Advertisement

Existence and Uniqueness of Normal Forms in Pure Type Systems with βη-conversion

  • Gilles Barthe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1584)

Abstract

Pure Type Systems ( PTS β s) provide a parametric framework for typed λ-calculi à la Church [1,2,10,11]. One important aspect of PTS β s is to feature a definitional equality based on β-conversion. In some instances however, one desires a stronger definitional equality based on βη-conversion. The need for such a strengthened definitional equality arises for example when using type theory as a logical framework or in categorical type theory.

Keywords

Normal Form Type Theory Abstract Syntax Legal Term Induction Principle 
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.
    Barendregt, H.: Introduction to Generalised Type Systems. Journal of Functional Programming 1(2), 125–154 (1991)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Barendregt, H.: Lambda calculi with types. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 117–309. Oxford Science Publications (1992)Google Scholar
  3. 3.
    Barras, B., et al.: The Coq Proof Assistant User’s Guide. Version 6.2 (May 1998)Google Scholar
  4. 4.
    Barthe, G.: Expanding the cube. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 90–104. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  5. 5.
    Barthe, G., Hatcliff, J., Sφrensen, M.H.B.: An induction principle for Pure Type Systems. Manuscript (1998)Google Scholar
  6. 6.
    Cornes, C.: Conception d’un langage de haut niveau de representation de preuves: Récurrence par filtrage de motifs; Unification en présence de types inductifs primitifs; Synthése de lemmes d’inversion. PhD thesis, Université de Paris 7 (1997)Google Scholar
  7. 7.
    Di Cosmo, R.: A brief history of rewriting with extensionality. Presented at the International Summer School on Type Theory and Term Rewriting, Glasgow (September 1996)Google Scholar
  8. 8.
    Dowek, G., Huet, G., Werner, B.: On the existence of long βη-normal forms in the cube. In: Geuvers, H. (ed.) TYPES 1993. LNCS, vol. 806, pp. 115–130. Springer, Heidelberg (1994)Google Scholar
  9. 9.
    Geuvers, H.: The Church-Rosser property for βη-reduction in typed λ-calculi. In: Proceedings of LICS 1992, pp. 453–460. IEEE Computer Society Press, Los Alamitos (1992)Google Scholar
  10. 10.
    Geuvers, H.: Logics and type systems. PhD thesis, University of Nijmegen (1993)Google Scholar
  11. 11.
    Geuvers, H., Nederhof, M.J.: A modular proof of strong normalisation for the Calculus of Constructions. Journal of Functional Programming 1(2), 155–189 (1991)zbMATHMathSciNetGoogle Scholar
  12. 12.
    Geuvers, H., Werner, B.: On the Church-Rosser property for expressive type systems and its consequence for their metatheoretic study. In: Proceedings of LICS 1994, pp. 320–329. IEEE Computer Society Press, Los Alamitos (1994)Google Scholar
  13. 13.
    Ghani, N.: Eta-expansions in dependent type theory–the calculus of constructions. In: de Groote, P., Hindley, J.R. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 164–180. Springer, Heidelberg (1997)Google Scholar
  14. 14.
    Klop, J.W.: Term-rewriting systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 1–116. Oxford Science Publications (1992)Google Scholar
  15. 15.
    Luo, Z., Pollack, R.: LEGO proof development system: User’s manual. In: Nerode, A., Taitslin, M.A. (eds.) LFCS 1992. LNCS, vol. 620. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  16. 16.
    Nederpelt, R.: Strong normalisation in a typed lambda calculus with lambda structured types. PhD thesis, Technical University of Eindhoven (1973)Google Scholar
  17. 17.
    Salvesen, A.: The Church-Rosser property for βη-reduction. Manuscript (1991)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Gilles Barthe
    • 1
    • 2
  1. 1.Institutionen för DatavetenskapChalmers Tekniska HögskolaGöteborgSweden
  2. 2.Departamento de InformáticaUniversidade do MinhoBragaPortugal

Personalised recommendations