On the public citation graph
Term rewriting systems from Church-Rosser to Knuth-Bendix and beyond
0 signed · 66 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.1002/spe.4380090105openalex-snapshot
A new implementation technique for applicative languages
inferredcites →https://doi.org/10.1007/3-540-08531-9openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1007/3-540-15975-4_26openalex-snapshot
Miranda: A non-strict functional language with polymorphic types
inferredcites →https://doi.org/10.1007/3-540-19242-5_3openalex-snapshot
Confluence of conditional rewrite systems
inferredcites →https://doi.org/10.1007/3-540-19242-5_6openalex-snapshot
A completion procedure for conditional equations
inferredcites →https://doi.org/10.1007/3-540-51081-8_113openalex-snapshot
Modular aspects of properties of term rewriting systems related to normal forms
inferredcites →https://doi.org/10.1007/3-540-51081-8_127openalex-snapshot
Termination for the direct sum of left-linear term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-54317-1_99openalex-snapshot
Confluence of the disjoint union of conditional term rewriting systems
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/978-3-662-09691-8openalex-snapshot
Recent Trends in Data Type Specification
inferredcites →https://doi.org/10.1007/978-3-662-09691-8_11openalex-snapshot
Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence
inferredcites →https://doi.org/10.1007/bf01448013openalex-snapshot
Über die Bausteine der mathematischen Logik
inferredcites →https://doi.org/10.1007/bfb0012855openalex-snapshot
Canonical conditional rewrite systems
inferredcites →https://doi.org/10.1007/bfb0015791openalex-snapshot
Foundations of Equational Logic Programming
inferredcites →https://doi.org/10.1007/bfb0029537openalex-snapshot
Some philosophical issues concerning theories of combinators
inferredcites →https://doi.org/10.1007/bfb0062861openalex-snapshot
Church-Rosser theorems for replacement systems
inferredcites →https://doi.org/10.1016/0004-3702(85)90074-8openalex-snapshot
Refutational theorem proving using term-rewriting systems
inferredcites →https://doi.org/10.1016/0010-4485(78)90044-1openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1016/0020-0190(87)90039-1openalex-snapshot
On termination of the direct sum of term-rewriting systems
inferredcites →https://doi.org/10.1016/0020-0190(87)90122-0openalex-snapshot
Counterexamples to termination for the direct sum of term rewriting systems
inferredcites →https://doi.org/10.1016/0022-0000(86)90033-4openalex-snapshot
Conditional rewrite rules: Confluence and termination
inferredcites →https://doi.org/10.1016/0141-9331(87)90510-2openalex-snapshot
The implementation of functional programming languages
inferredcites →https://doi.org/10.1016/0168-0072(89)90024-9openalex-snapshot
Sequential evaluation strategies for parallel-or and related reduction systems
inferredcites →https://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot
Conditional rewrite rules
inferredcites →https://doi.org/10.1016/0304-3975(87)90100-9openalex-snapshot
The Church-Rosser property for ground term-rewriting systems is decidable
inferredcites →https://doi.org/10.1016/0304-3975(89)90006-6openalex-snapshot
Term-rewriting systems with rule priorities
inferredcites →https://doi.org/10.1016/0304-3975(89)90105-9openalex-snapshot
Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCL
inferredcites →https://doi.org/10.1016/0890-5401(89)90014-xopenalex-snapshot
Unique normal forms for lambda calculus with surjective pairing
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50012-3openalex-snapshot
Functional Programming and Lambda Calculus
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1017/s0305004100013463openalex-snapshot
On the Structure of Abstract Algebras
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.1109/lics.1988.5122openalex-snapshot
Proof by consistency in equational theories
inferredcites →https://doi.org/10.1109/lics.1989.39194openalex-snapshot
A sufficient condition for the termination of the direct sum of term rewriting systems
inferredcites →https://doi.org/10.1145/1089338.1089341openalex-snapshot
A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm
inferredcites →https://doi.org/10.1145/321738.321750openalex-snapshot
Tree-Manipulating Systems and Church-Rosser Theorems
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/7531.7534openalex-snapshot
On the Church-Rosser property for the direct sum of term rewriting systems
inferredcites →https://doi.org/10.2307/1968867openalex-snapshot
On Theories with a Combinatorial Definition of "Equivalence"
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/11601548openalex-snapshot
Processes, Terms and Cycles: Steps on the Road to Infinity
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_103openalex-snapshot
Decidability of confluence and termination of monadic term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_100openalex-snapshot
Implementing term rewriting by graph reduction: Termination of combined systems
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_7openalex-snapshot
Collapsed tree rewriting: Completeness, confluence, and modularity
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_48openalex-snapshot
An introduction to category-based equational logic
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_18openalex-snapshot
Memory Policy Analysis for Semantics Specifications in Maude
inferred← citeshttps://doi.org/10.1007/978-4-431-68144-1_7openalex-snapshot
An Application of Term Rewriting Systems for Functional Programming
inferred← citeshttps://doi.org/10.1007/bf01190830openalex-snapshot
Completeness results for basic narrowing
inferred← citeshttps://doi.org/10.1007/bfb0013830openalex-snapshot
Counterexamples to completeness results for basic narrowing (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0017417openalex-snapshot
Graph-reducible term rewriting systems
inferred← citeshttps://doi.org/10.1007/s002360050054openalex-snapshot
Category-based modularisation for equational logic programming
inferred← citeshttps://doi.org/10.1016/0164-1212(95)00071-2openalex-snapshot
Languages for the specification of software
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00125-3openalex-snapshot
Categorical abstract machines for higher-order typed λ-calculi
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.019openalex-snapshot
Lambda calculus with patterns
inferred← citeshttps://doi.org/10.1051/ita/1991250504451openalex-snapshot
Implementing term rewriting by jungle evaluation
inferred← citeshttps://doi.org/10.11606/t.45.1998.tde-20210729-015610openalex-snapshot
Grupos maximais em semigrupos de Burnside livres
inferred← citeshttps://doi.org/10.17918/etd-6852openalex-snapshot
Applications of symbolic computation to the calculus of moving surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.2101.02690openalex-snapshot
Theorem Proving and Algebra
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.