4573 search results - page 680 / 915 » Automated Reasoning |
142
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
134
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
126
click to vote
TPHOL
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract. Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part...
129
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...
118
click to vote
TPHOL
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Among other things, Isar provides an infrastructure for Isabelle plug-ins,...