<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<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/publ/papers/Diss_Regensbu.pdf"> 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ät München. <BR>
Year: 1994.
</UL>
A short survey is available in:
<UL>
<li><A HREF="http://www4.informatik.tu-muenchen.de/publ/papers/Regensburger_HOLT1995.pdf">HOLCF: Higher Order Logic of Computable Functions</A> <br>
</UL>
</BODY></HTML>