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 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253
|
; RP-REWRITER
; Note: The license below is based on the template at:
; http://opensource.org/licenses/BSD-3-Clause
; Copyright (C) 2019, Regents of the University of Texas
; All rights reserved.
; Copyright (C) 2022 Intel Corporation
; Redistribution and use in source and binary forms, with or without
; modification, are permitted provided that the following conditions are
; met:
; o Redistributions of source code must retain the above copyright
; notice, this list of conditions and the following disclaimer.
; o Redistributions in binary form must reproduce the above copyright
; notice, this list of conditions and the following disclaimer in the
; documentation and/or other materials provided with the distribution.
; o Neither the name of the copyright holders nor the names of its
; contributors may be used to endorse or promote products derived
; from this software without specific prior written permission.
; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
; A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
; HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
; SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
; LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
; DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
; THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
; (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
; OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
; Original Author(s):
; Mertcan Temel <mert@utexas.edu>
(in-package "RP")
(include-book "rp-rewriter")
(include-book "extract-formula")
(include-book "eval-functions")
(include-book "cl-correct")
(include-book "tools/templates" :dir :system)
(include-book "std/strings/decimal" :dir :system)
(include-book "centaur/meta/def-formula-checks" :dir :system)
(defthm rp-state-preservedp-of-the-same-rp-state
(implies (rp-statep rp-state)
(rp-state-preservedp rp-state rp-state))
:hints (("Goal"
:in-theory (e/d (rp-state-preservedp) ()))))
(defconst *acceptable-meta-rule-args*
'(term
dont-rw
context
limit
rp-state
state))
(defconst *acceptable-processor-args*
'(term
context
rp-state
state))
(defconst *acceptable-meta-rule-ret-vals*
'(term
dont-rw
rp-state))
(defun fix-args/returns-package (lst)
(declare (xargs :guard t))
(if (atom lst)
nil
(b* (((when (not (symbolp (car lst))))
(cons (car lst)
(fix-args/returns-package (cdr lst))))
(cur (symbol-name (car lst)))
((when (or (equal cur "rp-state")
(equal cur "state")))
(cons (car lst)
(fix-args/returns-package (cdr lst)))))
(cons (intern$ cur "RP")
(fix-args/returns-package (cdr lst))))))
(defun add-meta-rule-guard (meta-fnc trig-fnc formula-checks
returns rw-direction
valid-syntaxp cl-name-prefix state)
(declare (xargs :guard t
:stobjs (state)
:guard-hints (("Goal"
:in-theory (e/d () ((:DEFINITION acl2::formals)))))))
(and (or (and (symbolp meta-fnc)
meta-fnc)
(hard-error 'add-meta-rule-guard
"You need to pass a non-nil symbol for :meta-fnc keyword ~%"
nil))
(or (and (symbolp trig-fnc)
trig-fnc)
(hard-error 'add-meta-rule-guard
"You need to pass a non-nil symbol for :trig-fnc keyword ~%"
nil))
(or (and (symbolp formula-checks))
(hard-error 'add-meta-rule-guard
"You need to pass a non-nil symbol for :formula-checks keyword~%"
nil))
(or (subsetp-equal (true-list-fix (fix-args/returns-package (acl2::formals meta-fnc (w state))))
*acceptable-meta-rule-args*)
(hard-error 'add-meta-rule-guard
"The arguments of your function should be a subset of
~p0 (names can be in any package)~%"
(list (cons #\0 *acceptable-meta-rule-args*))))
(or (and (symbolp returns)
(equal (symbol-name returns) "TERM"))
(and (symbol-listp returns)
(> (len returns) 2)
(equal (car returns) 'mv)
(subsetp-equal (true-list-fix (fix-args/returns-package (cdr
returns)))
*acceptable-meta-rule-ret-vals*))
(hard-error 'add-meta-rule-guard
"Possible options for :returns keyword are:
1. (mv symbol1 symbol2 ...) where symbols must be a subset of ~p1
2. term
but instead you passed ~p0~%"
(list (cons #\0 returns)
(cons #\1 *acceptable-meta-rule-ret-vals*))))
(or (booleanp valid-syntaxp)
(hard-error 'add-meta-rule-guard
"You need to pass a t or nil for :valid-syntaxp keyword~%"
nil))
(or (equal rw-direction nil)
(equal rw-direction ':both)
(equal rw-direction ':inside-out)
(equal rw-direction ':outside-in)
(hard-error 'add-meta-rule-guard
"You need to pass a :inside-out, nil (same as~
:inside-out), :outside-in or :both for :rw-direction keyword~%"
nil))
(or (symbolp cl-name-prefix)
(hard-error 'add-meta-rule-guard
"You need to pass a symbol for :cl-name-prefix keyword~%"
nil))))
(defun add-processor-guard (processor-fnc formula-checks
valid-syntaxp cl-name-prefix state)
(declare (xargs :guard t
:stobjs (state)
:guard-hints (("Goal"
:in-theory (e/d () ((:DEFINITION acl2::formals)))))))
(and (or (and (symbolp processor-fnc)
processor-fnc)
(hard-error 'add-processor-guard
"You need to pass a non-nil symbol for :meta-fnc keyword ~%"
nil))
(or (and (symbolp formula-checks))
(hard-error 'add-processor-guard
"You need to pass a non-nil symbol for :formula-checks keyword~%"
nil))
(or (subsetp-equal (true-list-fix (fix-args/returns-package (acl2::formals processor-fnc (w state))))
*acceptable-processor-args*)
(hard-error 'add-processor-guard
"The arguments of your function should be a subset of
~p0 ~%"
(list (cons #\0 *acceptable-processor-args*))))
(or (booleanp valid-syntaxp)
(hard-error 'add-processor-guard
"You need to pass a t or nil for :valid-syntaxp keyword~%"
nil))
(or (symbolp cl-name-prefix)
(hard-error 'add-processor-guard
"You need to pass a symbol for :cl-name-prefix keyword~%"
nil))))
(defrec meta-rule-table-rec
(formula-checks ;; formula-checks function for the associated meta rule
trig-fnc ;; trigger function name
meta-fnc ;; function name that meta rule executes
valid-syntaxp ;; if meta rule returns valid-syntax (rp-valid-termp)
rw-direction ;; rewriting direction outside-in, inside-out or both
returns ;; return vals of "meta-fnc"
args
correctness-lemma)
t)
(defrec pre-post-processor-table-rec
(formula-checks ;; formula-checks function for the associated meta rule
processor-fnc ;; function name that meta rule executes
valid-syntaxp ;; if meta rule returns valid-syntax (rp-valid-termp)
args
correctness-lemma
returns
priority)
t)
(defund add-meta-rule-fn (meta-fnc trig-fnc formula-checks returns rw-direction
valid-syntaxp hints cl-name-prefix disabledp
state)
(declare (xargs :guard (add-meta-rule-guard meta-fnc trig-fnc
formula-checks returns
rw-direction valid-syntaxp
cl-name-prefix state)
:stobjs (state)))
(b* ((rune `(:meta ,meta-fnc . ,trig-fnc))
(returns (if (symbolp returns) (list returns) returns))
(returns (fix-args/returns-package returns))
(returns (if (equal (len returns) 1) (car returns) returns))
(args (true-list-fix (fix-args/returns-package (acl2::formals meta-fnc (w state)))))
(correctness-lemma (sa meta-fnc 'for trig-fnc 'valid))
(entry (make meta-rule-table-rec
:formula-checks formula-checks
:trig-fnc trig-fnc
:meta-fnc meta-fnc
:valid-syntaxp valid-syntaxp
:rw-direction rw-direction
:returns returns
:correctness-lemma correctness-lemma
:args args)))
`(encapsulate
nil
(set-ignore-ok t)
(table rp-rules ',rune
',(cond
((equal rw-direction ':both) `(:both . t))
((equal rw-direction ':outside-in) `(:outside-in . t))
(t `(:inside-out . t))))
(table rp-rw-all-meta-rules ',rune ',entry)
,@(if disabledp
`((disable-rules '(,rune)))
nil)
(defthmd ,correctness-lemma
(and
(implies (and (rp-evl-meta-extract-global-facts)
(rp-termp term)
(valid-sc term a)
,@(append (and formula-checks
`((,formula-checks state)))
(and (member-equal 'context args)
`((valid-sc-subterms context a)
(eval-and-all context a)
(rp-term-listp context)))
(and (member-equal 'rp-state args)
`((rp-statep rp-state)))))
(b* ((term-input term)
(,returns
(,meta-fnc . ,args)))
(and (equal (rp-evlt term a)
(rp-evlt term-input a))
(valid-sc term a))))
,@(append (and valid-syntaxp
`((implies (and (rp-termp term)
,@(append (and (true-listp args)
(member-equal 'context
args)
`((rp-term-listp context)))))
(b* ((term-input term)
(,returns
(,meta-fnc . ,args)))
(rp-termp term)))))
(and (true-listp returns)
(member-equal 'rp-state returns)
`((implies (rp-statep rp-state)
(b* ((,returns (,meta-fnc . ,args)))
(rp-statep rp-state)))
(implies (valid-rp-statep rp-state)
(b* ((,returns (,meta-fnc . ,args)))
(valid-rp-statep rp-state)))
(implies (valid-rp-state-syntaxp rp-state)
(b* ((,returns (,meta-fnc . ,args)))
(valid-rp-state-syntaxp rp-state)))))))
:hints ,hints)
,@(and cl-name-prefix
`((attach-meta-fncs ,cl-name-prefix))))))
(defmacro add-meta-rule (&key meta-fnc
trig-fnc
formula-checks
(returns 'term)
(rw-direction 'nil)
(valid-syntaxp 't)
(disabled 'nil)
hints
(cl-name-prefix 'nil))
`(make-event
(add-meta-rule-fn ',meta-fnc
',trig-fnc
',formula-checks
',returns
',rw-direction
',valid-syntaxp
',hints
',cl-name-prefix
',disabled
state)))
(defmacro disable-preprocessor (processor-fnc)
`(make-event
(b* (((unless (hons-assoc-equal '(:preprocessor ,processor-fnc)
(table-alist 'rp-processors (w state))))
(hard-error 'disable-preprocessor
"The given preprocessor function ~p0 is not registered ~
with RP-Rewriter. ~%"
(list (cons #\0 ',processor-fnc)))))
`(table rp-processors '(:preprocessor ,',processor-fnc)
nil))))
(defmacro enable-preprocessor (processor-fnc)
`(make-event
(b* (((unless (hons-assoc-equal '(:preprocessor ,processor-fnc)
(table-alist 'rp-processors (w state))))
(hard-error 'enable-preprocessor
"The given preprocessor function ~p0 is not registered ~
with RP-Rewriter. ~%"
(list (cons #\0 ',processor-fnc)))))
`(table rp-processors '(:preprocessor ,',processor-fnc)
t))))
(defmacro disable-postprocessor (processor-fnc)
`(make-event
(b* (((unless (hons-assoc-equal '(:postprocessor ,processor-fnc)
(table-alist 'rp-processors (w state))))
(hard-error 'disable-postprocessor
"The given postprocessor function ~p0 is not registered ~
with RP-Rewriter. ~%"
(list (cons #\0 ',processor-fnc)))))
`(table rp-processors '(:postprocessor ,',processor-fnc)
nil))))
(defmacro enable-postprocessor (processor-fnc)
`(make-event
(b* (((unless (hons-assoc-equal '(:postprocessor ,processor-fnc)
(table-alist 'rp-processors (w state))))
(hard-error 'enable-postprocessor
"The given postprocessor function ~p0 is not registered ~
with RP-Rewriter. ~%"
(list (cons #\0 ',processor-fnc)))))
`(table rp-processors '(:postprocessor ,',processor-fnc)
t))))
(defund add-processor-fn (processor-fnc formula-checks
valid-syntaxp hints cl-name-prefix disabledp
returns processor-type
state)
(declare (xargs :guard (add-processor-guard processor-fnc formula-checks
valid-syntaxp
cl-name-prefix state)
:stobjs (state)))
(b* ((rune `(,processor-type ,processor-fnc))
(returns (if (symbolp returns) (list returns) returns))
(returns (fix-args/returns-package returns))
(returns (if (equal (len returns) 1) (car returns) returns))
(args (true-list-fix (fix-args/returns-package (acl2::formals processor-fnc (w state)))))
(correctness-lemma (sa processor-fnc 'valid))
(entry (make pre-post-processor-table-rec
:formula-checks formula-checks
:processor-fnc processor-fnc
:valid-syntaxp valid-syntaxp
:correctness-lemma correctness-lemma
:args args
:returns returns)))
`(encapsulate
nil
(set-ignore-ok t)
(table rp-processors ',rune ',(not disabledp))
,(if (equal processor-type :preprocessor)
`(table rp-rw-all-preprocessors ',processor-fnc ',entry)
`(table rp-rw-all-postprocessors ',processor-fnc ',entry))
(defthmd ,correctness-lemma
(and
(implies (and (rp-evl-meta-extract-global-facts)
(rp-termp term)
(valid-sc term a)
(alistp a)
,@(append (and formula-checks
`((,formula-checks state)))
(and (member-equal 'context args)
`((valid-sc-subterms context a)
(eval-and-all context a)
(rp-term-listp context)))
(and (member-equal 'rp-state args)
`((valid-rp-statep rp-state)
(rp-statep rp-state)))))
(b* ((term-input term)
(,returns
(,processor-fnc . ,args)))
(and (iff (rp-evlt term a)
(rp-evlt term-input a))
(valid-sc term a))))
,@(append (and valid-syntaxp
`((implies (and (rp-termp term)
,@(append (and (member-equal 'context args)
`((rp-term-listp context)))
(and (member-equal 'rp-state args)
`((valid-rp-state-syntaxp rp-state)))))
(b* ((term-input term)
(,returns
(,processor-fnc . ,args)))
(rp-termp term)))))
(and (true-listp returns)
(member-equal 'rp-state returns)
`((implies (rp-statep rp-state)
(b* ((,returns (,processor-fnc . ,args)))
(rp-statep rp-state)))
(implies (and (rp-statep rp-state)
(valid-rp-statep rp-state))
(b* ((,returns (,processor-fnc . ,args)))
(valid-rp-statep rp-state)))
(implies (valid-rp-state-syntaxp rp-state)
(b* ((,returns (,processor-fnc . ,args)))
(valid-rp-state-syntaxp rp-state)))))
))
:hints ,hints)
,@(and cl-name-prefix
`((attach-meta-fncs ,cl-name-prefix))))))
(defmacro add-preprocessor (&key processor-fnc
formula-checks
(valid-syntaxp 't)
(disabledp 'nil)
hints
(returns 'term)
(cl-name-prefix 'nil))
`(make-event
(add-processor-fn ',processor-fnc
',formula-checks
',valid-syntaxp
',hints
',cl-name-prefix
',disabledp
',returns
:preprocessor
state)))
(defmacro add-postprocessor (&key processor-fnc
formula-checks
(valid-syntaxp 't)
(disabledp 'nil)
hints
(returns 'term)
(cl-name-prefix 'nil))
`(make-event
(add-processor-fn ',processor-fnc
',formula-checks
',valid-syntaxp
',hints
',cl-name-prefix
',disabledp
',returns
:postprocessor
state)))
;; (add-meta-rule :meta-fnc test-meta-fnc
;; :trig-fnc foo
;; :formula-checks test-formula-checks
;; :returns (mv term rp-state dont-rw)
;; :outside-in t
;; :valid-syntaxp nil
;; :hints (("Goal"
;; :in-theory (e/d (test-meta-fnc) ()))))
#|(defun add-meta-rules-fn-aux (formula-checks-fn new-meta-rules hints)
(declare (xargs :guard (weak-rp-meta-rule-recs-p new-meta-rules)))
(if (atom new-meta-rules)
nil
(cons
`(local
(in-theory (disable ,(rp-meta-fnc (car new-meta-rules)))))
(cons
(b* ((cur (car new-meta-rules))
(dont-rw (rp-meta-dont-rw cur))
(syntax (rp-meta-syntax-verified cur))
(trig-fnc (rp-meta-trig-fnc cur))
(fnc (rp-meta-fnc cur))
(outside-in (rp-meta-outside-in cur))
(rune `(:meta ,fnc . ,trig-fnc)))
`(progn
(table rp-rules ',rune
',(cond
((equal outside-in ':both) `(:both . t))
(outside-in `(:outside-in . t))
(t `(:inside-out . t))))
(table rp-rw-all-meta-rules ',rune ',formula-checks-fn)
(defthm ,(sa fnc 'for trig-fnc 'valid)
(and (implies (and (,formula-checks-fn state)
(rp-evl-meta-extract-global-facts)
(rp-termp term)
(valid-sc term a))
(and (equal (rp-evlt
,(if dont-rw `(mv-nth 0 (,fnc term)) `(,fnc
term))
a)
(rp-evlt term a))
(valid-sc ,(if dont-rw `(mv-nth 0 (,fnc term)) `(,fnc
term))
a
)))
,@(append (and dont-rw
`((dont-rw-syntaxp (mv-nth 1 (,fnc term)))))
(and syntax
`((implies (rp-termp term)
(rp-termp ,(if dont-rw `(mv-nth 0 (,fnc term)) `(,fnc
term))))))))
:hints ,hints)))
(add-meta-rules-fn-aux formula-checks-fn (cdr new-meta-rules) hints)))))||#
#|(defun add-meta-rules-fn (formula-checks-fn new-meta-rules cl-name-prefix
hints)
(declare (ignorable hints cl-name-prefix))
`(make-event
(b* ((?talist (table-alist 'rp-rw (w state)))
(?added-meta-rules (cdr (assoc-equal 'meta-rules talist)))
(?added-meta-rules-list (cdr (assoc-equal 'meta-rules-list talist)))
(?added-meta-formal-checks-fn-list (cdr (assoc-equal 'formal-checks-fn-list talist)))
(formula-checks-fn ',formula-checks-fn)
(?new-meta-rules ',new-meta-rules))
`(encapsulate
nil
(in-theory (disable ,formula-checks-fn
(:type-prescription ,formula-checks-fn)))
(progn ,@(add-meta-rules-fn-aux formula-checks-fn new-meta-rules ',hints))
))))||#
(xdoc::defxdoc
add-meta-rule
:parents (rp-rewriter/meta-rules rp-ruleset)
:short "A macro to add created meta rules to RP-Rewriter"
:long "<p>
<code>
@('
(add-meta-rule :meta-fnc <meta-fnc-name> ;; mandatory
:trig-fnc <trig-fnc-name> ;; mandatory
:formula-checks <formula-check-fnc-name> ;; nil by default, necessary in most cases.
:returns <return-signature> ;; optional
:rw-directuon <:inside-out, :outside-in, or :both> ;; optional, :inside-out by default
:valid-syntaxp <t-or-nil> ;; optional, t by default
:disabled <t-or-nil> ;; optional, t by default
:hints <regular-ACL2-hints> ;; optional
:cl-name-prefix <nil-or-a-unqiue-prefix> ;; optional, nil by default
)
')
</code>
registers a verified meta-rule for RP-Rewriter.
</p>
<p> Mandatory arguments: </p>
<ul>
<li> :meta-fnc must be the name of the meta function. </li>
<li> :trig-fnc the function to trigger this meta function </li>
</ul>
<p> Optional Arguments: </p>
<ul>
<li> :formula-checks the name of the formula-checks function created
with def-formula-checks if the meta rule needed one. This will likely be
necessary for most cases. </li>
<li> :returns return signature of the meta function. By default, it is 'term',
which means that it only returns the rewritten term. Other acceptable forms are
(mv term dont-rw), (mv term dont-rw rp-state), (mv term rp-state) etc. in any
order. </li>
<li> :rw-direction whether the meta rule be applied from outside-in or
inside-out. You can pass :inside-out, nil (same as :inside-out), :outside-in or
:both. If you choose to make it an outside-in rule,
then it is recommended that you input the current dont-rw structure to the meta
function and update
it accordingly. </li>
<li> :valid-syntaxp if you proved that your meta function returns rp-termp,
then set this to t. Otherwise, RP-Rewriter will have to call rp-termp everytime
the meta runction changes the term. </li>
<li> :disabled will cause the registered meta rule to be disabled by default,
but it can be later enabled by the user. </li>
<li>:hints regular ACL2 hints passed to the internal defthm event that checks
the correctness of necessary lemmas mentioned in @(see Rp-rewriter/meta-rules).</li>
<li> :cl-name-prefix Meta functions are attached to RP-Rewriter using a
defattach mechanism. By default, add-meta-rule will not trigger this mechanism,
and the user needs to call @(see attach-meta-fncs) once all the necessary meta
rules are created and included in the same book. If you wish to call @(see
attach-meta-fncs) automatically with rp::add-meta-rule, then pass a unique
name for :cl-name-prefix. It is nil by default, which will prevent @(see
attach-meta-fncs) from being executed. </li>
</ul>
"
)
(defun create-rp-rw-meta-rule-fn-aux1 (all-entries)
;; gets unique formula-checks function names
(if (atom all-entries)
nil
(b* ((rest (create-rp-rw-meta-rule-fn-aux1 (cdr all-entries)))
(formula-check-fnc
(cond ((weak-meta-rule-table-rec-p (cdr (car all-entries)))
(access meta-rule-table-rec
(cdr (car all-entries))
:formula-checks))
((weak-pre-post-processor-table-rec-p
(cdr (car all-entries)))
(access pre-post-processor-table-rec
(cdr (car all-entries))
:formula-checks))
(t nil))))
(if (or (member-equal formula-check-fnc rest)
(not formula-check-fnc))
rest
(cons formula-check-fnc rest)))))
(defun create-rp-rw-meta-rule-fn-aux2 (rp-rw-all-meta-rules)
(if (atom rp-rw-all-meta-rules)
(mv nil `((t (mv term nil rp-state))))
(b* (((mv added-meta-fnc rest) (create-rp-rw-meta-rule-fn-aux2 (cdr rp-rw-all-meta-rules)))
(cur (cdar rp-rw-all-meta-rules))
(meta-fnc (access meta-rule-table-rec cur :meta-fnc))
((when (member-equal meta-fnc added-meta-fnc))
(mv added-meta-fnc rest))
(valid-syntaxp (access meta-rule-table-rec cur :valid-syntaxp))
(returns (access meta-rule-table-rec cur :returns))
(args (access meta-rule-table-rec cur :args))
(body
`((eq meta-fnc-name ',meta-fnc)
(b* (,@(and (not valid-syntaxp)
`((input-term term)))
(,returns (,meta-fnc . ,args)))
,(if valid-syntaxp
`(mv term dont-rw rp-state)
`(mv (if (rp-termp term) term input-term) dont-rw rp-state))))))
(mv (cons meta-fnc added-meta-fnc)
(cons body rest)))))
(defund is-proc-enabled (proc-fnc type state)
(declare (xargs :guard t
:stobjs state))
(cdr (hons-assoc-equal `(,type ,proc-fnc)
(table-alist 'rp-processors (w state)))))
(defun create-rp-rw-processor-fn-aux2 (all-processors type)
(if (atom all-processors)
nil
(b* ((rest (create-rp-rw-processor-fn-aux2 (cdr all-processors) type))
(cur (cdar all-processors))
(proc-fnc (access pre-post-processor-table-rec cur :processor-fnc))
(valid-syntaxp (access pre-post-processor-table-rec cur :valid-syntaxp))
(args (access pre-post-processor-table-rec cur :args))
(returns (access pre-post-processor-table-rec cur :returns))
(body
`(,returns
(if (is-proc-enabled ',proc-fnc ',type state)
,(if valid-syntaxp
`(,proc-fnc . ,args)
`(b* ((input-term term)
(,returns (,proc-fnc . ,args))
(term
(if (rp-termp term)
term
input-term)))
,returns))
,returns)))
)
(cons body rest))))
(defun create-rp-rw-meta-rule-fn-aux3 (all-entries)
(if (atom all-entries)
nil
(b* ((cur (cdar all-entries))
(correctness-lemma
(cond ((weak-meta-rule-table-rec-p cur)
(access meta-rule-table-rec cur :correctness-lemma))
((weak-pre-post-processor-table-rec-p cur)
(access pre-post-processor-table-rec cur :correctness-lemma))
(t nil)))
(rest (create-rp-rw-meta-rule-fn-aux3 (cdr all-entries))))
(if correctness-lemma
(cons correctness-lemma rest)
rest))))
#|
(add-meta-rule :meta-fnc test-meta-fnc
:trig-fnc foo
:formula-checks test-formula-checks
:returns (mv term rp-state dont-rw)
:outside-in t
:valid-syntaxp t
:hints (("Goal"
:in-theory (e/d (test-meta-fnc) ()))))||#
;;(create-rp-rw-meta-rule-fn-aux2 (table-alist 'rp-rw-all-meta-rules (w state)))
(defun create-rp-rw-meta-rule-fn (prefix skip-cycle-checks world)
(b* ((meta-fnc-name (sa prefix 'rp-rw-meta-rule))
(preprocessor-fnc-name (sa prefix 'rp-rw-preprocessor))
(postprocessor-fnc-name (sa prefix 'rp-rw-postprocessor))
(meta-formula-checks-fnc-name
(sa prefix 'rp-meta-fnc-formula-checks))
(proc-formula-checks-fnc-name
(sa prefix 'rp-proc-formula-checks))
(rp-rw-all-meta-rules (table-alist 'rp-rw-all-meta-rules world))
(rp-rw-all-preprocessors (table-alist 'rp-rw-all-preprocessors world))
(rp-rw-all-postprocessors (table-alist 'rp-rw-all-postprocessors world))
(meta-fnc-formula-checks-fns (create-rp-rw-meta-rule-fn-aux1
rp-rw-all-meta-rules))
(proc-formula-checks-fns (create-rp-rw-meta-rule-fn-aux1
(append rp-rw-all-preprocessors
rp-rw-all-postprocessors)))
(meta-formula-checks-fn-body
(cons 'and (pairlis$ meta-fnc-formula-checks-fns
(pairlis$ (repeat (len meta-fnc-formula-checks-fns) 'state) nil))))
(proc-formula-checks-fn-body
(cons 'and (pairlis$ proc-formula-checks-fns
(pairlis$ (repeat (len proc-formula-checks-fns) 'state) nil))))
((mv & new-meta-rule-fnc-body)
(create-rp-rw-meta-rule-fn-aux2 rp-rw-all-meta-rules))
(new-preprocessor-body
(create-rp-rw-processor-fn-aux2 rp-rw-all-preprocessors :preprocessor))
(new-postprocessor-body
(create-rp-rw-processor-fn-aux2 rp-rw-all-postprocessors :postprocessor))
#|(meta-rule-validity-lemmas (get-meta-rule-validity-lemma meta-rules))||#
)
`(
(defun ,meta-formula-checks-fnc-name (state)
(declare (xargs :stobjs (state)))
(declare (ignorable state))
,meta-formula-checks-fn-body)
(defun ,proc-formula-checks-fnc-name (state)
(declare (xargs :stobjs (state)))
(declare (ignorable state))
,proc-formula-checks-fn-body)
(defun ,meta-fnc-name (term meta-fnc-name dont-rw context limit rp-state state )
(declare (xargs :guard (and (rp-termp term)
(rp-term-listp context)
(symbolp meta-fnc-name)
(valid-rp-state-syntaxp rp-state)
(natp limit))
:stobjs (rp-state state)))
(declare (ignorable term meta-fnc-name dont-rw limit context rp-state state))
(cond
. ,new-meta-rule-fnc-body))
(defun ,preprocessor-fnc-name (term context rp-state state )
(declare (xargs :guard (and (rp-termp term)
(valid-rp-state-syntaxp rp-state))
:stobjs (rp-state state)))
(declare (ignorable term context rp-state state))
(b* (
,@new-preprocessor-body)
(mv term rp-state)))
(defun ,postprocessor-fnc-name (term context rp-state state )
(declare (xargs :guard (and (rp-termp term)
(valid-rp-state-syntaxp rp-state))
:stobjs (rp-state state)))
(declare (ignorable term context rp-state state))
(b* (
,@new-postprocessor-body)
(mv term rp-state)))
(table rp-rw 'main-meta-formula-checks-fnc-name
',meta-formula-checks-fnc-name)
(table rp-rw 'main-proc-formula-checks-fnc-name ',proc-formula-checks-fnc-name)
(table rp-rw 'meta-rule-caller-fnc-name ',meta-fnc-name)
(table rp-rw 'preprocessor-caller-fnc-name ',preprocessor-fnc-name)
(table rp-rw 'postprocessor-caller-fnc-name ',postprocessor-fnc-name)
(table rp-rw 'added-meta-rules
',(table-alist 'rp-rw-all-meta-rules world))
(table rp-rw 'added-preprocessors
',(table-alist 'rp-rw-all-preprocessors world))
(table rp-rw 'added-postprocessors
',(table-alist 'rp-rw-all-postprocessors world))
,@(and skip-cycle-checks `((defttag :skip-defattach-cycles-check)))
(defattach
(rp-meta-fnc-formula-checks ,meta-formula-checks-fnc-name)
(rp-rw-meta-rule ,meta-fnc-name)
:hints (("Goal"
:in-theory '(,meta-formula-checks-fnc-name
,meta-fnc-name
,preprocessor-fnc-name
,postprocessor-fnc-name
rp-state-preservedp-of-the-same-rp-state
,@(create-rp-rw-meta-rule-fn-aux3
rp-rw-all-meta-rules)
,@(create-rp-rw-meta-rule-fn-aux3
rp-rw-all-preprocessors)
,@(create-rp-rw-meta-rule-fn-aux3
rp-rw-all-postprocessors)
(:e dont-rw-syntaxp)
valid-rp-statep-and-rp-statep-implies-valid-rp-state-syntaxp
valid-rp-state-syntaxp-implies)))
,@(and skip-cycle-checks `(:skip-checks :cycles)))
(defattach
(rp-proc-formula-checks ,proc-formula-checks-fnc-name)
(rp-rw-preprocessor ,preprocessor-fnc-name)
(rp-rw-postprocessor ,postprocessor-fnc-name)
:hints (("Goal"
:in-theory '(,proc-formula-checks-fnc-name
,meta-fnc-name
,preprocessor-fnc-name
,postprocessor-fnc-name
rp-state-preservedp-of-the-same-rp-state
,@(create-rp-rw-meta-rule-fn-aux3
rp-rw-all-meta-rules)
,@(create-rp-rw-meta-rule-fn-aux3
rp-rw-all-preprocessors)
,@(create-rp-rw-meta-rule-fn-aux3
rp-rw-all-postprocessors)
(:e dont-rw-syntaxp)
valid-rp-statep-and-rp-statep-implies-valid-rp-state-syntaxp
valid-rp-state-syntaxp-implies)))
,@(and skip-cycle-checks `(:skip-checks :cycles)))
,@(and skip-cycle-checks `((defttag nil))))))
(defun attach-meta-fncs-fn (prefix skip-cycle-checks state)
(declare (xargs :stobjs (state)
:guard (symbolp prefix)
:verify-guards nil))
`(progn
,@(create-rp-rw-meta-rule-fn prefix skip-cycle-checks (w state))))
(defmacro attach-meta-fncs (prefix &key (skip-cycle-checks 'nil))
`(make-event
(attach-meta-fncs-fn ',prefix ',skip-cycle-checks state)))
(defun is-rp-clause-processor-up-to-date (world)
(declare (xargs :guard (and (PLIST-WORLDP world))
:guard-hints (("Goal"
:in-theory (e/d (hons-assoc-equal
acl2::plist-worldp-with-formals)
())))))
(and (b* ( (rp-rw-all-meta-rules (table-alist 'rp-rw-all-meta-rules world))
(add-meta-rules (cdr (hons-assoc-equal 'added-meta-rules
(table-alist 'rp-rw world)))))
(acl2::set-equiv (true-list-fix rp-rw-all-meta-rules)
(true-list-fix add-meta-rules)))
(b* ( (rp-rw-all-preprocessors (table-alist 'rp-rw-all-preprocessors world))
(added (cdr (hons-assoc-equal 'added-preprocessors
(table-alist 'rp-rw world)))))
(acl2::set-equiv (true-list-fix rp-rw-all-preprocessors)
(true-list-fix added)))
(b* ( (rp-rw-all-postprocessors (table-alist 'rp-rw-all-postprocessors world))
(added (cdr (hons-assoc-equal 'added-postprocessors
(table-alist 'rp-rw world)))))
(acl2::set-equiv (true-list-fix rp-rw-all-postprocessors)
(true-list-fix added)))))
(xdoc::defxdoc
is-rp-clause-processor-up-to-date
:parents (rp-rewriter/meta-rules)
:short "Checks if all the added meta-rules are 'registered'"
:long "<p>
After calling @(see add-meta-rule) or when different books with meta rules are
included, users need to call @(see rp::attach-meta-fncs). This function
checks if it is necessary.</p>
<code>(is-rp-clause-processor-up-to-date world)</code>
")
(define check-if-clause-processor-up-to-date (world)
(declare (xargs :guard (and (PLIST-WORLDP world))
:guard-hints (("Goal"
:in-theory (e/d (assoc-equal
ACL2::PLIST-WORLDP-WITH-FORMALS) ())))))
(if (is-rp-clause-processor-up-to-date world)
nil
(hard-error 'defthmrp
"The clause processor function is NOT up-to-date with respect ~
to added meta rules. Run (rp::attach-meta-fncs prefix) to create the ~
attach all the meta functions to RP-Rewriter. \"prefix\" should be a unique ~
symbol for the updated meta-rule caller function. ~%"
nil)))
(progn
;; (defwarrant RP-META-FNC)
;; (defwarrant RP-META-TRIG-FNC)
(defwarrant meta-rune-fnc$inline)
(define disable-meta-rules-fnc (rp-rw-all-meta-rules args)
:verify-guards nil
(if (atom args)
nil
(b* ((rest (disable-meta-rules-fnc rp-rw-all-meta-rules (cdr args)))
(cur (loop$ for x in rp-rw-all-meta-rules
when (equal (car args)
(meta-rune-fnc (car x)))
collect
(car x))))
(if cur
(cons `(disable-rules
',cur)
rest)
rest))))
(define enable-meta-rules-fnc (rp-rw-all-meta-rules args)
:verify-guards nil
(if (atom args)
nil
(b* ((rest (enable-meta-rules-fnc rp-rw-all-meta-rules (cdr args)))
(cur (loop$ for x in rp-rw-all-meta-rules
when (equal (car args)
(meta-rune-fnc (car x)))
collect
(car x))))
(if cur
(cons `(enable-rules
',cur)
rest)
rest))))
(defmacro disable-all-meta-rules ()
`(make-event
(b* ((rp-rw-all-meta-rules (table-alist 'rp-rw-all-meta-rules (w state)))
(meta-rules (strip-cars rp-rw-all-meta-rules)))
`(disable-rules ',meta-rules))))
(defmacro enable-all-meta-rules ()
`(make-event
(b* ((rp-rw-all-meta-rules (table-alist 'rp-rw-all-meta-rules (w state)))
(meta-rules (strip-cars rp-rw-all-meta-rules)))
`(enable-rules ',meta-rules))))
(defsection disable-meta-rules
:short "Disable meta rules with given meta function name list."
:long "See @(see rp-ruleset) for description."
:parents (rp-ruleset)
(defmacro disable-meta-rules (&rest args)
(if (not args)
`(value-triple :none)
`(make-event
(b* ((rp-rw-all-meta-rules (table-alist 'rp-rw-all-meta-rules (w state))))
`(progn
,@(disable-meta-rules-fnc rp-rw-all-meta-rules ',args)))))))
(defsection enable-meta-rules
:short "Enable meta rules with given meta function name list."
:long "See @(see rp-ruleset) for description."
:parents (rp-ruleset)
(defmacro enable-meta-rules (&rest args)
(if (not args)
`(value-triple :none)
`(make-event
(b* ((rp-rw-all-meta-rules (table-alist 'rp-rw-all-meta-rules (w state))))
`(progn
,@(enable-meta-rules-fnc rp-rw-all-meta-rules ',args)))))))
(defmacro bump-all-meta-rules ()
`(make-event
(b* ((rp-rw-all-meta-rules (table-alist 'rp-rw-all-meta-rules (w state)))
(meta-rules (strip-cars rp-rw-all-meta-rules)))
`(bump-rules ,@(reverse meta-rules))))))
(defthm iff-of-rp-evlt-lst
(iff (rp-evlt-lst subterms a)
(consp subterms))
:hints (("goal"
:induct (len subterms)
:do-not-induct t
:in-theory (e/d () ()))))
(defthmd rp-evl-of-ex-from-rp-reverse-for-atom
(implies (syntaxp (atom x))
(equal (rp-evl x a)
(rp-evl (ex-from-rp x) a)))
:hints (("Goal"
:do-not-induct t
:induct (ex-from-rp x)
:in-theory (e/d (is-rp) ()))))
(defthmd rp-evlt-of-ex-from-rp-reverse-for-atom
(implies (syntaxp (atom x))
(equal (rp-evlt x a)
(rp-evlt (ex-from-rp x) a)))
:hints (("Goal"
:do-not-induct t
:induct (ex-from-rp x)
:in-theory (e/d (is-rp) ()))))
(acl2::def-ruleset
regular-eval-lemmas
nil)
(acl2::def-ruleset
regular-eval-lemmas-with-ex-from-rp
nil)
(defun create-regular-eval-lemma-fn (fn argc formula-checks)
`(progn
(defthmd ,(sa 'regular-rp-evl-of fn 'when formula-checks)
(implies (and (rp-evl-meta-extract-global-facts :state state)
(,formula-checks state)
(case-match x ((',fn . ,(repeat argc '&)) t)))
(and (equal (rp-evl x a)
(,fn . ,(loop$ for i from 1 to argc
collect `(rp-evl (nth ,i x) a))))
(equal (rp-evlt x a)
(,fn . ,(loop$ for i from 1 to argc
collect `(rp-evlt (nth ,i x)
a))))))
:hints (("Goal"
:in-theory (e/d (rp-trans trans-list) ()))))
(acl2::add-to-ruleset regular-eval-lemmas '(,(sa 'regular-rp-evl-of fn 'when formula-checks)))
(defthmd ,(sa 'regular-rp-evl-of fn 'when formula-checks 'with-ex-from-rp)
(implies (and (rp-evl-meta-extract-global-facts :state state)
(,formula-checks state)
(let* ((x (ex-from-rp x))) (case-match x ((',fn . ,(repeat argc '&)) t))))
(and (equal
(rp-evl x a)
(,fn . ,(loop$ for i from 1 to argc
collect `(rp-evl (nth ,i (ex-from-rp x)) a))))
(equal
(rp-evlt x a)
(,fn . ,(loop$ for i from 1 to argc
collect `(rp-evlt (nth ,i (ex-from-rp x)) a))))))
:hints (("Goal"
:use ((:instance
,(sa 'regular-rp-evl-of fn 'when formula-checks)
(x (ex-from-rp x))))
:in-theory '(
rp-evlt-of-ex-from-rp-reverse-for-atom
rp-evl-of-ex-from-rp-reverse-for-atom ))))
(acl2::add-to-ruleset regular-eval-lemmas
'(,(sa 'regular-rp-evl-of fn 'when formula-checks 'with-ex-from-rp)))
(acl2::add-to-ruleset regular-eval-lemmas-with-ex-from-rp
'(,(sa 'regular-rp-evl-of fn 'when formula-checks 'with-ex-from-rp)))))
(defmacro create-regular-eval-lemma (fn argc formula-checks)
`(make-event
(create-regular-eval-lemma-fn ',fn ',argc ',formula-checks)))
(xdoc::defxdoc
rp-rewriter/meta-rules
:parents (rp-rewriter)
:short "The steps necessary to add meta rules to RP-Rewriter"
:long "<p>Below are the steps users need to follow, and information they may
use:</p>
<p>
1. Create your meta function.
<code>
@('(define <meta-fnc> (term)
:returns (mv term dont-rw) OR (term)
...)')
</code>
Your meta function can return either two values:term and @(see rp::dont-rw); or
only term. For best performance, it is recommended that you return dont-rw
structure as well. If you do not want the returned term to be rewritten at all,
you can return 't' for dont-rw.
</p>
<p>
2. Create formula-checks function.
<code>
@('(def-formula-checks <formula-check-name>
(<list-of-function-names>))')
</code>
This event submits a function with signature @('(<formula-check-name> state)'). When
you add this function to your correctness theorem for this meta function, the
evaluator of RP-Rewriter will recognize the functions you list.
</p>
<p>
3. Prove that evaluation of the function returns an equivalent term under the
evaluator.
<code>
@('(defthm rp-evlt-of-meta-fnc
(implies (and (valid-sc term a) ;;optional
(rp-termp term) ;;optional
(rp-evl-meta-extract-global-facts)
(<formula-check-name> state))
(equal (rp-evlt (<meta-fnc> term) a)
(rp-evlt term a))))')
</code>
This is the correctness theorem of the meta rule. Optionally, you may have
(valid-sc term a), which states that the side-conditions in RP-Rewriter are
correct; and (rp-termp term), which states that some of the syntactic
invariances hold and the term is syntactically compatible with RP-Rewriter. See
discussions for @(see valid-sc) and @(see rp-termp).
</p>
<p>
If the meta function returns dont-rw, then you need to prove this lemma for
@('(mv-nth 0 (<meta-fnc> term))') instead.
</p>
<p>
4. Prove that meta-function retains the correctness of side-conditions.
<code>
@('(defthm valid-sc-of-meta-fnc
(implies (and (valid-sc term a)
(rp-termp term) ;;optional
(rp-evl-meta-extract-global-facts) ;;optional
(<formula-check-name> state)) ;;optional
(valid-sc (<meta-fnc> term) a)))')
</code>
Meta functions can introduce or change side-conditions by manipulating 'rp'
instances. Therefore users need to prove that the invariance about side
conditions are maintained.
</p>
<p>
If the meta function returns dont-rw, then you need to prove this lemma for
@('(mv-nth 0 (<meta-fnc> term))') instead.
</p>
<p>
5. Optionally, prove that the meta function returns a valid syntax.
<code>
@('(defthm rp-termp-of-meta-fnc
(implies (rp-termp term)
(rp-termp (<meta-fnc> term))))')
</code>
Even though it is optional, it is recommended that you prove such a lemma for
your meta function. It prevents syntactic check on every term returned from
meta function.
</p>
<p>
If the meta function returns dont-rw, then you need to prove this lemma for
@('(mv-nth 0 (<meta-fnc> term))') instead.
</p>
<p>
6. Save the meta rule in the rule-set of RP-Rewriter for meta rules.
<code>
@('
(rp::add-meta-rule
:meta-fnc <meta-fnc>
:trig-fnc <trig-fnc>
:returns <return-signature>
:rw-direction <:inside-out, :outside-in, or :both>
:valid-syntaxp <t-if-rp-termp-of-meta-fnc-is-proved>)
')
</code>
See @(see add-meta-rule) for further discussion of the options.
</p>
<p>
7. Attach these newly created meta functions.
<code>
@('(rp::attach-meta-fncs <a-unique-name-for-updated-clause-processor>)')
</code>
If you are going to include this book later when other meta rules for
RP-Rewriter is present, you may want to call this function when all the meta
rules are included.
</p>
<p>
You may look at examples of RP-Rewriter meta rules under
/books/projects/RP-Rewriter/meta/*. implies-meta.lisp is a very simple example
of an outside-in meta rule.
</p>
<p>
Some books under /books/projects/RP-Rewriter/proofs/* might be useful when
proving when proving meta rules correct, especially aux-function-lemmas and
eval-functions-lemmas.
</p>
")
(xdoc::defxdoc
dont-rw
:parents (rp-rewriter/meta-rules)
:short "A special data structure that RP-Rewriter meta rules may return to
control rewriting of returned terms."
:long "<p>When a term us returned from a meta rule, it appears as completely
new to the rewriter and by default, it will be parsed completely and be
rewritten for a second time. This can cause performance issues with big
terms. To solve this problem, we use a special structure called dont-rw that
meta functions may generate and return to control which subterms should be
rewritten and which should not.</p>
<p>
The dont-rw structure has the same cons skeleton as the term itself such that
it is traversed (car'ed and cdr'ed) the same way as the term. Whenever dont-rw
structure becomes an atom and non-nil, the rewriting of corresponding term
stops. For example, assume that a meta rule returns the following term and we
would like to avoid rewriting all the instances of g, then the following
dont-rw structure would enable that.</p>
<code>
(f1 (f2 (g a b) c)
(f3 d (g x y)))
</code>
<code>
(nil (nil t t)
(nil t t))
</code>")
(xdoc::defxdoc
attach-meta-fncs
:parents (rp-rewriter/meta-rules)
:short "Creates and attaches a new meta-rule caller function to register added meta rules."
:long "<p>
After calling @(see add-meta-rule) or when different books with meta rules are
included, users need to call attach-meta-fncs. This creates a
new meta function caller function and attaches it to rp::rp-rw-meta-rule. </p>
<code>(rp::attach-meta-fncs unique-prefix)</code>
<p> unique-prefix should be a unique name that will be a prefix to the name
of the new meta-rule caller function. </p>
")
|