Sciweavers

2231 search results - page 129 / 447
» Alternation as a programming paradigm
Sort
View
PLILP
1994
Springer
15 years 8 months ago
clp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation meth...
Philippe Codognet, Daniel Diaz
JFPLC
2000
15 years 5 months ago
Preuves infinies en Programmation logique
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
Mathieu Jaume
ENTCS
2007
87views more  ENTCS 2007»
15 years 4 months ago
Aspect-orientation For Revitalising Legacy Business Software
This paper relates on a first attempt to see if aspect-oriented programming (AOP) and logic meta-programming (LMP) can help with the revitalisation of legacy business software. B...
Kris De Schutter, Bram Adams
ENTCS
2000
154views more  ENTCS 2000»
15 years 4 months ago
Debugging Haskell by Observing Intermediate Data Structures
Haskell has long needed a debugger. Although there has been much research into the topic of debugging lazy functional programs, no robust tool has yet come from the Haskell commun...
Andy Gill
ICFP
2002
ACM
16 years 4 months ago
Shortcut fusion for accumulating parameters & zip-like functions
We present an alternative approach to shortcut fusion based on the function unfoldr. Despite its simplicity the technique can remove intermediate lists in examples which are known...
Josef Svenningsson