Programming by multiset transformation

@article{Bantre1993ProgrammingBM,
  title={Programming by multiset transformation},
  author={Jean-Pierre Ban{\^a}tre and Daniel Le M{\'e}tayer},
  journal={Commun. ACM},
  year={1993},
  volume={36},
  pages={98-111}
}
We present a new formalism called Gamma in which programs are described in terms of multiset transformations. A distinguishing property of Gamma is the possibility of expressing algorithms in a very abstract way, without any artificial sequentiality. The expressive power of the formalism is illustrated through a series of examples chosen from a wide range of domains (string processing problems, graph problems, geometric problems...). 
A Calculus of Gamma Programs
TLDR
Se sequential and parallel operators for combining Gamma programs and their properties are introduced and conditions under which sequential composition can be transformed into parallel composition and vice versa are given.
Multiset Transformer Programs : Syntax and Semantics
TLDR
A language that can be used to e ectively control the nondeterministic behaviour of Gamma programs is introduced, which allows the logic of a program to be treated separately from control issues.
Refining Multiset Tranformers
Higher-Order Multiset Programming
  • D. L. Métayer
  • Computer Science
    Specification of Parallel Algorithms
  • 1994
TLDR
It is shown that more sophisticated control strategies can be expressed within the Gamma language and put into practice by deriving a scan vector model program suitable for execution on ne-grained parallel machines.
Full abstraction for Gamma
  • F. H. Quiroz
  • Computer Science
    Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004.
  • 2004
TLDR
A denotational semantics for Gamma is produced for which full abstraction is proven with respect to the operational model chosen and can be used as a basis for a further proof system for Gamma.
Probabilistic concurrent programming using multiset transactions
  • V. Murthy, E. Krishnamurthy
  • Computer Science
    Proceedings of TENCON'94 - 1994 IEEE Region 10's 9th Annual International Conference on: 'Frontiers of Computer Technology'
  • 1994
TLDR
The P-GAMMA model can realise probabilistic, classifier, bucket-brigade, and genetic algorithms, and concurrency in GAMMA paradigm can be supported using transaction processing facilities provided with multilevel atomicity, consistency, isolation and durability features.
A Compositional Semantics of Combining Forms for Gramma Programs
  • David Sands
  • Computer Science
    Formal Methods in Programming and Their Applications
  • 1993
The Gamma model is a minimal programming language based on local multiset rewriting (with an elegant chemical reaction metaphor); Hankin et al derived a calculus of Gamma programs built from basic
Programming with Logical Links: Design of the LMNtal language ? (Extended Abstract)
TLDR
LMNtal is proposed, a simple language model based on the rewriting of hierarchical graphs that use logical variables to represent links to serve as the basis of a truly general-purpose language covering various platforms ranging from wide-area to embedded computation.
Multiset constraints and P systems
TLDR
This paper relates P systems with the language and theory for multisets presented in [9.] This allows for P systems to be defined and implemented using multiset constraints in a constraint logic programming framework, and to define and implement constraint solving procedures used to testMultiset constraint satisfiability in terms of P system with active membranes.
...
...

References

SHOWING 1-10 OF 17 REFERENCES
Associons: A Program Notation with Tuples Instead of Variables
  • M. Rem
  • Computer Science
    TOPL
  • 1981
TLDR
The notation proposed is the result of a search for a basic statement the execution of which may employ more concurrency than is the case for the traditional assignment statement.
Communicating sequential processes
This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When
Generative communication in Linda
TLDR
This work is particularly concerned with implementation of the dynamic global name space that the generative communication model requires, and its implications for systems programming in distributed settings generally and on integrated network computers in particular.
The humble programmer
As a result of a long sequence of coincidences I entered the programming profession officially on the first spring morning of 1952, and as far as I have been able to trace, I was the first Dutchman
The Science of Programming
  • D. Gries
  • Computer Science
    Text and Monographs in Computer Science
  • 1981
TLDR
Describes basic programming principles and their step-by- step applications and shows how to apply them to real-world problems.
Principles of Artificial Intelligence
  • N. Nilsson
  • Computer Science
    IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 1981
TLDR
This classic introduction to artificial intelligence describes fundamental AI ideas that underlie applications such as natural language processing, automatic programming, robotics, machine vision, automatic theorem proving, and intelligent data retrieval.
Image Analysis and Mathematical Morphology
TLDR
This invaluable reference helps readers assess and simplify problems and their essential requirements and complexities, giving them all the necessary data and methodology to master current theoretical developments and applications, as well as create new ones.
The Art of Computer Programming
TLDR
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Linda in context
How can a system that differs sharply from all currently fashionable approaches score any kind of success? Here's how.
...
...