Proof Theory At Work: Program Development In The Minlog System (1998)
| Citations: | 22 - 10 self |
BibTeX
@MISC{Benl98prooftheory,
author = {? Benl and Berger and Schwichtenberg and Seisenberger and Zuber},
title = {Proof Theory At Work: Program Development In The Minlog System},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
INTRODUCTION The old idea that proofs are in some sense functions, has been made precise by the Curry-Howard-correspondence between proofs in natural deduction and terms in typed l-calculus. Since the latter can be viewed as an idealized functional programming language, this amounts to an interpretation of proofs as functional programs. This concept and related ones going back to work of Gentzen, Gödel, Kleene and Kreisel are implemented in MINLOG, an interactive proof system designed for generating proof terms and exploring their algorithmic content. Besides tools for interactive proof generation, MINLOG has automatic devices \Gamma to search for purely logical (sub)proofs, \Gamma to check the correctness of a proof, \Gamma to remove detours in a proof, \Gamma to make a nonconstructive proof constructive, \Gamma to read off witnesses from a constructive pro
Citations
No citations identified.
