DMCA
A Congruence for Gamma Programs (1993)
| Venue: | in Proc. of the 5th workshop on Languages and Compilers for Parallel Computing |
| Citations: | 45 - 11 self |
BibTeX
@INPROCEEDINGS{Errington93acongruence,
author = {Lindsay Errington and Chris Hankin and Thomas Jensen},
title = {A Congruence for Gamma Programs},
booktitle = {in Proc. of the 5th workshop on Languages and Compilers for Parallel Computing},
year = {1993},
pages = {342--355},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. This paper defines a congruence relation on Gamma programs. Based on this congruence relation, laws for transforming programs are derived. We define an axiomatic semantics for Gamma based on Brookes' transition assertions. The definition of the congruence is in terms of provable satisfiability of such assertions. We consider the relationship between our congruence and other orderings that have been proposed in the literature. 1 Introduction In this paper we study the problem of transforming programs expressed in the Gamma programming formalism. We aim at defining a relation between Gamma programs that captures when one program mimics another program. This relation allows us to decide when we can safely replace one program by another i.e., it gives us a means of expressing the correctness of program transformations. Gamma operates with a single data structure, the multiset, and computation proceeds by rewriting multisets of data. Gamma has proved successful in expressing a variety of...
