A fully abstract semantics for concurrent graph reduction (Extended Abstract) (1993)

Cached

Download Links

by Alan Jeffrey
Citations:13 - 1 self

Documents Related by Co-Citation

180 A Natural Semantics for Lazy Evaluation – John Launchbury - 1993
186 Parameter-Passing and the Lambda Calculus – Erik Crank, Matthias Felleisen - 1991
315 Functions as processes – R Milner - 1990
390 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
95 Equality In Lazy Computation Systems – Douglas J. Howe - 1998
7 Semantics and Pragmatics of the -Calculus – C P Wadsworth - 1971
7 Some chemical abstract machines. In A Decade of Concurrency---Reflections and – G'erard Boudol - 1993
23 The lazy -calculus – S Abramsky - 1990
45 A fully abstract denotational model for higher-order processes – M Hennessy - 1993
395 LCF considered as a programming language – G Plotkin - 1977
730 Notions of Computation and Monads – Eugenio Moggi - 1991
1125 The Lambda Calculus: Its Syntax and Semantics – H P Barendregt - 1981
39 The Call-by-Need Lambda Calculus – John Maraist, Martin Odersky, Philip Wadler - 1994
273 The polyadic -calculus: A tutorial – Robin Milner - 1992
36 Cyclic Lambda Calculi – Zena M. Ariola, Stefan Blom - 1997
239 The Lazy Lambda Calculus – Samson Abramsky - 1990
130 Lambda-Calculus Models of Programming Languages – J H Morris - 1968
121 Bisimilarity as a theory of functional programming – A D Gordon
6 A Chemical Abstract Machine for Graph Reduction – Alan Jeffrey - 1992