Department of Informatics

TU München - Fakultät für Informatik
Chair IV: Software & Systems Engineering

TUM
 
PDF-Datei  HOLCF = HOL + LCF

Article

Journal:Journal of Functional Programming
Author:
Number:9(2)
Pages:191 - 223
Publisher:Cambridge University Press
Year:1999
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.
 See also JFP Volume 9
 
BibTeX

(c) 1999-2006 - Lehrstuhl Software & Systems Engineering
Sitemap |  Contact