95 search results - page 1 / 19 » Automated Proof Construction in Type Theory Using Resolution |
136
Voted
CADE
2000
Springer
15 years 7 months ago
2000
Springer
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
99
Voted
CADE
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
115
Voted
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
115
Voted
TPHOL
1999
IEEE
15 years 7 months ago
1999
IEEE
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
147
Voted
HASKELL
2005
ACM
15 years 8 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...