The Lazy Lambda Calculus in a Concurrency Scenario (Extended Abstract) (1994)

Cached

Download Links

by Davide Sangiorgi
Venue:Information and Computation
Citations:50 - 7 self

Documents Related by Co-Citation

933 Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
238 Expressing Mobility in Process Algebras: First-Order and HigerOrder Paradigms – D Sangiorgi - 1992
290 Functions as processes – R Milner - 1992
267 The Polyadic ?-calculus: A Tutorial – R Milner - 1993
2972 Communication and Concurrency – R Milner - 1989
218 The Lazy Lambda Calculus – Samson Abramsky - 1990
128 Games and Full Abstraction for the Lazy lambda-calculus – Samson Abramsky, Guy Mccusker - 1995
192 Barbed Bisimulation – Robin Milner, Davide Sangiorgi, Edinburgh Eh Jz - 1992
123 On reduction-based process semantics – Kohei Honda, Nobuko Yoshida - 1995
36 Lambda-calculi for (strict) parallel functions – G Boudol - 1994
107 Calculli for Higher Order Communicating Systems – B Thomsen - 1990
426 The Chemical Abstract Machine – Gérard Berry, Gérard Boudol - 1998
997 The Lambda Calculus: its Syntax and Semantics – H P Barendregt - 1984
102 Proving congruence of bisimulation in functional programming languages – Douglas J. Howe - 1996
341 An Object Calculus for Asynchronous Communication – Kohei Honda, Mario Tokoro - 1991
56 Towards a lambda calculus for concurrent and communicating systems – G Boudol - 1989
48 Bisimulation for higher-order process calculi – Davide Sangiorgi, Inria Sophia Antipolis - 1996
58 A Foundation for Higher-order Concurrent Constraint Programming – Gert Smolka - 1994
183 Structured operational semantics and bisimulation as a congruence – J F Groote, F W Vaandrager - 1992