Maurice Bruynooghe (1991):
A Practical Framework for the Abstract Interpretation of Logic Programs.
J. Log. Program. 10(2),
pp. 91–124,
doi:10.1016/0743-1066(91)80001-T.
Maurice Bruynooghe, Danny De Schreye & Bruno Krekels (1989):
Compiling Control.
The Journal of Logic Programming 6(1&2),
pp. 135–162,
doi:10.1016/0743-1066(89)90033-2.
Danny De Schreye & Maurice Bruynooghe (1989):
On the Transformation of Logic Programs with Instantiation Based Computation Rules.
Journal of Symbolic Computation 7(2),
pp. 125–154,
doi:10.1016/S0747-7171(89)80046-X.
Thom W. Frühwirth (1998):
Theory and Practice of Constraint Handling Rules.
The Journal of Logic Programming 37(1-3),
pp. 95–138,
doi:10.1016/S0743-1066(98)10005-5.
Thom W. Frühwirth (1999):
Proving Termination of Constraint Solver Programs.
In: Krzysztof R. Apt, Antonis C. Kakas, Eric Monfroy & Francesca Rossi: New Trends in Contraints, Joint ERCIM/Compulog Net Workshop, Paphos, Cyprus, October 25-27, 1999, Selected Papers,
Lecture Notes in Computer Science 1865.
Springer,
pp. 298–317,
doi:10.1007/3-540-44654-0_15.
Thom W. Frühwirth (2002):
As Time Goes by: Automatic Complexity Analysis of Simplified Rules.
In: Dieter Fensel, Fausto Giunchiglia, Deborah L. McGuinness & Mary-Anne Williams: Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), Toulouse, France, April 22-25, 2002.
Morgan Kaufmann,
pp. 547–557,
doi:10.1016/S1571-0661(04)00288-9.
John Gallagher & Maurice Bruynooghe (1990):
Some low-level source transformations for logic programs.
Proceedings Meta 90,
pp. 229–244.
Michael Leuschel (2004):
A framework for the integration of partial evaluation and abstract interpretation of logic programs.
ACM Trans. Program. Lang. Syst. 26(3),
pp. 413–463,
doi:10.1145/982158.982159.
John W. Lloyd (1987):
Foundations of Logic Programming, 2nd Edition.
Springer,
doi:10.1007/978-3-642-83189-8.
John W. Lloyd & John C. Shepherdson (1991):
Partial Evaluation in Logic Programming.
J. Log. Program. 11(3&4),
pp. 217–242,
doi:10.1016/0743-1066(91)90027-M.
Vincent Nys & Danny De Schreye (2017):
Abstract conjunctive partial deduction for the analysis and compilation of coroutines.
Formal Asp. Comput. 29(1),
pp. 125–153,
doi:10.1007/s00165-016-0389-8.
Danny De Schreye & Stefaan Decorte (1994):
Termination of Logic Programs: The Never-Ending Story.
J. Log. Program. 19/20,
pp. 199–260,
doi:10.1016/0743-1066(94)90027-2.
Danny De Schreye, Vincent Nys & Colin J. Nicholson (2014):
Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction.
In: Maurizio Proietti & Hirohisa Seki: Logic-Based Program Synthesis and Transformation - 24th International Symposium, LOPSTR 2014, Canterbury, UK, September 9-11, 2014. Revised Selected Papers,
Lecture Notes in Computer Science 8981.
Springer,
pp. 21–38,
doi:10.1007/978-3-319-17822-6_2.
Tom Schrijvers (2008):
Constraint Handling Rules.
In: Maria Garcia de la Banda & Enrico Pontelli: Logic Programming: 24th International Conference, ICLP 2008 Udine, Italy, December 9-13 2008 Proceedings,
Lecture Notes in Computer Science 5366.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 9–10,
doi:10.1007/978-3-540-89982-2_3.
eptcs@eptcs.org