Sciweavers

700 search results - page 45 / 140
» On Termination of Constraint Logic Programs
Sort
View
LOPSTR
2007
Springer
15 years 5 months ago
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
Elvira Albert, John P. Gallagher, Miguel Gó...
LPAR
1992
Springer
15 years 3 months ago
From the Past to the Future: Executing Temporal Logic Programs
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
Michael Fisher, Richard Owens
ICFP
2005
ACM
15 years 4 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
CADE
2001
Springer
15 years 11 months ago
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
Bernhard Beckert, Steffen Schlager
CORR
2004
Springer
136views Education» more  CORR 2004»
14 years 11 months ago
Automatic Generation of CHR Constraint Solvers
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
Slim Abdennadher, Christophe Rigotti