On the public citation graph
Optimizing ML using a hierarchy of monadic types
0 signed · 36 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.1006/inco.1994.1046openalex-snapshot
The Type and Effect Discipline
inferredcites →https://doi.org/10.1006/inco.1996.2613openalex-snapshot
Region-Based Memory Management
inferredcites →https://doi.org/10.1007/3-540-55253-7_28openalex-snapshot
Typing references by effect inference
inferredcites →https://doi.org/10.1007/3-540-61055-3_27openalex-snapshot
Compiling Haskell by program transformation: A report from the trenches
inferredcites →https://doi.org/10.1007/3540543961_30openalex-snapshot
Unboxed values as first class citizens in a non-strict functional language
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/s0956796800000393openalex-snapshot
Polymorphic type, region and effect inference
inferredcites →https://doi.org/10.1017/s0956796898003086openalex-snapshot
From ML to Ada: Strongly-typed language interoperability via source translation
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/199448.199528openalex-snapshot
Monad transformers and modular interpreters
inferredcites →https://doi.org/10.1145/237721.237771openalex-snapshot
From region inference to von Neumann machines via region representation inference
inferredcites →https://doi.org/10.1145/289423.289429openalex-snapshot
The marriage of effects 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/978-3-030-17184-1_9openalex-snapshot
Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_3openalex-snapshot
Counting Successes: Effects and Transformations for Non-deterministic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_9openalex-snapshot
Witnessing Purity, Constancy and Mutability
inferred← citeshttps://doi.org/10.1007/s10990-006-8611-7openalex-snapshot
Polymorphic typed defunctionalization and concretization
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.11.012openalex-snapshot
Factorisation Systems for Logical Relations and Monadic Lifting in Type-and-effect System Semantics
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80280-4openalex-snapshot
Monads, Effects and Transformations
inferred← citeshttps://doi.org/10.1017/s095679680200446xopenalex-snapshot
Verification of non-functional programs using interpretations in type theory
inferred← citeshttps://doi.org/10.1145/2103621.2103698openalex-snapshot
Algebraic foundations for effect-dependent optimisations
inferred← citeshttps://doi.org/10.1145/2429069.2429074openalex-snapshot
The sequential semantics of producer effect systems
inferred← citeshttps://doi.org/10.1145/289423.289428openalex-snapshot
Taming effects with monadic typing
inferred← citeshttps://doi.org/10.1145/289423.289429openalex-snapshot
The marriage of effects and monads
inferred← citeshttps://doi.org/10.1145/289423.289435openalex-snapshot
Compiling standard ML to Java bytecodes
inferred← citeshttps://doi.org/10.1145/601775.601776openalex-snapshot
The marriage of effects and monads
inferred← citeshttps://doi.org/10.17863/cam.52720openalex-snapshot
Reasoning about effectful programs and evaluation order
inferred← citeshttps://doi.org/10.2168/lmcs-10(3:21)2014openalex-snapshot
Inferring Algebraic Effects
inferred← citeshttps://doi.org/10.25911/5d63bdac49b1bopenalex-snapshot
Type inference and optimisation for an impure world
inferred← citeshttps://doi.org/10.4204/eptcs.153.8openalex-snapshot
Koka: Programming with Row Polymorphic Effect 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.