95 search results - page 5 / 19 » Automated Proof Construction in Type Theory Using Resolution |
COCOON
1995
Springer
13 years 11 months ago
1995
Springer
A Craig interpolant of two inconsistent theories is a formula which is true in one and false in the other. This paper gives an eificient method for constructing a Craig interpolant...
LICS
2002
IEEE
14 years 7 days ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
APAL
2010
13 years 7 months ago
2010
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTT0 and LTT 0, which we...