Skip to main content
SpringerLink
Log in

Geometry of interaction 2: Deadlock-free algorithms

  • Conference paper
  • First Online:
COLOG-88 (COLOG 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 417))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. DANOS, Vincent Λ et Λ*, draft, université Paris VII, 1989

    Google Scholar 

  2. GIRARD, Jean-Yves Linear logic, T.C.S. 50, 1987.

    Google Scholar 

  3. GIRARD, Jean-Yves Towards a geometry of interaction, to appear in Proceedings of AMS conference on categories, logic and computer science, held in Boulder, Co, in june 1987.

    Google Scholar 

  4. GIRARD, Jean-Yves Geometry of interaction 1: interpretation of system F, to appear in Proceedings of ASL meeting held in Padova, august 1988.

    Google Scholar 

  5. KADISON, Richard V. & RINGROSE, John R. Fundamentals of the theory of operator algebras, volume 1, Academic Press, 1983.

    Google Scholar 

  6. MARTIN-LÖF, Per to appear in the Proceedings of Padova meeting

    Google Scholar 

  7. MOSCHOVAKIS, Yannis N. The formal language of recursion, preprint, UCLA, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. équipe de logique, UA 753 du CNRS mathématiques, Université Paris VII, t.45-55, 5 étage 2, place Jussieu, 75251, Paris cedex 05

    Jean-Yves Girard

Authors
  1. Jean-Yves Girard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Per Martin-Löf Grigori Mints

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Girard, JY. (1990). Geometry of interaction 2: Deadlock-free algorithms. In: Martin-Löf, P., Mints, G. (eds) COLOG-88. COLOG 1988. Lecture Notes in Computer Science, vol 417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52335-9_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-52335-9_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52335-2

  • Online ISBN: 978-3-540-46963-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation