author nipkow
Fri, 18 Dec 1998 19:43:10 +0100
changeset 6034 96ac04a17c56
parent 3279 815ef5848324
child 15255 1b860b5d23f8
permissions -rw-r--r--
Link to HOLCF paper added.


<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>