Sciweavers

125 search results - page 12 / 25
» Tabling for Higher-Order Logic Programming
Sort
View
TOPLAS
1998
113views more  TOPLAS 1998»
13 years 7 months ago
An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs
Konstantinos F. Sagonas, Terrance Swift
PADL
2004
Springer
14 years 1 months ago
Observing Functional Logic Computations
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...
LISP
2007
124views more  LISP 2007»
13 years 7 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&...
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
14 years 1 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
PPDP
2004
Springer
14 years 1 months ago
Semi-naive evaluation in linear tabling
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
Neng-Fa Zhou, Yi-Dong Shen, Taisuke Sato