Sciweavers

1445 search results - page 57 / 289
» Abstract Interpretation of Logic Programs
Sort
View
PEPM
2004
ACM
15 years 5 months ago
Imperative program optimization by partial evaluation
We implement strength reduction and loop-invariant code motion by specializing instrumented interpreters; we define a novel program transformation that uses bisimulation to ident...
Søren Debois
LISP
2007
124views more  LISP 2007»
14 years 11 months ago
A new generic scheme for functional logic programming with constraints
In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
Francisco Javier López-Fraguas, Mario Rodr&...
SLP
1997
102views more  SLP 1997»
15 years 1 months ago
Compositionality of Normal Open Logic Programs
Compositionality of programsis an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly be...
Sofie Verbaeten, Marc Denecker, Danny De Schreye
CSL
2004
Springer
15 years 5 months ago
Predicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
Pierre Hyvernat
LPNMR
2001
Springer
15 years 4 months ago
Multi-adjoint Logic Programming with Continuous Semantics
Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several a...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...