Abstract
We give a realizability interpretation of an intuitionistic version of Church's Simple Theory of Types (CST) which can be viewed as a formalization of intuitionistic higher-order logic. Although definable in CST we include operators for monotone induction and coinduction and provide simple realizers for them. Realizers are formally represented in an untyped lambda–calculus with pairing and case-construct. The purpose of this interpretation is to provide a foundation for the extraction of verified programs from formal proofs as an alternative to type-theoretic systems. The advantages of our approach are that (a) induction and coinduction are not restricted to the strictly positive case, (b) abstract mathematical structures and results may be imported, (c) the formalization is technically simpler than in other systems, for example, regarding the definition of realizability, which is a simple syntactical substitution, and the treatment of nested and simultaneous (co)inductive definitions.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference41 articles.
1. Dependent choice, ‘quote’ and the clock
2. The Coq Proof Assistant. http://coq.inria.fr/.
3. Paulin-Mohring C. (1989a). Extracting Fω 's programs from proofs in the calculus of constructions. In: Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages 89–104.
4. Hayashi S. and Nakano H. (1987). PX, a computational logic. Technical Report, Research Institute for Mathematical Sciences, Kyoto University.
5. Constable R. , Allen S. , Bromley H. , Cleaveland W. , Cremer J. , Harper R. , Howe D. , Knoblock T. , Mendler N. , Panangaden P. , Sasaki J. and Smith S. (1986). Implementing mathematics with the Nuprl proof development system. Prentice–Hall, New Jersey.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献