On the public citation graph
Eff Directly in OCaml
0 signed · 59 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-57887-0_99openalex-snapshot
Extensible denotational language specifications
inferredcites →https://doi.org/10.1007/978-3-540-76637-7_16openalex-snapshot
Polymorphic Delimited Continuations
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_7openalex-snapshot
Handlers of Algebraic Effects
inferredcites →https://doi.org/10.1007/978-3-642-32202-0_3openalex-snapshot
Typed Tagless Final Interpreters
inferredcites →https://doi.org/10.1007/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferredcites →https://doi.org/10.1007/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50016-0openalex-snapshot
Denotational Semantics
inferredcites →https://doi.org/10.1016/j.jlamp.2014.02.001openalex-snapshot
Programming with algebraic effects and handlers
inferredcites →https://doi.org/10.1016/j.tcs.2012.02.025openalex-snapshot
Delimited control in OCaml, abstractly and concretely
inferredcites →https://doi.org/10.1017/s0956796807006259openalex-snapshot
A monadic framework for delimited continuations
inferredcites →https://doi.org/10.1017/s0956796809007205openalex-snapshot
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
inferredcites →https://doi.org/10.1023/a:1010016816429openalex-snapshot
Implementation Strategies for First-Class Continuations
inferredcites →https://doi.org/10.1023/a:1010027404223openalex-snapshot
Definitional Interpreters for Higher-Order Programming Languages
inferredcites →https://doi.org/10.1023/a:1023064908962openalex-snapshot
Algebraic Operations and Generic Effects
inferredcites →https://doi.org/10.1145/2500365.2500581openalex-snapshot
Programming and reasoning with algebraic effects and dependent types
inferredcites →https://doi.org/10.1145/2804302.2804319openalex-snapshot
Freer monads, more extensible effects
inferredcites →https://doi.org/10.1145/3009837.3009872openalex-snapshot
Type directed compilation of row-typed algebraic effects
inferredcites →https://doi.org/10.1145/3110257openalex-snapshot
On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control
inferredcites →https://doi.org/10.1145/365230.365257openalex-snapshot
The next 700 programming languages
inferredcites →https://doi.org/10.1145/604131.604150openalex-snapshot
Guarded recursive datatype constructors
inferredcites →https://doi.org/10.1145/640128.604150openalex-snapshot
Guarded recursive datatype constructors
inferredcites →https://doi.org/10.1145/73560.73576openalex-snapshot
The theory and practice of first-class prompts
inferredcites →https://doi.org/10.1145/800194.805852openalex-snapshot
Definitional interpreters for higher-order programming languages
inferredcites →https://doi.org/10.1145/944705.944722openalex-snapshot
A sound and complete axiomatization of delimited continuations
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.7146/brics.v10i41.21809openalex-snapshot
An Operational Foundation for Delimited Continuations
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-57761-2_8openalex-snapshot
One-Shot Algebraic Effects as Coroutines
inferred← citeshttps://doi.org/10.1007/978-3-031-21314-4_4openalex-snapshot
Understanding Algebraic Effect Handlers via Delimited Control Operators
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_12openalex-snapshot
Explicit Effect Subtyping
inferred← citeshttps://doi.org/10.1016/j.scico.2023.103015openalex-snapshot
Generating C: Heterogeneous metaprogramming system description
inferred← citeshttps://doi.org/10.1016/j.scico.2024.103086openalex-snapshot
A framework for higher-order effects & handlers
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.038openalex-snapshot
Introducing ⦇ λ ⦈, a λ-calculus for effectful computation
inferred← citeshttps://doi.org/10.1017/s0956796820000027openalex-snapshot
Effekt: Capability-passing style for type- and effect-safe, extensible effect handlers in Scala
inferred← citeshttps://doi.org/10.1017/s0956796820000040openalex-snapshot
Effect handlers via generalised continuations
inferred← citeshttps://doi.org/10.1017/s0956796820000271openalex-snapshot
Not by equations alone: Reasoning with extensible effects
inferred← citeshttps://doi.org/10.1109/csde53843.2021.9718480openalex-snapshot
Implementing Algebraic Effects and Handlers in Non-functional Programming Languages
inferred← citeshttps://doi.org/10.1109/iciteics64870.2025.11341094openalex-snapshot
Bridging Formal Methods and Software Engineering Through a Tagless-Final Embedded DSL for Program Semantics
inferred← citeshttps://doi.org/10.1145/3136000.3136007openalex-snapshot
Effekt: extensible algebraic effects in Scala (short paper)
inferred← citeshttps://doi.org/10.1145/3158096openalex-snapshot
Handle with care: relational interpretation of algebraic effects and handlers
inferred← citeshttps://doi.org/10.1145/3236764openalex-snapshot
Handling delimited continuations with dependent types
inferred← citeshttps://doi.org/10.1145/3236771openalex-snapshot
Capturing the future by replaying the past (functional pearl)
inferred← citeshttps://doi.org/10.1145/3240719.3241789openalex-snapshot
First class dynamic effect handlers: or, polymorphic heaps with dynamic effect handlers
inferred← citeshttps://doi.org/10.1145/3331545.3342595openalex-snapshot
Monad transformers and modular algebraic effects: what binds them together
inferred← citeshttps://doi.org/10.1145/3408975openalex-snapshot
Compiling effect handlers in capability-passing style
inferred← citeshttps://doi.org/10.1145/3453483.3454039openalex-snapshot
Retrofitting effect handlers onto OCaml
inferred← citeshttps://doi.org/10.1145/3485479openalex-snapshot
Efficient compilation of algebraic effect handlers
inferred← citeshttps://doi.org/10.1145/3610612.3610616openalex-snapshot
Typed Equivalence of Labeled Effect Handlers and Labeled Delimited Control Operators
inferred← citeshttps://doi.org/10.1145/3622816openalex-snapshot
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems
inferred← citeshttps://doi.org/10.1145/3732771.3742721openalex-snapshot
Optimize Effect Handling for Tail-resumption with Stack Unwinding
inferred← citeshttps://doi.org/10.48550/arxiv.2006.01531openalex-snapshot
Effectful Programming in Declarative Languages with an Emphasis on Non-Determinism: Applications and Formal Reasoning
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.