On the public citation graph
Compiling to categories
0 signed · 94 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/11964681openalex-snapshot
Implementation and Application of Functional Languages
inferredcites →https://doi.org/10.1007/3-540-15975-4_29openalex-snapshot
The categorical abstract machine
inferredcites →https://doi.org/10.1007/3-540-17184-3_44openalex-snapshot
Cartesian closed categories and typed λ-calculi
inferredcites →https://doi.org/10.1007/3-540-47797-7_5openalex-snapshot
Calculating Functional Programs
inferredcites →https://doi.org/10.1007/3-540-54396-1openalex-snapshot
Functional Programming Languages and Computer Architecture
inferredcites →https://doi.org/10.1007/3-540-59451-5_3openalex-snapshot
The design of a pretty-printing library
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.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-45340-3_2openalex-snapshot
Using Rewriting to Synthesize Functional Languages to Digital Circuits
inferredcites →https://doi.org/10.1007/s10990-008-9037-1openalex-snapshot
Nesting forward-mode AD in a functional framework
inferredcites →https://doi.org/10.1016/0304-3975(90)90152-8openalex-snapshot
Fixed points in cartesian closed categories
inferredcites →https://doi.org/10.1016/0304-3975(90)90154-aopenalex-snapshot
Categorical fixed point semantics
inferredcites →https://doi.org/10.1016/s0019-9958(86)80047-xopenalex-snapshot
Categorical combinators
inferredcites →https://doi.org/10.1016/s0167-6423(02)00025-4openalex-snapshot
Polytypic values possess polykinded types
inferredcites →https://doi.org/10.1016/s0167-6423(99)00023-4openalex-snapshot
Generalising monads to arrows
inferredcites →https://doi.org/10.1017/s0956796802004331openalex-snapshot
Secrets of the Glasgow Haskell Compiler inliner
inferredcites →https://doi.org/10.1017/s0956796802004574openalex-snapshot
Compiling embedded languages
inferredcites →https://doi.org/10.1017/s0956796809007175openalex-snapshot
The worker/wrapper transformation
inferredcites →https://doi.org/10.1017/s0956796899003299openalex-snapshot
Power series, power serious
inferredcites →https://doi.org/10.1093/acprof:oso/9780198568612.001.0001openalex-snapshot
Category Theory
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.2000.855753openalex-snapshot
Complete axioms for categorical fixed-point operators
inferredcites →https://doi.org/10.1142/9789812794499_others03openalex-snapshot
Logic in Computer Science
inferredcites →https://doi.org/10.1145/1017472.1017482openalex-snapshot
Programming graphics processors functionally
inferredcites →https://doi.org/10.1145/1190315.1190324openalex-snapshot
System F with type equality coercions
inferredcites →https://doi.org/10.1145/1596638.1596653openalex-snapshot
Type-safe observable sharing in Haskell
inferredcites →https://doi.org/10.1145/1863523.1863529openalex-snapshot
A generic deriving mechanism for Haskell
inferredcites →https://doi.org/10.1145/2500365.2500602openalex-snapshot
The constrained-monad problem
inferredcites →https://doi.org/10.1145/2594291.2594304openalex-snapshot
A theory of changes for higher-order languages
inferredcites →https://doi.org/10.1145/2605205openalex-snapshot
Domain-specific languages and code synthesis using Haskell
inferredcites →https://doi.org/10.1145/2628136.2628138openalex-snapshot
Folding domain-specific languages
inferredcites →https://doi.org/10.1145/289423.289442openalex-snapshot
Functional differentiation of computer programs
inferredcites →https://doi.org/10.1145/3110251openalex-snapshot
Generic functional parallel algorithms: scan and FFT
inferredcites →https://doi.org/10.1145/331960.331977openalex-snapshot
Domain specific embedded compilers
inferredcites →https://doi.org/10.1145/355586.364791openalex-snapshot
A simple automatic derivative evaluation program
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/581478.581482openalex-snapshot
Monads for incremental computing
inferredcites →https://doi.org/10.1145/800055.802026openalex-snapshot
muFP, a language for VLSI design
inferredcites →https://doi.org/10.1184/r1/6608579openalex-snapshot
Prefix sums and their applications
inferredcites →https://doi.org/10.5860/choice.36-1018openalex-snapshot
Conceptual mathematics: a first introduction to categories
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-03427-6_31openalex-snapshot
Towards Adding Variety to Simplicity
inferred← citeshttps://doi.org/10.1007/978-3-030-67438-0_2openalex-snapshot
On Adding Pattern Matching to Haskell-Based Deeply Embedded Domain Specific Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-79382-1_24openalex-snapshot
Category Theory Framework for Variability Models with Non-functional Requirements
inferred← citeshttps://doi.org/10.1007/978-3-031-24841-2_3openalex-snapshot
Embedding Functional Logic Programming in Haskell via a Compiler Plugin
inferred← citeshttps://doi.org/10.1007/s10485-023-09762-9openalex-snapshot
Algebraic Dynamical Systems in Machine Learning
inferred← citeshttps://doi.org/10.1016/bs.adcom.2021.11.009openalex-snapshot
Embracing the laws of physics: Three reversible models of computation
inferred← citeshttps://doi.org/10.1016/j.jocs.2024.102345openalex-snapshot
Decapodes: A diagrammatic tool for representing, composing, and computing spatialized partial differential equations
inferred← citeshttps://doi.org/10.1016/j.nlm.2021.107552openalex-snapshot
Neural circuits and symbolic processing
inferred← citeshttps://doi.org/10.1017/s095679681900008xopenalex-snapshot
Perturbation confusion in forward automatic differentiation of higher-order functions
inferred← citeshttps://doi.org/10.1017/s0956796825000048openalex-snapshot
Domain-specific tensor languages
inferred← citeshttps://doi.org/10.1109/lca.2022.3198844openalex-snapshot
Structured Combinators for Efficient Graph Reduction
inferred← citeshttps://doi.org/10.1145/3110251openalex-snapshot
Generic functional parallel algorithms: scan and FFT
inferred← citeshttps://doi.org/10.1145/3136040.3136048openalex-snapshot
Rewriting a shallow DSL using a GHC compiler extension
inferred← citeshttps://doi.org/10.1145/3170492.3136048openalex-snapshot
Rewriting a shallow DSL using a GHC compiler extension
inferred← citeshttps://doi.org/10.1145/3236765openalex-snapshot
The simple essence of automatic differentiation
inferred← citeshttps://doi.org/10.1145/3341700openalex-snapshot
Demystifying differentiable programming: shift/reset the penultimate backpropagator
inferred← citeshttps://doi.org/10.1145/3341703openalex-snapshot
Sound and robust solid modeling via exact real arithmetic and continuity
inferred← citeshttps://doi.org/10.1145/3354166.3354185openalex-snapshot
Exponential Elimination for Bicartesian Closed Categorical Combinators
inferred← citeshttps://doi.org/10.1145/3377555.3377889openalex-snapshot
Compiling first-order functions to session-typed parallel code
inferred← citeshttps://doi.org/10.1145/3385412.3385965openalex-snapshot
The essence of Bluespec: a core language for rule-based hardware design
inferred← citeshttps://doi.org/10.1145/3445814.3446720openalex-snapshot
Effective simulation and debugging for a high-level hardware language using software compilers
inferred← citeshttps://doi.org/10.1145/3471874.3472980openalex-snapshot
Evaluating linear functions to symmetric monoidal categories
inferred← citeshttps://doi.org/10.1145/3473587openalex-snapshot
Calculating dependently-typed compilers (functional pearl)
inferred← citeshttps://doi.org/10.1145/3571209openalex-snapshot
Grisette: Symbolic Compilation as a Functional Programming Library
inferred← citeshttps://doi.org/10.1145/3652561.3652568openalex-snapshot
Crafting Extensible Forward Incremental Parallel Embedded Build Systems
inferred← citeshttps://doi.org/10.1145/3677999.3678283openalex-snapshot
Calculating Compilers Effectively (Functional Pearl)
inferred← citeshttps://doi.org/10.1145/3759164.3759347openalex-snapshot
Plinth: A Plugin-Powered Language Built on Haskell (Experience Report)
inferred← citeshttps://doi.org/10.1145/3779031.3779087openalex-snapshot
A Certifying Proof Assistant for Synthetic Mathematics in Lean
inferred← citeshttps://doi.org/10.1145/3798264openalex-snapshot
DeCo: A Core Calculus for Incremental Functional Programming with Generic Data Types
inferred← citeshttps://doi.org/10.1145/3830438.3830956openalex-snapshot
From Lambda to Ledger: An Architectural Comparison of Plinth and Plutarch
inferred← citeshttps://doi.org/10.17760/d20618640openalex-snapshot
Towards compositional probabilistic programming
inferred← citeshttps://doi.org/10.48550/arxiv.1804.00746openalex-snapshot
The simple essence of automatic differentiation
inferred← citeshttps://doi.org/10.48550/arxiv.1810.13430openalex-snapshot
Exceptionally Monadic Error Handling
inferred← citeshttps://doi.org/10.48550/arxiv.1811.03678openalex-snapshot
Embracing the Laws of Physics: Three Reversible Models of Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1908.00898openalex-snapshot
The meaning of a program change is a change to the program's meaning
inferred← citeshttps://doi.org/10.48550/arxiv.1910.11724openalex-snapshot
Embracing a mechanized formalization gap
inferred← citeshttps://doi.org/10.70675/a37dc4e6z2953z4b3bz84ebz71b3bc5bdadcopenalex-snapshot
Sur le pouvoir expressif des structures applicatives et monadiques indexées
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.