378 search results - page 37 / 76 » Higher-order transformation of logic programs |
IJCAI
2007
14 years 11 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
LOPSTR
1995
Springer
15 years 1 months ago
1995
Springer
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s con...
151
click to vote
POPL
2002
ACM
15 years 10 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...
ACL
1996
14 years 11 months ago
1996
Off-line compilation of logic grammars using Magic allows an incorporation of filtering into the logic underlying the grammar. The explicit definite clause characterization of fil...
ICFP
2003
ACM
15 years 9 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...