On the public citation graph
Environments, continuation semantics and indexed categories
0 signed · 40 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-60164-3_28openalex-snapshot
Decomposing typed lambda calculus into a couple of categorical programming languages
inferredcites →https://doi.org/10.1007/3-540-60164-3_30openalex-snapshot
A proposed categorical semantics for ML modules
inferredcites →https://doi.org/10.1007/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferredcites →https://doi.org/10.1007/bfb0018355openalex-snapshot
Declarative continuations: An investigation of duality in programming language semantics
inferredcites →https://doi.org/10.1016/0890-5401(88)90034-xopenalex-snapshot
Categories of partial maps
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/s0022-4049(96)00162-4openalex-snapshot
Categories for computation in context and unified logic
inferredcites →https://doi.org/10.1016/s1571-0661(05)80149-5openalex-snapshot
Continuation Semantics and Self-adjointness
inferredcites →https://doi.org/10.1017/s095679680000085xopenalex-snapshot
Typing first-class continuations in ML
inferredcites →https://doi.org/10.1017/s0960129597002375openalex-snapshot
Premonoidal categories and notions of computation
inferredcites →https://doi.org/10.1109/lics.1996.561323openalex-snapshot
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
inferredcites →https://doi.org/10.1145/99583.99608openalex-snapshot
Typing first-class continuations in ML
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-48168-0_39openalex-snapshot
Data-Refinement for Call-By-Value Programming Languages
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_59openalex-snapshot
Closed Freyd- and κ-categories
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_9openalex-snapshot
Graded Hoare Logic and its Categorical Semantics
inferred← citeshttps://doi.org/10.1007/bfb0028027openalex-snapshot
Categories with algebraic structure
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.012openalex-snapshot
Arrows, like Monads, are Monoids
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.081openalex-snapshot
Axiomatics for Data Refinement in Call by Value Programming Languages
inferred← citeshttps://doi.org/10.1016/j.scico.2013.04.010openalex-snapshot
On the semantics of parsing actions
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00340-6openalex-snapshot
Premonoidal categories as categories with algebraic structure
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00088-9openalex-snapshot
Modelling environments in call-by-value programming languages
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot
Some aspects of categories in computer science
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80078-1openalex-snapshot
Direct Models of the Computational Lambda-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80056-8openalex-snapshot
Models for the computational λ-calculus
inferred← citeshttps://doi.org/10.1017/s0956796809007308openalex-snapshot
Categorical semantics for arrows
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00047openalex-snapshot
Effectful Mealy Machines: Bisimulation and Trace
inferred← citeshttps://doi.org/10.1145/2370776.2370789openalex-snapshot
Functional semantics of parsing actions, and left recursion elimination as continuation passing
inferred← citeshttps://doi.org/10.1145/2429069.2429074openalex-snapshot
The sequential semantics of producer effect systems
inferred← citeshttps://doi.org/10.14236/ewic/msfp2006.9openalex-snapshot
Freyd is Kleisli, for Arrows
inferred← citeshttps://doi.org/10.1515/tmj-2017-0105openalex-snapshot
Equilogical spaces and algebras for a double-power monad
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:20)2017openalex-snapshot
Fair Simulation for Nondeterministic and Probabilistic Buechi Automata: a Coalgebraic Perspective
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d1eopenalex-snapshot
Graded Hoare Logic and its Categorical Semantics
inferred← citeshttps://doi.org/10.4204/eptcs.397.12openalex-snapshot
Effectful Semantics in 2-Dimensional Categories: Premonoidal and Freyd Bicategories
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2885openalex-snapshot
Multi-Level Languages are Generalized Arrows
inferred← citeshttps://doi.org/10.70675/1fe9d40fzc796z4fb8zbc8fz98a158e7d52aopenalex-snapshot
Quantum Game Semantics
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.