Debian Codegraph @

theories/READ-ME

raw
1 + ===================================================================== +
2 | HOL DISTRIBUTION DIRECTORY: theories |
3 + ===================================================================== +
4
5 This directory contains the files needed to rebuild all the built-in HOL
6 theories. The theory files themselves are also kept here.
7
8 Theory Hierarchy for BASIC-HOL is:
9
10
11
12
13 PPLAMB
14 |
15 |
16 bool
17 |
18 |
19 ind
20 |
21 |
22 BASIC-HOL
23
24
25 Where these theories are:
26
27 PPLAMB - The interface to the LCF world. HOL users don't need
28 to know about this.
29
30 bool - Introduces the type ":bool" and the constants "==>", "="
31 and "@". Contains the definitions of the logical constants
32 ("T", "!", "?", "/\", \/", "<=>", "F", "~", "LET", "COND",
33 "FCOND", "ONE_ONE" and "ONTO"). Introduces the axioms of HOL.
34 The type ":prod" is also introduced in the theory bool,
35 together with the pairing functions "$,", "FST" and "SND".
36 For boring reasons to do with how the system is build
37 pairing can't be in a separate theory with `bool` as
38 parent (see hol/theories/mk_bool.ml for details).
39
40 ind - Introduces the type ":ind" and the Axiom of Infinity.
41
42 BASIC-HOL - A dummy theory which is what you are in when you run
43 the basic-hol system (HOL users can ignore this).
44
45
46 The HOL system is built on top of BASIC-HOL, which is a parent to all the
47 theories described below. The theory hierarchy for HOL is:
48
49 num
50 |
51 |
52 prim_rec
53 |
54 |
55 arithmetic combin
56 | |
57 | |
58 list ---------
59 | | |
60 | | sum one
61 tree | | |
62 | | | |
63 --------| | | |
64 | | | |
65 ltree | |
66 | | |
67 | | |
68 tydefs | |
69 | | |
70 | | |
71 --------- | ----------
72 | | |
73 | | |
74 HOL
75
76 Where these theories are
77
78 combin - defines the combinators o, K, S, I.
79
80 sum - defines the disjoint sum type operator
81
82 one - defines the type :one with only one element
83
84 num - Defines the type ":num" and the constants "0" and "SUC".
85 Has Peano's Axioms as theorems.
86
87 prim_rec - Defines "<" and contains the Primitive Recursion Theorem
88 (together with several trivial about numbers that are needed
89 in proving it).
90
91 arithmetic - Defines "+", "-", "*", "/", ">", "<=", ">=" and contains
92 various theorems about them.
93
94 list - Defines the type ":list" and the constants "NIL",
95 "CONS", "HD", "TL", "NULL" and various others. Contains
96 various theorems including structural induction.
97
98 tree - defines the type :tree of arbitrary-branching trees. Used
99 to automate recursive type definitions.
100
101 ltree - defines the type :(*)ltree of arbitrary-branching LABELLED
102 trees. Used to automate recursive type definitions.
103
104 tydefs - contains the proof of a "master theorem" for automating
105 recursive type definitions.
106
107 HOL - The theory you are in when starting up a hol system.
108
109