src/HOLCF/README.html
author huffman
Mon May 11 08:28:09 2009 -0700 (2009-05-11)
changeset 31095 b79d140f6d0b
parent 24567 4970fb01aa01
child 35174 e15040ae75d7
permissions -rw-r--r--
simplify fixrec proofs for mutually-recursive definitions; generate better fixpoint induction rules
     1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
     2 
     3 <!-- $Id$ -->
     4 
     5 <html>
     6 
     7 <head>
     8   <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
     9   <title>HOLCF/README</title>
    10 </head>
    11 
    12 <body>
    13 
    14 <h3>HOLCF: A higher-order version of LCF based on Isabelle/HOL</h3>
    15 
    16 HOLCF is the definitional extension of Church's Higher-Order Logic with
    17 Scott's Logic for Computable Functions that has been implemented in the
    18 theorem prover Isabelle.  This results in a flexible setup for reasoning
    19 about functional programs. HOLCF supports standard domain theory (in particular
    20 fixpoint reasoning and recursive domain equations) but also coinductive
    21 arguments about lazy datatypes.
    22 
    23 <p>
    24 
    25 The most recent description of HOLCF is found here:
    26 
    27 <ul>
    28   <li><a href="/~nipkow/pubs/jfp99.html">HOLCF = HOL+LCF</a>
    29 </ul>
    30 
    31 A detailed description (in German) of the entire development can be found in:
    32 
    33 <ul>
    34   <li><a href="http://www4.informatik.tu-muenchen.de/publ/papers/Diss_Regensbu.pdf">HOLCF: eine konservative Erweiterung von HOL um LCF</a>, <br>
    35       Franz Regensburger.<br>
    36       Dissertation Technische Universit&auml;t M&uuml;nchen.<br>
    37       Year: 1994.
    38 </ul>
    39 
    40 A short survey is available in:
    41 <ul>
    42   <li><a href="http://www4.informatik.tu-muenchen.de/publ/papers/Regensburger_HOLT1995.pdf">HOLCF: Higher Order Logic of Computable Functions</a><br>
    43 </ul>
    44 
    45 </body>
    46 
    47 </html>