Elvira Albert, Germán Puebla & John P. Gallagher (2006):
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates.
In: Patricia M. Hill: Logic Based Program Synthesis and Transformation.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 115–132,
doi:10.1007/11680093_8.
Maximilian C. Bolingbroke & Simon L. Peyton Jones (2010):
Supercompilation by evaluation.
In: Jeremy Gibbons: Proceedings of the 3rd ACM SIGPLAN Symposium on Haskell, Haskell 2010, Baltimore, MD, USA, 30 September 2010.
ACM,
pp. 135–146,
doi:10.1145/1863523.1863540.
Mikhail A. Bulyonkov (1984):
Polyvariant Mixed Computation for Analyzer Programs.
Acta Informatica 21(5),
pp. 473–484,
doi:10.1007/BF00271642.
William E. Byrd, Eric Holk & Daniel P. Friedman (2012):
miniKanren, Live and Untagged: Quine Generation via Relational Interpreters (Programming Pearl).
In: Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming,
pp. 8–29,
doi:10.1145/2661103.2661105.
Wei-Ngan Chin (1993):
Towards an Automated Tupling Strategy.
In: Proceedings of the 1993 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation,
PEPM '93.
Association for Computing Machinery,
New York, NY, USA,
pp. 119–132,
doi:10.1145/154630.154643.
Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens & Morten Heine B. Sørensen (1999):
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments.
The Journal of Logic Programming 41(2-3),
pp. 231–277,
doi:10.1016/S0743-1066(99)00030-8.
Daniel P. Friedman, William E. Byrd & Oleg Kiselyov (2005):
The Reasoned Schemer.
The MIT Press,
doi:10.7551/mitpress/5801.001.0001.
John P. Gallagher (1993):
Tutorial on Specialisation of Logic Programs.
In: Proceedings of the 1993 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation,
PEPM '93,
New York, NY, USA,
pp. 88–98,
doi:10.1145/154630.154640.
Robert Glück & Morten Heine B. Sørensen (1994):
Partial Deduction and Driving are Equivalent.
In: International Symposium on Programming Language Implementation and Logic Programming.
Springer,
pp. 165–181,
doi:10.1007/3-540-58402-1_13.
Geoff W. Hamilton (2007):
Distillation: Extracting the Essence of Programs.
In: Proceedings of the 2007 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation,
PEPM '07.
Association for Computing Machinery,
New York, NY, USA,
pp. 61–70,
doi:10.1145/1244381.1244391.
Jason Hemann & Daniel P. Friedman (2013):
μKanren: A Minimal Functional Core for Relational Programming.
In: Proceedings of the 2013 Workshop on Scheme and Functional Programming (Scheme'13).
Available at http://webyrd.net/scheme-2013/papers/HemannMuKanren2013.pdf.
Graham Higman (1952):
Ordering by Divisibility in Abstract Algebras.
In: Proceedings of the London Mathematical Society 2,
pp. 326–336,
doi:10.1112/plms/s3-2.1.326.
Neil D. Jones, Carsten K. Gomard & Peter Sestoft (1993):
Partial Evaluation and Automatic Program Generation.
Prentice Hall international series in computer science.
Prentice Hall, Inc,
USA.
Peter A. Jonsson & Johan Nordlander (2011):
Taming Code Explosion in Supercompilation.
In: Siau-Cheng Khoo & Jeremy G. Siek: Proceedings of the 20th ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation,
PEPM '11.
Association for Computing Machinery,
New York, NY, USA,
pp. 33–42,
doi:10.1145/1929501.1929507.
Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman & Amr Sabry (2005):
Backtracking, Interleaving, and Terminating Monad Transformers: (Functional Pearl).
In: Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming,
ICFP '05.
Association for Computing Machinery,
New York, NY, USA,
pp. 192–203,
doi:10.1145/1086365.1086390.
Joseph B. Kruskal (1960):
Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture.
Transactions of the American Mathematical Society 95(2),
pp. 210–225,
doi:10.2307/1993287.
Michael Leuschel (1997):
The Ecce Partial Deduction System.
In: Proceedings of the ILPS'97 Workshop on Tools and Environments for (Constraint) Logic Programming, German Puebla, Universidad Politécnica de Madrid Tech. Rep. CLIP7/97.1.
Michael Leuschel & Maurice Bruynooghe (2002):
Logic Program Specialisation through Partial Deduction: Control Issues.
Theory and Practice of Logic Programming 2(4-5),
pp. 461–515,
doi:10.1017/S147106840200145X.
Michael Leuschel, Dan Elphick, Mauricio Varea, Stephen-John Craig & Marc Fontaine (2006):
The Ecce and Logen Partial Evaluators and Their Web Interfaces.
In: John Hatcliff & Frank Tip: Proceedings of the 2006 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation,
PEPM '06.
Association for Computing Machinery,
pp. 88–94,
doi:10.1145/1111542.1111557.
Michael Leuschel & Morten Heine B. Sørensen (1996):
Redundant Argument Filtering of Logic Programs.
In: International Workshop on Logic Programming Synthesis and Transformation.
Springer,
Berlin, Heidelberg,
pp. 83–103,
doi:10.1007/3-540-62718-9_6.
Michael Leuschel & Germán Vidal (2014):
Fast Offline Partial Evaluation of Logic Programs.
Information and Computation 235,
pp. 70–97,
doi:10.1016/j.ic.2014.01.005.
John W. Lloyd & John C. Shepherdson (1991):
Partial Evaluation in Logic Programming.
The Journal of Logic Programming 11(3-4),
pp. 217–242,
doi:10.1016/0743-1066(91)90027-M.
Petr Lozov, Ekaterina Verbitskaia & Dmitry Boulytchev (2019):
Relational Interpreters for Search Problems.
In: miniKanren and Relational Programming Workshop,
pp. 43.
Available at http://minikanren.org/workshop/2019/minikanren19-final3.pdf.
Petr Lozov, Andrei Vyatkin & Dmitry Boulytchev (2017):
Typed Relational Conversion.
In: International Symposium on Trends in Functional Programming.
Springer,
pp. 39–58,
doi:10.1007/978-3-319-89719-6_3.
Neil Mitchell & Colin Runciman (2007):
A Supercompiler for Core Haskell.
In: Olaf Chitil, Zoltán Horváth & Viktória Zsók: Implementation and Application of Functional Languages, 19th International Workshop,
Lecture Notes in Computer Science 5083.
Springer,
Freiburg, Germany,
pp. 147–164,
doi:10.1007/978-3-540-85373-2_9.
Steven Muchnick (1997):
Advanced Compiler Design Implementation.
Morgan kaufmann.
Alberto Pettorossi (1984):
A Powerful Strategy for Deriving Efficient Programs by Transformation.
In: Proceedings of the 1984 ACM Symposium on LISP and Functional Programming,
LFP '84.
Association for Computing Machinery,
New York, NY, USA,
pp. 273–281,
doi:10.1145/800055.802044.
Dmitry Rozplokhas, Andrey Vyatkin & Dmitry Boulytchev (2020):
Certified Semantics for Relational Programming.
In: Bruno C. d. S. Oliveira: Asian Symposium on Programming Languages and Systems.
Springer.
Springer International Publishing,
Cham,
pp. 167–185,
doi:10.1007/978-3-030-64437-6_9.
Morten Heine B. Sørensen (1998):
Convergence of Program Transformers in the Metric Space of Trees.
In: International Conference on Mathematics of Program Construction.
Springer.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 315–337,
doi:10.1007/BFb0054297.
Morten Heine B. Sørensen, Robert Glück & Neil D. Jones (1996):
A Positive Supercompiler.
Journal of functional programming 6(6),
pp. 811–838,
doi:10.1017/S0956796800002008.
Valentin F. Turchin (1986):
The Concept of a Supercompiler.
ACM Transactions on Programming Languages and Systems 8(3),
pp. 292–325,
doi:10.1145/5956.5957.
Raf Venken & Bart Demoen (1988):
A Partial Evaluation System for Prolog: Some Practical Considerations.
New Generation Computing 6(2-3),
pp. 279–290,
doi:10.1007/BF03037142.
Germán Vidal (2004):
Cost-Augmented Partial Evaluation of Functional Logic Programs.
Higher-Order and Symbolic Computation 17(1),
pp. 7–46,
doi:10.1023/B:LISP.0000029447.02190.42.
Germán Vidal (2008):
Trace Analysis for Predicting the Effectiveness of Partial Evaluation.
In: International Conference on Logic Programming.
Springer.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 790–794,
doi:10.1007/978-3-540-89982-2_78.
Germán Vidal (2011):
A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs.
In: María Alpuente: Logic-Based Program Synthesis and Transformation.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
pp. 200–214,
doi:10.1007/978-3-642-20551-4_13.
Philip Wadler (1990):
Deforestation: Transforming Programs to Eliminate Trees.
Theoretical Computer Science 73(2),
pp. 231–248,
doi:10.1016/0304-3975(90)90147-A.