|
53
|
A Brief Guide to Linear Logic
– Andre Scedrov
- 1993
|
|
6
|
Linear Logic, Comonads and Optimal Reductions
– Andrea Asperti
- 1993
|
|
93
|
The Geometry of Optimal Lambda Reduction
– Georges Gonthier, Martín Abadi, Jean-Jacques Lévy
- 1992
|
|
41
|
Applications of Linear Logic to Computation: An Overview
– Vladimir Alexiev
- 1993
|
|
40
|
Interaction Systems I: The theory of optimal reductions
– Andrea Asperti, Cosimo Laneve
- 1994
|
|
2
|
Safe Operators: Brackets Closed Forever - Optimizing optimal lambda-calculus implementations
– Andrea Asperti, Juliusz Chroboczek
- 1997
|
|
|
Optimizing Optimal Lambda-Calculus Implementations
– Andrea Asperti
- 1994
|
|
18
|
Interaction Systems II: The Practice of Optimal Reductions
– Andrea Asperti, Cosimo Laneve
- 1994
|
|
15
|
Optimality and Inefficiency : What Isn't a Cost Model of the Lambda Calculus?
– Julia Lawall, Harry G. Mairson
- 1996
|
|
14
|
Linear Logic and Computation: A Survey
– Andre Scedrov
- 1993
|
|
|
Sharing Implementations of Graph Rewriting Systems
– Stefano Guerrini
- 2004
|
|
26
|
Call-by-Name, Call-by-Value, Call-by-Need, and the Linear Lambda Calculus
– John Maraist, Martin Odersky, David N. Turner, Philip Wadler
- 1994
|
|
75
|
A Taste of Linear Logic
– Philip Wadler
- 1993
|
|
5
|
On Global Dynamics of Optimal Graph Reduction
– Julia L. Lawall, Harry G. Mairson
- 1997
|
|
|
A Proof of the Reducibility of General Port Graph Grammars to Simple Port Graph Grammars
– Charles Stewart
- 2002
|
|
3
|
Paths, Computations and Labels in the λ-calculus
– Andrea Asperti, Cosimo Laneve
- 1995
|
|
4
|
A general theory of sharing graphs
– Stefano Guerrini
- 1999
|
|
7
|
(Optimal) duplication is not elementary recursive
– Andrea Asperti, Paolo Coppola, Simone Martini
- 2000
|
|
2
|
Proofs as Polynomials
– Esfandiar Haghverdi, Philip J. Scott
|
