HOLCF = HOL + LCF

摘要

HOLCF is the definitional extension of Church's Higher-Order Logic with Scott's Logic for Computable Functions that has been implemented in the theorem prover Isabelle. This results in a flexible setup for reasoning about functional programs. HOLCF supports standarddo main theory (in particular fix point reasoning and recursive domain equations), but also conductive arguments about lazy data types. This paper describes in detail how domain theory is embedded in HOL, and presents applications from functional programming, concurrency and denotational semantics.