Mercurial Mercurial > repos > isabelle / file revision
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
src/HOLCF/README.html
author wenzelm
Mon, 22 Oct 2001 17:58:26 +0200
changeset 11880 a625de9ad62a
parent 6034 96ac04a17c56
child 15255 1b860b5d23f8
permissions -rw-r--r--
quick_and_dirty_prove_goalw_cterm;

<HTML><HEAD><TITLE>HOLCF/README</TITLE></HEAD><BODY>

<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.
<P>
The most recent description of HOLCF is found here:
<UL>
<li> <A HREF="/~nipkow/pubs/jfp99.html">HOLCF = HOL+LCF</A>
</UL>

A detailed description (in german) of the entire development can be found in:

<UL>
  <li> <A HREF="http://www4.informatik.tu-muenchen.de/papers/Diss_Regensbu.ps.gz"> HOLCF: eine konservative Erweiterung von HOL um LCF</A>, <br>
        <A HREF="http://www4.informatik.tu-muenchen.de/~regensbu/">
        Franz Regenburger</A>. <br>
        Dissertation Technische Universit&auml;t M&uuml;nchen. <BR>
        Year: 1994.
</UL>

A short survey is available in:
<UL>
<li><A HREF="http://www4.informatik.tu-muenchen.de/papers/Regensburger_HOLT1995.ps.gz">HOLCF: Higher Order Logic of Computable Functions</A> <br>
</UL>

</BODY></HTML>
isabelle