On the public citation graph
Vector Iteration in Pointed Iterative Theories
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.
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/bf02485827openalex-snapshot
A compactification of the algebra of terms
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/s0022-0000(77)80015-9openalex-snapshot
Scalar and vector iteration
inferredcites →https://doi.org/10.1016/s0049-237x(08)71949-9openalex-snapshot
Monadic Computation And Iterative Algebraic Theories
inferredcites →https://doi.org/10.1137/0209002openalex-snapshot
Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
inferredcites →https://doi.org/10.1137/0209052openalex-snapshot
Compatible Orderings on the Metric Theory of Trees
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-10828-9_59openalex-snapshot
Easy solutions are hard to find
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_15openalex-snapshot
Iteration algebras extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_4openalex-snapshot
An algebraic approach to the interpretation of recursive types
inferred← citeshttps://doi.org/10.1007/3-540-55511-0_24openalex-snapshot
Program correctness and matricial iteration theories
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_19openalex-snapshot
Some quasi-varieties of iteration theories
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_160openalex-snapshot
Equational properties of iteration in algebraically complete categories
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_7openalex-snapshot
Iteration Theories of Synchronization Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-73859-6_1openalex-snapshot
Regular and Algebraic Words and Ordinals
inferred← citeshttps://doi.org/10.1007/978-3-642-24897-9_4openalex-snapshot
Kleene Theorem in Partial Conway Theories with Applications
inferred← citeshttps://doi.org/10.1007/bfb0000461openalex-snapshot
Iteration 2-theories: Extended Abstract
inferred← citeshttps://doi.org/10.1007/bfb0054297openalex-snapshot
Convergence of program transformers in the metric space of trees
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90034-xopenalex-snapshot
Calvin C. Elgot 1922–1980
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90037-5openalex-snapshot
Recursion and iteration in continuous theories: The “M-construction”
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90044-2openalex-snapshot
Algebras of iteration theories
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90059-5openalex-snapshot
Axiomatizing schemes and their behaviors
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90011-0openalex-snapshot
On flowchart theories Part I. The deterministic case
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90020-7openalex-snapshot
Independence of the equational axioms for iteration theories
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90114-9openalex-snapshot
On flowchart theories: Part II. The nondeterministic case
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90012-1openalex-snapshot
Equational logic of circular data type specification
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90153-9openalex-snapshot
A note on guarded theories
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90171-bopenalex-snapshot
A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90307-2openalex-snapshot
Foundations of a theory of synchronous systems
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90006-2openalex-snapshot
An algebraic model of synchronous systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.06.010openalex-snapshot
How Iterative are Iterative Algebras?
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.033openalex-snapshot
Axiomatizing weighted synchronization trees and weighted bisimilarity
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00026-xopenalex-snapshot
Convergence of program transformers in the metric space of trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00242-0openalex-snapshot
Recursion and corecursion have the same equational logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00240-xopenalex-snapshot
Completeness of Park induction
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00248-4openalex-snapshot
The equational logic of fixed points
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00158-8openalex-snapshot
Equational properties of iteration in algebraically complete categories
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80086-0openalex-snapshot
Recursion and Corecursion Have the Same Equational Logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80558-9openalex-snapshot
Unique, guarded fixed points in an additive setting
inferred← citeshttps://doi.org/10.1051/ita/1998321-300351openalex-snapshot
Semantics of flowchart programs and the free Conway theories
inferred← citeshttps://doi.org/10.1137/0209052openalex-snapshot
Compatible Orderings on the Metric Theory of Trees
inferred← citeshttps://doi.org/10.1142/s0218196700000145openalex-snapshot
THE POWER OF THE GROUP-IDENTITIES FOR ITERATION
inferred← citeshttps://doi.org/10.1145/115234.115352openalex-snapshot
Floyd-Hoare logic in iteration theories
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.