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

Cached

Download Links

by Alan Jeffrey
Citations:13 - 1 self

Active Bibliography

Contents – unknown authors
6 A Chemical Abstract Machine for Graph Reduction – Alan Jeffrey - 1992
1 Interpreting functions as π-calculus processes: a tutorial – Davide Sangiorgi - 1999
Non-deterministic Lazy it λ-calculus VS it π-calculus – Carolina Lavatelli - 1993
1 Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri - 2009
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri (Hossein) - 2009
9 A Fully Abstract Semantics for a Higher-Order Functional Language With Nondeterministic Computation – Alan Jeffrey - 1994
4 Lazy Lambda Calculus: Theories, Models and Local Structure Characterisation – C.-H. Luke Ong - 1994
1 lambda-Calculus, Multiplicities and the pi-Calculus – Gérard Boudol, Cosimo Laneve, Cosimo Laneve - 1995
144 On reduction-based process semantics – Kohei Honda, Nobuko Yoshida - 1995
A Partial Rehabilitation of Side-Effecting I/O: Non-Determinism in Non-Strict Functional Languages – Manfred Schmidt-Schauß, Fachbereich Informatik, Johann Wolfgang Goethe-universitat - 1996
14 A non-deterministic call-by-need lambda calculus – Arne Kutzner, Manfred Schmidt-Schauß - 1998
64 The π-Calculus in Direct Style – Gerard Boudol - 1997
25 Asynchrony and the Pi-Calculus – Gérard Boudol - 1992
11 The Evaluation Transformer Model of Reduction and Its Correctness – G. L. Burn - 1991
21 A Fully Abstract Semantics for a Concurrent Functional Language With Monadic Types – Alan Jeffrey - 1995
Reduction Theories for Concurrent Calculi – Nobuko Yoshida, Kohei Honda
6 From π-calculus to Higher-Order π-calculus -- and back – Davide Sangiorgi
280 Computational Interpretations of Linear Logic – Samson Abramsky - 1993