Open proofs and open terms: A basis for interactive logic (0)

by Herman Geuvers, Gueorgui I Jojgov
Venue:CSL, Springer
Add To MetaCart
Results 1 - 1 of 1

Holes with Binding Power

by G. I. Jojgov, Tu Eindhoven - In Types for Proofs and Programs, Second International Workshop, TYPES 2002, Berg en Dal, The Netherlands, April 24-28, 2002, Selected Papers, H. Geuvers and F. Wiedijk, Eds. Lecture Notes in Computer Science (LNCS 2646 , 2002
"... Incomplete logical proofs are the logical counterpart of the incomplete #-terms that one usually works with in an interactive theorem prover based on type theory. In this paper we extend the formalization of such incomplete proofs given in [5] by introducing unknowns that are allowed to provide ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Incomplete logical proofs are the logical counterpart of the incomplete #-terms that one usually works with in an interactive theorem prover based on type theory. In this paper we extend the formalization of such incomplete proofs given in [5] by introducing unknowns that are allowed to provide temporary bindings for variables that are supposed to be bound, but whose binders are not constructed yet - a situation that typically occurs when one does forward reasoning.