On the public citation graph
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction
0 signed · 44 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-44622-2_21openalex-snapshot
Interactive Programs in Dependent 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.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0168-0072(91)90069-xopenalex-snapshot
Inductive types and type constraints in the second-order lambda calculus
inferredcites →https://doi.org/10.1016/j.entcs.2009.07.081openalex-snapshot
Continuous Functions on Final Coalgebras
inferredcites →https://doi.org/10.1016/j.ic.2007.12.004openalex-snapshot
Coinductive big-step operational semantics
inferredcites →https://doi.org/10.1016/s0304-3975(01)00094-9openalex-snapshot
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
inferredcites →https://doi.org/10.1051/ita:1999125openalex-snapshot
A note on Coinduction and Weak Bisimilarity for While Programs
inferredcites →https://doi.org/10.21236/ada220285openalex-snapshot
Semantic Domains and Denotational Semantics
inferredcites →https://doi.org/10.2168/lmcs-1(2:1)2005openalex-snapshot
General Recursion via Coinductive Types
inferredcites →https://doi.org/10.2168/lmcs-11(1:1)2015openalex-snapshot
A Hoare logic for the coinductive trace-based big-step semantics of While
inferredcites →https://doi.org/10.4230/lipics.mfcs.2023.37openalex-snapshot
Inductive Continuity via Brouwer Trees
inferredcites →https://doi.org/10.7146/dpb.v18i276.7630openalex-snapshot
Semantic Domains and Denotational Semantics
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-02508-3_11openalex-snapshot
A Metalanguage for Guarded Iteration
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-3-642-25318-8_26openalex-snapshot
A Proof Pearl with the Fan Theorem and Bar Induction
inferred← citeshttps://doi.org/10.1007/978-3-642-32037-8_2openalex-snapshot
Subtyping by Folding an Inductive Relation into a Coinductive One
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_12openalex-snapshot
Permutations in Coinductive Graph Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_28openalex-snapshot
Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_27openalex-snapshot
Program Extraction from Nested Definitions
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.10.015openalex-snapshot
The Coinductive Resumption Monad
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.1016/j.tcs.2021.04.005openalex-snapshot
A metalanguage for guarded iteration
inferred← citeshttps://doi.org/10.1017/s0960129516000104openalex-snapshot
A realizability interpretation of Church's simple theory of types
inferred← citeshttps://doi.org/10.1093/logcom/exv091openalex-snapshot
Well-definedness and observational equivalence for inductive–coinductive programs
inferred← citeshttps://doi.org/10.1145/2048066.2048141openalex-snapshot
A syntactic type system for recursive modules
inferred← citeshttps://doi.org/10.1145/2076021.2048141openalex-snapshot
A syntactic type system for recursive modules
inferred← citeshttps://doi.org/10.1145/2364406.2364411openalex-snapshot
A supposedly fun thing i may have to do again
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/3133905openalex-snapshot
Reasoning on divergent computations with coaxioms
inferred← citeshttps://doi.org/10.1145/3371119openalex-snapshot
Interaction trees: representing recursive and impure programs in Coq
inferred← citeshttps://doi.org/10.1145/3776714openalex-snapshot
A Family of Sims with Diverging Interests
inferred← citeshttps://doi.org/10.2168/lmcs-11(1:1)2015openalex-snapshot
A Hoare logic for the coinductive trace-based big-step semantics of While
inferred← citeshttps://doi.org/10.2168/lmcs-8(4:4)2012openalex-snapshot
On streams that are finitely red
inferred← citeshttps://doi.org/10.23638/lmcs-16(1:31)2020openalex-snapshot
A new coinductive confluence proof for infinitary lambda calculus
inferred← citeshttps://doi.org/10.4204/eptcs.137.6openalex-snapshot
Coinductive Big-Step Semantics for Concurrency
inferred← citeshttps://doi.org/10.4204/eptcs.66.12openalex-snapshot
Resumption-based big-step and small-step interpreters for While with interactive I/O
inferred← citeshttps://doi.org/10.48550/arxiv.1501.04354openalex-snapshot
Coinduction: an elementary approach
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.