File: basetypes.lisp

package info (click to toggle)
acl2 8.5dfsg-5
  • links: PTS
  • area: main
  • in suites: bookworm
  • size: 991,452 kB
  • sloc: lisp: 15,567,759; javascript: 22,820; cpp: 13,929; ansic: 12,092; perl: 7,150; java: 4,405; xml: 3,884; makefile: 3,507; sh: 3,187; ruby: 2,633; ml: 763; python: 746; yacc: 723; awk: 295; csh: 186; php: 171; lex: 154; tcl: 49; asm: 23; haskell: 17
file content (528 lines) | stat: -rw-r--r-- 17,346 bytes parent folder | download | duplicates (4)
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
; FTY type support library
; Copyright (C) 2014 Centaur Technology
;
; Contact:
;   Centaur Technology Formal Verification Group
;   7600-C N. Capital of Texas Highway, Suite 300, Austin, TX 78731, USA.
;   http://www.centtech.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: Sol Swords <sswords@centtech.com>

(in-package "ACL2")
(include-book "std/basic/defs" :dir :system)
(include-book "std/basic/pos-fix" :dir :system)
(include-book "std/lists/list-defuns" :dir :system)
(include-book "fixtype")
(local (include-book "std/lists/equiv" :dir :system))

(defconst fty::*defbasetype-keys*
  '(:name
    :fix
    :topic))

;; This is just deffixtype with defaults for the names and with :define t.  We
;; wouldn't need to take the equiv name as an input, but since we're defining
;; it we'd like it to be tags-searchable.
(defun fty::defbasetype-fn (equiv pred keys)
  (declare (xargs :mode :program))
  (b* ((__function__ 'fty::defbasetype-fn)
       ((mv kwd-alist args) (std::extract-keywords __function__
                                                   fty::*defbasetype-keys*
                                                   keys nil))
       ((when args) (raise "Bad args: ~x0" args))
       (pkg (if (equal (symbol-package-name pred) "COMMON-LISP")
                'acl2::foo
              pred))
       (typename (or (std::getarg :name nil kwd-alist)
                     (b* ((predname (symbol-name pred))
                          (len (length predname))
                          (p? (char predname (- len 1)))
                          ((unless (eql p? #\P)) pred)
                          (dash? (char predname (- len 2)))
                          (newlen (- len (if (eql dash? #\-) 2 1))))
                       (intern-in-package-of-symbol
                        (subseq predname 0 newlen)
                        pkg))))
       (fix (or (std::getarg :fix nil kwd-alist)
                (intern-in-package-of-symbol
                 (concatenate 'string (symbol-name typename) "-FIX")
                 pkg)))
       (topic (std::getarg :topic typename kwd-alist)))
    `(fty::deffixtype ,typename :pred ,pred :fix ,fix :equiv ,equiv :define t :topic ,topic)))

(defmacro fty::defbasetype (equiv pred &rest keys)
  (fty::defbasetype-fn equiv pred keys))

(fty::defbasetype bit-equiv bitp :fix bfix :topic bitp)

(fty::defbasetype nat-equiv natp :fix nfix :topic natp)

(fty::defbasetype int-equiv integerp :fix ifix :name int :topic integerp)

(fty::defbasetype rational-equiv rationalp :fix rfix :topic rationalp)

(fty::defbasetype number-equiv acl2-numberp :fix fix :topic acl2-numberp)

(fty::deffixtype true-list
  :pred true-listp
  :fix list-fix
  :equiv list-equiv
  :topic true-listp)

(local (in-theory (enable streqv)))
(fty::deffixtype string
  :pred stringp
  :fix str-fix
  :equiv streqv
  :topic stringp)

(defsection true-p
  :parents (fty::basetypes)
  :short "@(call true-p) recognizes only the symbol @('t')."

  (defun true-p (x)
    (declare (xargs :guard t))
    (eq x t)))

(defsection true-fix
  :parents (fty::basetypes)
  :short "@(call true-fix) ignores its argument and unconditionally returns @('t')."

  (defun true-fix (x)
    (declare (xargs :guard t)
             (ignore x))
    t))

(defsection true-equiv
  :parents (fty::basetypes)
  :short "@(call true-equiv) is a ``degenerate'' equivalence for @(see true-p) objects."
  :long "<p>Because of the way @(see true-fix) works, this is always just true.</p>"

  ;; bozo gross
  (local (set-default-hints '('(:in-theory (enable true-fix true-p)))))

  (fty::deffixtype true
    :pred true-p
    :fix true-fix
    :equiv true-equiv
    :define t
    :topic true-p))

(defsection symbol-fix
  :parents (fty::basetypes symbolp)
  :short "@(call symbol-fix) is a fixing function for @(see symbolp); it is the
identity for symbols and coerces non-symbols to @('acl2::||'), i.e., the empty
symbol in the ACL2 package."

  :long "<p>Unfortunately it's not currently possible to come up with a good
symbol-fixing function that induces the proper congruences for both @(see
symbol-name) and @(see symbol-package-name).  This definition at least gives us
a congruence for @(see symbol-name).</p>

<p>BOZO consider adding a symbolp guard, inlining it, and turning it into an
identity function for execution.</p>"

  (defund symbol-fix (x)
    (declare (xargs :guard t))
    (if (symbolp x)
        x
      'acl2::||))

  (local (in-theory (enable symbol-fix)))

  (defthm symbolp-of-symbol-fix
    (symbolp (symbol-fix x))
    :rule-classes :type-prescription)

  (defthm symbol-fix-when-symbolp
    (implies (symbolp x)
             (equal (symbol-fix x) x))))

(defsection symbol-equiv
  :parents (fty::basetypes symbolp)
  :short "@(call symbol-equiv) recognizes symbols that are identical under
@(see symbol-fix)."

  (local (in-theory (enable symbol-fix)))

  (fty::defbasetype symbol-equiv symbolp :topic symbolp)

  (defcong symbol-equiv equal (symbol-name x) 1))


(defsection pos-equiv
  :parents (fty::basetypes posp)
  :short "@(call pos-equiv) is equality for positive numbers, i.e., equality up
to @(see pos-fix)."

  (fty::defbasetype pos-equiv posp :fix pos-fix :topic posp))


(defsection lposfix
  :parents (fty::basetypes posp)
  :short "@(call lposfix) is logically identical to @(call pos-fix), but its
guard requires that @('x') is a @(see posp) and, in the execution, it's just a
no-op that returns @('x')."

  (defun-inline lposfix (x)
    ;; enabled
    (declare (xargs :guard (posp x)))
    (mbe :logic (pos-fix x)
         :exec x)))


(fty::deffixtype character
  :pred characterp
  :fix char-fix
  :equiv chareqv)


(defsection any-p
  :parents (fty::basetypes)
  :short "@(call any-p) is always true; i.e., it recognizes any ACL2 object."

  :long "<p>This is a ``degenerate'' recognizer which is sometimes useful for
@(see fty).  For instance, it allows you to have fields within a @(see
fty::defprod) that are completely unconstrained, which may be especially useful
when you are in the early stages of development and haven't yet thought much
about types.</p>"

  (defun-inline any-p (x)
    (declare (xargs :guard t)
             (ignore x))
    t))

(fty::deffixtype any
  :pred any-p
  :fix  identity
  :equiv equal
  :topic any-p)


(defsection bool-fix
  :parents (fty::basetypes booleanp)
  :short "@(call bool-fix) is a fixing function for Booleans; it coerces any
non-@('nil') symbol to @('t')."
  :long "<p>BOZO: could consider putting a @(see booleanp) guard here.</p>"

  (defund-inline bool-fix (x)
    (declare (xargs :guard t))
    (and x t))

  (local (in-theory (enable bool-fix)))

  (defthm booleanp-of-bool-fix
    (booleanp (bool-fix x))
    :rule-classes :type-prescription)

  (defthm bool-fix-when-booleanp
    (implies (booleanp x)
             (equal (bool-fix x) x)))

  (fty::deffixtype bool
    :pred booleanp
    :fix bool-fix
    :equiv iff
    :topic booleanp)

  (defcong iff equal (bool-fix x) 1)

  (defthm bool-fix-under-iff
    (iff (bool-fix x) x)))



(defthm maybe-natp-when-natp
  ;; BOZO non-local, move to std/defs instead?
  (implies (natp x)
           (maybe-natp x)))

(defthmd natp-when-maybe-natp
  ;; BOZO non-local, move to std/defs instead?
  (implies (and (maybe-natp x)
                (double-rewrite x))
           (natp x)))

(defsection maybe-natp-fix
  :parents (fty::basetypes maybe-natp)
  :short "@(call maybe-natp-fix) is the identity for @(see maybe-natp)s, or
  coerces any invalid object to @('nil')."
  :long "<p>Performance note.  In the execution this is just an inlined
  identity function, i.e., it should have zero runtime cost.</p>"

  (defund-inline maybe-natp-fix (x)
    (declare (xargs :guard (maybe-natp x)))
    (mbe :logic (if x (nfix x) nil)
         :exec x))

  (local (in-theory (enable maybe-natp-fix)))

  (defthm maybe-natp-of-maybe-natp-fix
    (maybe-natp (maybe-natp-fix x))
    :rule-classes (:rewrite :type-prescription))

  (defthm maybe-natp-fix-when-maybe-natp
    (implies (maybe-natp x)
             (equal (maybe-natp-fix x) x)))

  (defthm maybe-natp-fix-under-iff
    (iff (maybe-natp-fix x) x))

  (defthm maybe-natp-fix-under-nat-equiv
    (acl2::nat-equiv (maybe-natp-fix x) x)
    :hints(("Goal" :in-theory (enable maybe-natp-fix)))))

(defsection maybe-nat-equiv
  :parents (fty::basetypes maybe-natp)
  :short "@('(maybe-natp-equiv x y)') is an equivalence relation for @(see
  maybe-natp)s, i.e., equality up to @(see maybe-natp-fix)."
  :long "<p>Performance note.  In the execution, this is just an inlined call
  of @(see eql).</p>"

  (fty::deffixtype maybe-nat
    :pred maybe-natp
    :fix maybe-natp-fix
    :equiv maybe-nat-equiv
    :define t
    :inline t
    :equal eql
    :topic maybe-natp))


(defthm maybe-posp-when-posp
  ;; BOZO non-local, move to std/defs instead?
  (implies (posp x)
           (maybe-posp x)))

(defthmd posp-when-maybe-posp
  ;; BOZO non-local, move to std/defs instead?
  (implies (and (maybe-posp x)
                (double-rewrite x))
           (posp x)))


(defsection maybe-posp-fix
  :parents (fty::basetypes maybe-posp)
  :short "@(call maybe-posp-fix) is the identity for @(see maybe-posp)s, or
  coerces any non-@(see posp) to @('nil')."
  :long "<p>Performance note.  In the execution this is just an inlined
  identity function, i.e., it should have zero runtime cost.</p>"

  (defund-inline maybe-posp-fix (x)
    (declare (xargs :guard (maybe-posp x)))
    (mbe :logic (if x (pos-fix x) nil)
         :exec x))

  (local (in-theory (enable maybe-posp-fix)))

  (defthm maybe-posp-of-maybe-posp-fix
    (maybe-posp (maybe-posp-fix x))
    :rule-classes (:rewrite :type-prescription))

  (defthm maybe-posp-fix-when-maybe-posp
    (implies (maybe-posp x)
             (equal (maybe-posp-fix x) x)))

  (defthm maybe-posp-fix-under-iff
    (iff (maybe-posp-fix x) x))

  (defthm maybe-posp-fix-under-pos-equiv
    (acl2::pos-equiv (maybe-posp-fix x) x)
    :hints(("Goal" :in-theory (enable maybe-posp-fix)))))


(defsection maybe-pos-equiv
  :parents (fty::basetypes maybe-posp)
  :short "@('(maybe-posp-equiv x y)') is an equivalence relation for @(see
  maybe-posp)s, i.e., equality up to @(see maybe-posp-fix)."
  :long "<p>Performance note.  In the execution, this is just an inlined call
  of @(see eql).</p>"

  (fty::deffixtype maybe-pos
    :pred maybe-posp
    :fix maybe-posp-fix
    :equiv maybe-pos-equiv
    :define t
    :inline t
    :equal eql
    :topic maybe-posp))

(defthm maybe-bitp-when-bitp
  ;; BOZO non-local, move to std/defs instead?
  (implies (bitp x)
           (maybe-bitp x)))

(defthmd bitp-when-maybe-bitp
  ;; BOZO non-local, move to std/defs instead?
  (implies (and (maybe-bitp x)
                (double-rewrite x))
           (bitp x))
  :hints (("Goal" :in-theory (e/d (maybe-bitp) ()))))


(defsection maybe-bit-fix
  :parents (fty::basetypes maybe-bitp)
  :short "@(call maybe-bit-fix) is the identity for @(see maybe-bitp)s, or
  coerces any non-@(see bitp) to @('nil')."
  :long "<p>Performance note.  In the execution this is just an inlined
  identity function, i.e., it should have zero runtime cost.</p>"

  (defund-inline maybe-bit-fix (x)
    (declare (xargs :guard (maybe-bitp x)
                    :guard-hints (("Goal" :in-theory (e/d (maybe-bitp)
                                                          ())))))
    (mbe :logic (if x (bfix x) nil)
         :exec x))

  (local (in-theory (enable maybe-bitp maybe-bit-fix)))

  (defthm maybe-bitp-of-maybe-bit-fix
    (maybe-bitp (maybe-bit-fix x))
    :rule-classes (:rewrite :type-prescription))

  (defthm maybe-bit-fix-when-maybe-bitp
    (implies (maybe-bitp x)
             (equal (maybe-bit-fix x) x)))

  (defthm maybe-bit-fix-under-iff
    (iff (maybe-bit-fix x) x))

  (defthm maybe-bit-fix-under-bit-equiv
    (acl2::bit-equiv (maybe-bit-fix x) x)
    :hints(("Goal" :in-theory (enable maybe-bit-fix)))))


(defsection maybe-bit-equiv
  :parents (fty::basetypes maybe-bitp)
  :short "@('(maybe-bitp-equiv x y)') is an equivalence relation for @(see
  maybe-bitp)s, i.e., equality up to @(see maybe-bit-fix)."
  :long "<p>Performance note.  In the execution, this is just an inlined call
  of @(see eql).</p>"

  (fty::deffixtype maybe-bit
    :pred maybe-bitp
    :fix maybe-bit-fix
    :equiv maybe-bit-equiv
    :define t
    :inline t
    :equal eql
    :topic maybe-bitp))

(defthm maybe-integerp-when-integerp
  ;; BOZO non-local, move to std/defs instead?
  (implies (integerp x)
           (maybe-integerp x)))

(defthmd integerp-when-maybe-integerp
  ;; BOZO non-local, move to std/defs instead?
  (implies (and (maybe-integerp x)
                (double-rewrite x))
           (integerp x)))

(defsection maybe-integerp-fix
  :parents (fty::basetypes maybe-integerp)
  :short "@(call maybe-integerp-fix) is the identity for @(see maybe-integerp)s, or
  coerces any invalid object to @('nil')."
  :long "<p>Performance note.  In the execution this is just an inlined
  identity function, i.e., it should have zero runtime cost.</p>"

  (defund-inline maybe-integerp-fix (x)
    (declare (xargs :guard (maybe-integerp x)))
    (mbe :logic (if x (ifix x) nil)
         :exec x))

  (local (in-theory (enable maybe-integerp-fix)))

  (defthm maybe-integerp-of-maybe-integerp-fix
    (maybe-integerp (maybe-integerp-fix x))
    :rule-classes (:rewrite :type-prescription))

  (defthm maybe-integerp-fix-when-maybe-integerp
    (implies (maybe-integerp x)
             (equal (maybe-integerp-fix x) x)))

  (defthm maybe-integerp-fix-under-iff
    (iff (maybe-integerp-fix x) x))

  (defthm maybe-integerp-fix-under-int-equiv
    (acl2::int-equiv (maybe-integerp-fix x) x)
    :hints(("Goal" :in-theory (enable maybe-integerp-fix)))))

(defsection maybe-integer-equiv
  :parents (fty::basetypes maybe-integerp)
  :short "@('(maybe-integerp-equiv x y)') is an equivalence relation for @(see
  maybe-integerp)s, i.e., equality up to @(see maybe-integerp-fix)."
  :long "<p>Performance note.  In the execution, this is just an inlined call
  of @(see eql).</p>"

  (fty::deffixtype maybe-integer
    :pred maybe-integerp
    :fix maybe-integerp-fix
    :equiv maybe-integer-equiv
    :define t
    :inline t
    :equal eql
    :topic maybe-integerp))



(defun fty::make-basetypes-table-rchars (table acc)
  (declare (xargs :mode :program))
  (b* (((when (atom table)) acc)
       ((fty::fixtype type) (cdar table))
       (row (concatenate 'string
                         "<tr><td><sf>" (string-downcase (symbol-name type.name)) "</sf></td>"
                         ;; BOZO, can't use xdoc::see here because of horrible dependency loop
                         "<td>@(see |" (symbol-package-name type.pred) "|::|" (symbol-name type.pred) "|)</td>"
                         "<td>@(see |" (symbol-package-name type.fix) "|::|" (symbol-name type.fix) "|)</td>"
                         "<td><tt>" (string-downcase (symbol-name type.equiv)) "</tt></td>"
                         "</tr>"))
       (acc (revappend (coerce row 'list) acc))
       (acc (cons #\Newline acc)))
    (fty::make-basetypes-table-rchars (cdr table) acc)))

(make-event
 (let* ((types (cdar (table-alist 'fty::fixtypes (w state))))
        (rows  (reverse (coerce (fty::make-basetypes-table-rchars (reverse types) nil) 'string))))
   `(defxdoc fty::basetypes
      :parents (fty::fty)
      :short "A book that associates many built-in ACL2 predicates with
suitable fixing functions and equivalence relations, for use in the @(see
fty::fty-discipline)."

      :long (concatenate
             'string
             "<p>The @('centaur/fty/basetypes') book provides basic support for
using many built-in ACL2 types with the FTY discipline.  It introduces any
necessary fixing functions and equivalences, and then sets up @(see
fty::deffixtype) associations between the recognizers, fixing functions, and
equivalence relations for the following types.</p>

<p>See also @(see fty::baselists), which sets up similar support for various
built-in list recognizers like @(see character-listp), etc.</p>

<table>
<tr><th>Type Name</th> <th>Recognizer</th> <th>Fix</th> <th>Equiv</th></tr>" ,rows "</table>

<p>Note: all of these associations are made in the ACL2 package.</p>
"))))