On the public citation graph

Embedding by Unembedding

https://doi.org/10.1145/3607830
0 signed · 81 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-53507-1_93openalex-snapshot
Foundations of canonical update support for closed database views
inferredcites →https://doi.org/10.1007/978-3-030-17184-1_20openalex-snapshot
Incremental $$\lambda $$ -Calculus in Cache-Transfer Style
inferredcites →https://doi.org/10.1007/978-3-030-45231-5_17openalex-snapshot
Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_2openalex-snapshot
HOBiT: Programming Lenses Without Using Lens Combinators
inferredcites →https://doi.org/10.1007/978-3-319-90686-7_7openalex-snapshot
Polymorphic Rewrite Rules: Confluence, Type Inference, and Instance Validation
inferredcites →https://doi.org/10.1007/978-3-540-88643-3_10openalex-snapshot
A Landscape of Bidirectional Model Transformations
inferredcites →https://doi.org/10.1007/978-3-642-02273-9_5openalex-snapshot
Syntax for Free: Representing Syntax with Binding Using Parametricity
inferredcites →https://doi.org/10.1007/978-3-642-13321-3_22openalex-snapshot
Gradual Refinement
inferredcites →https://doi.org/10.1007/978-3-642-15205-4_26openalex-snapshot
Second-Order Equational Logic (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-642-29517-1_2openalex-snapshot
Towards a Reversible Functional Language
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_6openalex-snapshot
FliPpr: A Prettier Invertible Printing System
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_19openalex-snapshot
Programs Using Syntax with First-Class Binders
inferredcites →https://doi.org/10.1007/bf00264598openalex-snapshot
Proving and applying program transformations expressed with second-order patterns
inferredcites →https://doi.org/10.1007/bfb0053552openalex-snapshot
Functor categories and two-level languages
inferredcites →https://doi.org/10.1007/s00354-018-0033-7openalex-snapshot
FliPpr: A System for Deriving Parsers from Pretty-Printers
inferredcites →https://doi.org/10.1016/j.scico.2012.07.014openalex-snapshot
Refactoring pattern matching
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.002openalex-snapshot
A structural approach to reversible computation
inferredcites →https://doi.org/10.1016/s0304-3975(03)00392-xopenalex-snapshot
The differential lambda-calculus
inferredcites →https://doi.org/10.1017/s0956796809007205openalex-snapshot
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
inferredcites →https://doi.org/10.1017/s0956796814000033openalex-snapshot
Implicit self-adjusting computation for purely functional programs
inferredcites →https://doi.org/10.1017/s0956796818000096openalex-snapshot
Applicative bidirectional programming
inferredcites →https://doi.org/10.1017/s0956796819000157openalex-snapshot
How to prove decidability of equational theories with second-order computation analyser SOL
inferredcites →https://doi.org/10.1023/a:1026193328134openalex-snapshot
Preface
inferredcites →https://doi.org/10.1109/icde.2010.5447896openalex-snapshot
Propagating updates through XML views using lineage tracing
inferredcites →https://doi.org/10.1109/icse.2012.6227162openalex-snapshot
Maintaining invariant traceability through bidirectional transformations
inferredcites →https://doi.org/10.1109/lics.1999.782615openalex-snapshot
Abstract syntax and variable binding
inferredcites →https://doi.org/10.1145/1017472.1017488openalex-snapshot
Strongly typed heterogeneous collections
inferredcites →https://doi.org/10.1145/1040305.1040325openalex-snapshot
Combinators for bi-directional tree transformations
inferredcites →https://doi.org/10.1145/1186632.1186634openalex-snapshot
Adaptive functional programming
inferredcites →https://doi.org/10.1145/1232420.1232424openalex-snapshot
Combinators for bidirectional tree transformations
inferredcites →https://doi.org/10.1145/1273442.1250770openalex-snapshot
DITTO
inferredcites →https://doi.org/10.1145/1321631.1321657openalex-snapshot
Towards automatic model synchronization from model transformations
inferredcites →https://doi.org/10.1145/1328438.1328483openalex-snapshot
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
inferredcites →https://doi.org/10.1145/1411204.1411226openalex-snapshot
Parametric higher-order abstract syntax for mechanized semantics
inferredcites →https://doi.org/10.1145/1480881.1480904openalex-snapshot
Bidirectionalization for free! (Pearl)
inferredcites →https://doi.org/10.1145/1542476.1542480openalex-snapshot
CEAL
inferredcites →https://doi.org/10.1145/154630.154643openalex-snapshot
Towards an automated tupling strategy
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/1596638.1596644openalex-snapshot
Unembedding domain-specific languages
inferredcites →https://doi.org/10.1145/165180.165214openalex-snapshot
A short cut to deforestation
inferredcites →https://doi.org/10.1145/2254064.2254100openalex-snapshot
Type-directed automatic incrementalization
inferredcites →https://doi.org/10.1145/2364474.2364488openalex-snapshot
An embedded DSL for stochastic processes
inferredcites →https://doi.org/10.1145/237721.237792openalex-snapshot
Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space)
inferredcites →https://doi.org/10.1145/2429376.2429382openalex-snapshot
Streaming big data with self-adjusting computation
inferredcites →https://doi.org/10.1145/2500365.2500595openalex-snapshot
Optimising purely functional GPU programs
inferredcites →https://doi.org/10.1145/2594291.2594304openalex-snapshot
A theory of changes for higher-order languages
inferredcites →https://doi.org/10.1145/2692915.2628138openalex-snapshot
Folding domain-specific languages
inferredcites →https://doi.org/10.1145/2784731.2784750openalex-snapshot
Applicative bidirectional programming with lenses
inferredcites →https://doi.org/10.1145/2804302.2804309openalex-snapshot
Embedding a full linear Lambda calculus in Haskell
inferredcites →https://doi.org/10.1145/2804302.2804316openalex-snapshot
Bridging the GUI gap with reactive values and relations
inferredcites →https://doi.org/10.1145/3110271openalex-snapshot
Compiling to categories
inferredcites →https://doi.org/10.1145/3158089openalex-snapshot
Synthesizing bijective lenses
inferredcites →https://doi.org/10.1145/3158093openalex-snapshot
Linear Haskell: practical linearity in a higher-order polymorphic language
inferredcites →https://doi.org/10.1145/317636.317794openalex-snapshot
Haskell and XML
inferredcites →https://doi.org/10.1145/319628.319634openalex-snapshot
Update semantics of relational views
inferredcites →https://doi.org/10.1145/3242744.3242758openalex-snapshot
Embedding invertible languages with binders: a case of the FliPpr language
inferredcites →https://doi.org/10.1145/3341700openalex-snapshot
Demystifying differentiable programming: shift/reset the penultimate backpropagator
inferredcites →https://doi.org/10.1145/3409000openalex-snapshot
Sparcl: a language for partially-invertible computation
inferredcites →https://doi.org/10.1145/3434284openalex-snapshot
𝜆ₛ: computable semantics for differentiable programming with higher-order functions and datatypes
inferredcites →https://doi.org/10.1145/3434290openalex-snapshot
A computational interpretation of compact closed categories: reversible programming with negative and fractional types
inferredcites →https://doi.org/10.1145/3434309openalex-snapshot
Automatic differentiation in PCF
inferredcites →https://doi.org/10.1145/3498710openalex-snapshot
Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation
inferredcites →https://doi.org/10.1145/3609026.3609729openalex-snapshot
Effect Handlers for Programmable Inference
inferredcites →https://doi.org/10.1145/53990.54010openalex-snapshot
Higher-order abstract syntax
inferredcites →https://doi.org/10.1145/636517.636528openalex-snapshot
Template meta-programming for Haskell
inferredcites →https://doi.org/10.1145/99370.99404openalex-snapshot
Theorems for free!
inferredcites →https://doi.org/10.14279/tuj.eceasst.57.879openalex-snapshot
Lenses for Web Data
inferredcites →https://doi.org/10.14778/3377369.3377380openalex-snapshot
Programmable view update strategies on relations
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.4204/eptcs.294.2openalex-snapshot
Effects Without Monads: Non-determinism – Back to the Meta Language

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-032-22723-2_2openalex-snapshot
Lenses for Partially-Specified States
inferred← citeshttps://doi.org/10.1109/icnepe67923.2025.11384638openalex-snapshot
Transmission Line Fault Identification Method Based on Markov Graph and Multi-Source Information Fusion
inferred← citeshttps://doi.org/10.1145/3609026openalex-snapshot
Proceedings of the 16th ACM SIGPLAN International Haskell Symposium
inferred← citeshttps://doi.org/10.1145/3609026.3609729openalex-snapshot
Effect Handlers for Programmable Inference
inferred← citeshttps://doi.org/10.1145/3652561.3652568openalex-snapshot
Crafting Extensible Forward Incremental Parallel Embedded Build Systems
inferred← citeshttps://doi.org/10.1145/3756907.3756923openalex-snapshot
Shallowly Embedded Functions
inferred← citeshttps://doi.org/10.1145/3759164.3759348openalex-snapshot
Rebound: Efficient, Expressive, and Well-Scoped Binding
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/3808269openalex-snapshot
Contextual Embeddings: Implementing Bound Variables through Instance Resolution
inferred← citeshttps://doi.org/10.1145/3828692openalex-snapshot
Animated Pictures for Slide Presentations: From the Shallows to the Depths of a Domain-Specific Language (Functional Pearl)
inferred← citeshttps://doi.org/10.1145/3838790.3838793openalex-snapshot
Effects with Variable Binding
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.