On the public citation graph
“Everything Is Everything” Revisited: Shapeshifting Data Types with Isomorphisms and Hylomorphisms
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.
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.1002/malq.200610026openalex-snapshot
Addition and multiplication of sets
inferredcites →https://doi.org/10.1007/3-540-46564-2_10openalex-snapshot
Capturing LOGSPACE over Hereditarily-Finite Sets
inferredcites →https://doi.org/10.1007/3-540-60579-7_7openalex-snapshot
A concrete final coalgebra theorem for ZF set theory
inferredcites →https://doi.org/10.1007/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-540-45138-9_51openalex-snapshot
Generic Algorithms for the Generation of Combinatorial Objects
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1016/0168-0072(93)90044-eopenalex-snapshot
Functional interpretations of feasibly constructive arithmetic
inferredcites →https://doi.org/10.1016/0196-6774(90)90030-iopenalex-snapshot
Generating binary trees by transpositions
inferredcites →https://doi.org/10.1016/s0020-0190(01)00141-7openalex-snapshot
Ranking and unranking permutations in linear time
inferredcites →https://doi.org/10.1016/s0304-3975(00)00109-2openalex-snapshot
Decidability of the theory of the natural integers with the cantor pairing function and the successor
inferredcites →https://doi.org/10.1017/s0956796899003500openalex-snapshot
A tutorial on the universality and expressiveness of fold
inferredcites →https://doi.org/10.1017/s1471068404002091openalex-snapshot
Ackermann encoding, bisimulations and OBDDs
inferredcites →https://doi.org/10.1090/s0002-9939-1950-0038912-1openalex-snapshot
General Recursive Functions
inferredcites →https://doi.org/10.1090/s0002-9939-1968-0239974-2openalex-snapshot
Finite Generation of Recursively Enumerable Sets
inferredcites →https://doi.org/10.1137/0204001openalex-snapshot
On Simple Goedel Numberings and Translations
inferredcites →https://doi.org/10.1145/1378704.1378725openalex-snapshot
Composable memory transactions
inferredcites →https://doi.org/10.1145/321892.321894openalex-snapshot
A Theory of Program Size Formally Identical to Information Theory
inferredcites →https://doi.org/10.1145/581690.581696openalex-snapshot
Testing monadic code with QuickCheck
inferredcites →https://doi.org/10.1305/ndjfl/1193667707openalex-snapshot
On Interpretations of Arithmetic and Set Theory
inferredcites →https://doi.org/10.2977/prims/1195190375openalex-snapshot
A Foundation of Finite Mathematics
inferredcites →https://doi.org/10.7208/chicago/9780226470993.001.0001openalex-snapshot
Metaphors We Live By
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-27694-1_20openalex-snapshot
A Declarative Specification of Tree-Based Symbolic Arithmetic Computations
inferred← citeshttps://doi.org/10.1016/j.cl.2013.08.002openalex-snapshot
Binary trees as a computational framework
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.04.025openalex-snapshot
Towards a generic view of primality through multiset decompositions of natural numbers
inferred← citeshttps://doi.org/10.1109/synasc.2012.20openalex-snapshot
Boolean Evaluation with a Pairing and Unpairing Function
inferred← citeshttps://doi.org/10.1145/1863597.1863602openalex-snapshot
Hereditarily finite representations of natural numbers and self-delimiting codes
inferred← citeshttps://doi.org/10.1145/2513228.2513264openalex-snapshot
Two mechanisms for generating infinite families of pairing bijections
inferred← citeshttps://doi.org/10.1145/2643135.2643139openalex-snapshot
Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3782openalex-snapshot
Computing with Hereditarily Finite Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0114openalex-snapshot
Tree-based Arithmetic and Compressed Representations of Giant Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0128openalex-snapshot
Binary Tree Arithmetic with Generalized Constructors
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.