13383 search results - page 8 / 2677 » Abstractions from proofs |
149
click to vote
TLCA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
115
click to vote
MKM
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we address the problem of reconstructing a higher order, checkable proof object starting from a proof trace left by a first order automatic proof searching procedure...
123
click to vote
ROOM
2000
15 years 5 months ago
2000
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
133
click to vote
TPHOL
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
167
click to vote
AGP
2010
IEEE
15 years 9 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...