Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Theoretical Aspects of Computer Software

TACS 1991: Theoretical Aspects of Computer Software pp 38–52Cite as

Monotone recursive definition of predicates and its realizability interpretation

  • Conference paper
  • First Online:

  • 144 Accesses

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

Abstract

The main aim of the paper is to construct a logic by which we can formalize properties of programs. Inductive definition or recursive definition plays a very important role for this purpose. Inductive definition has been studied for untyped theories, predicative typed theories and impredicative typed theories. Monotone recursive definition in an untyped theory is studied in this paper. The main point is realizability interpretation of monotone recursive definition.

Untyped predicative theory TID 0 and TID 1 are presented, which have monotone recursive definition of predicates. TID 1 has full monotone recursive definition and TID 0 has only restricted monotone recursive definition. q-realizability interpretation of TID 0 and TID 1 is defined. It is proved that the realizability interpretation of TID 0 is sound and that the realizability interpretation of TID 1 is not sound, though TID 1 and its interpretation seem very natural.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Beeson. Foundations of Constructive Mathematics. Springer, 1985.

    Google Scholar 

  2. R.L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.

    Google Scholar 

  3. T. Coquand and C. Paulin. Inductively Defined Types. Manuscript, 1989.

    Google Scholar 

  4. S. Feferman. Constructive theories of functions and classes, In: M. Boffa, D. van Dalen and K. McAloon, editors. Logic Colloquium '78, Proceedings of the Logic Colloquium at Mons, pages 159–224. North-Holland, 1979.

    Google Scholar 

  5. S. Hayashi and H. Nakano. PX: A Computational Logic. MIT Press, 1988.

    Google Scholar 

  6. S. Kobayashi and M. Tatsuta. Realizability Interpretation of Generalized Inductive Definitions. Submitted, 1989.

    Google Scholar 

  7. P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, 1984.

    Google Scholar 

  8. C. Paulin-Mohring. Extracting F w's programs from proofs in the Calculus of Constructions. In 16th Symp. Principles of Programming Languages, pages 89–104. ACM, 1989.

    Google Scholar 

  9. F. Pfenning and C. Paulin-Mohring. Inductively Defined Types in the Calculus of Constructions. Technical Report CMU-CS-89-209, School of Computer Science, Carnegie Melon University, 1989.

    Google Scholar 

  10. M. Tatsuta. Program Synthesis Using Realizability. Theoretical Computer Science, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute of Electrical Communication, Tohoku University, 980, Sendai, Japan

    Makoto Tatsuta

Authors
  1. Makoto Tatsuta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Takayasu Ito Albert R. Meyer

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tatsuta, M. (1991). Monotone recursive definition of predicates and its realizability interpretation. In: Ito, T., Meyer, A.R. (eds) Theoretical Aspects of Computer Software. TACS 1991. Lecture Notes in Computer Science, vol 526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54415-1_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-54415-1_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation