Types for Proofs and Programs
From MaRDI portal
Publication:5712322
DOI10.1007/b98246zbMath1100.68616OpenAlexW4298423642MaRDI QIDQ5712322
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98246
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Coq formalization of the higher-order recursive path ordering ⋮ Certified Kruskal’s Tree Theorem ⋮ A solution to the PoplMark challenge using de Bruijn indices in Isabelle/HOL ⋮ Proof pearl: a formal proof of Higman's lemma in ACL2 ⋮ A Mechanized Proof of Higman’s Lemma by Open Induction ⋮ Higman’s Lemma and Its Computational Content ⋮ Programs from proofs using classical dependent choice
Uses Software
This page was built for publication: Types for Proofs and Programs
