On the public citation graph
Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types
0 signed · 40 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-47018-2_16openalex-snapshot
Type-Directed Partial Evaluation
inferredcites →https://doi.org/10.1007/3-540-58085-9_72openalex-snapshot
Infinite objects in type theory
inferredcites →https://doi.org/10.1007/3-540-60579-7_3openalex-snapshot
Codifying guarded definitions with recursive schemes
inferredcites →https://doi.org/10.1007/978-3-540-70594-9_4openalex-snapshot
Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory
inferredcites →https://doi.org/10.1007/bf01091743openalex-snapshot
Finite investigations of transfinite derivations
inferredcites →https://doi.org/10.1016/j.apal.2004.10.003openalex-snapshot
Continuous normalization for the lambda-calculus and Gödel’s T
inferredcites →https://doi.org/10.1017/s0956796801004191openalex-snapshot
A predicative analysis of structural recursion
inferredcites →https://doi.org/10.1109/lics.1991.151645openalex-snapshot
An inverse of the evaluation functional for typed lambda -calculus
inferredcites →https://doi.org/10.1145/1863597.1863601openalex-snapshot
Hereditary substitutions for simple types, formalized
inferredcites →https://doi.org/10.1145/2364527.2364546openalex-snapshot
Operational semantics using the partiality monad
inferredcites →https://doi.org/10.1145/237721.237784openalex-snapshot
Type-directed partial evaluation
inferredcites →https://doi.org/10.1145/2500365.2500591openalex-snapshot
Wellfounded recursion with copatterns
inferredcites →https://doi.org/10.1145/581478.581501openalex-snapshot
A compiled implementation of strong reduction
inferredcites →https://doi.org/10.21236/ada418517openalex-snapshot
A Concurrent Logical Framework I: Judgments and Properties
inferredcites →https://doi.org/10.2168/lmcs-1(2:1)2005openalex-snapshot
General Recursion via Coinductive Types
inferredcites →https://doi.org/10.29007/n51dopenalex-snapshot
Termination Checking in the Presence of Nested Inductive and Coinductive Types
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-33636-3_13openalex-snapshot
En Garde! Unguarded Iteration for Reversible Computation in the Delay Monad
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_3openalex-snapshot
Reconciling Partial and Local Invertibility
inferred← citeshttps://doi.org/10.1007/978-3-031-99751-8_4openalex-snapshot
Heapless Functional Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-19797-5_13openalex-snapshot
Turing-Completeness Totally Free
inferred← citeshttps://doi.org/10.1007/978-3-319-40370-0_2openalex-snapshot
Compositional Coinduction with Sized Types
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_4openalex-snapshot
Building a Correct-by-Construction Type Checker for a Dependently Typed Core Language
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.05.001openalex-snapshot
Flag-based big-step semantics
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102492openalex-snapshot
A big step from finite to infinite computations
inferred← citeshttps://doi.org/10.1017/s0956796819000170openalex-snapshot
POPLMark reloaded: Mechanizing proofs by logical relations
inferred← citeshttps://doi.org/10.1017/s0956796823000126openalex-snapshot
Sparcl : A language for partially invertible computation
inferred← citeshttps://doi.org/10.1145/2678015.2682545openalex-snapshot
Imperative Polymorphism by Store-Based Types as Abstract Interpretations
inferred← citeshttps://doi.org/10.1145/3167091openalex-snapshot
A Coq formalization of normalization by evaluation for Martin-Löf type theory
inferred← citeshttps://doi.org/10.1145/3176245.3167091openalex-snapshot
A Coq formalization of normalization by evaluation for Martin-Löf type theory
inferred← citeshttps://doi.org/10.1145/3236950.3236965openalex-snapshot
An Internalist Approach to Correct-by-Construction Compilers
inferred← citeshttps://doi.org/10.1145/3372885.3373818openalex-snapshot
Intrinsically-typed definitional interpreters for linear, session-typed languages
inferred← citeshttps://doi.org/10.1145/3409000openalex-snapshot
Sparcl: a language for partially-invertible computation
inferred← citeshttps://doi.org/10.1145/3678000.3678202openalex-snapshot
Modal μ-Calculus for Free in Agda
inferred← citeshttps://doi.org/10.1145/3759427.3760377openalex-snapshot
Generic Reduction-Based Interpreters
inferred← citeshttps://doi.org/10.1145/3759538.3759654openalex-snapshot
The Conatural Numbers Form an Exponential Commutative Semiring
inferred← citeshttps://doi.org/10.1145/3776733openalex-snapshot
Coco: Corecursion with Compositional Heterogeneous Productivity
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.