Skip to main content
SpringerLink
Log in
Book cover

International Conference on Typed Lambda Calculi and Applications

TLCA 1999: Typed Lambda Calculi and Applications pp 177–197Cite as

Soundness of the Logical Framework for Its Typed Operational Semantic

  • Conference paper
  • First Online:

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

Abstract

Typed operational semantics [4],[5] is a technique for describing the operational behavior of the terms of type theory. The combination of operational information and types provides a strong induction principle that allows an elegant and uniform treatment of the metatheory of type theory. In this paper, we adapt the new proof of strong normalization by Joachimski and Matthes [6] for the simply-typed λ-calculus to prove soundness of the Logical Framework for its typed operational semantics. This allows an elegant treatment of strong normalization, Church-Rosser, and subject reduction for βη-reduction for the Logical Framework. Along the way, we also give a cleaner presentation of typed operational semantics than has appeared elsewhere.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbai, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford University Press, 1991.

    Google Scholar 

  2. A. Compagnoni and H. Goguen. Typed operational semantics for higher order subtyping. Technical Report ECS-LFCS-97-361, Edinburgh Univ., July 1997. Submitted to Information and Computation.

    Google Scholar 

  3. H. Geuvers. Logics and Type Systems. PhD thesis, Katholieke Universiteit Nijmegen, Sept. 1993.

    Google Scholar 

  4. H. Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, Edinburgh Univ., Aug. 1994.

    Google Scholar 

  5. H. Goguen. Typed operational semantics. In Proceedings of TLCA, volume 902 of Lecture Notes in Computer Science, pages 186–200. Springer-Verlag, Apr. 1995.

    Google Scholar 

  6. F. Joachimski and R. Matthes. Short proofs of strong normalization, 1998. Draft, submitted for publication.

    Google Scholar 

  7. A. Jones, Z. Luo, and S. Soloviev. Some algorithmic and proof-theoretical aspects of coercive subtyping. In Proceedings of TYPES’96, 1996. To appear.

    Google Scholar 

  8. P. Leleu. Metatheoretic results for a modal lambda calculus. Technical Report RR-3361, INRIA, 1998.

    Google Scholar 

  9. R. Loader. Normalisation by translation. Note distributed on TYPES list, Apr. 1995. 177

    Google Scholar 

  10. Z. Luo. An Extended Calculus of Constructions. PhD thesis, Edinburgh Univ., Nov. 1990.

    Google Scholar 

  11. Z. Luo. Computation and Reasoning. Oxford University Press, 1994.

    Google Scholar 

  12. J. McKinna and R. Pollack. Pure type systems formalized. In M. Bezem and J. F. Groote, editors, Proceedings of TLCA, pages 289–305. Springer-Verlag, LNCS 664, Mar. 1993.

    Google Scholar 

  13. B. Nordström, K. Petersson, and J. Smith. Programming in Martin-Löf’s Type Theory: An Introduction. Oxford University Press, 1990.

    Google Scholar 

  14. G. Pottinger. Strong normalization for the terms of the theory of constructions. Technical Report TR 11-7, Odyssey Research Associates, Inc., 1987.

    Google Scholar 

  15. A. Salvesen. The Church-Rosser property for pure type systems with βη-reduction, Nov. 1991. Unpublished manuscript.

    Google Scholar 

  16. M. Takahashi. Parallel reductions in λ-calculus. Information and Computation, 118:120–127, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  17. L. van Benthem Jutting, J. McKinna, and R. Pollack. Typechecking in pure type systems. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programming. Springer-Verlag, 1993.

    Google Scholar 

  18. F. van Raamsdonk and P. Severi. On normalisation. Technical Report CS-R9545, CWI Amsterdam, 1995.

    Google Scholar 

  19. B. Werner. Une Théorie des Constructions Inductives. PhD thesis, Université Paris 7, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AT&T Labs, 180 Park Ave., Florham Park, NJ, 07932, USA

    Healfdene Goguen

  2. Department of Computer Science, University of Edinburgh, The King’s Buildings, Edinburgh, EH9 3JZ, UK

    Healfdene Goguen

Authors
  1. Healfdene Goguen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS - UPR9016, Institut de Mathématiques de Luminy, 163 Avenue de Luminy, case 907, F-13288, Marseille cedex 9, France

    Jean-Yves Girard

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goguen, H. (1999). Soundness of the Logical Framework for Its Typed Operational Semantic. In: Girard, JY. (eds) Typed Lambda Calculi and Applications. TLCA 1999. Lecture Notes in Computer Science, vol 1581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48959-2_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-48959-2_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation