Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics

From MaRDI portal

Revision as of 04:18, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3613407

Jump to:navigation, search

DOI10.1007/11814771_16zbMath1222.68359OpenAlexW1944542258MaRDI QIDQ3613407

Wojciech Moczydłowski, Robert L. Constable

Publication date: 12 March 2009

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814771_16

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (3)

Unifying sets and programs via dependent types ⋮ Extracting the resolution algorithm from a completeness proof for the propositional calculus ⋮ Unifying Sets and Programs via Dependent Types

Uses Software

PVS

This page was built for publication: Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3613407&oldid=17038063"

Pages with script errors