On the public citation graph

Mixtus: An automatic partial evaluator for full Prolog

https://doi.org/10.1007/bf03038271
0 signed · 81 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf03037138openalex-snapshot
Composing recursive logic programs withClausal join
inferredcites →https://doi.org/10.1007/bf03037139openalex-snapshot
Partial evaluation of metaprograms in a “multiple worlds” logic language
inferredcites →https://doi.org/10.1007/bf03037142openalex-snapshot
A partial evaluation system for Prolog: some practical considerations
inferredcites →https://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
inferredcites →https://doi.org/10.1007/bfb0024182openalex-snapshot
Finding the least fixed point using wait-declarations in Prolog
inferredcites →https://doi.org/10.1016/0304-3975(91)90007-oopenalex-snapshot
Unfold/fold transformation of stratified programs
inferredcites →https://doi.org/10.1016/0743-1066(91)90027-mopenalex-snapshot
Partial evaluation in logic programming
inferredcites →https://doi.org/10.1145/115865.115869openalex-snapshot
Determinacy analysis for full Prolog
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.7551/mitpress/5510.001.0001openalex-snapshot
The Practice of Prolog
inferredcites →https://doi.org/10.7551/mitpress/5510.003.0009openalex-snapshot
ProMiX: a Prolog Partial Evaluation System

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118576984.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/11680093_8openalex-snapshot
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_17openalex-snapshot
Homeomorphic Embedding for Online Termination of Symbolic Methods
inferred← citeshttps://doi.org/10.1007/3-540-45013-0_18openalex-snapshot
A Fixed Point Semantics for Logic Programs Extended with Cuts
inferred← citeshttps://doi.org/10.1007/3-540-45142-0_8openalex-snapshot
Automated Strategies for Specializing Constraint Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_2openalex-snapshot
Design and Implementation of the High-Level Specification Language CSP(LP) in Prolog
inferred← citeshttps://doi.org/10.1007/3-540-45350-4_8openalex-snapshot
A New Termination Approach for Specialization
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_12openalex-snapshot
Program Derivation = Rules + Strategies
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_8openalex-snapshot
Transformation Systems and Nondeclarative Properties
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_49openalex-snapshot
Binding-Time Annotations without Binding-Time Analysis
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_9openalex-snapshot
Sonic Partial Deduction
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_5openalex-snapshot
Logic Program Specialisation
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_11openalex-snapshot
Improving Homeomorphic Embedding for Online Termination
inferred← citeshttps://doi.org/10.1007/3-540-49674-2_10openalex-snapshot
Preserving Termination of Tabled Logic Programs While Unfolding (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-49674-2_13openalex-snapshot
A Higher Order Reconstruction of Stepwise Enhancement
inferred← citeshttps://doi.org/10.1007/3-540-49674-2_17openalex-snapshot
To Parse or Not To Parse
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_14openalex-snapshot
On the Power of Homeomorphic Embedding for Online Termination
inferred← citeshttps://doi.org/10.1007/3-540-58792-6_8openalex-snapshot
Partial evaluation of the “real thing”
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_1openalex-snapshot
Ecological partial deduction: Preserving characteristic trees without constraints
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_12openalex-snapshot
Efficiently generating efficient generating extensions in prolog
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_13openalex-snapshot
Global control for partial deduction through characteristic atoms and global trees
inferred← citeshttps://doi.org/10.1007/3-540-62718-9_5openalex-snapshot
Conjunctive partial deduction in practice
inferred← citeshttps://doi.org/10.1007/3-540-62718-9_9openalex-snapshot
Enhancing partial deduction via unfold/fold rules
inferred← citeshttps://doi.org/10.1007/978-1-4020-6585-9_12openalex-snapshot
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_8openalex-snapshot
LIX: an Effective Self-applicable Partial Evaluator for Prolog
inferred← citeshttps://doi.org/10.1007/978-3-540-25938-1_10openalex-snapshot
Proving Termination with Adornments
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_11openalex-snapshot
Specialising Interpreters Using Offline Partial Deduction
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_17openalex-snapshot
A Compiler Generator for Constraint Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_5openalex-snapshot
Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-17071-3_7openalex-snapshot
Interleaving Symbolic Execution and Partial Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-642-38197-3_4openalex-snapshot
Semantic Code Clones in Logic Programs
inferred← citeshttps://doi.org/10.1007/bf03037483openalex-snapshot
Constrained partial deduction and the preservation of characteristic trees
inferred← citeshttps://doi.org/10.1007/bfb0053561openalex-snapshot
A polyvariant binding-time analysis for off-line partial deduction
inferred← citeshttps://doi.org/10.1007/s10817-005-6546-zopenalex-snapshot
Termination of Floating-Point Computations
inferred← citeshttps://doi.org/10.1007/s10990-005-7008-3openalex-snapshot
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
inferred← citeshttps://doi.org/10.1007/s10990-008-9030-8openalex-snapshot
Efficient and flexible access control via Jones-optimal logic program specialisation
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00149-2openalex-snapshot
Automatic finite unfolding using well-founded measures
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.04.016openalex-snapshot
Type-based homeomorphic embedding for online termination
inferred← citeshttps://doi.org/10.1016/j.scico.2004.03.010openalex-snapshot
Transformation by interpreter specialisation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00197-3openalex-snapshot
Loop checks for logic programs with functions
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10012-7openalex-snapshot
Creating specialised integrity checks through partial evaluation of meta-interpreters
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00030-8openalex-snapshot
Conjunctive partial deduction: foundations, control, algorithms, and experiments
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80634-6openalex-snapshot
Rules and Strategies for Contextual Specialization of Constraint Logic Programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80636-xopenalex-snapshot
Efficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN
inferred← citeshttps://doi.org/10.1017/s0269888900008031openalex-snapshot
Developing correct and efficient logic programs by transformation
inferred← citeshttps://doi.org/10.1017/s147106840100134xopenalex-snapshot
Chain programs for writing deterministic metainterpreters
inferred← citeshttps://doi.org/10.1017/s1471068402001114openalex-snapshot
Sequence-based abstract interpretation of Prolog
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1017/s1471068403001662openalex-snapshot
Offline specialisation in Prolog using a hand-written compiler generator
inferred← citeshttps://doi.org/10.1017/s147106840300190xopenalex-snapshot
Speedup of logic programs by binarization and partial deduction
inferred← citeshttps://doi.org/10.1017/s1471068409990068openalex-snapshot
Termination prediction for general logic programs
inferred← citeshttps://doi.org/10.1017/s1471068409990263openalex-snapshot
Efficient local unfolding with ancestor stacks
inferred← citeshttps://doi.org/10.1017/s1471068421000211openalex-snapshot
Analysis and Transformation of Constrained Horn Clauses for Program Verification
inferred← citeshttps://doi.org/10.1109/tai.1997.632249openalex-snapshot
An automatic partial deduction system for constraint logic programs
inferred← citeshttps://doi.org/10.1145/1069774.1069777openalex-snapshot
Self-tuning resource aware specialisation for prolog
inferred← citeshttps://doi.org/10.1145/1069774.1069784openalex-snapshot
Automatic type inference via partial evaluation
inferred← citeshttps://doi.org/10.1145/1111542.1111557openalex-snapshot
The Ecce and Logen partial evaluators and their web interfaces
inferred← citeshttps://doi.org/10.1145/1119479.1119481openalex-snapshot
Nontermination inference of logic programs
inferred← citeshttps://doi.org/10.1145/215465.215598openalex-snapshot
Towards creating specialised integrity checks through partial evaluation of meta-interpreters
inferred← citeshttps://doi.org/10.1145/263699.263759openalex-snapshot
Reducing nondeterminism while specializing logic programs
inferred← citeshttps://doi.org/10.1145/271510.271525openalex-snapshot
Controlling generalization and polyvariance in partial deduction of normal logic programs
inferred← citeshttps://doi.org/10.1145/982158.982159openalex-snapshot
A framework for the integration of partial evaluation and abstract interpretation of logic programs
inferred← citeshttps://doi.org/10.20868/upm.thesis.329openalex-snapshot
Poly-controlled partial evaluation and its application to resource-aware program specialization
inferred← citeshttps://doi.org/10.4204/eptcs.299.6openalex-snapshot
Polyvariant Program Specialisation with Property-based Abstraction
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0006031openalex-snapshot
Verifying Termination of General Logic Programs with Concrete Queries
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0212026openalex-snapshot
A Generalization of the Lifting Lemma for Logic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0311044openalex-snapshot
Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0512055openalex-snapshot
Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach
inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0059openalex-snapshot
Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.