95 search results - page 10 / 19 » Automated Proof Construction in Type Theory Using Resolution |
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
CADE
2003
Springer
14 years 7 months ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
HMF is a conservative extension of Hindley-Milner type inference with first-class polymorphism. In contrast to other proposals, HML uses regular System F types and has a simple ty...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...