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
|
; 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 "core")
(set-verify-guards-eagerness 2)
(set-case-split-limitations nil)
(set-well-founded-relation ord<)
(set-measure-function rank)
;; Implementing Magic Evaluation
;;
;; Now that we can inspect the global function definitions and arity table, we can
;; make the magic-evaluator executable for the current definitions.
(encapsulate
()
(ACL2::defttag executable-magic-evaluator)
(ACL2::progn!
(ACL2::set-raw-mode t)
(ACL2::defun magic-evaluator (x defs)
(cond ((not (logic.termp x))
(ACL2::er hard 'magic-evaluator "Tried to evaluate a non-term, ~x0.~%" x))
((not (logic.groundp x))
(ACL2::er hard 'magic-evaluator "Tried to evaluate a non-ground term, ~x0.~%" x))
((ACL2::eq defs (tactic.harness->defs (ACL2::w ACL2::*the-live-state*)))
(if (logic.warn-term-atblp x (tactic.harness->atbl (ACL2::w ACL2::*the-live-state*)))
(list 'quote (ACL2::eval x))
(ACL2::er hard 'magic-evaluator "Tried to evaluate a term with improper arity, ~x0.~%" x)))
;((ACL2::eq defs (tactic.harness->syndefs (ACL2::w ACL2::*the-live-state*)))
; ;; BOZO we should check the atbl with respect to the syndefs. We don't even have an
; ;; atbl set up for this. But we could add one and just update it in %syntax-defun-fn.
; (list 'quote (ACL2::eval x)))
(t
(ACL2::er hard 'magic-evaluator "Tried to evaluate with the wrong definitions. ~
Only (tactic.harness->defs (ACL2::w ACL2::state)) or ~
(tactic.harness->syndefs (ACL2::w ACL2::state)) are ~
permitted.~%"))))
;; We were able to redefine the magic-evaluator above because we already had
;; ACL2::eval available to us. But ACL2 has no built-in function for creating
;; a Milawa proof corresponding to an execution. But we can easily introduce
;; one, by modifying the generic-evaluator-bldr to not take a clock.
(ACL2::defun ACL2::eval-bldr (flag x defs)
(if (equal flag 'term)
(cond ((logic.constantp x)
(build.reflexivity x))
((logic.variablep x)
nil)
((logic.functionp x)
(let ((fn (logic.function-name x))
(args (logic.function-args x)))
(if (and (equal fn 'if)
(equal (len args) 3))
(let ((arg1-proof (ACL2::eval-bldr 'term (first args) defs)))
(and arg1-proof
(let ((arg1-prime (logic.=rhs (logic.conclusion arg1-proof))))
(if (logic.unquote arg1-prime)
(let ((arg2-proof (ACL2::eval-bldr 'term (second args) defs)))
(and arg2-proof
(eval-lemma-1-bldr arg1-proof arg2-proof (third args))))
(let ((arg3-proof (ACL2::eval-bldr 'term (third args) defs)))
(and arg3-proof
(eval-lemma-2-bldr arg1-proof arg3-proof (second args))))))))
(let ((aproofs+ (ACL2::eval-bldr 'list args defs)))
(and aproofs+
(let* ((aproofs (cdr aproofs+))
(vals (logic.=rhses (logic.strip-conclusions aproofs))))
(if (memberp fn (domain (logic.initial-arity-table)))
(and (equal (cdr (lookup fn (logic.initial-arity-table))) (len aproofs))
(build.transitivity-of-pequal (build.pequal-by-args fn aproofs)
(build.base-eval (logic.function fn vals))))
(let* ((def (definition-list-lookup fn defs)))
(and def
(let ((formals (logic.function-args (logic.=lhs def)))
(body (logic.=rhs def)))
(and (equal (len formals) (len aproofs))
(let* ((sigma (pair-lists formals vals))
(ground-body (logic.substitute body sigma))
(body-proof (ACL2::eval-bldr 'term ground-body defs)))
(and body-proof
(build.transitivity-of-pequal (build.pequal-by-args fn aproofs)
(build.transitivity-of-pequal
(build.instantiation (build.axiom def) sigma)
body-proof)))))))))))))))
((logic.lambdap x)
(let ((formals (logic.lambda-formals x))
(body (logic.lambda-body x))
(actuals (logic.lambda-actuals x)))
(let ((aproofs+ (ACL2::eval-bldr 'list actuals defs)))
(and aproofs+
(let* ((vals (logic.=rhses (logic.strip-conclusions (cdr aproofs+))))
(sigma (pair-lists formals vals))
(body-proof (ACL2::eval-bldr 'term (logic.substitute body sigma) defs)))
(and body-proof
(build.transitivity-of-pequal (build.transitivity-of-pequal
(build.lambda-pequal-by-args formals body (cdr aproofs+))
(build.beta-reduction formals body vals))
body-proof)))))))
(t nil))
(if (consp x)
(let ((first (ACL2::eval-bldr 'term (car x) defs))
(rest (ACL2::eval-bldr 'list (cdr x) defs)))
(if (and first rest)
(cons t (cons first (cdr rest)))
nil))
(cons t nil))))
(ACL2::defun magic-evaluator-bldr (x defs)
(cond ((not (logic.termp x))
(ACL2::er hard 'magic-evaluator-bldr "Tried to evaluate-bldr a non-term, ~x0.~%" x))
((not (logic.groundp x))
(ACL2::er hard 'magic-evaluator-bldr "Tried to evaluate-bldr a non-ground term, ~x0.~%" x))
((not (logic.warn-term-atblp x (tactic.harness->atbl (ACL2::w ACL2::*the-live-state*))))
(ACL2::er hard 'magic-evaluator-bldr "Tried to evaluate-bldr a term with improper arity, ~x0.~%" x))
(t
(if (ACL2::eq defs (tactic.harness->defs (ACL2::w ACL2::*the-live-state*)))
(ACL2::eval-bldr 'term x defs)
(ACL2::er hard 'magic-evaluator-bldr "Tried to evaluate-bldr with the wrong definitions. ~
Only (tactic.harness->defs (ACL2::w ACL2::state)) ~
are permitted.~%~
Lengths: ~x0 (should be ~x1)~%~
Missing: ~x2 ~%~
Additional: ~x3 ~%~
Defs are equal (but not eq)?: ~x4~%"
(len defs)
(len (tactic.harness->defs (ACL2::w ACL2::*the-live-state*)))
(fast-difference$ (tactic.harness->defs (ACL2::w ACL2::*the-live-state*)) defs nil)
(fast-difference$ defs (tactic.harness->defs (ACL2::w ACL2::*the-live-state*)) nil)
(equal defs (tactic.harness->defs (ACL2::w ACL2::*the-live-state*))))))))))
|
