src/HOLCF/README.html
changeset 15582 7219facb3fd0
parent 15283 f21466450330
child 24567 4970fb01aa01
equal deleted inserted replaced
15581:f07e865d9d40 15582:7219facb3fd0
     1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
     1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
     2 
     2 
     3 <HTML><HEAD><TITLE>HOLCF/README</TITLE></HEAD><BODY>
     3 <!-- $Id$ -->
     4 
     4 
     5 <H3>HOLCF: A higher-order version of LCF based on Isabelle/HOL</H3>
     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>
     6 
    15 
     7 HOLCF is the definitional extension of Church's Higher-Order Logic with
    16 HOLCF is the definitional extension of Church's Higher-Order Logic with
     8 Scott's Logic for Computable Functions that has been implemented in the
    17 Scott's Logic for Computable Functions that has been implemented in the
     9 theorem prover Isabelle.  This results in a flexible setup for reasoning
    18 theorem prover Isabelle.  This results in a flexible setup for reasoning
    10 about functional programs. HOLCF supports standard domain theory (in particular
    19 about functional programs. HOLCF supports standard domain theory (in particular
    11 fixpoint reasoning and recursive domain equations) but also coinductive
    20 fixpoint reasoning and recursive domain equations) but also coinductive
    12 arguments about lazy datatypes.
    21 arguments about lazy datatypes.
    13 <P>
    22 
       
    23 <p>
       
    24 
    14 The most recent description of HOLCF is found here:
    25 The most recent description of HOLCF is found here:
    15 <UL>
       
    16 <li> <A HREF="/~nipkow/pubs/jfp99.html">HOLCF = HOL+LCF</A>
       
    17 </UL>
       
    18 
    26 
    19 A detailed description (in german) of the entire development can be found in:
    27 <ul>
       
    28   <li><a href="/~nipkow/pubs/jfp99.html">HOLCF = HOL+LCF</a>
       
    29 </ul>
    20 
    30 
    21 <UL>
    31 A detailed description (in German) of the entire development can be found in:
    22   <li> <A HREF="http://www4.informatik.tu-muenchen.de/publ/papers/Diss_Regensbu.pdf"> HOLCF: eine konservative Erweiterung von HOL um LCF</A>, <br>
    32 
    23         <A HREF="http://www4.informatik.tu-muenchen.de/~regensbu/">
    33 <ul>
    24         Franz Regenburger</A>. <br>
    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>
    25         Dissertation Technische Universit&auml;t M&uuml;nchen. <BR>
    35       <a href="http://www4.informatik.tu-muenchen.de/~regensbu/">Franz Regenburger</a>.<br>
    26         Year: 1994.
    36       Dissertation Technische Universit&auml;t M&uuml;nchen.<br>
    27 </UL>
    37       Year: 1994.
       
    38 </ul>
    28 
    39 
    29 A short survey is available in:
    40 A short survey is available in:
    30 <UL>
    41 <ul>
    31 <li><A HREF="http://www4.informatik.tu-muenchen.de/publ/papers/Regensburger_HOLT1995.pdf">HOLCF: Higher Order Logic of Computable Functions</A> <br>
    42   <li><a href="http://www4.informatik.tu-muenchen.de/publ/papers/Regensburger_HOLT1995.pdf">HOLCF: Higher Order Logic of Computable Functions</a><br>
    32 </UL>
    43 </ul>
    33 
    44 
    34 </BODY></HTML>
    45 </body>
       
    46 
       
    47 </html>