Efficiently generating efficient generating extensions in prolog
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The initial approach in [5] was often too weak for logic programs.
“which w as often too weak for logic programs”
From Efficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN (2000) · cites this paper as [5]
The first cogen for logic programming languages was developed in [5].
“The rst cogen for logic programming languages was developed in 5].”
From Efficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN (2000) · cites this paper as [5]
Compared with [5], points 3, 4, 5 and the partially static structures of point 1 are new.
“Compared with 5], the points 3, 4, 5 as well as the partially static structures of point 1 are new”
From Efficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN (2000) · cites this paper as [5]
Due to the limitations of the initial cogen, only very few realistic benchmarks could be run.
“However, due to the limitations of the initial cogen only very few realistic benchmarks could be run.”
From Efficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN (2000) · cites this paper as [5]
Cites
Foundations of Logic Programming
Lloyd, J. (1984) · Symbolic Computation · doi:10.1007/978-3-642-96826-6 · Cited by 5,772 · see citing works
Foundations of Logic Programming
Lloyd, J. W. (1987) · Springer eBooks · doi:10.1007/978-3-642-83189-8 · Cited by 2,736 · see citing works
Partial evaluation and automatic program generation
Jones, N. D., Gomard, C. K., & Sestoft, P. (1993) · Medical Entomology and Zoology · Cited by 1,440 · see citing works
Program Analysis and Specialization for the C Programming Language
Andersen, L. O., & Lee, P. (2005) · Cited by 903 · see citing works
Partial evaluation in logic programming
Lloyd, J. W., & Shepherdson, J. C. (1991) · The Journal of Logic Programming · doi:10.1016/0743-1066(91)90027-m · Cited by 381 · see citing works
The concept of a supercompiler
Turchin, V. F. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5956.5957 · Cited by 363 · see citing works
Tutorial notes on partial evaluation
Consel, C., & Olivier Danvy, A. (1993) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/158511.158707 · Cited by 317 · see citing works
Mix: A self-applicable partial evaluator for experiments in compiler generation
Jones, N. D., Sestoft, P., & Søndergaard, H. (1989) · LISP and Symbolic Computation · doi:10.1007/bf01806312 · Cited by 250 · see citing works
Transformation of logic programs: Foundations and techniques
Pettorossi, A., & Proietti, M. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90028-0 · Cited by 197 · see citing works
Tutorial on specialisation of logic programs
Gallagher, J. P. (1993) · Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '93 · doi:10.1145/154630.154640 · Cited by 171 · see citing works
An Algorithm of Generalization in Positive Supercompilation
(1995) · Logic Programming · doi:10.7551/mitpress/4301.003.0048 · Cited by 145 · see citing works
Logic Program Synthesis via Proof Planning
Kraan, I., Basin, D., & Bundy, A. (1993) · Workshops in computing · doi:10.1007/978-1-4471-3560-9_1 · Cited by 126 · see citing works
Meta-programming in logic programming
Abramson, H., & Rogers, M. H. (1989) · Medical Entomology and Zoology · Cited by 119 · see citing works
Global flow analysis as a practical compilation tool
Hermenegildo, M. V., Warren, R., & Debray, S. (1992) · The Journal of Logic Programming · doi:10.1016/0743-1066(92)90053-6 · Cited by 111 · see citing works
A partial evaluator, and its use as a programming tool
Beckman, L., Haraldson, A., Oskarsson, Ö., & Sandewall, E. J. (1976) · Artificial Intelligence · doi:10.1016/0004-3702(76)90011-4 · Cited by 107 · see citing works
Efficient multi-level generating extensions for program specialization
Glück, R., & Jørgensen, J. (1995) · Lecture notes in computer science · doi:10.1007/bfb0026825 · Cited by 103 · see citing works
Self-citationMeta-Programming in Logic Progamming
Hill, P. M., & Gallagher, J. P. (1998) · Bristol Research (University of Bristol) · Cited by 89 · see citing works
Projection Factorisations in Partial Evaluation
Launchbury, J. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511569814 · Cited by 85 · see citing works
Mixtus: An automatic partial evaluator for full Prolog
Sahlin, D. (1993) · New Generation Computing · doi:10.1007/bf03038271 · Cited by 76 · see citing works
Loop checking in partial deduction
Bol, R. N. (1993) · The Journal of Logic Programming · doi:10.1016/0743-1066(93)90022-9 · Cited by 73 · see citing works
The derivation of an algorithm for program specialisation
Gallagher, J., & Bruynooghe, M. (1991) · New Generation Computing · doi:10.1007/bf03037167 · Cited by 73 · see citing works
Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance
Martens, B., & Gallagher, J. (1995) · Logic Programming · doi:10.7551/mitpress/4298.003.0059 · Cited by 69 · see citing works
A general criterion for avoiding infinite unfolding during partial deduction
Bruynooghe, M., De Schreye, D., & Martens, B. (1992) · New Generation Computing · doi:10.1007/bf03037527 · Cited by 67 · see citing works
A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration
Leuschel, M., Schreye, D. D., & de Waal, D. A. (1996) · Lirias · Cited by 57 · see citing works
Self-citationHand-writing program generator generators
Birkedal, L., & Welinder, M. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58402-1_15 · Cited by 53 · see citing works
Global control for partial deduction through characteristic atoms and global trees
Leuschel, M., & Martens, B. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_13 · Cited by 52 · see citing works
Self-citationAn introduction to partial deduction
Komorowski, J. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56282-6_4 · Cited by 50 · see citing works
A partial evaluation procedure for logic programs
Benkerimi, K., & Lloyd, J. W. (1990) · Conference on Logic Programming · Cited by 46 · see citing works
Logimix: A Self-Applicable Partial Evaluator for Prolog
Mogensen, T. Æ., & Bondorf, A. (1993) · Workshops in computing · doi:10.1007/978-1-4471-3560-9_15 · Cited by 40 · see citing works
Automatic finite unfolding using well-founded measures
Martens, B., & De Schreye, D. (1996) · The Journal of Logic Programming · doi:10.1016/0743-1066(95)00149-2 · Cited by 37 · see citing works
A self-applicable partial evaluator and its use in incremental compilation
Fujita, H., & Furukawa, K. (1988) · New Generation Computing · doi:10.1007/bf03037133 · Cited by 35 · see citing works
Controlling conjunctive partial deduction of definite logic programs
Glück, R., Jørgensen, J., Martens, B., & Sørensen, M. H. (1996) · Cited by 31 · see citing works
Self-citationSupporting Transformations for the Partial Evaluation of Logic Programs
Benkerimi, K., & HILL, P. M. (1993) · Journal of Logic and Computation · doi:10.1093/logcom/3.5.469 · Cited by 28 · see citing works
Logic Program Synthesis and Transformation — Meta-Programming in Logic
(1994) · Lecture notes in computer science · doi:10.1007/3-540-58792-6 · Cited by 25 · see citing works
Ecological partial deduction: Preserving characteristic trees without constraints
Leuschel, M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60939-3_1 · Cited by 24 · see citing works
Self-citationPartial deduction of the ground representation and its application to integrity checking
(1995) · Logic Programming · doi:10.7551/mitpress/4301.003.0050 · Cited by 23 · see citing works
A System For Specialising Logic Programs
Gallagher, J. P. (2009) · Cited by 20 · see citing works
Partial evaluation of the “real thing”
Leuschel, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58792-6_8 · Cited by 20 · see citing works
Self-citationTowards fast and declarative meta-programming
Bowers, A. F., & Gurr, C. (1995) · Cited by 18 · see citing works
A Self-Applicable Partial Evaluator for the Logic Programming Language Godel
Gurr, C. (2015) · Cited by 16 · see citing works
Towards creating specialised integrity checks through partial evaluation of meta-interpreters
Leuschel, M., & De Schreye, D. (1995) · Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '95 · doi:10.1145/215465.215598 · Cited by 16 · see citing works
Self-citationAn almost perfect abstraction operation for partial deduction using characteristic trees
Leuschel, M., & Schreye, D. D. (1995) · Cited by 9 · see citing works
Self-citationNeumann, G. (1992) · Lecture notes in computer science · doi:10.1007/3-540-55460-2_26 · Cited by 4 · see citing works
Flagged first, then by citations
2 of the 45 references couldn’t be matched to a known paper.
Cited by
Sorted by citations
Controlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88 · see citing works
Self-citationInfinite State Model Checking by Abstract Interpretation and Program Specialisation
Leuschel, M., & Massart, T. (2000) · Lecture notes in computer science · doi:10.1007/10720327_5 · Cited by 77 · see citing works
Self-citationLogic program specialisation through partial deduction: Control issues
Leuschel, M., & Bruynooghe, M. (2002) · Theory and Practice of Logic Programming · doi:10.1017/s147106840200145x · Cited by 74 · see citing works
Self-citationGlobal control for partial deduction through characteristic atoms and global trees
Leuschel, M., & Martens, B. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_13 · Cited by 52 · see citing works
Self-citationProgram Development in Computational Logic
Demoen, B., de la Banda, M. G., Harvey, W., Marriott, K., Overton, D., & Stuckey, P. J. (2004) · Lecture notes in computer science · doi:10.1007/b98187 · Cited by 51 · see citing works
Offline specialisation in Prolog using a hand-written compiler generator
Leuschel, M., Jørgensen, J., Vanhoof, W., & Bruynooghe, M. (2004) · Theory and Practice of Logic Programming · doi:10.1017/s1471068403001662 · Cited by 44 · see citing works
Self-citationAdvanced Techniques for Logic Program Specialisation
Leuschel, M. (1997) · Lirias · Cited by 35 · see citing works
Self-citationTermination proofs for logic programs with tabling
Verbaeten, S., Schreye, D. D., & Sagonas, K. (2001) · ACM Transactions on Computational Logic · doi:10.1145/371282.371357 · Cited by 33 · see citing works
Creating specialised integrity checks through partial evaluation of meta-interpreters
Leuschel, M., & De Schreye, D. (1998) · The Journal of Logic Programming · doi:10.1016/s0743-1066(97)10012-7 · Cited by 29 · see citing works
Self-citationSpecialising Interpreters Using Offline Partial Deduction
Leuschel, M., Craig, S.-J., Bruynooghe, M., & Vanhoof, W. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25951-0_11 · Cited by 26 · see citing works
Self-citationA polyvariant binding-time analysis for off-line partial deduction
Bruynooghe, M., Leuschel, M., & Sagonas, K. (1998) · Lecture notes in computer science · doi:10.1007/bfb0053561 · Cited by 23 · see citing works
Self-citationDesign and Implementation of the High-Level Specification Language CSP(LP) in Prolog
Leuschel, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45241-9_2 · Cited by 22 · see citing works
Self-citationTermination Analysis for Tabled Logic Programming
Decorte, S., Schreye, D. D., Leuschel, M., Martens, B., & Sagonas, K. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49674-2_6 · Cited by 21 · see citing works
Self-citationThe Ecce and Logen partial evaluators and their web interfaces
Leuschel, M., Elphick, D., Varea, M., Craig, S.-J., & Fontaine, M. (2006) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/1111542.1111557 · Cited by 15 · see citing works
Self-citationBinding-Time Annotations without Binding-Time Analysis
Vanhoof, W., & Bruynooghe, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45653-8_49 · Cited by 12 · see citing works
Binding-Time Analysis for Mercury
Vanhoof, W., Bruynooghe, M., & Leuschel, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25951-0_7 · Cited by 12 · see citing works
Self-citationMartin, J., & Leuschel, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46562-6_9 · Cited by 12 · see citing works
Self-citationEfficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN
Leuschel, M., & Jørgensen, J. (2000) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)80636-x · Cited by 11 · see citing works
Self-citationBinding-Time Analysis by Constraint Solving
Vanhoof, W. (2007) · Springer eBooks · doi:10.1007/3-540-44404-1_25 · Cited by 11 · see citing works
Similix: A Self-Applicable Partial Evaluator for Scheme
Jørgensen, J. (1999) · Lecture notes in computer science · doi:10.1007/3-540-47018-2_3 · Cited by 9 · see citing works
Self-citationSome achievements and prospects in partial deduction
Leuschel, M., Martens, B., & Schreye, D. D. (1998) · ACM Computing Surveys · doi:10.1145/289121.289125 · Cited by 9 · see citing works
Self-citationAutomatic verification of counter systems via domain-specific multi-result supercompilation
Klimov, A. V., Klyuchnikov, I. G., & Romanenko, S. A. (2012) · Cited by 5 · see citing works
LIX: an Effective Self-applicable Partial Evaluator for Prolog
Craig, S.-J., & Leuschel, M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24754-8_8 · Cited by 3 · see citing works
Self-citationBinding-Time Analysis for Mercury
(1999) · The MIT Press eBooks · doi:10.7551/mitpress/4304.003.0042 · Cited by 3 · see citing works
- Authors
- Jørgensen, J., & Leuschel, M.
- Affiliations
- KU Leuven (BE)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 238-262
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1929307865
- Cited by
- 26
- References
- 45
- Citations by year
- 2012: 1
- FWCI
- 3.76
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- ePrints Soton (University of Southampton) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Database Systems and Queries
- Keywords
- partial deduction, partial evaluation, logic programming, Prolog, program specialization, compiler generators, self-application
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
