The GAMMA Model and Its Discipline of Programming

  title={The GAMMA Model and Its Discipline of Programming},
  author={Jean-Pierre Ban{\^a}tre and Daniel Le M{\'e}tayer},
  journal={Sci. Comput. Program.},
A Calculus of Gamma Programs
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.
Programming by multiset transformation
A new formalism called Gamma is presented in which programs are described in terms of multiset transformations, with the possibility of expressing algorithms in a very abstract way, without any artificial sequentiality.
A Parallel Programming Style and Its Algebra of Programs
We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The primitive program schemes (called
Reasoning About Gamma Programs
An axiomatic semantics for the parallel programming language Gamma is described based on a framework developed by Brookes that allows compositional reasoning about the interleaved execution of Gamma programs.
Multiset Transformer Programs : Syntax and Semantics
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.
Functional Plus Logic Programming with Built-In and Symbolic Constraints
A lazy functional logic language, named SETA, which allows to handle multisets, built-in arithmetic constraints over the domain of real numbers, as well as various symbolic constraints over datatypes is proposed.
Multiset Rewriting forConcurrent Object-Oriented
This paper presents a calculus model expressing the behavior of a system of communicating objects via multiset rewriting via composition principle, and introduces the composition principle allowing to synchronize several applicable rewriting rules.
Reening Multiset Transformers
A notion of reenement for programs involving parallel and sequential composition operators, and a number of programming laws are derived, which enables certain sequential compositions to be reened into parallel compositions.
Parallel Programming with Bags
  • Louis Mussat
  • Computer Science, Mathematics
    Research Directions in High-Level Parallel Programming Languages
  • 1991
The relevance of a high level computational model for the development of correct parallel programs for correctness is shown and four programs solving classical problems are derived.
A Congruence for Gamma Programs
Based on this congruence relation, laws for transforming programs are derived and an axiomatic semantics for Gamma is defined based on Brookes' transition assertions.


Synthesis: Dreams - Programs
Deductive techniques are presented for deriving programs systematically from given specifications and have been incorporated in a running program-synthesis system, called DEDALUS.
The Science of Programming
  • D. Gries
  • Computer Science
    Text and Monographs in Computer Science
  • 1981
Describes basic programming principles and their step-by- step applications and shows how to apply them to real-world problems.
Associons: A Program Notation with Tuples Instead of Variables
  • M. Rem
  • Computer Science
  • 1981
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.
A shared dataspace model of concurrency-language and programming implications
  • G. Roman, H. C. Cunningham
  • Computer Science
    [1989] Proceedings. The 9th International Conference on Distributed Computing Systems
  • 1989
A language paradigm called shared dataspace is defined that causes computations to be performed using an anonymous, content-addressable communication medium acted upon by atomic transactions. To
Program derivation - the development of programs from specifications
  • R. Dromey
  • Psychology
    International computer science series
  • 1989
Interestingly, program derivation the development of programs from specifications that you really wait for now is coming. It's significant to wait for the representative and beneficial books to read.
Generative communication in Linda
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.
How to Solve it by Computer
How to solve it by computer , How to solve this problem by computer, and more.
The art of computer programming. Vol.2: Seminumerical algorithms
This professional art of computer programming volume 2 seminumerical algorithms 3rd edition that has actually been written by is one of the best seller books in the world and is never late to read.
Linda in context
How can a system that differs sharply from all currently fashionable approaches score any kind of success? Here's how.