3658 search results - page 420 / 732 » The logic of proofs, semantically |
264
click to vote
POPL
2002
ACM
16 years 7 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
132
click to vote
LICS
2007
IEEE
16 years 1 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
170
click to vote
ICLP
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. This paper proposes a diagnosis algorithm for locating a certain kind of errors in logic programs: variable binding errors that result act symptoms during compile-time ch...
161
click to vote
KR
2004
Springer
16 years 3 days ago
2004
Springer
The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
182
click to vote
KCAP
2003
ACM
15 years 12 months ago
2003
ACM
Modularity is a key requirement for large ontologies in order to achieve re-use, maintainability, and evolution. Mechanisms for ‘normalisation’ to achieve analogous aims are s...