On the public citation graph

Narrowing the narrowing space

https://doi.org/10.1007/bfb0033833
0 signed · 34 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-51081-8_102openalex-snapshot
Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
inferredcites →https://doi.org/10.1007/3-540-53162-9_47openalex-snapshot
Lazy narrowing in a graph machine
inferredcites →https://doi.org/10.1007/3-540-53904-2_87openalex-snapshot
Detecting redundant narrowing derivations by the LSE-SL reducibility test
inferredcites →https://doi.org/10.1007/3-540-55844-6_147openalex-snapshot
On the interaction of lazy evaluation and backtracking
inferredcites →https://doi.org/10.1007/3-540-56393-8_39openalex-snapshot
An optimal narrowing strategy for general canonical systems
inferredcites →https://doi.org/10.1007/978-3-642-73005-4_25openalex-snapshot
Narrowing Techniques Applied to Idempotent Unification
inferredcites →https://doi.org/10.1007/bfb0013830openalex-snapshot
Counterexamples to completeness results for basic narrowing (extended abstract)
inferredcites →https://doi.org/10.1007/bfb0013831openalex-snapshot
Uniform narrowing strategies
inferredcites →https://doi.org/10.1007/bfb0015791openalex-snapshot
Foundations of Equational Logic Programming
inferredcites →https://doi.org/10.1007/bfb0026098openalex-snapshot
On completeness of narrowing strategies
inferredcites →https://doi.org/10.1016/0022-0000(82)90006-xopenalex-snapshot
Proofs by induction in equational theories with constructors
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/0022-0000(91)90039-8openalex-snapshot
Unification modulo an equality theory for equational logic programming
inferredcites →https://doi.org/10.1016/0141-9331(87)90510-2openalex-snapshot
The implementation of functional programming languages
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/s0096-0551(97)00010-6openalex-snapshot
Lazy narrowing with simplification
inferredcites →https://doi.org/10.1016/s0747-7171(89)80014-8openalex-snapshot
Basic narrowing revisited
inferredcites →https://doi.org/10.1145/174675.177899openalex-snapshot
A needed narrowing strategy
inferredcites →https://doi.org/10.1145/321864.321875openalex-snapshot
Proving Theorems about LISP Functions
inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferredcites →https://doi.org/10.1145/73560.73579openalex-snapshot
Inductive methods for reasoning about abstract data types

What points at this work

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

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-540-24725-8_9openalex-snapshot
A Memoizing Semantics for Functional Logic Languages
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-37651-1_6openalex-snapshot
Functional Logic Programming: From Theory to Curry
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-007-9000-6openalex-snapshot
Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.024openalex-snapshot
Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.040openalex-snapshot
Type-level Computation Using Narrowing in Ωmega
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.037openalex-snapshot
Termination of narrowing revisited
inferred← citeshttps://doi.org/10.1145/1086365.1086394openalex-snapshot
Fast narrowing-driven partial evaluation for inductively sequential programs
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/19251openalex-snapshot
Termination of Narrowing: Automated Proofs and Modularity Properties
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.