Abstract

We present an extension of the Interaction Abstract Machine (IAM) [4] to full Linear Logic with Girard's Geometry of Interaction (GoI) [6]. We propose a simplied way to interpret the additives and the interaction between additives and exponentials by means of weights [7]. We describe the interpretation by a token machine which allows us to recover the usual MELL case by forgetting all the additive information. The Geometry of Interaction (GoI), introduced by Girard [5], is an interpretation of proofs (programs) by bideterministic automatons, turning the global cut elimination steps (-reduction) into local transitions [4]. One of the main results of the MELL-GoI is that it gives an algebraic characterization of the persistent paths of a proof, that is the paths in the graph structure of the proof that are not broken by cut elimination (see [3]). More abstractly, the presentation of the GoI may be generalized in the framework of traced monoidal categories [10]. Because of its local f...

Citations

152	Traced monoidal categories - Joyal, Street, et al. - 1996
93	The geometry of optimal lambda reduction - Gonthier, Abadi, et al. - 1992
91	Geometry of Interaction I: interpretation of system F - Girard - 1989
76	Proof-nets: The parallel syntax for proof-theory - Girard - 1996
65	Full abstraction for PCF (extended abstract - Abramsky, Jagadeesan, et al. - 1994
44	Proof nets and the Hilbert space - Danos, Regnier - 1995
26	Geometry of Interaction III: Accommodating the Additives - Girard - 1995
14	The Bologna Optimal Higher-Order Machine - Asperti, Giovannetti, et al. - 1995
3	A parallel implementation for optimal lambda-calculus reduction - Pedicini, Quaglia - 2000
2	Reversible, Irreversible and Optimal -machines - Danos, Regnier - 1996
1	Polarized proof-nets and -calculus. Submitted. Available at ftp://iml.univ-mrs.fr /pub/olaurent/lmpn.ps.gz - Laurent - 1999