Advertisement

Parallel Implementation Models for the λ-Calculus Using the Geometry of Interaction (Extended Abstract)

  • Jorge Sousa Pinto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2044)

Abstract

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.

Keywords

Linear Logic Execution Path Abstract Machine Task List London Mathematical Society Lecture Note 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Vincent Danos, Marco Pedicini, and Laurent Regnier. Directed virtual reductions. In M. Bezem and D. van Dalen, editors, Computer Science Logic, 10th International Workshop, CSL’ 96, volume 1258 of Lecture Notes in Computer Science. Springer Verlag, 1997.Google Scholar
  2. 2.
    Vincent Danos and Laurent Regnier. Local and asynchronous beta-reduction (an analysis of Girard’s execution formula). In Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science (LICS’93), pages 296–306. IEEE Computer Society Press, 1993.Google Scholar
  3. 3.
    Vincent Danos and Laurent Regnier. Proof-nets and the Hilbert space. In Jean-Yves Girard, Yves Lafont, and Laurent Regnier, editors, Advances in Linear Logic, number 222 in London Mathematical Society Lecture Note Series, pages 307–328. 1995.Google Scholar
  4. 4.
    Jean-Yves Girard. Linear Logic. Theoretical Computer Science, 50(1):1–102, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Jean-Yves Girard. Geometry of interaction 2: Deadlock-free algorithms. In Per Martin-Löf and G. Mints, editors, International Conference on Computer Logic, COLOG 88, pages 76–93. Springer-Verlag, 1988. Lecture Notes in Computer Science 417.Google Scholar
  6. 6.
    Jean-Yves Girard. Geometry of interaction 1: Interpretation of System F. In R. Ferro, C. Bonotto, S. Valentini, and A. Zanardo, editors, Logic Colloquium 88, volume 127 of Studies in Logic and the Foundations of Mathematics, pages 221–260. North Holland Publishing Company, Amsterdam, 1989.CrossRefGoogle Scholar
  7. 7.
    Jean-Yves Girard. Geometry of interaction III: accommodating the additives. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, number 222 in London Mathematical Society Lecture Note Series, pages 329–389. 1995.Google Scholar
  8. 8.
    Georges Gonthier, Martín Abadi, and Jean-Jacques Lévy. Linear logic without boxes. In Proceedings of the 7th IEEE Symposium on Logic in Computer Science (LICS’92), pages 223–234. IEEE Press, 1992.Google Scholar
  9. 9.
    Ian Mackie. The Geometry of Implementation. PhD thesis, Department of Computing, Imperial College of Science, Technology and Medicine, September 1994.Google Scholar
  10. 10.
    Ian Mackie. The geometry of interaction machine. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL’95), pages 198–208. ACM Press, January 1995.Google Scholar
  11. 11.
    M. Pedicini and F. Quaglia. A parallel implementation for optimal lambda-calculus reduction. In Proceedings of the 2nd International Conference on Principles and Practice of Declarative Programming (PPDP 2000). ACM press, 2000.Google Scholar
  12. 12.
    Jorge Sousa Pinto. Parallel Implementation with Linear Logic (Applications of Interaction Nets and of the Geometry of Interaction). PhD thesis, école Polytechnique, 2001.Google Scholar
  13. 13.
    Laurent Regnier. Lambda-Calcul et Réseaux. PhD thesis, Université Paris VII, January 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jorge Sousa Pinto
    • 1
  1. 1.Departamento de InformáticaUniversidade do MinhoBragaPortugal

Personalised recommendations