Skip to main content
SpringerLink
Log in

A syntactic proof of the conservativity of λω over λ2

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, the relationship between the second order typed λ-calculus λ2 and its higher order version λω is discussed. A purely syntactic proof of the conservativity of λω over λ2 is given.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barendregt H P. Typed lambda calculi. InHandbook of Logic in Computer Science, Abramsky Set al. (eds.), Oxford Univ. Press, 1990.

  2. Geuvers J H. Logic and Type Systems. Ph.D. Thesis, Univ. of Nijmegen, the Netherlands, 1993.

    Google Scholar 

  3. Barendregt H P. Introduction to generalized type systems.J. Functional Programming, 1991, 1(2).

  4. Geuvers J H. Conservativity between logic and typed λ-calculi. InInformal Proceedings of the 1993 Workshop on Types for Proofs and Program.

  5. Luo Z. A Problem of Adequacy: Conservativity of Calculus of Constructions over High-Order Logic. Technical report, Dept. of Computer Science, Univ. of Edinburgh, 1993.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, State Key Laboratory for Novel Software Technology, Nanjing University, 210093, Nanjing, P.R. China

    Song Fangmin & Qian Yuechen

Authors
  1. Song Fangmin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qian Yuechen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Song Fangmin.

Additional information

SONG Fangmin is a Professor of the Department of Computer Science and Technology, Nanjing University. He received his B.Sc., M.Sc. and Ph.D. degrees from Nanjing University in 1982, 1985 and 1988 respectively. His research interests include logic in computer science, lambda calculus and type theory.

QIAN Yuechen is a M.S. candidate of the Department of Computer Science and Technology, Nanjing University, majoring in Theoretical Computer Science. He received his B.Sc. degree from Nanjing University in 1996. His research interests include communicating sequential processes and formal semantics of object-oriented programming languages.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Song, F., Qian, Y. A syntactic proof of the conservativity of λω over λ2 . J. Comput. Sci. & Technol. 14, 129–134 (1999). https://doi.org/10.1007/BF02946518

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946518

Keywords

Search

Navigation