On the public citation graph
From action calculi to linear logic
0 signed · 43 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/3-540-56992-8_6openalex-snapshot
Linear λ-calculus and categorical models revisited
inferredcites →https://doi.org/10.1007/3-540-60218-6_9openalex-snapshot
Fibrational control structures
inferredcites →https://doi.org/10.1007/3-540-61604-7_51openalex-snapshot
Elementary control structures
inferredcites →https://doi.org/10.1007/3-540-62688-3_37openalex-snapshot
Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/bfb0014569openalex-snapshot
Types and models for higher-order action calculi
inferredcites →https://doi.org/10.1007/bfb0022251openalex-snapshot
A mixed linear and non-linear logic: Proofs, terms and models
inferredcites →https://doi.org/10.1007/bfb0063099openalex-snapshot
An embedding theorem for closed categories
inferredcites →https://doi.org/10.1016/0022-4049(86)90005-8openalex-snapshot
A universal property of the convolution monoidal structure
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/s0049-237x(08)71252-7openalex-snapshot
Frege Structures and the Notions of Proposition, Truth and Set
inferredcites →https://doi.org/10.1017/cbo9780511600579openalex-snapshot
Locally Presentable and Accessible Categories
inferredcites →https://doi.org/10.1017/s0960129597002296openalex-snapshot
Categorical logic of names and abstraction in action calculi
inferredcites →https://doi.org/10.1017/s0960129597002375openalex-snapshot
Premonoidal categories and notions of computation
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11874683_1openalex-snapshot
Functorial Boxes in String Diagrams
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_62openalex-snapshot
Abstract Syntax and Variable Binding for Linear Binders
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_15openalex-snapshot
Logical Predicates for Intuitionistic Linear Type Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_22openalex-snapshot
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
inferred← citeshttps://doi.org/10.1007/bfb0014569openalex-snapshot
Types and models for higher-order action calculi
inferred← citeshttps://doi.org/10.1007/s10990-006-8750-xopenalex-snapshot
Pseudo-distributive laws and axiomatics for variable binding
inferred← citeshttps://doi.org/10.1016/j.scico.2007.11.005openalex-snapshot
The logic of message-passing
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00362-0openalex-snapshot
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
inferred← citeshttps://doi.org/10.1017/s0956796899003615openalex-snapshot
Girard translation and logical predicates
inferred← citeshttps://doi.org/10.1017/s0960129598002679openalex-snapshot
Type assignment and termination of interaction nets
inferred← citeshttps://doi.org/10.1023/a:1008647417502openalex-snapshot
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
inferred← citeshttps://doi.org/10.1145/976571.976578openalex-snapshot
A unified category theoretic approach to variable binding
inferred← citeshttps://doi.org/10.4204/eptcs.292.3openalex-snapshot
From Linear Logic to Cyclic Sharing
inferred← citeshttps://doi.org/10.48550/arxiv.0810.4419openalex-snapshot
Binding bigraphs as symmetric monoidal closed theories
inferred← citeshttps://doi.org/10.48550/arxiv.math/0703713openalex-snapshot
The logic of message passing
inferred← citeshttps://doi.org/10.70675/a6c55256z1f31z437czaf55z88753e210716openalex-snapshot
Théories symétriques monoïdales closes, applications au lambda-calcul et aux bigraphes
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.