On the public citation graph

Safe folding/unfolding with conditional narrowing

0 signed · 40 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/3-540-61055-3_28openalex-snapshot
Narrowing-driven partial evaluation of functional logic programs
inferredcites →https://doi.org/10.1007/bf01190830openalex-snapshot
Completeness results for basic narrowing
inferredcites →https://doi.org/10.1007/bfb0013543openalex-snapshot
Efficient implementation of narrowing and rewriting
inferredcites →https://doi.org/10.1007/bfb0015791openalex-snapshot
Foundations of Equational Logic Programming
inferredcites →https://doi.org/10.1007/bfb0026999openalex-snapshot
Safe folding/unfolding with conditional narrowing
inferredcites →https://doi.org/10.1016/0304-3975(88)90095-3openalex-snapshot
Narrowing vs. SLD-resolution
inferredcites →https://doi.org/10.1016/0304-3975(96)00042-4openalex-snapshot
On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
inferredcites →https://doi.org/10.1016/0304-3975(96)00043-6openalex-snapshot
A compositional semantic basis for the analysis of equational Horn programs
inferredcites →https://doi.org/10.1016/0304-3975(96)00071-0openalex-snapshot
Lazy narrowing: Strong completeness and eager variable elimination
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(93)90021-8openalex-snapshot
Unfold⧸fold transformation of general logic programs for the well-founded semantics
inferredcites →https://doi.org/10.1016/0743-1066(93)90023-aopenalex-snapshot
Basic transformation operations which preserve computed answer substitutions of logic programs
inferredcites →https://doi.org/10.1016/0743-1066(94)90028-0openalex-snapshot
Transformation of logic programs: Foundations and techniques
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/s0747-7171(06)80002-7openalex-snapshot
Deductive and inductive synthesis of equational programs
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1109/iccl.1994.288383openalex-snapshot
A compositional semantics for conditional term rewriting systems
inferredcites →https://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
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.0065openalex-snapshot
On Extra Variables in (Equational) Logic Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10705424_10openalex-snapshot
A Transformation System for Lazy Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-36131-6_14openalex-snapshot
Automatic Optimization of Multi-paradigm Declarative Programs
inferred← citeshttps://doi.org/10.1007/3-540-36575-3_5openalex-snapshot
Correction of Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-13838-7_2openalex-snapshot
Guided Unfoldings for Finding Loops in Standard Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-031-31476-6_2openalex-snapshot
Optimizing Maude Programs via Program Specialization
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_14openalex-snapshot
Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_13openalex-snapshot
Transformation and Debugging of Functional Logic Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.10.032openalex-snapshot
Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and Folding
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100729openalex-snapshot
Optimization of rewrite theories by equational partial evaluation
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.033openalex-snapshot
Rules + strategies for transforming lazy functional logic programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.013openalex-snapshot
Loop detection in term rewriting using the eliminating unfoldings
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80345-1openalex-snapshot
A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424.
inferred← citeshttps://doi.org/10.1017/s147106841700031xopenalex-snapshot
Inspecting Maude variants withGLINTS
inferred← citeshttps://doi.org/10.1109/synasc.2010.32openalex-snapshot
Completeness of Unfolding for Rewriting Logic Theories
inferred← citeshttps://doi.org/10.1145/289121.289130openalex-snapshot
A unifying view of functional and logic program specialization
inferred← citeshttps://doi.org/10.4995/thesis/10251/130206openalex-snapshot
Partial Evaluation of Rewriting Logic Theories
inferred← citeshttps://doi.org/10.4995/thesis/10251/1948openalex-snapshot
Rule-Based Software Verification and Correction.
inferred← citeshttps://doi.org/10.4995/thesis/10251/8964openalex-snapshot
Rule-based Methodologies for the Specification and Analysis of Complex Computing Systems
inferred← citeshttps://doi.org/10.5281/zenodo.26359openalex-snapshot
Morphometrics As A Tool In Identification: A Case Study On A Myrmica From France (Hymenoptera, Formicidae).
showing the first 19 of 20 · page through all 20
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.