351 search results - page 8 / 71 » Logic Programs with Compiled Preferences |
JISE
2000
13 years 8 months ago
2000
PPCP
1993
14 years 20 days ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
POPL
2002
ACM
14 years 9 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...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
ICFP
2009
ACM
14 years 9 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...