Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Types for Proofs and Programs

TYPES 1993: Types for Proofs and Programs pp 313–332Cite as

Closure under alpha-conversion

  • Conference paper
  • First Online:

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

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. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, October 1991.

    Google Scholar 

  2. Thorsten Altenkirch. A formalization of the strong normalization proof for System F in LEGO. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA'93, March 1993.

    Google Scholar 

  3. Henk Barendregt. Introduction to generalised type systems. J. Functional Programming, 1(2):125–154, April 1991.

    Google Scholar 

  4. Henk Barendregt. Lambda calculi with types. In Gabbai Abramsky and. Maibaum, editors, Handbook of Logic in Computer Science, volume II. Oxford University Press, 1992.

    Google Scholar 

  5. Stefano Berardi. Type Dependence and Constructive Mathematics. PhD thesis, Dipartimento di Informatica, Torino, Italy, 1990.

    Google Scholar 

  6. Thierry Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. D. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.

    Google Scholar 

  7. Nicolas G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the churchrosser theorem. Indag. Math., 34(5), 1972.

    Google Scholar 

  8. Nicolas G. de Bruijn. Generalizing automath by means of a lambda-typed lambda calculus. In Proceedings of the Maryland 1984–1985 Special Year in Mathematical Logic and Theoretical Computer Science, 1985.

    Google Scholar 

  9. Dowek, Felty, Herbelin, Huet, Murthy, Parent, Paulin-Mohring, and Werner. The Coq proof assistant user's guide, version 5.8. Technical report, INRIA-Rocquencourt, February 1993.

    Google Scholar 

  10. Herman Geuvers and Mark-Jan Nederhof. A modular proof of strong normalization for the calculus of constructions. Journal of Functional Programming, 1(2):155–189, April 1991.

    Google Scholar 

  11. Andrew Gordon. A mechanism of name-carrying syntax up to alphaconversion. In Proceedings of the 1993 HOL User's Meeting, Vancouver. Springer-Verlag, 1993. LNCS.

    Google Scholar 

  12. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143–184, 1992. Preliminary version in LICS'87.

    Google Scholar 

  13. Gérard Huet. The constructive engine. In R. Narasimhan, editor, A Perspective in Theoretical Computer Science. World Scientific Publishing, 1989. Commemorative Volume for Gift Siromoney.

    Google Scholar 

  14. G. Huet. Residual theory in λ-calculus: A complete Gallina development. 1993.

    Google Scholar 

  15. Zhaohui Luo and Robert Pollack. LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211, LFCS, Computer Science Dept., University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, May 1992. Updated version.

    Google Scholar 

  16. Zhaohui Luo. An Extended Calculus of Constructions. PhD thesis, Department of Computer Science, University of Edinburgh, June 1990.

    Google Scholar 

  17. James McKinna and Robert Pollack. Pure type systems formalized. In M.Bezem and J.F.Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA'93, pages 289–305. Springer-Verlag, LNCS 664, March 1993.

    Google Scholar 

  18. Robert Pollack. Implicit syntax. Informal Proceedings of First Workshop on Logical Frameworks, Antibes, May 1990.

    Google Scholar 

  19. R. Pollack. Typechecking in pure type systems. In Informal Proceedings of the 1992 Workshop on Types for Proofs and Programs, Båstad, Sweden, pages 271–288, June 1992. available by ftp.

    Google Scholar 

  20. Robert Pollack. The Theory of LEGO; A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1994. In preparation.

    Google Scholar 

  21. A. Tasistro. Formulation of Martin-Löf 's theory of types with explicit substitutions. Master's thesis, Chalmers Tekniska Högskola and Göteborgs Universitet, May 1993.

    Google Scholar 

  22. L.S. van Benthem Jutting. Typing in pure type systems. Information and Computation, 105(1):30–41, July 1993.

    Google Scholar 

  23. L.S. van Benthem Jutting, James McKinna, and Robert Pollack. Typechecking in pure type systems. In Henk Barendregt and Tobias Nipkow, editors, Formal Proceedings of the Nijmegen Workshop on Types for Proofs and Programs, May '93. Springer-Verlag, LNCS, 1994. This volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Foundations of Computer Science, University of Edinburgh, The King's Buildings, EH9 3JZ, Edinburgh, Scotland

    Randy Pollack

Authors
  1. Randy Pollack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Henk Barendregt Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pollack, R. (1994). Closure under alpha-conversion. In: Barendregt, H., Nipkow, T. (eds) Types for Proofs and Programs. TYPES 1993. Lecture Notes in Computer Science, vol 806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58085-9_82

Download citation

  • DOI: https://doi.org/10.1007/3-540-58085-9_82

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58085-0

  • Online ISBN: 978-3-540-48440-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation