On the public citation graph
The narrowing-driven approach to functional logic program specialization
0 signed · 97 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/10722010_13openalex-snapshot
The Universal Resolving Algorithm: Inverse Computation in a Functional Language
inferredcites →https://doi.org/10.1007/3-540-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-44404-1_24openalex-snapshot
Using an Abstract Representation to Specialize Functional Logic Programs
inferredcites →https://doi.org/10.1007/3-540-44716-4_14openalex-snapshot
An Abstract Machine Based System for a Lazy Narrowing Calculus
inferredcites →https://doi.org/10.1007/3-540-44716-4_21openalex-snapshot
A Practical Partial Evaluator for a Multi-Paradigm Declarative Language
inferredcites →https://doi.org/10.1007/3-540-45142-0_7openalex-snapshot
Measuring the Effectiveness of Partial Evaluation in Functional Logic Languages
inferredcites →https://doi.org/10.1007/3-540-48242-3_23openalex-snapshot
A Partial Evaluation Framework for Curry Programs
inferredcites →https://doi.org/10.1007/3-540-48685-2_19openalex-snapshot
TOY: A Multiparadigm Declarative System
inferredcites →https://doi.org/10.1007/3-540-49727-7_14openalex-snapshot
On the Power of Homeomorphic Embedding for Online Termination
inferredcites →https://doi.org/10.1007/3-540-49727-7_16openalex-snapshot
Improving Control in Functional Logic Program Specialization
inferredcites →https://doi.org/10.1007/3-540-50940-2_29openalex-snapshot
A self-applicable partial evaluator for term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-57186-8_79openalex-snapshot
A demand driven computation strategy for lazy narrowing
inferredcites →https://doi.org/10.1007/3-540-57264-3_34openalex-snapshot
Occam's razor in metacomputation: the notion of a perfect process tree
inferredcites →https://doi.org/10.1007/3-540-58402-1_13openalex-snapshot
Partial deduction and driving are equivalent
inferredcites →https://doi.org/10.1007/3-540-61055-3_28openalex-snapshot
Narrowing-driven partial evaluation of functional logic programs
inferredcites →https://doi.org/10.1007/3-540-61580-6_16openalex-snapshot
A Self-Applicable supercompiler
inferredcites →https://doi.org/10.1007/3-540-61580-6_18openalex-snapshot
A comparative revisitation of some program transformation techniques
inferredcites →https://doi.org/10.1007/978-3-662-01069-3_58openalex-snapshot
An Efficient Abstract Machine for Curry
inferredcites →https://doi.org/10.1007/bf01806312openalex-snapshot
Mix: A self-applicable partial evaluator for experiments in compiler generation
inferredcites →https://doi.org/10.1007/bf03037527openalex-snapshot
A general criterion for avoiding infinite unfolding during partial deduction
inferredcites →https://doi.org/10.1016/0022-0000(91)90009-topenalex-snapshot
Kernel-LEAF: A logic plus functional language
inferredcites →https://doi.org/10.1016/0743-1066(91)90027-mopenalex-snapshot
Partial evaluation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(92)90024-wopenalex-snapshot
Logic programming with functions and predicates: The language Babel
inferredcites →https://doi.org/10.1016/0743-1066(93)90022-9openalex-snapshot
Loop checking in partial deduction
inferredcites →https://doi.org/10.1016/0743-1066(94)90034-5openalex-snapshot
The integration of functions into logic programming: From theory to practice
inferredcites →https://doi.org/10.1016/s0743-1066(99)00030-8openalex-snapshot
Conjunctive partial deduction: foundations, control, algorithms, and experiments
inferredcites →https://doi.org/10.1017/s0956796899003330openalex-snapshot
Higher-order narrowing with definitional trees
inferredcites →https://doi.org/10.1023/a:1010095604496openalex-snapshot
Partial Evaluation of Computation Process--An Approach to a Compiler-Compiler
inferredcites →https://doi.org/10.1090/s0002-9947-1960-0111704-1openalex-snapshot
Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
inferredcites →https://doi.org/10.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/154630.154640openalex-snapshot
Tutorial on specialisation of logic programs
inferredcites →https://doi.org/10.1145/158511.158707openalex-snapshot
Tutorial notes on partial evaluation
inferredcites →https://doi.org/10.1145/258993.259014openalex-snapshot
A transformation system for CLP with dynamic scheduling and CCP
inferredcites →https://doi.org/10.1145/258993.259015openalex-snapshot
Specialization of lazy functional logic programs
inferredcites →https://doi.org/10.1145/258994.259014openalex-snapshot
A transformation system for CLP with dynamic scheduling and CCP
inferredcites →https://doi.org/10.1145/258994.259015openalex-snapshot
Specialization of lazy functional logic programs
inferredcites →https://doi.org/10.1145/263699.263710openalex-snapshot
A unified computation model for functional and logic programming
inferredcites →https://doi.org/10.1145/271510.271525openalex-snapshot
Controlling generalization and polyvariance in partial deduction of normal logic programs
inferredcites →https://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
inferredcites →https://doi.org/10.1145/317636.317910openalex-snapshot
Specialization of inductively sequential functional logic programs
inferredcites →https://doi.org/10.1145/317765.317910openalex-snapshot
Specialization of inductively sequential functional logic programs
inferredcites →https://doi.org/10.1145/321850.321859openalex-snapshot
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0059openalex-snapshot
Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance
inferredcites →https://doi.org/10.7551/mitpress/4301.003.0048openalex-snapshot
An Algorithm of Generalization in Positive Supercompilation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_13openalex-snapshot
Principles of Inverse Computation and the Universal Resolving Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45013-0_17openalex-snapshot
Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation
inferred← citeshttps://doi.org/10.1007/3-540-45607-4_9openalex-snapshot
Symbolic Profiling for Multi-paradigm Declarative Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-14125-1_4openalex-snapshot
A Finite Representation of the Narrowing Space
inferred← citeshttps://doi.org/10.1007/978-3-319-14125-1_7openalex-snapshot
Towards Erlang Verification by Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-24725-8_9openalex-snapshot
A Memoizing Semantics for Functional Logic Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_6openalex-snapshot
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_6openalex-snapshot
An Universal Resolving Algorithm for Inverse Computation of Lazy Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_6openalex-snapshot
Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_13openalex-snapshot
Symbolic Model Checking of Infinite-State Systems Using Narrowing
inferred← citeshttps://doi.org/10.1007/978-3-540-78969-7_10openalex-snapshot
Termination of Narrowing in Left-Linear Constructor Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-00515-2_4openalex-snapshot
A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_17openalex-snapshot
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
inferred← citeshttps://doi.org/10.1007/978-3-642-38197-3_10openalex-snapshot
Computing More Specific Versions of Conditional Rewriting Systems
inferred← citeshttps://doi.org/10.1007/bf03160224openalex-snapshot
Inverse computation and the Universal Resolving Algorithm
inferred← citeshttps://doi.org/10.1007/s00200-010-0122-4openalex-snapshot
Termination of narrowing via termination of rewriting
inferred← citeshttps://doi.org/10.1007/s10990-013-9097-8openalex-snapshot
Polynomial-time inverse computation for accumulative functions with multiple data traversals
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.004openalex-snapshot
Narrowing and Rewriting Logic: from Foundations to Applications
inferred← citeshttps://doi.org/10.1016/j.jlap.2013.07.001openalex-snapshot
Conversion to tail recursion in term rewriting
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.01.001openalex-snapshot
Operational semantics for declarative multi-paradigm languages
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.014openalex-snapshot
Refactoring pattern matching
inferred← citeshttps://doi.org/10.1016/j.scico.2015.01.007openalex-snapshot
Symbolic execution as a basis for termination analysis
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00336-8openalex-snapshot
A residualizing semantics for the partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00023-0openalex-snapshot
The universal resolving algorithm and its correctness: inverse computation in a functional language
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80600-5openalex-snapshot
An Operational Semantics for Declarative Multi-Paradigm Languages1 1This work has been partially supported by CICYT TIC 2001-2705-C03-01, by the MCYT under grants HA2001-0059, HU2001-0019 and HI2000-0161, and by the DFG under grant Ha 2457/1-2.
inferred← citeshttps://doi.org/10.1017/s1471068404002303openalex-snapshot
Specialization of functional logic programs based on needed narrowing
inferred← citeshttps://doi.org/10.1017/s1471068406002870openalex-snapshot
Forward slicing of functional logic programs by partial evaluation
inferred← citeshttps://doi.org/10.1023/b:lisp.0000029447.02190.42openalex-snapshot
Cost-Augmented Partial Evaluation of Functional Logic Programs
inferred← citeshttps://doi.org/10.1109/icsmc.2002.1167972openalex-snapshot
A partial evaluation tool for multi-paradigm declarative languages
inferred← citeshttps://doi.org/10.1109/smc.2018.00273openalex-snapshot
Specialization of Distributed Actors by Partial Evaluation
inferred← citeshttps://doi.org/10.1145/1085099.1085109openalex-snapshot
An offline partial evaluator for curry programs
inferred← citeshttps://doi.org/10.1145/1086365.1086394openalex-snapshot
Fast narrowing-driven partial evaluation for inductively sequential programs
inferred← citeshttps://doi.org/10.1145/1090189.1086394openalex-snapshot
Fast narrowing-driven partial evaluation for inductively sequential programs
inferred← citeshttps://doi.org/10.1145/1244381.1244390openalex-snapshot
Quasi-terminating logic programs for ensuring the termination of partial evaluation
inferred← citeshttps://doi.org/10.1145/1480881.1480916openalex-snapshot
Positive supercompilation for a higher order call-by-value language
inferred← citeshttps://doi.org/10.1145/1594834.1480916openalex-snapshot
Positive supercompilation for a higher order call-by-value language
inferred← citeshttps://doi.org/10.1145/1929501.1929507openalex-snapshot
Taming code explosion in supercompilation
inferred← citeshttps://doi.org/10.1145/2103746.2103752openalex-snapshot
Polynomial-time inverse computation for accumulative functions with multiple data traversals
inferred← citeshttps://doi.org/10.1145/503032.503037openalex-snapshot
Cost-augmented narrowing-driven specialization
inferred← citeshttps://doi.org/10.1145/509799.503037openalex-snapshot
Cost-augmented narrowing-driven specialization
inferred← citeshttps://doi.org/10.1145/777388.777391openalex-snapshot
Transforming interpreters into inverse interpreters by partial evaluation
inferred← citeshttps://doi.org/10.1145/966049.777391openalex-snapshot
Transforming interpreters into inverse interpreters by partial evaluation
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.4995/thesis/10251/17655openalex-snapshot
Evaluación Parcial Offline Dirigida por Narrowing: Técnicas de Optimización y Aplicaciones
inferred← citeshttps://doi.org/10.4995/thesis/10251/1888openalex-snapshot
Una aproximación offline a la evaluación parcial dirigida por narrowing
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.