Skip to main content
SpringerLink
Log in

Big trees in a λ-calculus with λ-expressions as types

  • Conference paper
  • First Online:
λ-Calculus and Computer Science Theory (LCCST 1975)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benthem Jutting, L.S. van, On normal forms in AUTOMATH; Unpublished, 1971.

    Google Scholar 

  2. Benthem Jutting, L.S. van, The development of a text in AUT-QE; proceedings of the Symposium APLASM (Orsay, December 1973), ed. P. Braffort (to appear).

    Google Scholar 

  3. Bruijn, N.G. de, The mathematical language AUTOMATH, its usage, and some of its extensions; Symposium on Automatic Demonstration (Versailles, December 1968), Springer Lecture Notes in Mathematics, Vol. 125 (1970), 29–61.

    Google Scholar 

  4. Daalen, D.T. van, A description of AUTOMATH and some aspects of its language theory; proceedings of the Symposium APLASM (Orsay, December 1973), ed. P. Brafford (to appear).

    Google Scholar 

  5. Hindley, J.R., B. Lercher and J.P. Seldin, Introduction to Combinatory Logic, Cambridge University Press (1972).

    Google Scholar 

  6. Howard, W.A., The formulae-as-types notion of construction; Unpublished (1969).

    Google Scholar 

  7. Martin-Löf, P., An intuitionistic theory of types; Unpublished (1972).

    Google Scholar 

  8. Nederpelt, R.P., Strong normalization in a typed lambda calculus with lambda structured types; Doctoral dissertation, Technological University Eindhoven (1973).

    Google Scholar 

  9. Prawitz, D., Ideas and results in proof theory; Proc. of the second Scandinavian Logic Symposium, ed. J.E. Fenstad, North Holland 1971.

    Google Scholar 

  10. Scott, D., Constructive validity; Symposium on Automatic Demonstration (Versailles, December 1968), Springer Lecture Notes in Mathematics, vol. 125 (1970), 237–275.

    Google Scholar 

  11. Tait, W.W., Intensional interpretations of functionals of finite type I. J. of Symbolic Logic 32 (1967), 198–212.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Technological University Eindhoven, The Netherlands

    Roel de Vrijer

Authors
  1. Roel de Vrijer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Vrijer, R. (1975). Big trees in a λ-calculus with λ-expressions as types. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029530

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07416-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation