Skip to main content
SpringerLink
Log in

A functional system with transfinitely defined types

  • Chapter
  • First Online:
Logic, Language and Computation

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

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. H. P. Barendregt, The lambda calculus (North-Holland, Amsterdam, 1981).

    Google Scholar 

  2. Th. Coquand and G. Huet, Calculus of constructions, Information and Computation 76 (1988), 95–120.

    Article  Google Scholar 

  3. J-Y. Girard, P. Taylor and Y. Lafont, Proofs and types (Cambridge University Press, Cambridge, 1989).

    Google Scholar 

  4. W. A. Howard and G. Kreisel, Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis, J. Symbolic Logic 31 (1966), 325–358.

    Google Scholar 

  5. J. Lambek and P. J. Scott, Introduction to higher order categorical logic (Cambridge University Press, Cambridge, 1984).

    Google Scholar 

  6. Z. Luo, An extended calculus of constructions (Department of Computer Science, University of Edinburgh, 1990).

    Google Scholar 

  7. G. Takeuti and M. Yasugi, The ordinals of the systems of second order arithmetic with the provably Δ 1 2-comprehension axiom and with the Δ 1 2-comprehension axiom respectively, Japanese J. Math. 41 (1973), 1–67.

    Google Scholar 

  8. M. Yasugi, Construction principle and transfinite induction up to ε 0, J. Austral. Math. Soc. 32 (1982), 24–47.

    Google Scholar 

  9. M. Yasugi, Hyper-principle and the functional structure of ordinal diagrams, Comment. Math. Univ. St. Pauli 34 (1985), 227–263 (the opening part); 35 (1986), 1–37 (the concluding part).

    Google Scholar 

  10. M. Yasugi and S. Hayashi, Interpretations of transfinite recursion and parametric abstraction in types, Words, Languages and Combinatorics IIedited by M. Ito and H. Jurgensen (World Scientific Publ., Singapore), to appear.

    Google Scholar 

  11. J. I. Zucker, Iterated inductive definitions, trees and ordinals, Metamathematical investigations of intuitionistic arithmetic and analysis, ed. by A. S. Troelstra, Lecture Notes in Math. 344 (Springer-Verlag, Berlin 1973), 392–453.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Science, Kyoto Sangyo University, Kita-ku, 603, Kyoto, Japan

    Mariko Yasugi

  2. Faculty of Science and Engineering, Ryukoku University, Seta, 520-21, Ohtsu, Japan

    Susumu Hayashi

Authors
  1. Mariko Yasugi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Susumu Hayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Neil D. Jones Masami Hagiya Masahiko Sato

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Yasugi, M., Hayashi, S. (1994). A functional system with transfinitely defined types. In: Jones, N.D., Hagiya, M., Sato, M. (eds) Logic, Language and Computation. Lecture Notes in Computer Science, vol 792. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032393

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57935-9

  • Online ISBN: 978-3-540-48391-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation