On the public citation graph

A deciding algorithm for linear isomorphism of types with complexity O(nlog 2(n)).

0 signed · 17 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-56944-8_71openalex-snapshot

A complete axiom system for isomorphism of types in closed categories

inferredcites →https://doi.org/10.1007/978-1-4612-2572-0openalex-snapshot

Isomorphisms of Types: from λ-calculus to information retrieval and language design

inferredcites →https://doi.org/10.1007/bf01084396openalex-snapshot

The category of finite sets and Cartesian closed categories

inferredcites →https://doi.org/10.1007/bf01404107openalex-snapshot

Closed categories and the theory of proofs

inferredcites →https://doi.org/10.1007/bfb0014972openalex-snapshot

Linear logic and lazy computation

inferredcites →https://doi.org/10.1007/bfb0037099openalex-snapshot

A term calculus for Intuitionistic Linear Logic

inferredcites →https://doi.org/10.1051/ita/1993270605231openalex-snapshot

Retrieving library functions by unifying types modulo linear isomorphism

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.2001.3090openalex-snapshot

Efficient and Flexible Matching of Recursive Types

inferred← citeshttps://doi.org/10.1007/3-540-48168-0_18openalex-snapshot

A Linear Logical View of Linear Type Isomorphisms

inferred← citeshttps://doi.org/10.1007/3-540-61254-8_21openalex-snapshot

R n - and G n -logics

inferred← citeshttps://doi.org/10.1017/s0960129505004871openalex-snapshot

A short survey of isomorphisms of types

inferred← citeshttps://doi.org/10.1017/s0960129505004913openalex-snapshot

Efficient algorithms for isomorphisms of simple types

inferred← citeshttps://doi.org/10.1017/s0960129505004950openalex-snapshot

Isomorphisms of simple inductive types through extensional rewriting

inferred← citeshttps://doi.org/10.1109/lics.2000.855786openalex-snapshot

Efficient and flexible matching of recursive types

inferred← citeshttps://doi.org/10.1109/phycon.2003.1236793openalex-snapshot

Type theory, computer algebra & dynamical systems

inferred← citeshttps://doi.org/10.1145/604131.604146openalex-snapshot

Efficient algorithms for isomorphisms of simple types

inferred← citeshttps://doi.org/10.7146/brics.v3i49.20051openalex-snapshot

Objects, Types and Modal Logics

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.