Mixtus: An automatic partial evaluator for full 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?
MIXTUS-like unfolding is the unfolding strategy explained by Sahlin [1991;1993], which in general unfolds deeply enough to solve the fully unfoldable problems, but also has safeguards against excessive unfolding and code explosion.
“-”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Sahlin 1993
The MIXTUS-like unfolding strategies of ECCE, MIXTUS, and PADDY differ slightly from each other, probably due to details not fully elaborated in Sahlin [1993] and Prestwich [1992a] and the different global control regimes.
“Note that the”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Sahlin 1993
MIXTUS-like unfolding requires a number of ad hoc settings.
“It requires, however, a number of ad hoc settings.”
From Controlling generalization and polyvariance in partial deduction of normal logic programs (1998) · cites this paper as Sahlin 1993
The problem of left-propagation of bindings has been solved in various ways in the partial evaluation literature.
“This problem of left-propagation of bindings has been solved in various ways in the partial evaluation literature [77,76,83,82]”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [82]
The problem of left-propagation of bindings has been solved in various ways in the partial evaluation literature.
“This problem of left-propagation of bindings has been solved in various ways in the partial evaluation literature [77,76,83,82]”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [83]
The treatment of cuts requires some rather involved techniques.
“The treatment of cuts therefore requires some rather involved techniques (see [14], [83,82] or [77,76]).”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [82]
The treatment of cuts requires some rather involved techniques.
“The treatment of cuts therefore requires some rather involved techniques (see [14], [83,82] or [77,76]).”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [83]
Partial evaluation of ITE-Prolog can be situated somewhere between partial deduction of pure logic programs and partial evaluation of full Prolog.
“In summary, partial evaluation of ITE-Prolog, can be situated somewhere between partial deduction of pure logic programs (see [60,31,10,69,68] and systems like sP [30,29], sAGE [34,33] or more recently ECCE [50,51,57]) and partial evaluation of full Prolog (e.g. MIXTUs [83,82] or PADDY [76–78]).”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [83]
Partial evaluation of ITE-Prolog can be situated somewhere between partial deduction of pure logic programs and partial evaluation of full Prolog.
“In summary, partial evaluation of ITE-Prolog, can be situated somewhere between partial deduction of pure logic programs (see [60,31,10,69,68] and systems like sP [30,29], sAGE [34,33] or more recently ECCE [50,51,57]) and partial evaluation of full Prolog (e.g. MIXTUs [83,82] or PADDY [76–78]).”
From Creating specialised integrity checks through partial evaluation of meta-interpreters (1998) · cites this paper as [82]
Cites
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,916 · see citing works
A Transformation System for Developing Recursive Programs
Burstall, R. M., & Darlington, J. (1977) · Journal of the ACM · doi:10.1145/321992.321996 · Cited by 1,300 · 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
A specification of an abstract Prolog machine and its application to partial evaluation
Komorowski, J. (1981) · Cited by 172 · see citing works
Unfold/Fold Transformations of Logic Programs.
Gardner, P. A., & Shepherdson, J. C. (1991) · Bristol Research (University of Bristol) · Cited by 171 · see citing works
Saint‐Dizier, P. (1988) · Computational Linguistics · Cited by 139 · see citing works
Partial Evaluation of Prolog Programs and its Application to Meta Programming.
Takeuchi, A., & Furukawa, K. (1986) · IFIP Congress · Cited by 110 · see citing works
Unfold/fold transformation of stratified programs
Seki, H. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90007-o · Cited by 95 · see citing works
Venken, R. (1984) · European Conference on Artificial Intelligence · Cited by 65 · see citing works
Bjørner, D., Jones, N. D., & Ershov, A. P. (1988) · Elsevier eBooks · Cited by 49 · see citing works
An Automatic Partial Evaluator for Full Prolog
Sahlin, D. (1991) · Cited by 44 · see citing works
Self-citationThe Mixtus approach to automatic partial evaluation of full Prolog
Sahlin, D. (1990) · Cited by 40 · see citing works
Self-citationAnnotated bibliography on partial evaluation and mixed computation
(1988) · New Generation Computing · doi:10.1007/bf03037145 · Cited by 28 · see citing works
The Compilation of Prolog Programs without the Use of a Prolog Compiler.
Kahn, K., & Carlsson, M. (1984) · Future Generation Computer Systems · Cited by 27 · see citing works
Partial evaluation of metaprograms in a “multiple worlds” logic language
Levi, G., & Sardu, G. (1988) · New Generation Computing · doi:10.1007/bf03037139 · Cited by 27 · see citing works
A partial evaluation system for Prolog: some practical considerations
Venken, R., & Demoen, B. (1988) · New Generation Computing · doi:10.1007/bf03037142 · Cited by 23 · see citing works
Issues in the Partial Evaluation of Meta-Interpreters.
Owen, S. (1988) · Cited by 22 · see citing works
Incremental flavor-mixing of meta-interpreters for expert system construction
STERLING, L. S., & Beer, R. D. (1986) · SLP · Cited by 22 · see citing works
Partial evaluation of a CLP language
Smith, D. A., & Hickey, T. J. (1990) · Conference on Logic Programming · Cited by 19 · see citing works
Composing recursive logic programs withClausal join
Lakhotia, A., & STERLING, L. S. (1988) · New Generation Computing · doi:10.1007/bf03037138 · Cited by 18 · see citing works
Determinacy analysis for full Prolog
Sahlin, D. (1991) · doi:10.1145/115865.115869 · Cited by 17 · see citing works
Self-citationSTERLING, L. S. (2003) · Cited by 16 · see citing works
A workbench for developing logic programs by stepwise enhancement
Lakhotia, A. (1990) · OhioLink ETD Center (Ohio Library and Information Network) · Cited by 15 · see citing works
ProMiX: a Prolog partial evaluation system
Lakhotia, A., & STERLING, L. S. (1990) · Cited by 14 · see citing works
Partial Evaluation in Prolog: Some Improvements about Cut.
Michele Bugliesi, A., & Russo, F. L. (1989) · Cited by 14 · see citing works
A Partial Evaluator of Lisp Programs Written in Prolog.
Kahn, K. (1982) · Cited by 13 · see citing works
ProMiX: a Prolog Partial Evaluation System
Lakhotia, A., & STERLING, L. S. (1990) · The MIT Press eBooks · doi:10.7551/mitpress/5510.003.0009 · Cited by 7 · see citing works
(1990) · The MIT Press eBooks · doi:10.7551/mitpress/5510.001.0001 · Cited by 7 · see citing works
Towards more efficient loop checks
Bol, R. N. (1990) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 6 · see citing works
Pure partial evaluation and instantiation
Kursawe, P. (1988) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 5 · see citing works
Finding the least fixed point using wait-declarations in Prolog
Sahlin, D. (2005) · Springer eBooks · doi:10.1007/bfb0024182 · Cited by 3 · see citing works
Self-citationIndustrial SICStus Prolog user's manual
Carlsson, M., Widén, J., Andersson, J. S., et al. (1991) · Cited by 2 · see citing works
Flagged first, then by citations
Research works printed but not linked: 8
- Partial Evaluation and Mixed Computation (D. Bjørner, A. P. Ershov and N. D. Jones eds.), Proceedings from Workshop in Gammel Avernæs, Denmark, North-Holland, Oct. 1988.
- New Generation Computing, 6, Special issue: selected papers from the Workshop on Partial Evaluation and Mixed Computation (K. Fuchi, ed.), Ohmsha, Ltd./Springer-Verlag, 1988.
- Komorowski, H. J., “Synthesis of Programs in the Framework of Partial Deduction,”Ser. A, No. 81, Departments of Computer Science & Mathematics, Åbo Akademi, Finland, 1989.
- Lam, J., “Control Structures in Partial Evaluation of Pure Prolog,”M. Sc. thesis, Department of Computational Science, University of Saskatchewan, Canada, 1989.
- Lam, J. and Kusalik, A., “A Partial Evaluation of Partial Evaluators for Pure Prolog,”Research Report, 90-9, Department of Computational Science, University of Saskatchewan, Canada, 1990.
- Plotkin, G. D., “A Note on Inductive Generalisation,” inMachine Intelligence, 5 (B. Meltzer and D. Michie, eds.) American Elsevier, New York, pp. 153–163, 1970.
- Prestwich, S., “Partial Evaluation by Unfold/Fold with Generalisation,”ECRC, München, Nov. 1990.
- Reynolds, J. C., “Transformational Systems and the Algebraic Structure of Atomic Formulas,” inMachine Intelligence, 5 (B. Meltzer and D. Michie, eds.), American Elsevier, New York, pp. 135–152, 1970.
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
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
Efficiently generating efficient generating extensions in prolog
Jørgensen, J., & Leuschel, M. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61580-6_12 · Cited by 26 · see citing works
Efficient 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
- Authors
- Sahlin, D.
- Affiliations
- Swedish Institute of Computer Science (SE)
- Corresponding author
- Sahlin, Dan
- Venue
- New Generation Computing
- Published
- 1993-12
- Volume
- 12
- Issue
- 1
- Pages
- 7-51
- ISSN
- 0288-3635 (ISSN-L)
- 1882-7055
- OpenAlex
- W1985933047
- Semantic Scholar
- f9fca27c150a57880e1cc92829fac1cbb4d7b22d
- Cited by
- 76
- References
- 32
- Citations by year
- 2021: 1 · 2019: 1 · 2013: 2 · 2012: 1
- FWCI
- 4.43
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- New Generation Computing (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Database Systems and Queries
- Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
- Keywords
- partial evaluation, Prolog, program specialization, cuts, Var, logic programming
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
