Combinatory formulations of concurrent languages
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 156-170
- https://doi.org/10.1007/3-540-60688-2_42
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A calculus of mobile processes, IPublished by Elsevier ,2004
- THE QUINE-BERNAYS COMBINATORY CALCULUSInternational Journal of Foundations of Computer Science, 1995
- Combinatory representation of mobile processesPublished by Association for Computing Machinery (ACM) ,1994
- An operational framework for value-passing processesPublished by Association for Computing Machinery (ACM) ,1994
- The chemical abstract machineTheoretical Computer Science, 1992
- Explicit substitutionsPublished by Association for Computing Machinery (ACM) ,1990
- Towards a lambda-calculus for concurrent and communicating systemsPublished by Springer Nature ,1989
- Director strings as combinatorsACM Transactions on Programming Languages and Systems, 1988
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremIndagationes Mathematicae, 1972
- Über die Bausteine der mathematischen LogikMathematische Annalen, 1924