On the public citation graph

An algebraic view of structural induction

https://doi.org/10.1007/bfb0022272
0 signed · 26 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-55511-0_1openalex-snapshot
Types, abstraction, and parametric polymorphism, part 2
inferredcites →https://doi.org/10.1007/bf01752392openalex-snapshot
Algebraic specification of data types: A synthetic approach
inferredcites →https://doi.org/10.1007/bfb0063102openalex-snapshot
Fibrations and Yoneda's lemma in a 2-category
inferredcites →https://doi.org/10.1016/0022-4049(72)90019-9openalex-snapshot
The formal theory of monads
inferredcites →https://doi.org/10.1016/0022-4049(94)00054-mopenalex-snapshot
Maps I: relative to a factorisation system
inferredcites →https://doi.org/10.1016/s0022-4049(02)00137-8openalex-snapshot
The formal theory of monads II
inferredcites →https://doi.org/10.1017/s0004972700002781openalex-snapshot
Elementary observations on 2-categorical limits
inferredcites →https://doi.org/10.1017/s0960129500001213openalex-snapshot
Fibrations with indeterminates: contextual and functional completeness for polymorphic lambda calculi
inferredcites →https://doi.org/10.1090/pspum/017/0257175openalex-snapshot
Equality in hyperdoctrines and comprehension schema as an adjoint functor
inferredcites →https://doi.org/10.1109/lics.1993.287597openalex-snapshot
Relational properties of recursively defined domains
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.
inferredcites →https://doi.org/10.3233/fi-1995-2431openalex-snapshot
PARAMETERS AND PARAMETRIZATION IN SPECIFICATION, USING DISTRIBUTIVE CATEGORIES
inferredcites →https://doi.org/10.7146/dpb.v22i462.6935openalex-snapshot
Fibrations, Logical Predicates and Indeterminates

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.1998.2725openalex-snapshot
Structural Induction and Coinduction in a Fibrational Setting
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_57openalex-snapshot
Mongruences and cofree coalgebras
inferred← citeshttps://doi.org/10.1007/3-540-60164-3_25openalex-snapshot
Categorical fixed point calculus
inferred← citeshttps://doi.org/10.1007/978-3-322-84823-9_9openalex-snapshot
Definitions- und Beweisprinzipien für Daten und Prozesse
inferred← citeshttps://doi.org/10.1007/978-3-642-32347-8_11openalex-snapshot
Bag Equivalence via a Proof-Relevant Membership Relation
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_10openalex-snapshot
Preorders on Monads and Coalgebraic Simulations
inferred← citeshttps://doi.org/10.1007/bfb0000477openalex-snapshot
Invariants, bisimulations and the correctness of coalgebraic refinements
inferred← citeshttps://doi.org/10.1007/bfb0026991openalex-snapshot
Proof principles for datatypes with iterated recursion
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00129-1openalex-snapshot
Some properties of Fib as a fibred 2-category
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80642-5openalex-snapshot
Developing Theories of Types and Computability via Realizability
inferred← citeshttps://doi.org/10.1017/s0960129500001213openalex-snapshot
Fibrations with indeterminates: contextual and functional completeness for polymorphic lambda calculi
inferred← citeshttps://doi.org/10.1017/s0960129523000245openalex-snapshot
Divergences on monads for relational program logics
inferred← citeshttps://doi.org/10.1145/3703595.3705873openalex-snapshot
Intrinsically Correct Sorting in Cubical Agda
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.