On the public citation graph
Recovering purity with comonads and capabilities
0 signed · 50 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/11417170_22openalex-snapshot
L3: A Linear Language with Locations
inferredcites →https://doi.org/10.1007/3-540-44802-0_21openalex-snapshot
Categorical and Kripke Semantics for Constructive S4 Modal Logic
inferredcites →https://doi.org/10.1007/3-540-47797-7_5openalex-snapshot
Calculating Functional Programs
inferredcites →https://doi.org/10.1007/978-1-4612-2822-6_8openalex-snapshot
Normal Forms and Cut-Free Proofs as Natural Transformations
inferredcites →https://doi.org/10.1007/978-3-319-89366-2_14openalex-snapshot
Fitch-Style Modal Lambda Calculi
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_26openalex-snapshot
Deny-Guarantee Reasoning
inferredcites →https://doi.org/10.1007/978-3-642-02273-9_8openalex-snapshot
Bounded Linear Logic, Revisited
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_19openalex-snapshot
A Core Quantitative Coeffect Calculus
inferredcites →https://doi.org/10.1007/bf01806033openalex-snapshot
Categorical models for local names
inferredcites →https://doi.org/10.1007/s00153-007-0042-6openalex-snapshot
Light affine lambda calculus and polynomial time strong normalization
inferredcites →https://doi.org/10.1016/0304-3975(90)90147-aopenalex-snapshot
Deforestation: transforming programs to eliminate trees
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/c2013-0-01290-xopenalex-snapshot
Capability-Based Computer Systems
inferredcites →https://doi.org/10.1016/s0890-5401(03)00009-9openalex-snapshot
Linear types and non-size-increasing polynomial time computation
inferredcites →https://doi.org/10.1016/s0890-5401(03)00088-9openalex-snapshot
Modelling environments in call-by-value programming languages
inferredcites →https://doi.org/10.1017/s0956796897002943openalex-snapshot
What is a purely functional language?
inferredcites →https://doi.org/10.1017/s0960129500000311openalex-snapshot
A model for syntactic control of interference
inferredcites →https://doi.org/10.1017/s0960129501003322openalex-snapshot
A judgmental reconstruction of modal logic
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1109/sp.2010.16openalex-snapshot
Object Capabilities and Isolation of Untrusted Web Applications
inferredcites →https://doi.org/10.1145/1111037.1111056openalex-snapshot
Fast and loose reasoning is morally correct
inferredcites →https://doi.org/10.1145/2500365.2500588openalex-snapshot
Higher-order functional reactive programming without spacetime leaks
inferredcites →https://doi.org/10.1145/289423.289429openalex-snapshot
The marriage of effects and monads
inferredcites →https://doi.org/10.1145/319838.319848openalex-snapshot
Integrating functional and imperative programming
inferredcites →https://doi.org/10.1145/3341714openalex-snapshot
Quantitative program reasoning with graded modal types
inferredcites →https://doi.org/10.1145/357980.357993openalex-snapshot
Programming semantics for multiprogrammed computations
inferredcites →https://doi.org/10.1145/365230.365252openalex-snapshot
Programming semantics for multiprogrammed computations
inferredcites →https://doi.org/10.1145/512760.512766openalex-snapshot
Syntactic control of interference
inferredcites →https://doi.org/10.1145/850657.850658openalex-snapshot
On the duality of operating system structures
inferredcites →https://doi.org/10.2307/2268135openalex-snapshot
Some theorems about the sentential calculi of Lewis and Heyting
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_13openalex-snapshot
Linearity and Uniqueness: An Entente Cordiale
inferred← citeshttps://doi.org/10.1007/978-3-032-05291-9_3openalex-snapshot
Actor Capabilities for Message Ordering
inferred← citeshttps://doi.org/10.1017/s0956796822000132openalex-snapshot
Modal FRP for all: Functional reactive programming without space leaks in Haskell
inferred← citeshttps://doi.org/10.1145/3527320openalex-snapshot
Effects, capabilities, and boxes: from scope-based reasoning to type-based reasoning and back
inferred← citeshttps://doi.org/10.1145/3547649openalex-snapshot
Normalization for fitch-style modal calculi
inferred← citeshttps://doi.org/10.1145/3776674openalex-snapshot
Rows and Capabilities as Modal Effects
inferred← citeshttps://doi.org/10.4230/lipics.ecoop.2022.15openalex-snapshot
Tracking Captured Variables in Types
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.