arXiv (All)
open access
Certification of Bilateral Patience Sort in Theorema and Rocq
This is a case study on a specific version of the Patience Sort algorithm in which we illustrate the evolution of it from an intuitive but inefficient nested recursion into a more complex but more efficient tail recursion, together with its formal implementation and certification in Theorema and Roc
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
- Breaking Cycles for Scalable Fair Ordering in Blockchain Systems#820842
- The Orientation Boundary for Step-Duplicating Recursors: A Machine-Checked Structural Theory of Termination Proofs#1155079
- Decidable Formulas Of Intuitionistic Primitive Recursive Arithmetic#764848
- The Encapsulation Asymmetry - Why Recursively Composed Systems Resist Their Own Audit#693084
- Reputation-Based Byzantine-Resilient Vector Consensus without Prespecified Fault Bounds#1014698
Record · ID 1129501
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