Implementing Distributed Systems Using Linear Naming (1993)

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

Documents Related by Co-Citation

97 The Geometry of Optimal Lambda Reduction – Georges Gonthier, Martín Abadi, Jean-Jacques Lévy - 1992
53 Linear Logic Without Boxes – Georges Gonthier, Martín Abadi, Jean-Jacques Lévy - 1992
119 An algorithm for optimal lambda calculus reduction – John Lamping - 1990
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
12 Connection Graphs, in – A Bawden - 1986
78 Optimal reductions in the lambda-calculus – J-J Lévy - 1980
163 Interaction nets – Y Lafont - 1990
3219 Communication and Concurrency – R Milner - 1990
475 The Connection Machine – W D Hillis - 1985
74 The optimal implementation of functional programming languages, in: Cambridge Tracts in Theoretical – A Asperti, S Guerrini - 1998
38 A Correspondence between Continuation Passing Style and Static Single Assignment Form – Richard Kelsey - 1995
25 Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching – Michael Rudolf - 1998
625 Compiling With Continuations – A W Appel - 1992
1 Graph rewrite systems for program optimisation – Uwe Assman