On the public citation graph

Higher-Order Rewriting: Framework, Confluence and Termination

https://doi.org/10.1007/11601548_14
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/11805618_29openalex-snapshot
Higher-Order Orderings for Normal Rewriting
inferredcites →https://doi.org/10.1007/11814771_50openalex-snapshot
Consistency and Completeness of Rewriting in the Calculus of Constructions
inferredcites →https://doi.org/10.1007/3-540-45949-9openalex-snapshot
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
inferredcites →https://doi.org/10.1007/3-540-48685-2_17openalex-snapshot
Higher-Order Rewriting
inferredcites →https://doi.org/10.1007/3-540-48685-2_25openalex-snapshot
The Calculus of Algebraic Constructions
inferredcites →https://doi.org/10.1007/978-3-662-07964-5_6openalex-snapshot
Inductive Data Types
inferredcites →https://doi.org/10.1007/978-94-017-0435-9openalex-snapshot
Automated Deduction — A Basis for Applications
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(82)90026-3openalex-snapshot
Orderings for term-rewriting systems
inferredcites →https://doi.org/10.1016/b978-044450813-3/50018-7openalex-snapshot
Higher-Order Unification and Matching
inferredcites →https://doi.org/10.1016/s0304-3975(96)00161-2openalex-snapshot
Abstract data type systems
inferredcites →https://doi.org/10.1016/s0304-3975(97)00143-6openalex-snapshot
Higher-order rewrite systems and their confluence
inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferredcites →https://doi.org/10.1017/s0956796802004641openalex-snapshot
Termination of rewriting in the Calculus of Constructions
inferredcites →https://doi.org/10.1093/logcom/1.4.497openalex-snapshot
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
inferredcites →https://doi.org/10.1109/lics.1991.151658openalex-snapshot
Higher-order critical pairs
inferredcites →https://doi.org/10.1109/lics.1994.316049openalex-snapshot
Modularity of strong normalization and confluence in the algebraic-λ-cube
inferredcites →https://doi.org/10.1109/lics.1999.782635openalex-snapshot
The higher-order recursive path ordering
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/1206035.1206037openalex-snapshot
Polymorphic higher-order recursive path orderings
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/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11805618_29openalex-snapshot
Higher-Order Orderings for Normal Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_12openalex-snapshot
The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4openalex-snapshot
Rewriting, Computation and Proof
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_7openalex-snapshot
Superdeduction at Work
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_21openalex-snapshot
Relating Nominal and Higher-Order Rewriting
inferred← citeshttps://doi.org/10.1145/1206035.1206037openalex-snapshot
Polymorphic higher-order recursive path orderings
inferred← citeshttps://doi.org/10.1145/2699913openalex-snapshot
Normal Higher-Order Termination
inferred← citeshttps://doi.org/10.1145/3161558openalex-snapshot
Typed Nominal Rewriting
inferred← citeshttps://doi.org/10.2168/lmcs-11(4:9)2015openalex-snapshot
From nominal to higher-order rewriting and back again
inferred← citeshttps://doi.org/10.70675/63d6f79fz8006z44b7za36cz0799f216b88aopenalex-snapshot
Analyse d'atteignabilité pour les programmes fonctionnels avec stratégie d'évaluation en profondeur
inferred← citeshttps://doi.org/10.70675/ea795992z3e96z40ebz99dcz23d58523b460openalex-snapshot
An operational semantics of interactions for verifying partially observed executions of distributed systems
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.