Parallel implementation models for the λ-calculus using the geometry of interaction

An examination of Girard's execution formula suggests implementations of the Geometry of Interaction at the syntactic level. In this paper we limit our scope to ground-type terms and study the parallel aspects of such implementations, by introducing a family of abstract machines which can be directly implemented. These machines address all the important implementation issues such as the choice of an interthread communication model, and allow to incorporate specific strategies for dividing the computation of the execution path into smaller tasks.

[1]  Vincent Danos,et al.  Local and asynchronous beta-reduction (an analysis of Girard's execution formula) , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[2]  Jean-Yves Girard,et al.  Geometry of Interaction 1: Interpretation of System F , 1989 .

[3]  Francesco Quaglia,et al.  A parallel implementation for optimal lambda-calculus reduction , 2000, PPDP '00.

[4]  Martín Abadi,et al.  Linear logic without boxes , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[5]  Laurent Regnier,et al.  Lambda-calcul et reseaux , 1992 .

[6]  Ian Mackie,et al.  The geometry of interaction machine , 1995, POPL '95.

[7]  J. Girard.  Geometry of interaction III: accommodating the additives , 1995 .

[8]  Ian Craig Mackie.  The geometry of implementation , 1994 .

[9]  Vincent Danos,et al.  Directed Virtual Reductions , 1996, CSL.

[10]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[11]  Jean-Yves Girard,et al.  Geometry of interaction 2: deadlock-free algorithms , 1990, Conference on Computer Logic.

[12]  Vincent Danos,et al.  Proof-nets and the Hilbert space , 1995 .