61 search results - page 5 / 13 » Partial Order Reduction for Rewriting Semantics of Programmi... |
170
click to vote
ICLP
2009
Springer
16 years 6 days ago
2009
Springer
Abstract. Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language f...
AGP
1997
IEEE
15 years 3 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
ICLP
2004
Springer
15 years 5 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
PEPM
1993
ACM
15 years 3 months ago
1993
ACM
Applications of partial evaluation have so far mainly focused on generation of compilers from interpreters for programming languages. We partially evaluate a simple general LR(k) ...
101
click to vote
POPL
1997
ACM
15 years 3 months ago
1997
ACM
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...