On a Nonconstructive Type Theory and Program Derivation

Jan M. Smith
Additional contact information
Jan M. Smith: University of Göteborg/Chalmers, Department of Computer Science

A chapter in Mathematical Logic and Its Applications, 1987, pp 331-340 from Springer

Abstract: 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].

Keywords: Induction Hypothesis; Classical Logic; Type Theory; Computation Rule; Constructive Mathematic (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_25

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_25

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().