Sciweavers

57 search results - page 2 / 12
» Specialising Logic Programs with Respect to Call
Sort
View
ESOP
2005
Springer
13 years 11 months ago
Determinacy Inference for Logic Programs
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...
Lunjin Lu, Andy King
DAGSTUHL
1996
13 years 6 months ago
Efficiently Generating Efficient Generating Extensions in Prolog
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
Jesper Jørgensen, Michael Leuschel
WLP
1997
Springer
13 years 9 months ago
Constrained Partial Deduction
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
Michael Leuschel, Danny De Schreye
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 5 months ago
Enhanced Prolog Remote Predicate Call Protocol
Following the ideas of the Remote Procedure Call model, we have developed a logic programming counterpart, naturally called Prolog Remote Predicate Call (Prolog RPC) [1]. The Prol...
Alin Suciu, Kalman Pusztai, Andrei Diaconu
FLOPS
2004
Springer
13 years 9 months ago
LIX: an Effective Self-applicable Partial Evaluator for Prolog
This paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. The partial evaluator is shown to achieve non-trivial specialisation and be effect...
Stephen-John Craig, Michael Leuschel