On the public citation graph

Infinite normal forms

https://doi.org/10.1007/bfb0035765
0 signed · 35 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-08531-9openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1007/3-540-50325-0_2openalex-snapshot
Algebraic data type and process specifications based on projection spaces
inferredcites →https://doi.org/10.1007/bf00267044openalex-snapshot
On the algebraic specification of infinite objects — ordered and continuous models of algebraic types
inferredcites →https://doi.org/10.1007/bfb0079432openalex-snapshot
Data types as lattices
inferredcites →https://doi.org/10.1016/0010-4485(78)90044-1openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0304-3975(84)90087-2openalex-snapshot
Conditional rewrite rules
inferredcites →https://doi.org/10.1016/b978-0-12-046371-8.50011-0openalex-snapshot
Completion Algorithms for Conditional Rewriting Systems11This work was partially supported by the GRECO de Programmation of the CNRS.
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/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1137/0205037openalex-snapshot
Data Types as Lattices
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
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/75277.75299openalex-snapshot
Rewrite, rewrite, rewrite, rewrite, rewrite...
inferredcites →https://doi.org/10.22028/d291-26058openalex-snapshot
On the interpretation of recursive program schemes
inferredcites →https://doi.org/10.3233/fi-1986-9106openalex-snapshot
Continuous Abstract Data Types

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.1995.1075openalex-snapshot
Transfinite Reductions in Orthogonal Term Rewriting Systems
inferred← citeshttps://doi.org/10.1006/inco.2000.2876openalex-snapshot
Descendants and Origins in Term Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_81openalex-snapshot
Transfinite reductions in orthogonal term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_82openalex-snapshot
Redex capturing in term graph rewriting (concise version)
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_79openalex-snapshot
Extended term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_84openalex-snapshot
Infinite terms and infinite rewritings
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_98openalex-snapshot
FPL : Functional plus logic programming an integration of the FP and Prolog languages
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_66openalex-snapshot
Infinite normal forms for non-linear term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_83openalex-snapshot
Term rewriting in CTΣ
inferred← citeshttps://doi.org/10.1007/3-540-57867-6_2openalex-snapshot
Rewriting techniques for software engineering
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_32openalex-snapshot
Infinitary Combinatory Reduction Systems
inferred← citeshttps://doi.org/10.1007/bf02939479openalex-snapshot
Nonterminating rewritings with head boundedness
inferred← citeshttps://doi.org/10.1007/bf02943496openalex-snapshot
Head boundedness of nonterminating rewritings
inferred← citeshttps://doi.org/10.1007/bfb0053548openalex-snapshot
Rational term rewriting
inferred← citeshttps://doi.org/10.1007/s00236-007-0043-2openalex-snapshot
Infinitary rewriting: meta-theory and convergence
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90040-9openalex-snapshot
Rewrite, rewrite, rewrite, rewrite, rewrite, …
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90182-fopenalex-snapshot
Conditional rewriting logic as a unified model of concurrency
inferred← citeshttps://doi.org/10.1016/j.ic.2011.01.007openalex-snapshot
Infinitary Combinatory Reduction Systems
inferred← citeshttps://doi.org/10.4204/eptcs.48.3openalex-snapshot
Term Graph Rewriting and Parallel Term Rewriting
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.