Abstract
In this paper we introduce a higher-order calculus suitable for reasoning about programs written in many of the existing paradigms that adhere to the chemical reaction metaphor. The calculus draws its inspiration from Banâtre and Le Métayer's first-order language Gamma. However, the idea behind our calculus varies in that the so-called reaction rules are one-shot and are regarded as first-class citizens — in opposition to Gamma's n-shot rewrite rules. First a preliminary study of the basic properties of this new calculus is pursued, then we demonstrate that it is possible to translate the Lambda Calculus, first-order Gamma and higher-order Gamma terms into it.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.-P. Banâtre and D. Le Métayer. The gamma model and its discipline of programming. In Science of Computer Programming, volume 15, pages 55–77. Elsvier Science Publishers, North Holland, 1990.
H. P. Barendregt. The Lambda Calculus. Elsevier Science Publishers, 1985.
G. Berry and G. Boudol. The chemical abstract machine. In Theoretical Computer Science, volume 96, pages 217–248. Elsvier, 1992.
K. Mani Chandy and Jayadev Misra. Parallel Program Design. Addison-Wesley, 1988.
D. Cohen. Higher order chemical machines. Master's thesis, Department of Computing, Imperial College of Science, Technology and Medicine, 1995.
C. Hankin, D. Le Métayer, and D. Sands. A calculus of gamma programs. In Proc. of the 5th Workshop on Languages and Compilers for Parallel Computing, number 757 in LNCS. Springer Verlag, 1992.
D. Le Métayer. Higher-order multiset programming. In Proceedings of the First Annual Workshop, COORDINATION, pages 103–123. ESPRIT, 1994.
G.-C. Roman and H. C. Cunnigham. A shared dataspace model of concurrency: Language and programming implications. In Proceedings of the 9th International Conference on Distributed Computing Systems, pages 270–279, 1989.
D. Sands. A compositional semantics of combining forms for gamma programs. In Formal Methods in Programming and Their Applications, number 735 in LNCS, pages 43–56. Springer Verlag, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, D., Muylaert-Filho, J. (1996). Introducing a calculus for higher-order multiset programming. In: Ciancarini, P., Hankin, C. (eds) Coordination Languages and Models. COORDINATION 1996. Lecture Notes in Computer Science, vol 1061. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61052-9_43
Download citation
DOI: https://doi.org/10.1007/3-540-61052-9_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61052-6
Online ISBN: 978-3-540-49936-7
eBook Packages: Springer Book Archive