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

181 A Natural Semantics for Lazy Evaluation – John Launchbury - 1993
187 Parameter-Passing and the Lambda Calculus – Erik Crank, Matthias Felleisen - 1991
315 Functions as Processes – Robin Milner - 1992
391 Explicit substitutions – M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy - 1996
96 Equality In Lazy Computation Systems – Douglas J. Howe - 1998
7 Some chemical abstract machines. In A Decade of Concurrency---Reflections and – G'erard Boudol - 1993
7 Semantics and Pragmatics of the -Calculus – C P Wadsworth - 1971
23 The lazy -calculus – S Abramsky - 1990
1119 The Lambda Calculus: Its Syntax and Semantics – H P BARENDREGT - 1984
42 The Call-by-Need Lambda Calculus – John Maraist, Martin Odersky, Philip Wadler - 1994
733 Notions of Computation and Monads – Eugenio Moggi - 1991
45 A fully abstract denotational model for higher-order processes – M Hennessy - 1993
398 LCF considered as a programming language – G Plotkin - 1977
272 The Polyadic -Calculus: A Tutorial – R Milner - 1993
37 Cyclic Lambda Calculi – Zena M. Ariola, Stefan Blom - 1997
128 Lambda Calculus Models of Programming Languages – James H Morris - 1968
240 The Lazy Lambda Calculus – Samson Abramsky - 1990
121 Bisimilarity as a theory of functional programming – Andrew D Gordon - 1999
6 A Chemical Abstract Machine for Graph Reduction – Alan Jeffrey - 1992