The foundation of a generic theorem prover
Journal of Automated Reasoning
Unification under a mixed prefix
Journal of Symbolic Computation
Handbook of logic in computer science (vol. 2)
Pure Type Systems with Definitions
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Parameters in Pure Type Systems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Open Proofs and Open Terms: A Basis for Interactive Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
PAL+: a lambda-free logical framework
Journal of Functional Programming
PVS#: Streamlined Tacticals for PVS
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Computational Logic (TOCL)
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
The lambda-context calculus (extended version)
Information and Computation
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
Information and Computation
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
| Hi-index | 0.00 |
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. We do this by introducing hereditarily parameterized meta-variables and show that by separating the object-level from the meta-level abstractions one can get the abstraction needed to implement the incomplete objects without having to extend the function spaces of the object-level system. We define a typing system that extends λHOL and re-establish the formulas-as-types embedding of the logic with binding holes into this system.