Sciweavers

122 search results - page 21 / 25
» Abductive Logic Programming by Nonground Rewrite Systems
Sort
View
ICFP
2000
ACM
15 years 10 months ago
The duality of computation
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
Pierre-Louis Curien, Hugo Herbelin
POPL
2007
ACM
16 years 6 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
FLOPS
1999
Springer
15 years 10 months ago
Typed Higher-Order Narrowing without Higher-Order Strategies
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
Sergio Antoy, Andrew P. Tolmach
OOPSLA
2004
Springer
15 years 11 months ago
C-SAW and genAWeave: a two-level aspect weaving toolsuite
This demonstration will feature overviews of the C-SAW and GenAWeave projects. The first half of the presentation will introduce the concept of two-level aspect weaving, which uni...
Jeffrey G. Gray, Jing Zhang, Suman Roychoudhury, I...
CADE
2003
Springer
16 years 6 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes