On the public citation graph

On the unification problem for Cartesian closed categories

https://doi.org/10.2307/2275552
0 signed · 25 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-52885-7_117openalex-snapshot
Retrieving library identifiers via equational matching of types
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/bf00245463openalex-snapshot
Complexity of unification problems with associative-commutative operators
inferredcites →https://doi.org/10.1007/bf01084396openalex-snapshot
The category of finite sets and Cartesian closed categories
inferredcites →https://doi.org/10.1016/s0747-7171(87)80004-4openalex-snapshot
Associative-commutative unification
inferredcites →https://doi.org/10.1017/s095679680000006xopenalex-snapshot
Using types as search keys in function libraries
inferredcites →https://doi.org/10.1017/s0956796800020049openalex-snapshot
Retrieving reusable software components by polymorphic type
inferredcites →https://doi.org/10.1017/s0960129500001444openalex-snapshot
Provable isomorphisms of types
inferredcites →https://doi.org/10.1051/ita/1993270605231openalex-snapshot
Retrieving library functions by unifying types modulo linear isomorphism
inferredcites →https://doi.org/10.1109/lics.1993.287600openalex-snapshot
On the unification problem for Cartesian closed categories
inferredcites →https://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.

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-44881-0_13openalex-snapshot
An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_2openalex-snapshot
Jeopardy
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_22openalex-snapshot
The Finite Variant Property: How to Get Rid of Some Algebraic Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_25openalex-snapshot
A Unification Algorithm for Analysis of Protocols with Blinded Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_4openalex-snapshot
Intruders with Caps
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_6openalex-snapshot
Automated Verification of Equivalence Properties of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1017/s0960129505004871openalex-snapshot
A short survey of isomorphisms of types
inferred← citeshttps://doi.org/10.1109/lics.1996.561463openalex-snapshot
Solving linear equations over polynomial semirings
inferred← citeshttps://doi.org/10.1145/2926715openalex-snapshot
Automated Verification of Equivalence Properties of Cryptographic Protocols
inferred← citeshttps://doi.org/10.29007/mj4lopenalex-snapshot
Unication Problems Modulo a Theory of Until
inferred← citeshttps://doi.org/10.48550/arxiv.0906.1199openalex-snapshot
On the Decidability of (ground) Reachability Problems for Cryptographic Protocols (extended version)
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.