61 search results - page 2 / 13 » Partial Order Reduction for Rewriting Semantics of Programmi... |
AI
2001
Springer
13 years 9 months ago
2001
Springer
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...
FPCA
1987
13 years 9 months ago
1987
: Categorical Multi-Combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of Catego...
FLOPS
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
PPDP
2009
Springer
14 years 21 days ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
PEPM
2004
ACM
13 years 11 months ago
2004
ACM
We implement strength reduction and loop-invariant code motion by specializing instrumented interpreters; we define a novel program transformation that uses bisimulation to ident...