Bisimilarity as a Theory of Functional Programming
Open Access
- 1 January 1995
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 1, 232-252
- https://doi.org/10.1016/s1571-0661(04)80013-6
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Operational Semantics of a Focusing DebuggerElectronic Notes in Theoretical Computer Science, 1995
- A fully abstract translation between a λ-calculus with reference types and Standard MLPublished by Springer Nature ,1995
- A sound metalogical semantics for input/output effectsPublished by Springer Nature ,1995
- A co-induction principle for recursively defined domainsTheoretical Computer Science, 1994
- Fully abstract translations between functional languagesMathematical Structures in Computer Science, 1993
- Comprehending monadsMathematical Structures in Computer Science, 1992
- FLIC—a functional language intermediate codeACM SIGPLAN Notices, 1988
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977