On the public citation graph
Infinite trees in normal form and recursive equations having a unique solution
0 signed · 93 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08921-7_53openalex-snapshot
The algebraic semantics of recursive program schemes
inferredcites →https://doi.org/10.1007/3-540-08921-7_58openalex-snapshot
Programming languages as mathematical objects
inferredcites →https://doi.org/10.1007/978-1-4613-8177-8_7openalex-snapshot
On the Algebraic Structure of Rooted Trees
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/978-94-011-1793-7_2openalex-snapshot
Towards a Mathematical Science of Computation
inferredcites →https://doi.org/10.1007/bf00263742openalex-snapshot
A system which automatically improves programs
inferredcites →https://doi.org/10.1007/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferredcites →https://doi.org/10.1016/0004-3702(75)90008-9openalex-snapshot
Knowledge and reasoning in program synthesis
inferredcites →https://doi.org/10.1016/0010-4485(78)90044-1openalex-snapshot
Computing in systems described by equations
inferredcites →https://doi.org/10.1016/0022-0000(78)90016-8openalex-snapshot
On some classes of interpretations
inferredcites →https://doi.org/10.1016/0022-0000(78)90024-7openalex-snapshot
On the algebraic structure of rooted trees
inferredcites →https://doi.org/10.1016/0304-3975(76)90074-8openalex-snapshot
The inclusion problem for simple languages
inferredcites →https://doi.org/10.1016/0304-3975(78)90039-7openalex-snapshot
A representation of trees by languages II
inferredcites →https://doi.org/10.1016/0304-3975(78)90040-3openalex-snapshot
A uniform approach to inductive posets and inductive closure
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1016/s0022-0000(75)80057-2openalex-snapshot
Program equivalence and context-free grammars
inferredcites →https://doi.org/10.1016/s0022-0000(76)80030-xopenalex-snapshot
Varieties of ordered algebras
inferredcites →https://doi.org/10.1016/s0022-0000(76)80036-0openalex-snapshot
Completeness results for the equivalence of recursive schemas
inferredcites →https://doi.org/10.1016/s0022-0000(77)80019-6openalex-snapshot
Equivalence problems for deterministic context-free languages and monadic recursion schemes
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7102-2openalex-snapshot
Computer Programming and Formal Systems
inferredcites →https://doi.org/10.1016/s0049-237x(09)70099-0openalex-snapshot
A Basis for a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1051/ita/1979130100311openalex-snapshot
Arbres infinis et systèmes d'équations
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1976.3openalex-snapshot
Algebraic families of interpretations
inferredcites →https://doi.org/10.1109/sfcs.1977.9openalex-snapshot
Conflunt reductions: Abstract properties and applications to term rewriting systems
inferredcites →https://doi.org/10.1145/321738.321750openalex-snapshot
Tree-Manipulating Systems and Church-Rosser Theorems
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
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/361454.361460openalex-snapshot
Fixpoint approach to the theory of computation
inferredcites →https://doi.org/10.1145/800133.804334openalex-snapshot
Operational and semantic equivalence between recursive programs.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_6openalex-snapshot
A system for proving equivalences of recursive programs
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_96openalex-snapshot
A birkhoff-like theorem for algebraic classes of interpretations of program schemes
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_32openalex-snapshot
An axiomatic approach to the Korenjak - Hopcroft algorithms
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_11openalex-snapshot
A class of program schemes based on tree rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-15984-3_280openalex-snapshot
An algebraic implementation of packages
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_116openalex-snapshot
Algebraic semantics and complexity of term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_53openalex-snapshot
Infinite values in hierarchical imperative types
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_24openalex-snapshot
Type inference with inequalities
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_228openalex-snapshot
Proving the correctness of recursion-based automatic program transformations
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_36openalex-snapshot
Computing in unpredictable environments: Semantics, reduction strategies, and program transformations
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_29openalex-snapshot
Semantics of non-terminating rewrite systems using minimal coverings
inferred← citeshttps://doi.org/10.1007/978-1-4615-8297-7_7openalex-snapshot
Equations Compared with Clauses for Specification of Abstract Data Types
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferred← citeshttps://doi.org/10.1007/bf01744577openalex-snapshot
An axiomatic approach to the Korenjak-Hopcroft algorithms
inferred← citeshttps://doi.org/10.1007/bfb0014547openalex-snapshot
Optimal representations of polymorphic types with subtyping (Extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0032020openalex-snapshot
Static correctness of hierarchical procedures
inferred← citeshttps://doi.org/10.1007/bfb0036489openalex-snapshot
On algebras of computation sequences and proofs of equivalence of operational and denotational semantics
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90030-8openalex-snapshot
An extension to trees of the Sardinas and Patterson algorithm
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90006-4openalex-snapshot
Recursion-closed algebraic theories
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90050-8openalex-snapshot
Deterministic and nondeterministic flowchart interpretations
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90041-3openalex-snapshot
Fully abstract submodels of typed lambda calculi
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00014-xopenalex-snapshot
Static typing for object-oriented programming
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90056-1openalex-snapshot
Graph grammars and operational semantics
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90142-1openalex-snapshot
Recursion induction principle revisited
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90007-6openalex-snapshot
Axiomatisation des tests
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90023-uopenalex-snapshot
The complexity of computing the number of strings of given length in context-free languages
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/0304-3975(92)90280-sopenalex-snapshot
Interpretations of recursively defined types
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00086-0openalex-snapshot
Static correctness of hierarchical procedures
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00074-6openalex-snapshot
Proving the correctness of recursion-based automatic program transformations
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50014-7openalex-snapshot
Recursive Applicative Program Schemes
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.034openalex-snapshot
A Rewriting Calculus for Cyclic Higher-order Term Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73837-4openalex-snapshot
About Ordered Sets in Algebraic Semantics
inferred← citeshttps://doi.org/10.1016/s0304-3975(06)80002-2openalex-snapshot
Algebraic and fixed point equations over inverse limits of algebras
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00084-4openalex-snapshot
Computing in unpredictable environments: semantics, reduction strategies, and program transformations
inferred← citeshttps://doi.org/10.1017/s0960129507006093openalex-snapshot
A rewriting calculus for cyclic higher-order term graphs
inferred← citeshttps://doi.org/10.1023/a:1010056315933openalex-snapshot
Optimal Representations of Polymorphic Types with Subtyping
inferred← citeshttps://doi.org/10.1051/ita/1984180200911openalex-snapshot
Définitions récursives par cas
inferred← citeshttps://doi.org/10.1051/ita/1986200302511openalex-snapshot
Continuous monoids and yields of infinite trees
inferred← citeshttps://doi.org/10.1109/sfcs.1985.23openalex-snapshot
Equivalences and transformations of recursive definitions
inferred← citeshttps://doi.org/10.1137/0213047openalex-snapshot
n -Rational Algebras I. Basic Properties and Free Algebras
inferred← citeshttps://doi.org/10.1137/0213048openalex-snapshot
n -Rational Algebras II. Varieties and Logic of inequalities
inferred← citeshttps://doi.org/10.1145/1008933.1008936openalex-snapshot
Survey on classes of interpretations and some of their applications
inferred← citeshttps://doi.org/10.1145/1014007.1014023openalex-snapshot
A theory of totally correct logic program transformations
inferred← citeshttps://doi.org/10.1145/199448.199485openalex-snapshot
Total correctness by local improvement in program transformation
inferred← citeshttps://doi.org/10.1145/227699.227716openalex-snapshot
Total correctness by local improvement in the transformation of functional programs
inferred← citeshttps://doi.org/10.1145/263699.263760openalex-snapshot
From SOS rules to proof principles
inferred← citeshttps://doi.org/10.1145/75277.75299openalex-snapshot
Rewrite, rewrite, rewrite, rewrite, rewrite...
inferred← citeshttps://doi.org/10.3233/fi-1996-263401openalex-snapshot
EQUATIONAL TERM GRAPH REWRITING
inferred← citeshttps://doi.org/10.7146/dpb.v20i355.6585openalex-snapshot
Static Typing for Object-Oriented Programming
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.