author webertj
Mon, 07 Mar 2005 19:17:07 +0100
changeset 15582 7219facb3fd0
parent 15283 f21466450330
child 24567 4970fb01aa01
permissions -rw-r--r--
HTML 4.01 Transitional conformity

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "">

<!-- $Id$ -->


  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">


<h3>HOLCF: A higher-order version of LCF based on Isabelle/HOL</h3>

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.


The most recent description of HOLCF is found here:

  <li><a href="/~nipkow/pubs/jfp99.html">HOLCF = HOL+LCF</a>

A detailed description (in German) of the entire development can be found in:

  <li><a href="">HOLCF: eine konservative Erweiterung von HOL um LCF</a>, <br>
      <a href="">Franz Regenburger</a>.<br>
      Dissertation Technische Universit&auml;t M&uuml;nchen.<br>
      Year: 1994.

A short survey is available in:
  <li><a href="">HOLCF: Higher Order Logic of Computable Functions</a><br>