Implementing Distributed Systems Using Linear Naming (1993)

by Alan Bawden
Venue:MIT AI Lab
Citations:4 - 0 self

Documents Related by Co-Citation

107 An algorithm for optimal lambda calculus reduction – John Lamping - 1990
50 Linear Logic Without Boxes – Georges Gonthier, Martín Abadi, Jean-Jacques Lévy - 1992
93 The Geometry of Optimal Lambda Reduction – Georges Gonthier, Martín Abadi, Jean-Jacques Lévy - 1992
2 Linear naming and computation: experimental software for optimizing communication protocols. Working paper #1, Linear Naming and Computation group – A Bawden, H Mairson - 1998
2 The Geometry of Optimal Implementation – Ian Mackie - 1994
2 Additive interaction nets. Unpublished manuscript – Satoshi Matsuoka
2 editor). Volume I:Foundations of the Handbook of Graph Grammars and Computing by Graph Transformations – G Rozenberg - 1997
2 Lambda: the ultimate declarative. AI memo 379 – Guy L Steele - 1976
4 urr. Programmed graph replacement systems – A Sch - 1997
74 Optimal reductions in the lambda calculus – J-J Lévy - 1980
34 A Correspondence between Continuation Passing Style and Static Single Assignment Form – Richard Kelsey - 1995
64 S.: The Optimal Implementation of Functional Programming Languages. Cambridge Tracts – A Asperti, Guerrini - 1998
432 The Connection Machine – W D Hillis - 1989
12 Connection Graphs, in – A Bawden - 1986
150 Interaction nets – Y Lafont - 1990
23 Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching – Michael Rudolf - 1998
2972 Communication and Concurrency – R Milner - 1989
595 Compiling with Continuations – Andrew Appel - 1992
1 Graph rewrite systems for program optimisation – Uwe Assman