HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A calculus of Gamma programs

Chris Hankin 1 Daniel Le Métayer 2 David Sands 1
2 LSP - Langages et Systèmes Parallèles
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : 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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 11:48:35 AM
Last modification on : Friday, February 4, 2022 - 3:25:31 AM
Long-term archiving on: : Friday, May 13, 2011 - 10:26:31 PM


  • HAL Id : inria-00076998, version 1


Chris Hankin, Daniel Le Métayer, David Sands. A calculus of Gamma programs. [Research Report] RR-1758, INRIA. 1992. ⟨inria-00076998⟩



Record views


Files downloads