Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1993: Mathematical Foundations of Computer Science 1993 pp 608–617Cite as

Constant time reductions in λ-calculus

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Barendregt, The Lambda-Calculus, North-Holland, 1981.

    Google Scholar 

  2. L. Colson, About primitive recursive algorithms, Proc. ICALP'89, Springer Lecture Notes in Computer Science, Vol. 372, pp 194–206.

    Google Scholar 

  3. J.Y. Girard, Interprétation fonctionnelle et élimination des coupures de l'arithmétique d'ordre supérieur, Thèse d'état, Université Paris 7,1972.

    Google Scholar 

  4. J.L. Krivine, Un algorithme non typable dans le système F, CRAS 304 Série I (1987), pp 123–126.

    Google Scholar 

  5. J.L. Krivine, Lambda-calcul types et modèles, Masson (1990).

    Google Scholar 

  6. M. Parigot, On the representation of data in lambda-calculus, Proc. CSL'89, Kaiserslautern, Springer Lecture Notes in Computer Science, Vol. 440, pp 309–321.

    Google Scholar 

  7. M. Parigot, Internal Labellings in Lambdaalculus, Proc. MFCS 1990, Banská Bystrica, Springer Lecture Notes in Computer Science, Vol. 452, pp 439–445.

    Google Scholar 

  8. M. Parigot, Recursive programming with proofs, Proc. Coll.“ Mathématique et Informatique”, Marseille 1989, Theoretical Computer Science, Vol. 94, pp 335–356.

    Google Scholar 

  9. P. Rozière, Un réultat de non typabilité dans le système F ω, CRAS 309 Série I (1989), pp 779–802.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Equipe de logique - CNRS UA 753 45–55 5ème étage, Université Paris 7, 2 place jussieu, 75251, Paris Cedex 05, France

    Michel Parigot & Paul Rozière

Authors
  1. Michel Parigot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paul Rozière
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parigot, M., Rozière, P. (1993). Constant time reductions in λ-calculus. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation