Skip to main content
SpringerLink
Log in

A new type assignment for λ-terms

  • Published:
Archiv für mathematische Logik und Grundlagenforschung Aims and scope Submit manuscript

Abstract

In the present paper we propose a new type assignment for λ-terms whose motivation is to introduce a system with simple inferential rules to study termination (i.e. the property of having a normal form) of λ-terms. The main results that will be proved in this paper are:

  1. a)

    all λ-terms in normal form possess a type,

  2. b)

    all λ-terms which possess a type reduce to normal form.

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. Birkhoff, G.: Lattice theory. American Mathematical Society Colloquium Publications25 (1940).

  2. Böhm, C., Groß, W.: Introduction to the CUCH. In: Caianiello, E. R. (ed.): Automata Theory, pp. 35–65. Amsterdam: North-Holland 1966.

    Google Scholar 

  3. Böhm, C., Dezani-Ciancaglini, M.: λ-Terms as total or partial function on normal forms. In: Böhm, C. (ed.): λ-Calculus and computer science theory. Lecture Notes in Computer Science, Vol. 37, pp. 96–121. Berlin, Heidelberg, New York: Springer 1975.

    Google Scholar 

  4. Böhm, C., Coppo, M., Dezani-Ciancaglini, M.: Termination test inside λ-calculus. In: Salomaa, A. and Steinby, M. (eds.): Lecture Notes in Computer Science, Vol. 52, pp. 95–110. Berlin, Heidelberg, New York: Springer 1977.

    Google Scholar 

  5. Church, A.: Combinatory logic as a semigroup. Bull. Amer. Math. Soc. (Abstract)43 333 (1937).

    Google Scholar 

  6. Church, A.: A formalization of the simple theory of types. J. Symbol. Logic5, 56–58 (1950).

    Google Scholar 

  7. Curry, H. B., Feys, R.: Combinatory logic, Vol. 1. Amsterdam: North-Holland 1958.

    Google Scholar 

  8. Curry, H. B., Hindley, J. R., Seldin, J. P.: Combinatory logic, Vol. 2. Amsterdam: North-Holland 1972.

    Google Scholar 

  9. Dezani-Ciancaglini, M.: A type theory for λ-β-normal forms. Proc. of the Symposium Informatica75, BLED (1975).

  10. Gentzen, G.: Investigations into logical reductions. In: The Collected Papers of Gerard Gentzen. Amsterdam: North-Holland 1969.

    Google Scholar 

  11. Hindley, R., Lercher, B., Seldin, J. P.: Introduction to combinatory logic. London North. Soc. Lecture Note Series7 (1972).

  12. Seldin, J. P.: The theory of generalized functionality. I. Unpublished manuscript (1976).

Download references

Author information

Authors and Affiliations

  1. Istituto di Scienze dell'informazione, Università di Torino, Corso M. d'Azeglio 42, 10125, Torino, Italien

    M. Coppo & M. Dezani-Ciancaglini

Authors
  1. M. Coppo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Dezani-Ciancaglini
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Coppo, M., Dezani-Ciancaglini, M. A new type assignment for λ-terms. Arch math Logik 19, 139–156 (1978). https://doi.org/10.1007/BF02011875

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation