HOLCF/README

diff -r f07e865d9d40 -r 7219facb3fd0 src/HOLCF/README.html --- a/src/HOLCF/README.html Mon Mar 07 18:40:36 2005 +0100 +++ b/src/HOLCF/README.html Mon Mar 07 19:17:07 2005 +0100 @@ -1,8 +1,17 @@ -HOLCF/README + + + -

HOLCF: A higher-order version of LCF based on Isabelle/HOL

+ + + HOLCF/README + + + + +

HOLCF: A higher-order version of LCF based on Isabelle/HOL

HOLCF is the definitional extension of Church's Higher-Order Logic with Scott's Logic for Computable Functions that has been implemented in the @@ -10,25 +19,29 @@ about functional programs. HOLCF supports standard domain theory (in particular fixpoint reasoning and recursive domain equations) but also coinductive arguments about lazy datatypes. -

+ +

+ The most recent description of HOLCF is found here: -

HOLCF = HOL+LCF -

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

HOLCF = HOL+LCF +

HOLCF: eine konservative Erweiterung von HOL um LCF,
- - Franz Regenburger.
- Dissertation Technische Universität München.
- Year: 1994. -

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

HOLCF: eine konservative Erweiterung von HOL um LCF,
+ Franz Regenburger.
+ Dissertation Technische Universität München.
+ Year: 1994. +

A short survey is available in: -

HOLCF: Higher Order Logic of Computable Functions
-

HOLCF: Higher Order Logic of Computable Functions
+

- + + +