On the public citation graph

Modular termination of term rewriting systems revisited

0 signed · 50 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-53904-2_96openalex-snapshot

Completeness of combinations of constructor systems

inferredcites →https://doi.org/10.1007/3-540-54317-1_100openalex-snapshot

Implementing term rewriting by graph reduction: Termination of combined systems

inferredcites →https://doi.org/10.1007/3-540-56393-8_7openalex-snapshot

Collapsed tree rewriting: Completeness, confluence, and modularity

inferredcites →https://doi.org/10.1007/3-540-60381-6_6openalex-snapshot

Hierarchical termination

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/0304-3975(82)90026-3openalex-snapshot

Orderings for term-rewriting systems

inferredcites →https://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot

Conditional rewrite rules

inferredcites →https://doi.org/10.1016/0304-3975(92)90015-8openalex-snapshot

Modularity of simple termination of term rewriting systems with shared constructors

inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot

Rewrite Systems

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.1109/lics.1991.151659openalex-snapshot

A computation model for executable higher-order algebraic specification languages

inferredcites →https://doi.org/10.1137/0215084openalex-snapshot

Completion of a Set of Rules Modulo a Set of Equations

inferredcites →https://doi.org/10.1145/7531.7534openalex-snapshot

On the Church-Rosser property for the direct sum of term rewriting systems

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1996.2617openalex-snapshot

Normalization Results for Typeable Rewrite Systems

inferred← citeshttps://doi.org/10.1006/jsco.1995.1036openalex-snapshot

Modular Properties of Composable Term Rewriting Systems

inferred← citeshttps://doi.org/10.1006/jsco.2002.0541openalex-snapshot

Modular Termination Proofs for Rewriting Using Dependency Pairs

inferred← citeshttps://doi.org/10.1007/11805588_13openalex-snapshot

Term Rewriting for Access Control

inferred← citeshttps://doi.org/10.1007/3-540-44557-9_3openalex-snapshot

Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and β-Rule

inferred← citeshttps://doi.org/10.1007/3-540-44802-0_34openalex-snapshot

Well-Founded Recursive Relations

inferred← citeshttps://doi.org/10.1007/3-540-60381-6_18openalex-snapshot

Modular properties of constructor-sharing conditional term rewriting systems

inferred← citeshttps://doi.org/10.1007/3-540-60381-6_6openalex-snapshot

Hierarchical termination

inferred← citeshttps://doi.org/10.1007/3-540-61064-2_35openalex-snapshot

Interaction nets and term rewriting systems (extended abstract)

inferred← citeshttps://doi.org/10.1007/3-540-61254-8_18openalex-snapshot

Modular properties of algebraic type systems

inferred← citeshttps://doi.org/10.1007/3-540-61464-8_46openalex-snapshot

A recursive path ordering for higher-order terms in η-long β-normal form

inferred← citeshttps://doi.org/10.1007/3-540-61464-8_55openalex-snapshot

Modularity of termination in term graph rewriting

inferred← citeshttps://doi.org/10.1007/3-540-61629-2_60openalex-snapshot

Modular algebraic specifications and the orientation of equations into rewrite rules

inferred← citeshttps://doi.org/10.1007/3-540-64299-4_38openalex-snapshot

Modular aspects of rewrite-based specifications

inferred← citeshttps://doi.org/10.1007/978-3-540-73538-0_15openalex-snapshot

Dynamic Event-Based Access Control as Term Rewriting

inferred← citeshttps://doi.org/10.1007/978-3-642-01748-3_5openalex-snapshot

On Lazy Commutation

inferred← citeshttps://doi.org/10.1007/978-3-642-11747-3_11openalex-snapshot

Category-Based Authorisation Models: Operational Semantics and Expressive Power

inferred← citeshttps://doi.org/10.1007/978-3-642-22444-7_4openalex-snapshot

Rewrite Specifications of Access Control Policies in Distributed Environments

inferred← citeshttps://doi.org/10.1007/bfb0014447openalex-snapshot

What is an Abstract Data Type, after all?

inferred← citeshttps://doi.org/10.1007/bfb0052373openalex-snapshot

Modularity of termination using dependency pairs

inferred← citeshttps://doi.org/10.1007/bfb0052375openalex-snapshot

Termination transformation by tree lifting ordering

inferred← citeshttps://doi.org/10.1016/0304-3975(96)00042-4openalex-snapshot

On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems

inferred← citeshttps://doi.org/10.1016/j.ic.2006.12.002openalex-snapshot

Nominal rewriting

inferred← citeshttps://doi.org/10.1016/j.ic.2014.07.009openalex-snapshot

A metamodel of access control for distributed environments: Applications and properties

inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106207openalex-snapshot

Modular termination of prefix-constrained term rewrite systems

inferred← citeshttps://doi.org/10.1016/j.jsc.2004.02.003openalex-snapshot

Modular and incremental proofs of AC-termination

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.045openalex-snapshot

Termination of rewrite relations on λ-terms based on Girard's notion of reducibility

inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00272-7openalex-snapshot

Hierarchical termination revisited

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00366-8openalex-snapshot

Equational rules for rewriting logic

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00161-2openalex-snapshot

Abstract data type systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00082-0openalex-snapshot

Interaction nets and term-rewriting systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00079-6openalex-snapshot

Modular aspects of term graph rewriting

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82550-2openalex-snapshot

Adventures in sequent calculus modulo equations

inferred← citeshttps://doi.org/10.1109/crisis.2008.4757458openalex-snapshot

An Algebraic-Functional Framework for Distributed Access Control

inferred← citeshttps://doi.org/10.1145/1069774.1069779openalex-snapshot

Nominal rewriting with name generation

inferred← citeshttps://doi.org/10.1145/1206035.1206037openalex-snapshot

Polymorphic higher-order recursive path orderings

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.