NameDateSize

..25-Jul-2019169

Adm.thyH A D25-Jul-20197.2 KiB

Algebraic.thyH A D25-Jul-20199.4 KiB

Bifinite.thyH A D25-Jul-201910.2 KiB

Cfun.thyH A D25-Jul-201918.7 KiB

Compact_Basis.thyH A D25-Jul-20193.8 KiB

Completion.thyH A D25-Jul-201915.6 KiB

Cont.thyH A D25-Jul-20197.5 KiB

ConvexPD.thyH A D25-Jul-201924 KiB

Cpodef.thyH A D25-Jul-201910 KiB

Cprod.thyH A D25-Jul-20191.3 KiB

Deflation.thyH A D25-Jul-201913.9 KiB

Discrete.thyH A D25-Jul-2019767

document/H25-Jul-20193

Domain.thyH A D25-Jul-201912.7 KiB

Domain_Aux.thyH A D25-Jul-201912.3 KiB

ex/H25-Jul-201914

Fix.thyH A D25-Jul-20198.4 KiB

Fixrec.thyH A D25-Jul-20198.1 KiB

FOCUS/H25-Jul-20198

Fun_Cpo.thyH A D25-Jul-20194.8 KiB

HOLCF.thyH A D25-Jul-2019247

IMP/H25-Jul-20195

IOA/H25-Jul-201927

Library/H25-Jul-201914

Lift.thyH A D25-Jul-20193.9 KiB

LowerPD.thyH A D25-Jul-201918.6 KiB

Map_Functions.thyH A D25-Jul-201919.8 KiB

One.thyH A D25-Jul-20192.2 KiB

Pcpo.thyH A D25-Jul-20197.7 KiB

Porder.thyH A D25-Jul-201911.4 KiB

Powerdomains.thyH A D25-Jul-20196.9 KiB

Product_Cpo.thyH A D25-Jul-20199.2 KiB

README.htmlH A D25-Jul-20191.7 KiB

Representable.thyH A D25-Jul-201922.3 KiB

Sfun.thyH A D25-Jul-20192 KiB

Sprod.thyH A D25-Jul-20197.9 KiB

Ssum.thyH A D25-Jul-20197.7 KiB

Tools/H25-Jul-20199

Tr.thyH A D25-Jul-20195.6 KiB

Tutorial/H25-Jul-20196

Universal.thyH A D25-Jul-201931.5 KiB

Up.thyH A D25-Jul-20198.1 KiB

UpperPD.thyH A D25-Jul-201918.6 KiB

README.html

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