95 search results - page 7 / 19 » Automated Proof Construction in Type Theory Using Resolution |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
TPHOL
2008
IEEE
14 years 1 months ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
CSL
2004
Springer
14 years 22 days ago
2004
Springer
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
CADE
2007
Springer
14 years 1 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...