177 search results - page 1 / 36 » Machine Checking Proof Theory: An Application of Logic to Lo... |
ICLA
2009
Springer
14 years 10 days ago
2009
Springer
TPHOL
1996
IEEE
13 years 10 months ago
1996
IEEE
We will present a Logic of Computable Functions based on the idea of Synthetic Domain Theory such that all functions are automatically continuous. Its implementation in the Lego pr...
CADE
2000
Springer
13 years 10 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 ...
ICALP
2007
Springer
13 years 12 months ago
2007
Springer
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
SLP
1993
13 years 7 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...