On the public citation graph

Polymorphic rewriting conserves algebraic strong normalization and confluence

https://doi.org/10.1007/bfb0035757
0 signed · 48 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/978-3-642-69962-7openalex-snapshot
Fundamentals of Algebraic Specification 1
inferredcites →https://doi.org/10.1007/bfb0064875openalex-snapshot
A realizability interpretation of the theory of species
inferredcites →https://doi.org/10.1016/0304-3975(88)90097-7openalex-snapshot
Extensional models for polymorphism
inferredcites →https://doi.org/10.1016/0304-3975(89)90004-2openalex-snapshot
Complete sets of transformations for general E-unification
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/0890-5401(92)90064-mopenalex-snapshot
Adding algebraic rewriting to the untyped lambda calculus
inferredcites →https://doi.org/10.1016/s0019-9958(85)80001-2openalex-snapshot
Logical relations and the typed λ-calculus
inferredcites →https://doi.org/10.1016/s0747-7171(89)80023-9openalex-snapshot
Higher-order unification revisited: Complete sets of transformations
inferredcites →https://doi.org/10.1109/lics.1988.5103openalex-snapshot
Combining algebra and higher-order types
inferredcites →https://doi.org/10.1145/41625.41646openalex-snapshot
Computable values can be classical
inferredcites →https://doi.org/10.1145/512644.512671openalex-snapshot
"Type" is not a type
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/2271658openalex-snapshot
Intensional interpretations of functionals of finite type I
inferredcites →https://doi.org/10.2307/2273377openalex-snapshot
Completeness, invariance and λ-definability

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11916277_1openalex-snapshot
Higher-Order Termination: From Kruskal to Computability
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_8openalex-snapshot
Matching Power
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_115openalex-snapshot
Higher order E-unification
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_97openalex-snapshot
Modular higher-order E-unification
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_103openalex-snapshot
A simplifier for untyped lambda expressions
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_110openalex-snapshot
Modularity of termination and confluence in combinations of rewrite systems with λω
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_13openalex-snapshot
Comparing combinatory reduction systems and higher-order rewrite systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4_4openalex-snapshot
Computability Closure: Ten Years Later
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_1openalex-snapshot
The Computability Path Ordering: The End of a Quest
inferred← citeshttps://doi.org/10.1007/bf03037096openalex-snapshot
Synthesis of rewrite programs by higher-order and semantic unification
inferred← citeshttps://doi.org/10.1007/bfb0037098openalex-snapshot
Combining first and higher order rewrite systems with type assignment systems
inferred← citeshttps://doi.org/10.1007/bfb0040259openalex-snapshot
Inductively defined types in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90155-oopenalex-snapshot
Confluence of the lambda calculus with left-linear algebraic rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90118-2openalex-snapshot
Equational type logic
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90075-5openalex-snapshot
Higher-order unification via combinators
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90047-7openalex-snapshot
The term rewriting approach to automated theorem proving
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90064-mopenalex-snapshot
Adding algebraic rewriting to the untyped lambda calculus
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.1016/j.tcs.2012.02.022openalex-snapshot
Internal models of system F for decompilation
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/s0304-3975(00)00347-9openalex-snapshot
Inductive-data-type systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80127-6openalex-snapshot
The simply typed rewriting calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82526-5openalex-snapshot
Rewriting Calculus with(out) Types
inferred← citeshttps://doi.org/10.1017/s0956796818000072openalex-snapshot
Size-based termination of higher-order rewriting
inferred← citeshttps://doi.org/10.1023/a:1006282725324openalex-snapshot
Managing Structural Information by Higher-Order Colored Unification
inferred← citeshttps://doi.org/10.1093/jigpal/9.3.377openalex-snapshot
The rewriting calculus - part II
inferred← citeshttps://doi.org/10.1109/lics.1991.151633openalex-snapshot
Partial objects in the calculus of constructions
inferred← citeshttps://doi.org/10.1145/115865.115896openalex-snapshot
Compiling the polymorphic λ-calculus
inferred← citeshttps://doi.org/10.1145/115866.115896openalex-snapshot
Compiling the polymorphic λ-calculus
inferred← citeshttps://doi.org/10.1145/174675.177889openalex-snapshot
Higher-order equational logic programming
inferred← citeshttps://doi.org/10.1145/227683.227689openalex-snapshot
Termination for direct sums of left-linear complete term rewriting systems
inferred← citeshttps://doi.org/10.1145/91556.91677openalex-snapshot
Operational and axiomatic semantics of PCF
inferred← citeshttps://doi.org/10.70675/1aceeb9azede6z4f94z9967z189737f4f5a5openalex-snapshot
Size-based termination : semantics and generalizations
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.