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