arXiv (All)
open access
The Formalization of two Computational Models in Dafny
We describe the formalization in Dafny of two computational models, Turing Machines and the Lambda Calculus. We present several application of the formalizations: machine proofs of termination for Turing machines, Dafny proofs for Church encodings, and a mechanized proof of the Church-Rosser theorem
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
- Proving Completeness in Kripke 1959’s Thesis via Banach-Tarski Decomposition and Incompleteness of Kripke’s Semantics with Th-Framework#728729
- Indiscernibles and satisfaction classes in arithmetic#986068
- Refuting Incompleteness and Undefinability#760253
- On Not Saying What We Shouldn't Have to Say#749109
- Peter D. Mosses, _Action Semantics_#73527
Record · ID 1129495
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