On the public citation graph
Possibly infinite sequences in theorem provers: A comparative study
0 signed · 28 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-58085-9_77openalex-snapshot
Programming with streams in Coq a case study: The Sieve of Eratosthenes
inferredcites →https://doi.org/10.1007/3-540-60275-5_72openalex-snapshot
HOLCF: Higher order logic of computable functions
inferredcites →https://doi.org/10.1007/3-540-61042-1_48openalex-snapshot
Formal verification of a partial-order reduction technique for model checking
inferredcites →https://doi.org/10.1007/bfb0026991openalex-snapshot
Proof principles for datatypes with iterated recursion
inferredcites →https://doi.org/10.1007/bfb0030627openalex-snapshot
Traces of I/O-automata in Isabelle/HOLCF
inferredcites →https://doi.org/10.1016/0168-0072(96)88189-9openalex-snapshot
Computation on abstract data types. The extensional approach, with an application to streams
inferredcites →https://doi.org/10.1093/logcom/7.2.175openalex-snapshot
Mechanizing coinduction and corecursion in higher-order logic
inferredcites →https://doi.org/10.1109/32.345827openalex-snapshot
Formal verification for fault-tolerant architectures: prolegomena to the design of PVS
inferredcites →https://doi.org/10.1145/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.7146/brics.v1i44.21598openalex-snapshot
A HOL Basis for Reasoning about Functional Programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_18openalex-snapshot
From I/O Automata to Timed I/O Automata
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_6openalex-snapshot
Recursive Function Definition over Coinductive Types
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_22openalex-snapshot
Recursive Functions on Lazy Lists via Domains and Topologies
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_2openalex-snapshot
Automating Theorem Proving with SMT
inferred← citeshttps://doi.org/10.1007/bfb0055129openalex-snapshot
The village telephone system: A case study in formal software engineering
inferred← citeshttps://doi.org/10.1007/bfb0055145openalex-snapshot
I/O automata and beyond: Temporal logic and abstraction in Isabelle
inferred← citeshttps://doi.org/10.1007/s001650050009openalex-snapshot
Winskel is (almost) Right: Towards a Mechanized Semantics Textbook
inferred← citeshttps://doi.org/10.1023/a:1008764923992openalex-snapshot
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
inferred← citeshttps://doi.org/10.1093/comjnl/40.10.640openalex-snapshot
Treating Partiality in a Logic of Total Functions
inferred← citeshttps://doi.org/10.1145/1024922.1024923openalex-snapshot
A theory of normed simulations
inferred← citeshttps://doi.org/10.14279/depositonce-3974openalex-snapshot
Modeling and verification of distributed algorithms in theorem proving environments
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.