On the public citation graph
Beating the Productivity Checker Using Embedded Languages
0 signed · 66 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/11417170_9openalex-snapshot
Filters on CoInductive Streams, an Application to Eratosthenes’ Sieve
inferredcites →https://doi.org/10.1007/11617990openalex-snapshot
Types for proofs and programs : International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004 : revised selected papers
inferredcites →https://doi.org/10.1007/3-540-39185-1_9openalex-snapshot
A Unifying Approach to Recursive and Co-recursive Definitions
inferredcites →https://doi.org/10.1007/3-540-44622-2openalex-snapshot
Computer Science Logic: 14th International Workshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21-26, 2000 Proceedings
inferredcites →https://doi.org/10.1007/3-540-44622-2_21openalex-snapshot
Interactive Programs in Dependent Type Theory
inferredcites →https://doi.org/10.1007/3-540-48256-3openalex-snapshot
Theorem Proving in Higher Order Logics
inferredcites →https://doi.org/10.1007/3-540-48256-3_6openalex-snapshot
Recursive Function Definition over Coinductive Types
inferredcites →https://doi.org/10.1007/3-540-58085-9_72openalex-snapshot
Infinite objects in type theory
inferredcites →https://doi.org/10.1007/978-3-540-74240-1_24openalex-snapshot
Productivity of Stream Definitions
inferredcites →https://doi.org/10.1007/978-3-540-76637-7openalex-snapshot
Programming languages and systems : 5th Asian Symposium, APLAS 2007, Singapore, November 29-December 1, 2007 : proceedings
inferredcites →https://doi.org/10.1007/978-3-540-76637-7_19openalex-snapshot
Mixed Inductive/Coinductive Types and Strong Normalization
inferredcites →https://doi.org/10.1007/978-3-540-89439-1openalex-snapshot
Logic for Programming, Artificial Intelligence, and Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-89439-1_6openalex-snapshot
Data-Oblivious Stream Productivity
inferredcites →https://doi.org/10.1007/978-3-642-02444-3openalex-snapshot
Types for Proofs and Programs
inferredcites →https://doi.org/10.1007/978-3-642-02444-3_14openalex-snapshot
Using Structural Recursion for Corecursion
inferredcites →https://doi.org/10.1007/978-3-642-02444-3_17openalex-snapshot
Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme
inferredcites →https://doi.org/10.1007/978-3-642-13321-3openalex-snapshot
Mathematics of Program Construction
inferredcites →https://doi.org/10.1016/j.apal.2005.05.006openalex-snapshot
A term calculus for (co-)recursive definitions on streamlike data structures
inferredcites →https://doi.org/10.1016/s0304-3975(02)00895-2openalex-snapshot
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
inferredcites →https://doi.org/10.1016/s1571-0661(04)80903-4openalex-snapshot
Generalised Coinduction
inferredcites →https://doi.org/10.1017/s0960129503004122openalex-snapshot
Type-based termination of recursive definitions
inferredcites →https://doi.org/10.1145/1292597.1292601openalex-snapshot
A coinductive monad for prop-bounded recursion
inferredcites →https://doi.org/10.1145/237721.240882openalex-snapshot
Proving the correctness of reactive systems using sized types
inferredcites →https://doi.org/10.1145/69558.69563openalex-snapshot
On the productivity of recursive list definitions
inferredcites →https://doi.org/10.1145/800194.805852openalex-snapshot
Definitional interpreters for higher-order programming languages
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
inferredcites →https://doi.org/10.3233/fi-1998-33401openalex-snapshot
Coinductive Axiomatization of Recursive Type Equality and Subtyping
inferredcites →https://doi.org/10.4230/lipics.mfcs.2023.37openalex-snapshot
Inductive Continuity via Brouwer Trees
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-319-22102-1_27openalex-snapshot
A Mechanized Theory of Regular Trees in Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-25655-4_8openalex-snapshot
Yablo-Like Paradoxes and Co-induction
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_26openalex-snapshot
Circular Coinduction in Coq Using Bisimulation-Up-To Techniques
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100619openalex-snapshot
(Co)inductive proof systems for compositional proofs in reachability logic
inferred← citeshttps://doi.org/10.1017/s0956796813000324openalex-snapshot
On the complexity of stream equality
inferred← citeshttps://doi.org/10.1017/s0956796816000022openalex-snapshot
Well-founded recursion with copatterns and sized types
inferred← citeshttps://doi.org/10.1017/s0960129520000080openalex-snapshot
Denotational semantics for guarded dependent type theory
inferred← citeshttps://doi.org/10.1109/lics.2013.27openalex-snapshot
Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes
inferred← citeshttps://doi.org/10.1109/lics.2017.8005097openalex-snapshot
The clocks are ticking: No more delays!
inferred← citeshttps://doi.org/10.1145/2364527.2364546openalex-snapshot
Operational semantics using the partiality monad
inferred← citeshttps://doi.org/10.1145/2398856.2364546openalex-snapshot
Operational semantics using the partiality monad
inferred← citeshttps://doi.org/10.1145/2500365.2500597openalex-snapshot
Productive coprogramming with guarded recursion
inferred← citeshttps://doi.org/10.1145/2544174.2500597openalex-snapshot
Productive coprogramming with guarded recursion
inferred← citeshttps://doi.org/10.1145/2603088.2603132openalex-snapshot
A type theory for productive coprogramming via guarded recursion
inferred← citeshttps://doi.org/10.1145/3531130.3533359openalex-snapshot
Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
inferred← citeshttps://doi.org/10.1145/3759538.3759654openalex-snapshot
The Conatural Numbers Form an Exponential Commutative Semiring
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.39.649openalex-snapshot
Coinductive Graph Representation: the Problem of Embedded Lists
inferred← citeshttps://doi.org/10.23889/suthesis.54270openalex-snapshot
Integration of the Process Algebra CSP in Dependent Type Theory - Formalisation and Verification
inferred← citeshttps://doi.org/10.3233/fi-2017-1473openalex-snapshot
CoCaml: Functional Programming with Regular Coinductive Types
inferred← citeshttps://doi.org/10.4204/eptcs.43.2openalex-snapshot
MiniAgda: Integrating Sized and Dependent Types
inferred← citeshttps://doi.org/10.4230/lipics.types.2011.55openalex-snapshot
Verification of redecoration for infinite triangular matrices using coinduction
inferred← citeshttps://doi.org/10.5555/3329995.3330032openalex-snapshot
The clocks are ticking: no more delays!: reduction semantics for type theory with guarded recursion
inferred← citeshttps://doi.org/10.70675/5e0f5705z8360z4a62zb884z5db7671051c1openalex-snapshot
A mechanized theory of regular trees in dependent type theory
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.