Interaction Combinators (1995)

Cached

Download Links

by Yves Lafont
Venue:Information and Computation
Citations:31 - 2 self

Active Bibliography

7 Encoding Linear Logic with Interaction Combinators – Ian Mackie - 2002
53 A Brief Guide to Linear Logic – Andre Scedrov - 1993
41 Applications of Linear Logic to Computation: An Overview – Vladimir Alexiev - 1993
59 From Proof-Nets to Interaction Nets – Yves Lafont - 1994
A Proof of the Reducibility of General Port Graph Grammars to Simple Port Graph Grammars – Charles Stewart - 2002
3 Proofnets and Context Semantics for the Additives – Harry G. Mairson, Xavier Rival
Optimizing Optimal Lambda-Calculus Implementations – Andrea Asperti - 1994
40 Interaction Systems I: The theory of optimal reductions – Andrea Asperti, Cosimo Laneve - 1994
3 Safe Operators: Brackets Closed Forever - Optimizing optimal lambda-calculus implementations – Andrea Asperti, Juliusz Chroboczek - 1997
7 Linear Logic, Comonads and Optimal Reductions – Andrea Asperti - 1993
13 Interaction Nets and Term Rewriting Systems – Maribel Fernández, Ian Mackie - 1998
7 A Calculus for Interaction Nets – Maribel Fernandez, Ian Mackie - 1999
Linear Naming: Experimental Software for Optimizing Communication Protocols – Alan Bawden, Harry G. Mairson - 1998
Modal Logic, Linear Logic, Optimal Lambda-Reduction – Stefano Guerrini, Simone Martini, Andrea Masini
8 Types, potency, and idempotency: why nonlinearity and amnesia make a type system work – Peter Møller Neergaard, Harry G. Mairson - 2004
9 Proof Nets and Explicit Substitutions – Roberto Di Cosmo, Delia Kesner, Emmanuel Polonovski - 2000
10 From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple – Harry G. Mairson - 2002
2 A denotational semantics for the symmetric interaction combinators – Damiano Mazza - 2007
4 Encoding Left Reduction in the λ-Calculus with Interaction Nets – Sylvain Lippi - 2001