HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs

HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs

HOLCF is an interactive theorem proving system that uses the mathematics of domain theory to reason about programs written in functional programming languages. This thesis introduces HOLCF '11, a thoroughly revised and extended version of HOLCF that advances the state of the art in program veri...

Full description

Bibliographic Details
Main Author: Huffman, Brian Charles
Format: Others
Published: PDXScholar 2011
Subjects:
Denotational semantics
Theorem proving
Domain theory
Computer programs > Verification
Programming languages (Electronic computers) > Semantics
Functional programming languages
Online Access:https://pdxscholar.library.pdx.edu/open_access_etds/113
https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1112&context=open_access_etds

Internet

https://pdxscholar.library.pdx.edu/open_access_etds/113
https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1112&context=open_access_etds

Similar Items