src/HOL/HOLCF/README.html
author haftmann
Sun Jun 23 21:16:07 2013 +0200 (2013-06-23)
changeset 52435 6646bb548c6b
parent 47839 3c54878ed67b
permissions -rw-r--r--
migration from code_(const|type|class|instance) to code_printing and from code_module to code_identifier
webertj@15283
     1
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
webertj@15283
     2
webertj@15582
     3
<html>
clasohm@1341
     4
webertj@15582
     5
<head>
webertj@15582
     6
  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
webertj@15582
     7
  <title>HOLCF/README</title>
webertj@15582
     8
</head>
webertj@15582
     9
webertj@15582
    10
<body>
webertj@15582
    11
webertj@15582
    12
<h3>HOLCF: A higher-order version of LCF based on Isabelle/HOL</h3>
clasohm@1341
    13
nipkow@6034
    14
HOLCF is the definitional extension of Church's Higher-Order Logic with
nipkow@6034
    15
Scott's Logic for Computable Functions that has been implemented in the
nipkow@6034
    16
theorem prover Isabelle.  This results in a flexible setup for reasoning
nipkow@6034
    17
about functional programs. HOLCF supports standard domain theory (in particular
nipkow@6034
    18
fixpoint reasoning and recursive domain equations) but also coinductive
nipkow@6034
    19
arguments about lazy datatypes.
webertj@15582
    20
webertj@15582
    21
<p>
webertj@15582
    22
nipkow@6034
    23
The most recent description of HOLCF is found here:
clasohm@1341
    24
webertj@15582
    25
<ul>
huffman@47839
    26
  <li><a href="http://web.cecs.pdx.edu/~brianh/phdthesis.html">HOLCF '11: A Definitional Domain Theory for Verifying Functional Programs</a>, <br>
huffman@47839
    27
  Brian Huffman.<br>
huffman@47839
    28
  Ph.D. thesis, Portland State University.<br>
huffman@47839
    29
  Year: 2012.
huffman@47839
    30
</ul>
huffman@47839
    31
huffman@47839
    32
Descriptions of earlier versions can also be found online:
huffman@47839
    33
huffman@47839
    34
<ul>
webertj@15582
    35
  <li><a href="/~nipkow/pubs/jfp99.html">HOLCF = HOL+LCF</a>
webertj@15582
    36
</ul>
clasohm@1341
    37
webertj@15582
    38
A detailed description (in German) of the entire development can be found in:
webertj@15582
    39
webertj@15582
    40
<ul>
webertj@15582
    41
  <li><a href="http://www4.informatik.tu-muenchen.de/publ/papers/Diss_Regensbu.pdf">HOLCF: eine konservative Erweiterung von HOL um LCF</a>, <br>
webertj@24567
    42
      Franz Regensburger.<br>
webertj@15582
    43
      Dissertation Technische Universit&auml;t M&uuml;nchen.<br>
webertj@15582
    44
      Year: 1994.
webertj@15582
    45
</ul>
regensbu@1410
    46
wenzelm@3279
    47
A short survey is available in:
webertj@15582
    48
<ul>
webertj@15582
    49
  <li><a href="http://www4.informatik.tu-muenchen.de/publ/papers/Regensburger_HOLT1995.pdf">HOLCF: Higher Order Logic of Computable Functions</a><br>
webertj@15582
    50
</ul>
clasohm@1341
    51
webertj@15582
    52
</body>
webertj@15582
    53
webertj@15582
    54
</html>