5818 search results - page 957 / 1164 » A reasonable Semantic Web |
284
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
166
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
169
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
161
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
137
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
Canonical propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the subformula property, in...