On the public citation graph

Higher order conditional rewriting and narrowing

https://doi.org/10.1007/bfb0016859
0 signed · 27 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-56393-8_10openalex-snapshot
Termination of combined (rewrite and λ-calculus) systems
inferredcites →https://doi.org/10.1007/3-540-58216-9_40openalex-snapshot
On conditional rewrite systems with extra variables and deterministic logic programs
inferredcites →https://doi.org/10.1007/bfb0013830openalex-snapshot
Counterexamples to completeness results for basic narrowing (extended abstract)
inferredcites →https://doi.org/10.1007/bfb0015791openalex-snapshot
Foundations of Equational Logic Programming
inferredcites →https://doi.org/10.1007/bfb0038698openalex-snapshot
A logic programming language with lambda-abstraction, function variables, and simple unification
inferredcites →https://doi.org/10.1016/0304-3975(90)90064-oopenalex-snapshot
A rationale for conditional equational programming
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/s0747-7171(87)80010-xopenalex-snapshot
Simplifying conditional term rewriting systems : Unification, termination and confluence
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1017/cbo9780511569906openalex-snapshot
The Clausal Theory of Types
inferredcites →https://doi.org/10.1109/lics.1988.5103openalex-snapshot
Combining algebra and higher-order types
inferredcites →https://doi.org/10.1109/lics.1991.151658openalex-snapshot
Higher-order critical pairs
inferredcites →https://doi.org/10.1109/lics.1994.316040openalex-snapshot
Higher-order narrowing
inferredcites →https://doi.org/10.2307/2274588openalex-snapshot
J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11690634_26openalex-snapshot
On the Confluence of λ-Calculus with Conditional Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_5openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_2openalex-snapshot
Higher Order Unification 30 Years Later
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_54openalex-snapshot
Higher-order narrowing with convergent systems
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_33openalex-snapshot
The practice of logical frameworks
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_48openalex-snapshot
Higher-order narrowing with definitional trees
inferred← citeshttps://doi.org/10.1007/978-3-030-16202-3openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50018-7openalex-snapshot
Higher-Order Unification and Matching
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.05.005openalex-snapshot
Shallow confluence of conditional term rewriting systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.058openalex-snapshot
On the confluence of lambda-calculus with conditional rewriting
inferred← citeshttps://doi.org/10.1017/s0956796899003330openalex-snapshot
Higher-order narrowing with definitional trees
inferred← citeshttps://doi.org/10.70675/528a189dz6263z4b1dz95bdz158fff7ad77eopenalex-snapshot
Définitions par réécriture dans le lambda-calcul : confluence, réductibilité et typage
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.