On the public citation graph

Termination of rewrite systems by elementary interpretations

https://doi.org/10.1007/bfb0013817
0 signed · 33 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-50939-9_123openalex-snapshot
Completion procedures as transition rules + control
inferredcites →https://doi.org/10.1007/3-540-51081-8_105openalex-snapshot
An overview of LP, the Larch Prover
inferredcites →https://doi.org/10.1007/3-540-51081-8_133openalex-snapshot
Comtes — An experimental environment for the completion of term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-53162-9_44openalex-snapshot
Implementation of completion by transition rules + control: ORME
inferredcites →https://doi.org/10.1007/3-540-53487-3_40openalex-snapshot
A new method for proving termination of AC-rewrite systems
inferredcites →https://doi.org/10.1007/3-540-55602-8_161openalex-snapshot
Polynomial interpretations and the complexity of algorithms
inferredcites →https://doi.org/10.1007/978-1-4684-7118-2openalex-snapshot
Canonical Equational Proofs
inferredcites →https://doi.org/10.1007/bf01810293openalex-snapshot
Termination by completion
inferredcites →https://doi.org/10.1016/0167-6423(87)90030-xopenalex-snapshot
Termination of rewriting systems by polynomial interpretations and its implementation
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50007-9openalex-snapshot
Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243.
inferredcites →https://doi.org/10.1016/s0747-7171(85)80019-5openalex-snapshot
Termination orderings for associative-commutative rewriting systems
inferredcites →https://doi.org/10.1145/567067.567078openalex-snapshot
Computer experiments with the REVE term rewriting system generator

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.1994.1003openalex-snapshot
Termination of term rewriting: interpretation and type elimination
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_12openalex-snapshot
Termination of term rewriting by interpretation
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_17openalex-snapshot
Total Termination of Term Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_31openalex-snapshot
Linear interpretations by counting patterns
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_39openalex-snapshot
More problems in rewriting
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_15openalex-snapshot
Syntactical analysis of total termination
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_6openalex-snapshot
Order-sorted termination: The unsorted way
inferred← citeshttps://doi.org/10.1007/978-3-662-21551-7_17openalex-snapshot
Total termination of term rewriting
inferred← citeshttps://doi.org/10.1007/bf01191381openalex-snapshot
Total termination of term rewriting
inferred← citeshttps://doi.org/10.1007/bf03037949openalex-snapshot
Proving termination of GHC programs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90032-9openalex-snapshot
Generating polynomial orderings
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90004-3openalex-snapshot
A methodology for proving termination of logic programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.007openalex-snapshot
Quasi-interpretations a way to control resources
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80125-2openalex-snapshot
CINNI - A Generic Calculus of Explicit Substitutions and its Application to λ- ς- and π-Calculi
inferred← citeshttps://doi.org/10.1017/s0956796800001945openalex-snapshot
λν, a calculus of explicit substitutions which preserves strong normalisation
inferred← citeshttps://doi.org/10.1017/s0956796800003877openalex-snapshot
Algorithms with polynomial interpretation termination proof
inferred← citeshttps://doi.org/10.1109/dexa.1997.617356openalex-snapshot
Putting into practice a formal method to verify properties of active rules based on rewriting logic
inferred← citeshttps://doi.org/10.1109/lics.1993.287573openalex-snapshot
The order types of termination orderings on monadic terms, strings and multisets
inferred← citeshttps://doi.org/10.1145/174675.174707openalex-snapshot
From λσ to λυ
inferred← citeshttps://doi.org/10.2307/2275551openalex-snapshot
The order types of termination orderings on monadic terms, strings and multisets
inferred← citeshttps://doi.org/10.3233/fi-1995-24123openalex-snapshot
SIMPLIFICATION ORDERINGS: HISTORY OF RESULTS
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.