HOLCF = HOL + LCF

Olaf Müller, Tobias Nipkow, David Von Oheimb, Oscar Slotosch

Research output: Contribution to journalArticlepeer-review

36 Scopus citations

Abstract

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 standard domain theory (in particular fixpoint reasoning and recursive domain equations), but also coinductive arguments about lazy datatypes. This paper describes in detail how domain theory is embedded in HOL, and presents applications from functional programming, concurrency and denotational semantics.

Original languageEnglish
Pages (from-to)191-223
Number of pages33
JournalJournal of Functional Programming
Volume9
Issue number2
DOIs
StatePublished - Mar 1999

Fingerprint

Dive into the research topics of 'HOLCF = HOL + LCF'. Together they form a unique fingerprint.

Cite this