Proving congruence of bisimulation in functional programming languages (1996)

Cached

Download Links

by Douglas J. Howe
Venue:Information and Computation
Citations:106 - 1 self

Documents Related by Co-Citation

239 The Lazy Lambda Calculus – Samson Abramsky - 1990
3219 Communication and Concurrency – R Milner - 1990
121 Bisimilarity as a theory of functional programming – A D Gordon
196 Bisimulation can’t be traced – B Bloom, S Istrail, A R Meyer - 1995
1000 Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
76 Operationally-based theories of program equivalence – Andrew Pitts - 1997
730 Notions of Computation and Monads – Eugenio Moggi - 1991
111 Operational Reasoning for Functions With Local State – Andrew Pitts, Ian Stark
109 A Congruence Theorem for Structured Operational Semantics With Predicates – J.C.M. Baeten, C. Verhoef - 1993
63 Higher-level synchronising devices in Meije–SCCS. Theoretical Computer Science 37(3), pp. 245–267. A Modal Characterisation of η-Bisimulation We prove the first part of Thm. 2.5, which states that η is a modal characterisation of η-bisimulation equivalenc – Robert De Simone, Communicated M. Nivat - 1985
105 Functional Programming and Input/Output – Andrew D Gordon - 1993
112 Equivalence in Functional Languages with Effects – Ian Mason, Carolyn Talcott - 1991
110 Fully abstract models of typed lambda calculi – R Milner - 1977
43 Bisimilarity for a First-Order Calculus of Objects with Subtyping – Andrew D. Gordon, Gareth D. Rees - 1996
95 Equality In Lazy Computation Systems – Douglas J. Howe - 1998
189 Structured Operational Semantics and Bisimulation as a Congruence, Information and Computation 100 – J F Groote, F Vaandrager - 1992
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
262 Expressing mobility in process algebras: First-order and higherorder paradigms – D Sangiorgi - 1992
75 Parametric Polymorphism and Operational Equivalence – Andrew M. Pitts - 2000