60 search results - page 2 / 12 » Proof Terms for Simply Typed Higher Order Logic |
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
AGP
2010
IEEE
13 years 10 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
EUROCAST
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an exte...
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...