arXiv (All)
open access
Domain Theory Meets Interaction Trees in Rocq
We present a domain-theoretical formalization of interaction trees in the Rocq prover. Unlike existing formalizations, ours does not rely on Rocq's built-in coinduction. Hence, we avoid complications occurring in earlier works, such as artificially including silent steps to comply with Rocq's produ
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Planning to Hammer: Difficulty-Aware Decomposition for Automating Rocq Proofs#282847
- On Reasoning-Centric LLM-based Automated Theorem Proving#124126
- Formal Verification of Proofs from Automated Theorem Provers for Higher-Order Logic#1051004
- A Formalisation of a Special Case of the Union-Closed Conjecture in Isabelle/HOL#1034850
- Abstract computation over first-order structures. Extras: From programs to decision trees I#658996
Record · ID 1129500
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive