File: fp.lisp

package info (click to toggle)
acl2 8.6%2Bdfsg-2
  • links: PTS
  • area: main
  • in suites: trixie
  • size: 1,111,420 kB
  • sloc: lisp: 17,818,294; java: 125,359; python: 28,122; javascript: 23,458; cpp: 18,851; ansic: 11,569; perl: 7,678; xml: 5,591; sh: 3,976; makefile: 3,833; ruby: 2,633; yacc: 1,126; ml: 763; awk: 295; csh: 233; lex: 197; php: 178; tcl: 49; asm: 23; haskell: 17
file content (198 lines) | stat: -rw-r--r-- 6,302 bytes parent folder | download | duplicates (2)
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
; Copyright (C) 2024, Matt Kaufmann and J Strother Moore
; Written by Matt Kaufmann and J Strother Moore
; License: A 3-clause BSD license.  See the LICENSE file distributed with ACL2.

; This book illustrates the power of partial-encapsulate, showing how it is
; used in the implementation of floating-point operations in ACL2.

; Warning: This book takes advantage of a trust tag to produce a proof of nil!

(in-package "ACL2")

(include-book "tools/include-raw" :dir :system)

(partial-encapsulate
 (((constrained-to-fp *) => *
   :formals (x)
   :guard (rationalp x)))
 nil ; supporters
 (local (defun constrained-to-fp (x)
          (declare (ignore x))
          0))
 (defthm rationalp-constrained-to-fp
   (rationalp (constrained-to-fp x))
   :rule-classes :type-prescription)
 (defthm constrained-to-fp-idempotent
   (equal (constrained-to-fp (constrained-to-fp x))
          (constrained-to-fp x)))
 (defthm constrained-to-fp-minus
   (implies (and (rationalp x)
                 (equal (constrained-to-fp x) x))
            (equal (constrained-to-fp (- x))
                   (- x))))
 (defthm constrained-to-fp-default
   (implies (not (rationalp x))
            (equal (constrained-to-fp x) 0)))
 (defthm constrained-to-fp-0
   (equal (constrained-to-fp 0) 0))
 (defthm constrained-to-fp-monotonicity
   (implies (and (<= x y)
                 (rationalp x)
                 (rationalp y))
            (<= (constrained-to-fp x)
                (constrained-to-fp y)))
   :rule-classes (:linear :rewrite)))

(defun to-fp (x)
  (declare (xargs :guard (rationalp x)))
  (constrained-to-fp x))

(defun fpp (x)
  (declare (xargs :guard t))
  (and (rationalp x) (= (to-fp x) x)))

(partial-encapsulate
 (((constrained-fp-sqrt *) => *
   :formals (x)
   :guard (and (rationalp x)
               (<= 0 x))))
 nil ; supporters
 (local (defun constrained-fp-sqrt (x)
          (declare (ignore x))
          0))
 (defthm fpp-constrained-fp-sqrt-fn
   (fpp (constrained-fp-sqrt x)))
 (defthm rationalp-constrained-fp-sqrt-fn
   (rationalp (constrained-fp-sqrt x))
   :rule-classes :type-prescription))

(defun fp-sqrt (x)
  (declare (xargs :guard (and (rationalp x)
                              (<= 0 x))))
  (constrained-fp-sqrt x))

(partial-encapsulate
 (((fp-round *)
   => *
   :formals (x)
   :guard (rationalp x)))
 nil ; supporters
 (local (defun fp-round (x)
          (to-fp x)))
 (defthm rationalp-fp-round
   (rationalp (fp-round x))
   :rule-classes :type-prescription)
 (defthm fpp-fp-round (fpp (fp-round r)))
 (defthm fp-round-is-identity-for-fpp
   (implies (fpp r)
            (equal (fp-round r) r)))
 (defthm fp-round-monotonicity
   (implies (and (<= x y)
                 (rationalp x)
                 (rationalp y))
            (<= (fp-round x) (fp-round y)))
   :rule-classes (:linear :rewrite)))

(defthm fp-round-idempotent

; This follows from fp-round-is-identity-for-dfp together with dfp-fp-round.

  (equal (fp-round (fp-round x))
         (fp-round x)))

(defun fp+ (x y)
  (declare (xargs :guard (and (fpp x) (fpp y))))
  (fp-round (+ x y)))

(defttag :fp)

(include-raw "fp-raw.lsp")

(defttag nil)

(defmacro assert-thm (x)

; We check not only that x evaluates to a non-nil value but that x is provable,
; presumably by execution.  The latter is worth checking because not all
; top-level executions can be done during proofs, notably, when attachments are
; used.

  `(progn (assert-event ,x)
          (thm ,x)))

(assert-thm (equal (to-fp 1/4) 1/4))
(assert-thm (fpp 1/4))

; This happens to be true in all Lisps that can host ACL2:
(assert-thm (equal (to-fp 1/3)
                   6004799503160661/18014398509481984))
(assert-thm (let* ((fp (to-fp 1/3))
                   (diff (abs (- 1/3 fp))))
              (and (< 0 diff)
                   (< diff (expt 10 -10))))) ; 10^(-10) is somewhat arbitrary
(assert-thm (equal (to-fp 1/3)
                   (to-fp (to-fp 1/3))))
; Fails in GCL 2.6.14:
#+(or (not gcl) gcl-2.7.0+)
(assert-thm (not (fpp 1/3)))

; Rounding the exact square root of 4 is rounding 2, which is 2.
(assert-thm (equal (fp-sqrt 4) 2))

(assert-thm (< (abs (- (expt (fp-sqrt 5) 2) 5))
               (expt 10 -10)))

(assert-thm (equal (fp+ 1/4 5/4) 3/2))

(assert-thm (< (abs (- (fp+ (to-fp 1/3) (to-fp 2/3))
                       1)) ; difference might or might not be 0
               (expt 10 -10))) ; 10^(-10) is somewhat arbitrary

; Below are some proofs of nil.  Explanations are somewhat technical.

; The following proof of nil illustrates that *1* functions (see :DOC
; evaluation) need to coerce double-float results to rationals, something that
; is done in the ACL2 implementation of dfs.
(local
 (encapsulate
   ()
   (local (defun f1 (x)
            (declare (xargs :guard (rationalp x)))
            (to-fp x)))
   (local (defthm not-rationalp-f1-3
            (not (rationalp (f1 3)))
            :rule-classes nil))
   (local (defthm rationalp-f1-3
            (rationalp (f1 3))
            :hints (("Goal" :in-theory (disable (:e f1) (:e to-fp))))
            :rule-classes nil))
   (defthm nil-is-true-1
     nil
     :hints (("Goal" :use (not-rationalp-f1-3 rationalp-f1-3)))
     :rule-classes nil)))

; This proof of nil illustrates why ACL2 tracks dfs much as it tracks stobjs,
; so that for example a double-float isn't given as an argument to EQUAL.
; (Perhaps this issue could instead by adding a double-float datatype to ACL2
; and defining EQUAL to return nil if exactly one argument is a double-float,
; but the prover relies heavily on EQUAL being defined as true equality.  So
; then we might distinguish between ACL2::EQUAL and COMMON-LISP::EQUAL.  But
; that would probably present many opportunities for bugs and might well
; require major changes to the community books.)
(local
 (encapsulate
   ()
   (local (defun f2 ()
            (declare (xargs :guard t))
            (equal 1 (to-fp 1))))
   (local (defthm f2-false ; (to-fp 1) is 1.0 in raw Lisp, not the integer 1
            (not (f2))
            :rule-classes nil))
   (local (defthm f2-true ; logically, (to-fp 1) is 1
            (f2)
            :hints (("Goal" :in-theory (disable (:e f2))))
            :rule-classes nil))
   (defthm nil-is-true-2
     nil
     :hints (("Goal" :use (f2-false f2-true)))
     :rule-classes nil)))