Abstract
Not considering philosophical arguments, the main motive for using constructive reasoning when constructing programs is that constructive proofs have computational content. For instance, formulating a specification and proving it in Martin-Löf’s type theory, gives a program satisfying the specification. On the other hand, extracting programs from classical proofs is in general not possible. However, the process of deriving a program may not only involve the actual construction of the program but also the verification that an already constructed part of the program satisfies some property and it is then quite possible to use classical logic. A system for program derivation where you may use classical logic is the one developed by Manna and Waldinger [5].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Beeson. Foundations of Constructive Mathematics. Springer, 1985.
T. Coquand and G. Huet. Constructions: A Higher Order Proof System for Mechanizing Mathematics. Presented at Eurocal 85, April 1985, Linz, Austria.
K. Gödel. Zur intuitionistischen Arithmetik und Zahlentheorie. Ergebnisse eines mathematischen Kolloquiums, Heft 4 (for 1931–32, pub. 1933), pp.34–38.
S.C. Kleene. Introduction to Metamathematics. North-Holland 1952.
Z. Manna and R. Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems Vol. 2, No. 1, January 1980, pp. 90–121.
P. Martin-Löf. Constructive Mathematics and Computer Programming. In Sixth International Congress for Logic, Methodology, and Philosophy of Science, pp. 153–175. North-Holland, 1982.
P. Martin-Löf. Intuitionistic Type Theory. Studies in Proof Theory, Lecture Notes, Bibliopolis, Napoli, 1984.
B. Nordström and J.M. Smith. Propositions, Types, and Specifications in Martin-Löf’s Type Theory. BIT Vol. 24, No. 3, 1984, pp. 288–301.
K. Petersson and J.M Smith. Program Derivation in Type Theory: A Partitioning Problem. To appear in Journal of Computer Languages.
The Prl Staff (R. Constable et al.). Implementing Mathematics with The Nuprl Proof Development System. Computer Science Department, Cornell University, 1985.
J.M. Smith. An Interpretation of Martin-Löf’s Type theory in a Type Free Theory of Propositions. Journal of Symbolic Logic Vol. 49, No. 3, September 1984, pp. 730–753.
C. Spector. Provable Recursive Functionals of Analysis: A Consistency Proof of Analysis by an Extension of Principles Formulated in Current Intuitionistic Mathematics. Proceedings of Symposia in Pure Mathematics, Volume V, pp.1–27, American Mathematical Society 1962.
W.W. Tait. Intensional interpretation of functionals of finite type I. Journal of Symbolic Logic Vol. 32, No. 2, June 1967, pp. 198–212.
A.S. Troelstra. Metamathematical Investigations of Intuitionistic Arithmetic and Analysis. Lecture Notes in Mathematics 344, Springer-Verlag 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Plenum Press, New York
About this chapter
Cite this chapter
Smith, J.M. (1987). On a Nonconstructive Type Theory and Program Derivation. In: Skordev, D.G. (eds) Mathematical Logic and Its Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0897-3_25
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0897-3_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8234-1
Online ISBN: 978-1-4613-0897-3
eBook Packages: Springer Book Archive