On the public citation graph
The Girard Translation extended with recursion
0 signed · 39 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-58201-0_80openalex-snapshot
A model of intuitionistic affine logic from stable domain theory
inferredcites →https://doi.org/10.1007/3-540-60045-0_38openalex-snapshot
Hardware verification using monadic second-order logic
inferredcites →https://doi.org/10.1007/978-1-4471-3503-6_18openalex-snapshot
An Internal Language for Autonomous Categories
inferredcites →https://doi.org/10.1007/978-1-4899-0021-0openalex-snapshot
Toposes, Triples and Theories
inferredcites →https://doi.org/10.1007/bf00873993openalex-snapshot
An internal language for autonomous categories
inferredcites →https://doi.org/10.1007/bfb0037099openalex-snapshot
A term calculus for Intuitionistic Linear Logic
inferredcites →https://doi.org/10.1007/bfb0080769openalex-snapshot
Diagonal arguments and cartesian closed categories
inferredcites →https://doi.org/10.1016/0168-0072(94)90020-5openalex-snapshot
Semantics of weakening and contraction
inferredcites →https://doi.org/10.1016/0304-3975(90)90165-eopenalex-snapshot
A note on inconsistencies caused by fixpoints in a cartesian closed category
inferredcites →https://doi.org/10.1016/0304-3975(93)90181-ropenalex-snapshot
Computational interpretations of linear logic
inferredcites →https://doi.org/10.1017/cbo9780511525902.012openalex-snapshot
Strong monads, algebras and fixed points
inferredcites →https://doi.org/10.1017/s0956796800001131openalex-snapshot
Lilac: a functional programming language based on linear logic
inferredcites →https://doi.org/10.1093/oso/9780198537359.003.0004openalex-snapshot
Basic Category Theory
inferredcites →https://doi.org/10.1109/lics.1990.113771openalex-snapshot
New foundations for fixpoint computations
inferredcites →https://doi.org/10.1137/s0097539793260404openalex-snapshot
An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String
inferredcites →https://doi.org/10.5860/choice.30-6217openalex-snapshot
The formal semantics of programming languages: an introduction
inferredcites →https://doi.org/10.7146/brics.v1i22.21645openalex-snapshot
A General Adequacy Result for a Linear Functional Language
inferredcites →https://doi.org/10.7146/brics.v2i12.19515openalex-snapshot
Fast Meldable Priority Queues
inferredcites →https://doi.org/10.7146/brics.v2i13.19882openalex-snapshot
The Girard Translation Extended with Recursion
inferredcites →https://doi.org/10.7146/brics.v2i2.19504openalex-snapshot
From Timed Automata to Logic - and Back
inferredcites →https://doi.org/10.7146/brics.v2i3.19505openalex-snapshot
A Semantic Theory for Value–Passing Processes Late Approach Part I: A Denotational Model and Its Complete Axiomatization
inferredcites →https://doi.org/10.7146/brics.v2i4.19506openalex-snapshot
Petri Nets and Bisimulations
inferredcites →https://doi.org/10.7146/brics.v2i5.19507openalex-snapshot
A Complete Equational Axiomatization for Prefix Iteration with Silent Steps
inferredcites →https://doi.org/10.7146/brics.v2i9.19512openalex-snapshot
Partial and Higher Order Differentials and Applications to the DES
inferredcites →https://doi.org/10.7551/mitpress/3054.001.0001openalex-snapshot
The Formal Semantics of Programming Languages
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/0304-3975(96)80134-4openalex-snapshot
Call-by-name, call-by-value, call-by-need and the linear lambda calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00233-2openalex-snapshot
A general adequacy result for a linear functional language
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00358-2openalex-snapshot
Call-by-name, call-by-value, call-by-need and the linear lambda calculus
inferred← citeshttps://doi.org/10.1017/s0956796899003615openalex-snapshot
Girard translation and logical predicates
inferred← citeshttps://doi.org/10.1017/s0956796899003639openalex-snapshot
Program equivalence in a linear functional language
inferred← citeshttps://doi.org/10.1109/lics.1996.561458openalex-snapshot
Linear logic, monads and the lambda calculus
inferred← citeshttps://doi.org/10.1145/2003476.2003500openalex-snapshot
Linearity and recursion in a typed Lambda-calculus
inferred← citeshttps://doi.org/10.7146/brics.v1i22.21645openalex-snapshot
A General Adequacy Result for a Linear Functional Language
inferred← citeshttps://doi.org/10.7146/brics.v1i27.21639openalex-snapshot
A Model of Intuitionistic Affine Logic from Stable Domain Theory (Revised and Expanded Version)
inferred← citeshttps://doi.org/10.7146/brics.v2i13.19882openalex-snapshot
The Girard Translation Extended with Recursion
inferred← citeshttps://doi.org/10.7146/brics.v2i15.19883openalex-snapshot
The Fourth Moment in Luby's Distribution
inferred← citeshttps://doi.org/10.7146/brics.v2i16.19884openalex-snapshot
Optimal Parallel Construction of Minimal Suffix and Factor Automata
inferred← citeshttps://doi.org/10.7146/brics.v2i19.19921openalex-snapshot
Compositional Model Checking of Real Time Systems
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.