Some facile chemistry
- 1 May 1995
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 7 (3) , 314-328
- https://doi.org/10.1007/bf01211076
Abstract
In this paper we use the chemical abstract machine (CHAM) framework [BeB90, BeB92, Bou94] for discussing various semantics for the Facile programming language [GMP89, GMP90, FAR93] and for formalising (parts of) its implementations. We use these formal descriptions to argue (informally) about implementability and cost of implementation in terms of low level machinery needed to implement the given semantics. We take the Facile language as source for discussion, but the results also apply to several other new languages such as CML [Rep91, BMT92] and Poly/ML [Mat91]. Characteristic for all these languages is that they combine ideas from the λ-calculus and process algebra, such as CCS [Mil80, Mil89], to support high level constructs for programming concurrent, parallel and/or distributed systems. The full version of this extended summary can be found in [LeT94].Keywords
This publication has 14 references indexed in Scilit:
- Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programmingPublished by Springer Nature ,2005
- Some Chemical Abstract MachinesPublished by Springer Nature ,1994
- The process group approach to reliable distributed computingCommunications of the ACM, 1993
- True concurrency semantics for a linear logic programming language with broadcast communicationPublished by Springer Nature ,1993
- Some issues in the semantics of facile distributed programmingPublished by Springer Nature ,1993
- The chemical abstract machineTheoretical Computer Science, 1992
- CMLACM SIGPLAN Notices, 1991
- A syntactic theory of sequential stateTheoretical Computer Science, 1989
- Facile: A symmetric integration of concurrent and functional programmingInternational Journal of Parallel Programming, 1989
- CCS without τ'sPublished by Springer Nature ,1987