1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
; Milawa - A Reflective Theorem Prover
; Copyright (C) 2005-2009 Kookamara LLC
;
; Contact:
;
; Kookamara LLC
; 11410 Windermere Meadows
; Austin, TX 78759, USA
; http://www.kookamara.com/
;
; License: (An MIT/X11-style license)
;
; Permission is hereby granted, free of charge, to any person obtaining a
; copy of this software and associated documentation files (the "Software"),
; to deal in the Software without restriction, including without limitation
; the rights to use, copy, modify, merge, publish, distribute, sublicense,
; and/or sell copies of the Software, and to permit persons to whom the
; Software is furnished to do so, subject to the following conditions:
;
; The above copyright notice and this permission notice shall be included in
; all copies or substantial portions of the Software.
;
; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
; FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
; AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
; LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
; FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
; DEALINGS IN THE SOFTWARE.
;
; Original author: Jared Davis <jared@kookamara.com>
(in-package "MILAWA")
(include-book "clause-basics")
(%interactive)
(%autoadmit rw.force-modep)
(%autoprove booleanp-of-rw.force-modep
(%enable default rw.force-modep))
(%defaggregate rw.hyp
(term fmode limitp limit)
:require ((logic.termp-of-rw.hyp->term (logic.termp term))
(rw.force-modep-of-rw.hyp->fmode (rw.force-modep fmode))
(booleanp-of-rw.hyp->limitp (booleanp limitp))
(natp-of-rw.hyp->limit (natp limit))))
(%deflist rw.hyp-listp (x)
(rw.hypp x))
(%autoadmit rw.hyp-atblp)
(%autoprove booleanp-of-rw.hyp-atblp
(%enable default rw.hyp-atblp))
(%autoprove forcing-logic.term-atblp-of-rw.hyp
(%enable default rw.hyp-atblp))
(%autoprove rw.hyp-atblp-of-rw.hyp
(%enable default rw.hyp-atblp))
(%autoprove rw.hyp-atblp-of-nil
(%enable default rw.hyp-atblp))
(%deflist rw.hyp-list-atblp (x atbl)
(rw.hyp-atblp x atbl))
(%defprojection :list (rw.hyp-list-terms x)
:element (rw.hyp->term x))
(%autoprove forcing-logic.term-listp-of-rw.hyp-list-terms
(%cdr-induction x))
(%autoprove forcing-logic.term-list-atblp-of-rw.hyp-list-terms
(%cdr-induction x))
(%defaggregate rw.rule
(name type hyps equiv lhs rhs syntax crithyps)
:require ((symbolp-of-rw.rule->name (symbolp name))
(symbolp-of-rw.rule->type (symbolp type))
(rw.hyp-listp-of-rw.rule->hyps (rw.hyp-listp hyps))
(logic.function-namep-of-rw.rule->equiv (logic.function-namep equiv))
(logic.termp-of-rw.rule->lhs (logic.termp lhs))
(logic.termp-of-rw.rule->rhs (logic.termp rhs))
(logic.term-listp-of-rw.rule->syntax (logic.term-listp syntax))
(subsetp-of-rw.rule->crithyps (logic.term-listp crithyps))))
(%deflist rw.rule-listp (x)
(rw.rulep x))
(%deflist rw.rule-list-listp (x)
(rw.rule-listp x))
(%autoprove forcing-rw.rule-listp-of-simple-flatten
(%cdr-induction x))
(%autoadmit rw.rule-atblp)
(%autoprove rw.rule-atblp-of-nil
(%enable default rw.rule-atblp))
(%autoprove booleanp-of-rw.rule-atblp
(%enable default rw.rule-atblp))
(%autoprove forcing-rw.hyp-list-atblp-of-rw.rule->hyps
(%enable default rw.rule-atblp))
(%autoprove forcing-logic.term-atblp-of-rw.rule->lhs
(%enable default rw.rule-atblp))
(%autoprove forcing-logic.term-atblp-of-rw.rule->rhs
(%enable default rw.rule-atblp))
(%autoprove forcing-logic.term-list-atblp-of-rw.rule->crithyps
(%enable default rw.rule-atblp))
(%autoprove forcing-lookup-of-rw.rule-equiv
(%forcingp nil)
(%enable default rw.rule-atblp))
(%autoprove forcing-rw.rule-atblp-of-rw.rule
(%enable default rw.rule-atblp))
(%deflist rw.rule-list-atblp (x atbl)
(rw.rule-atblp x atbl))
(%deflist rw.rule-list-list-atblp (x atbl)
(rw.rule-list-atblp x atbl))
(%autoadmit rw.rule-clause)
(%autoprove consp-of-rw.rule-clause
(%enable default rw.rule-clause))
(%autoprove forcing-logic.term-listp-of-rw.rule-clause
(%enable default rw.rule-clause))
(%autoprove forcing-logic.term-list-atbp-of-rw.rule-clause
(%enable default rw.rule-clause))
(%autoprove forcing-rw.rule-clause-when-no-hyps
(%forcingp nil)
(%enable default rw.rule-clause))
(%defprojection :list (rw.rule-list-clauses x)
:element (rw.rule-clause x))
(%autoprove cons-listp-of-rw.rule-list-clauses
(%cdr-induction x))
(%autoprove forcing-logic.term-list-listp-of-rw.rule-list-clauses
(%cdr-induction x))
(%autoprove forcing-logic.term-list-list-atbp-of-rw.rule-list-clauses
(%cdr-induction x))
(%defprojection :list (rw.rule-list-lhses x)
:element (rw.rule->lhs x))
(%autoprove forcing-logic.term-listp-of-rw.rule-list-lhses
(%cdr-induction x))
(%autoprove forcing-logic.term-list-atblp-of-rw.rule-list-lhses
(%cdr-induction x))
(%defprojection :list (rw.rule-list-names x)
:element (rw.rule->name x))
(%autoprove forcing-symbol-listp-of-rw.rule-list-names
(%cdr-induction x))
(%autoadmit rw.rule-env-okp)
(%autoprove booleanp-of-rw.rule-env-okp
(%enable default rw.rule-env-okp))
(%deflist rw.rule-list-env-okp (x thms)
(rw.rule-env-okp x thms))
(%deflist rw.rule-list-list-env-okp (x thms)
(rw.rule-list-env-okp x thms))
(%autoadmit rw.rule-list-lookup)
(%autoprove rw.rule-list-lookup-when-not-consp
(%restrict default rw.rule-list-lookup (equal rules 'rules)))
(%autoprove rw.rule-list-lookup-of-cons
(%restrict default rw.rule-list-lookup (equal rules '(cons rule rules))))
(%autoprove rw.rulep-of-rw.rule-list-lookup
(%cdr-induction rules))
(%autoprove rw.rule-atblp-of-rw.rule-list-lookup
(%cdr-induction rules))
(%autoprove rw.rule-env-okp-of-rw.rule-list-lookup
(%cdr-induction rules))
(%autoprove rw.rule-list-atblp-of-cdr-of-lookup
(%cdr-induction map))
(%autoprove rw.rule-list-env-okp-of-cdr-of-lookup
(%cdr-induction map))
(%ensure-exactly-these-rules-are-missing "../../rewrite/rulep")
|
