Stop When You Are Almost-Full

DOI10.1007/978-3-642-32347-8_17zbMath1360.68768OpenAlexW16315125MaRDI QIDQ2914747

David Wahlstedt, Thierry Coquand, Dimitrios Vytiniotis

Publication date: 20 September 2012

Published in: Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32347-8_17

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Reverse mathematical bounds for the termination theorem ⋮ Certified Kruskal’s Tree Theorem ⋮ Admissible ordering on monomials is well-founded: a constructive proof ⋮ Unnamed Item ⋮ A Mechanized Proof of Higman’s Lemma by Open Induction ⋮ An intuitionistic version of Ramsey's theorem and its use in program termination ⋮ Constructive decision via redundancy-free proof-search ⋮ RAMSEY’S THEOREM FOR PAIRS ANDKCOLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC

This page was built for publication: Stop When You Are Almost-Full