205 search results - page 10 / 41 » Higher-Order Coalition Logic |
TPHOL
2007
IEEE
14 years 4 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...
CADE
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
TPHOL
1997
IEEE
14 years 2 months ago
1997
IEEE
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
CADE
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
CADE
2009
Springer
14 years 10 months ago
2009
Springer
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-ord...