On the public citation graph

Termination Checking in the Presence of Nested Inductive and Coinductive Types

0 signed · 17 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.1017/s0956796801004191openalex-snapshot

A predicative analysis of structural recursion

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-06410-9_27openalex-snapshot

Co-induction Simply

inferred← citeshttps://doi.org/10.1017/s0956796816000022openalex-snapshot

Well-founded recursion with copatterns and sized types

inferred← citeshttps://doi.org/10.1017/s0956796816000319openalex-snapshot

Interactive programming in Agda – Objects and graphical user interfaces

inferred← citeshttps://doi.org/10.1145/1863543.1863585openalex-snapshot

Total parser combinators

inferred← citeshttps://doi.org/10.1145/1932681.1863585openalex-snapshot

Total parser combinators

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/2429069.2429075openalex-snapshot

Copatterns

inferred← citeshttps://doi.org/10.1145/2480359.2429075openalex-snapshot

Copatterns

inferred← citeshttps://doi.org/10.1145/2500365.2500591openalex-snapshot

Wellfounded recursion with copatterns

inferred← citeshttps://doi.org/10.1145/2544174.2500591openalex-snapshot

Wellfounded recursion with copatterns

inferred← citeshttps://doi.org/10.29007/l41fopenalex-snapshot

Beating the Productivity Checker Using Embedded Languages

inferred← citeshttps://doi.org/10.4204/eptcs.153.4openalex-snapshot

Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types

inferred← citeshttps://doi.org/10.4204/eptcs.43.3openalex-snapshot

Beating the Productivity Checker Using Embedded Languages

inferred← citeshttps://doi.org/10.46298/lmcs-17(3:13)2021openalex-snapshot

Infinite Types, Infinite Data, Infinite Interaction

inferred← citeshttps://doi.org/10.46298/lmcs-21(3:20)2025openalex-snapshot

The Size-Change Principle for Mixed Inductive and Coinductive 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.