Skip to main content Accessibility help
×
Home

HOLCF = HOL + LCF

  • OLAF MÜLLER (a1), TOBIAS NIPKOW (a1), DAVID VON OHEIMB (a1) and OSCAR SLOTOSCH (a1)

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.

Copyright

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

HOLCF = HOL + LCF

  • OLAF MÜLLER (a1), TOBIAS NIPKOW (a1), DAVID VON OHEIMB (a1) and OSCAR SLOTOSCH (a1)
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *