/usr/share/acl2-4.3/books/tools/rulesets.lisp is in acl2-books-source 4.3-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 | (in-package "ACL2")
(program)
(defun get-ruleset (name world)
(let* ((ruleset-alist (table-alist 'ruleset-table world)))
(cdr (assoc name ruleset-alist))))
(defmacro ruleset (name)
`(get-ruleset ,name world))
(defun is-ruleset (name world)
(let* ((ruleset-alist (table-alist 'ruleset-table world)))
(consp (assoc name ruleset-alist))))
(defun ruleset-designatorp (x world)
(cond ((or (symbolp x)
(and (consp x)
(not (keywordp (car x)))))
(theoryp! (list x) world))
((runep x world) t)
((and (consp x) (symbolp (car x)) (eq (cdr x) nil)) t)
(t (and (consp x)
(case-match x
((':ruleset ruleset)
(or (is-ruleset ruleset world)
(cw "**NOTE**:~%~x0 is not a ruleset.~%"
ruleset)))
((':executable-counterpart-theory &) t)
((':current-theory &) t)
((':theory &) t)
((':rules-of-class & &) t)
(& (cw "~
**NOTE**:~%~x0 is neither a rune nor a valid ruleset designator.~%" x)))))))
;; This does not short-circuit, so that we get error messages for all the
;; invalid entries.
(defun ruleset-designator-listp1 (x world ok)
(if (atom x)
(and (eq x nil) ok)
(ruleset-designator-listp1
(cdr x) world (and (ruleset-designatorp (car x) world) ok))))
(defun ruleset-designator-listp (x world)
(ruleset-designator-listp1 x world t))
(defun rules-of-class1 (class theory)
(declare (xargs :mode :program))
(if (atom theory)
nil
(if (and (consp (car theory))
(eq (caar theory) class))
(cons (car theory) (rules-of-class1 class (cdr theory)))
(rules-of-class1 class (cdr theory)))))
(defmacro rules-of-class (class name)
`(rules-of-class1 ,class (universal-theory ,name)))
(defmacro def-ruleset (name form)
(declare (xargs :guard (symbolp name)))
`(make-event
(let ((world (w state))
(name ',name))
(if (is-ruleset name world)
(er soft 'def-ruleset
"~x0 is already a ruleset. Use add-to-ruleset or def-ruleset! ~
instead.~%" name)
(let ((result ,form))
(if (ruleset-designator-listp result world)
(value `(table ruleset-table ',name ',result))
(er soft 'def-ruleset "Invalid ruleset specified~%")))))))
(defmacro add-to-ruleset (name form)
(declare (xargs :guard (symbolp name)))
`(make-event
(let ((world (w state))
(name ',name))
(if (is-ruleset name world)
(let ((result ,form))
(if (ruleset-designator-listp result world)
(value `(table ruleset-table ',name
(union-equal ',result (ruleset ',name))))
(er soft 'add-to-ruleset "Invalid ruleset specified~%")))
(er soft 'add-to-ruleset
"~x0 is not already a ruleset. Use def-ruleset, def-ruleset! ~
or add-to-ruleset! instead.~%" name)))))
(defmacro def-ruleset! (name form)
(declare (xargs :guard (symbolp name)))
`(make-event
(let* ((world (w state))
(name ',name)
(result ,form))
(if (ruleset-designator-listp result world)
(value `(table ruleset-table ',name ',result))
(er soft 'def-ruleset! "Invalid ruleset specified~%")))))
(defmacro add-to-ruleset! (name form)
(declare (xargs :guard (symbolp name)))
`(make-event
(let* ((world (w state))
(name ',name)
(result ,form))
(if (ruleset-designator-listp result world)
(value `(table ruleset-table ',name
(union-equal ',result (ruleset ',name))))
(er soft 'add-to-ruleset! "Invalid ruleset specified~%")))))
;; This is fragile; we don't recursively check rulesets that we're expanding.
(defun expand-ruleset1 (x world)
(if (atom x)
nil
(let ((des (car x)))
(if (or (atom des) (runep des world))
(cons des (expand-ruleset1 (cdr x) world))
(if (null (cdar x))
(cons `(:executable-counterpart ,(caar x))
(expand-ruleset1 (cdr x) world))
(case (car des)
(:ruleset
(append (expand-ruleset1 (ruleset (cadr des)) world)
(expand-ruleset1 (cdr x) world)))
(:executable-counterpart-theory
(append (executable-counterpart-theory (cadr des))
(expand-ruleset1 (cdr x) world)))
(:rules-of-class
(append (rules-of-class (cadr des) (caddr des))
(expand-ruleset1 (cdr x) world)))
(:theory
(append (theory (cadr des))
(expand-ruleset1 (cdr x) world)))
(:current-theory
(append (executable-counterpart-theory (cadr des))
(expand-ruleset1 (cdr x) world)))))))))
(defun expand-ruleset (x world)
(if (ruleset-designator-listp x world)
(expand-ruleset1 x world)
(er hard 'expand-ruleset "~x0 is not a valid ruleset.~%" x)))
(defmacro enable* (&rest x)
`(union-theories-fn
(current-theory :here)
(expand-ruleset ',x world)
t world))
(defmacro disable* (&rest x)
`(set-difference-theories-fn
(current-theory :here)
(expand-ruleset ',x world)
t world))
(defun e/d*-fn (theory e/d-list enable-p)
(declare (xargs :guard (and (true-list-listp e/d-list)
(or (eq enable-p t)
(eq enable-p nil)))))
(cond ((atom e/d-list) theory)
(enable-p (e/d*-fn `(UNION-THEORIES ,theory
(expand-ruleset ',(car e/d-list) world))
(cdr e/d-list) nil))
(t (e/d*-fn `(SET-DIFFERENCE-THEORIES ,theory
(expand-ruleset ',(car e/d-list) world))
(cdr e/d-list) t))))
(defmacro e/d** (&rest theories)
(declare (xargs :guard (true-list-listp theories)))
(cond ((atom theories) nil)
(t (e/d*-fn nil theories t))))
(defmacro e/d* (&rest theories)
(declare (xargs :guard (true-list-listp theories)))
(cond ((atom theories) '(current-theory :here))
(t (e/d*-fn '(current-theory :here)
theories t))))
(defmacro ruleset-theory (ruleset)
`(expand-ruleset (ruleset ,ruleset) world))
#||
(logic)
(local
(encapsulate
nil
(include-book
;; This is on a separate line so that this book won't appear to depend on
;; the make-event subdir.
"make-event/assert" :dir :system)
(def-ruleset! foo '(append reverse))
(def-ruleset! bar '((:ruleset foo) nth))
(add-to-ruleset foo '((consp)))
(in-theory (enable* (:ruleset foo)))
(assert! (let ((ens (ens state)))
(active-runep '(:definition binary-append))))
(in-theory (disable* (:ruleset bar)))
(assert! (let ((ens (ens state)))
(not (active-runep '(:definition binary-append)))))
(in-theory (e/d* ((:ruleset bar)) ((:ruleset foo))))
(assert! (let ((ens (ens state)))
(and (not (active-runep '(:definition binary-append)))
(active-runep '(:definition nth)))))))
||#
|