Download:
|
by Wim Vanhoof, Danny De Schreye, Bern Martens
Proceedings of the Joint International Symposia PLILP/ALP 1998, volume 1490 of Lecture Notes In Computer Science
http://www.cs.kuleuven.ac.be/~dtai/publications/files/20728.ps.gz
Add To MetaCart
Abstract:
Partial deduction is an important transformation technique for logic programs, capable of removing inefficiencies from programs [3, 4]. As an on-line specialisation technique, it is based on an evaluation mechanism for logic programs. The input to a typical partial
Citations
|
722
|
Rewrite systems
– Dershowitz, Jouannaud
- 1990
|
|
231
|
C.: Partial Evaluation in Logic Programming
– Lloyd, Shepherdson
- 1991
|
|
114
|
The s-semantics approach: Theory and applications
– Bossi, Gabrielli, et al.
- 1994
|
|
75
|
A Compositional Semantics for Logic Programs
– Bossi, Gabbrielli, et al.
- 1994
|
|
63
|
Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance
– Martens, Gallagher
- 1995
|
|
53
|
Compositional analysis of modular logic programs
– Codish, Debray, et al.
- 1993
|
|
53
|
An Algorithm of Generalization in Positive Supercompilation
– Sørensen, Glück
- 1995
|
|
49
|
Global Control for Partial Deduction through Characteristic Atoms and Global Trees
– Leuschel, Martens
- 1996
|
|
47
|
Controlling generalisation and polyvariance in partial deduction of normal logic programs
– Leuschel, Martens, et al.
- 1998
|
|
33
|
Controlling conjunctive partial deduction of definite logic programs
– Gluck, J��rgensen, et al.
- 1996
|
|
27
|
Program specialisation and abstract interpretation reconciled
– Leuschel
- 1998
|
|
17
|
Specialisation of logic programs: A tutorial
– Gallagher
- 1993
|
|
15
|
To parse or not to parse
– Vanhoof, Martens
- 1997
|
|
11
|
Tutorial on program specialisation (abstract
– Schreye, Leuschel, et al.
- 1995
|
|
10
|
Synthesis of programs in the partial deduction framework
– Komorowski
- 1991
|
|
9
|
Data-driven transformation of meta-interpreters: A sketch
– Cosmadopoulos, Sergot, et al.
- 1991
|
|
9
|
How to control unfolding when specializing interpreters
– Lakhotia, Sterling
- 1990
|
|
7
|
Bottom up information propagation for partial deduction
– Vanhoof
- 1997
|
|
5
|
Declarative modeling of the operational behaviour of logic programs
– Falaschi, Levi, et al.
- 1989
|
|
5
|
Vlaminck. Specialising the other way around
– Vanhoof, Martens, et al.
- 1998
|
|
4
|
procedural and fixpoint semantics of logic programs
– Unfolding
- 1991
|
|
1
|
A Figures In this appendix, the dags built in the examples throughout Section 4 are depicted. For simplicity, variables in the dags are not renamed. list_nil([]) list_notnil([X|Xs]) list_head([X|Xs],X) list_tail([X|Xs],Xs) list_cons(X,Xs,[X|Xs
– MIT-Press
|
