A calculus of gamma programs

  • C. Hankin
  • D. LeMétayer
  • D. Sands
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 757)


Gamma is a minimal language based on conditional multiset rewriting. The virtues of this paradigm in terms of systematic program construction and design of programs for highly parallel machines have been demonstrated in previous papers. We introduce here sequential and parallel operators for combining Gamma programs and we study their properties. The main focus of the paper is to give conditions under which sequential composition can be transformed into parallel composition and vice versa. Such transformations are especially valuable for adapting Gamma programs for execution on a particular target architecture.


Composition Operator Parallel Machine Parallel Operator Sequential Composition Parallel Composition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Banâtre, J.-P., Coutant, A., and Le Métayer, D. A Parallel Machine for Multiset Transformation and its Programming Style. Future Generation Computer Systems. 4 (1988) 133–144.Google Scholar
  2. 2.
    Banâtre, J.-P., and Le Métayer, D. The Gamma model and its discipline of programming. Science of Computer Programming 15 (1990) 55–77.Google Scholar
  3. 3.
    Banâtre, J.-P., and Le Métayer D. Programming by multiset transformation. Comm. of the ACM, January 1993.Google Scholar
  4. 4.
    Chandy K. M., and Misra J., Parallel program design: a foundation, Addison-Wesley, 1988.Google Scholar
  5. 5.
    Creveuil C., Implementation of Gamma on the Connection Machine. Proc. of the Workshop on Research Directions in High-level Parallel Programming Languages, Springer Verlag, LNCS 574, 1992.Google Scholar
  6. 6.
    Creveuil C., Techniques d'analyse et de mise en œuvre de programmes Gamma. Thèse de 3ème cycle, Université de Rennes 1, December 1991.Google Scholar
  7. 7.
    Dershowitz, N., Manna, Z., Proving termination with multiset orderings, Communications of the ACM, 22, 8, pp. 465–476, 1979.Google Scholar
  8. 8.
    Hillis, W. D., The connection machine, MIT Press, Cambridge, Mass, 1985.Google Scholar
  9. 9.
    Hoare C.A.R., foreword of [4].Google Scholar
  10. 10.
    Misra J., A foundation of parallel programming, in Constructive Methods in Computer Science, NATO ASI series, Vol. F55, 1989.Google Scholar
  11. 11.
    Mussat L., Parallel programming with bags. Proc. of the Workshop on Research Directions in High-level Parallel Programming Languages, Springer Verlag, LNCS 574, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • C. Hankin
    • 1
  • D. LeMétayer
    • 1
  • D. Sands
    • 2
  1. 1.Imperial College of Science, Technology and MedicineLondonUK
  2. 2.University of CopenhagenCopenhagenDenmark

Personalised recommendations