Skip to main content
×
×
Home

HOLCF = HOL + LCF

  • OLAF MÜLLER (a1), TOBIAS NIPKOW (a1), DAVID VON OHEIMB (a1) and OSCAR SLOTOSCH (a1)
    • Published online: 01 March 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.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

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

Abstract views

Total abstract views: 198 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 18th August 2018. This data will be updated every 24 hours.

HOLCF = HOL + LCF

  • OLAF MÜLLER (a1), TOBIAS NIPKOW (a1), DAVID VON OHEIMB (a1) and OSCAR SLOTOSCH (a1)
    • Published online: 01 March 1999
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? *