On the public citation graph

Efficient implementation of narrowing and rewriting

https://doi.org/10.1007/bfb0013543
0 signed · 49 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-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-16442-1_26openalex-snapshot
Experiences with the RAP system — a specification interpreter combining term rewriting and resolution
inferredcites →https://doi.org/10.1007/3-540-19242-5_10openalex-snapshot
Compiling conditional rewriting systems
inferredcites →https://doi.org/10.1007/3-540-19488-6_123openalex-snapshot
Operational semantics of OBJ-3
inferredcites →https://doi.org/10.1007/3-540-50820-1_52openalex-snapshot
Formal specification of a prolog compiler
inferredcites →https://doi.org/10.1007/3-540-51081-8_99openalex-snapshot
Completion-time optimization of rewrite-time goal solving
inferredcites →https://doi.org/10.1007/3-540-52531-9_142openalex-snapshot
A functional and logic language with polymorphic types
inferredcites →https://doi.org/10.1007/3-540-52592-0_69openalex-snapshot
Graph-based implementation of a functional logic language
inferredcites →https://doi.org/10.1007/3-540-53162-9_47openalex-snapshot
Lazy narrowing in a graph machine
inferredcites →https://doi.org/10.1007/3540539816_80openalex-snapshot
From reduction machines to narrowing machines
inferredcites →https://doi.org/10.1007/978-3-642-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1007/978-3-642-73824-1openalex-snapshot
Computing in Horn Clause Theories
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bfb0014986openalex-snapshot
Refined strategies for semantic unification
inferredcites →https://doi.org/10.1007/bfb0021681openalex-snapshot
Negation and Control in Prolog
inferredcites →https://doi.org/10.1007/bfb0024197openalex-snapshot
Compiling logic programs with equality
inferredcites →https://doi.org/10.1016/0743-1066(86)90014-2openalex-snapshot
The relation between logic and functional languages: a survey
inferredcites →https://doi.org/10.1016/0743-1066(89)90030-7openalex-snapshot
An implementation of narrowing
inferredcites →https://doi.org/10.1016/0743-1066(89)90033-2openalex-snapshot
Compiling control
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/s0747-7171(89)80014-8openalex-snapshot
Basic narrowing revisited
inferredcites →https://doi.org/10.1109/mex.1987.4307074openalex-snapshot
The Art of Prolog
inferredcites →https://doi.org/10.21236/ada087640openalex-snapshot
Canonical Forms and Unification.

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-54444-5_110openalex-snapshot
Dynamic detection of determinism in functional logic languages
inferred← citeshttps://doi.org/10.1007/3-540-54444-5_119openalex-snapshot
The ALF system
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_124openalex-snapshot
Improving control of logic programs by using functional logic languages
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_69openalex-snapshot
A debugging model for functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57877-3_5openalex-snapshot
Towards the global optimization of functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_29openalex-snapshot
A tiny constraint functional logic language and its continuation semantics
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_26openalex-snapshot
Combining lazy narrowing and simplification
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_7openalex-snapshot
How to realize LSE narrowing
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_31openalex-snapshot
Mode analysis of functional logic programs
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_209openalex-snapshot
Lazy narrowing: Strong completeness and eager variable elimination (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-319-51676-9_1openalex-snapshot
Eliminating Irrelevant Non-determinism in Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/bf03037158openalex-snapshot
Relating the implementation techniques of functional and functional logic languages
inferred← citeshttps://doi.org/10.1007/bf03037431openalex-snapshot
How to realize LSE narrowing
inferred← citeshttps://doi.org/10.1007/bfb0013551openalex-snapshot
The ALF system: An efficient implementation of a functional logic language
inferred← citeshttps://doi.org/10.1007/bfb0013829openalex-snapshot
Incremental rewriting in narrowing derivations
inferred← citeshttps://doi.org/10.1007/bfb0026999openalex-snapshot
Safe folding/unfolding with conditional narrowing
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00225-8openalex-snapshot
Dynamic detection of determinism in functional logic languages
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00071-0openalex-snapshot
Lazy narrowing: Strong completeness and eager variable elimination
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00105-fopenalex-snapshot
Analysis of residuating logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90034-5openalex-snapshot
The integration of functions into logic programming: From theory to practice
inferred← citeshttps://doi.org/10.1016/s0096-0551(97)00010-6openalex-snapshot
Lazy narrowing with simplification
inferred← citeshttps://doi.org/10.1016/s0096-0551(97)00012-xopenalex-snapshot
Towards the uniform implementation of declarative languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00136-4openalex-snapshot
Functional-logic integration via minimal reciprocal extensions
inferred← citeshttps://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.4995/thesis/10251/55796openalex-snapshot
Análisis semántico y transformación de programas lógico-funcionales.
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.