/usr/share/acl2-6.3/books/str/eqv.lisp is in acl2-books-source 6.3-5.
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 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 | ; ACL2 String Library
; Copyright (C) 2009-2013 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/
;
; This program is free software; you can redistribute it and/or modify it under
; the terms of the GNU General Public License as published by the Free Software
; Foundation; either version 2 of the License, or (at your option) any later
; version. This program is distributed in the hope that it will be useful but
; WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
; FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
; more details. You should have received a copy of the GNU General Public
; License along with this program; if not, write to the Free Software
; Foundation, Inc., 51 Franklin Street, Suite 500, Boston, MA 02110-1335, USA.
;
; Original author: Jared Davis <jared@centtech.com>
(in-package "STR")
(include-book "coerce")
(include-book "std/lists/equiv" :dir :system)
(include-book "std/lists/rev" :dir :system)
(local (include-book "arithmetic"))
(in-theory (disable char<))
(defsection chareqv
:parents (equivalences)
:short "Case-sensitive character equivalence test."
:long "<p>@(call chareqv) determines if @('x') and @('y') are equivalent when
interpreted as characters. That is, non-characters are first coerced to be the
NUL character (via @(see char-fix)), then we see if these coerced arguments are
equal.</p>
<p>See also @(see ichareqv) for a case-insensitive alternative.</p>"
(definlined chareqv (x y)
(declare (xargs :guard t))
(eql (char-fix x) (char-fix y)))
(local (in-theory (enable chareqv char-fix char<)))
(defequiv chareqv)
(defthm chareqv-of-char-fix
(chareqv (char-fix x) x))
(defcong chareqv equal (char-fix x) 1)
(defcong chareqv equal (char-code x) 1)
(defcong chareqv equal (char< x y) 1)
(defcong chareqv equal (char< x y) 2))
(defsection char<-order-thms
:parents (char<)
:short "Basic ordering facts about @('char<')."
(local (in-theory (enable char<)))
(defthm char<-irreflexive
(equal (char< x x)
nil))
(defthm char<-antisymmetric
(implies (char< x y)
(not (char< y x))))
(defthm char<-transitive
(implies (and (char< x y)
(char< y z))
(char< x z)))
(defthm char<-trichotomy-weak
(implies (and (not (char< x y))
(not (char< y x)))
(equal (chareqv x y)
t))
:hints(("Goal" :in-theory (enable chareqv))))
(defthm char<-trichotomy-strong
(equal (char< x y)
(and (not (chareqv x y))
(not (char< y x))))
:rule-classes ((:rewrite :loop-stopper ((x y))))))
(defsection charlisteqv
:parents (equivalences)
:short "Case-sensitive character-list equivalence test."
:long "<p>@(call charlisteqv) determines if @('x') and @('y') are equivalent
when interpreted as character lists. That is, @('x') and @('y') must have the
same length and their elements must be @(see chareqv) to one another.</p>
<p>See also @(see icharlisteqv) for a case-insensitive alternative.</p>"
(defund charlisteqv (x y)
(declare (xargs :guard (and (character-listp x)
(character-listp y))))
(if (consp x)
(and (consp y)
(chareqv (car x) (car y))
(charlisteqv (cdr x) (cdr y)))
(atom y)))
(local (in-theory (enable charlisteqv)))
(defequiv charlisteqv)
(defrefinement list-equiv charlisteqv
:hints(("Goal" :in-theory (enable list-equiv))))
(defcong charlisteqv chareqv (car x) 1)
(defcong charlisteqv charlisteqv (cdr x) 1)
(defcong chareqv charlisteqv (cons a x) 1)
(defcong charlisteqv charlisteqv (cons a x) 2)
(defcong charlisteqv equal (len x) 1)
(defcong charlisteqv charlisteqv (list-fix x) 1)
(defcong charlisteqv chareqv (nth n x) 2)
(defcong charlisteqv charlisteqv (take n x) 2)
(defcong charlisteqv charlisteqv (nthcdr n x) 2)
(defcong charlisteqv charlisteqv (append x y) 1)
(defcong charlisteqv charlisteqv (append x y) 2)
(defcong charlisteqv charlisteqv (rev x) 1)
(defcong charlisteqv charlisteqv (revappend x y) 2)
(defcong charlisteqv charlisteqv (revappend x y) 1)
(encapsulate
()
(local (defun my-induct (x y)
(if (atom x)
(list x y)
(my-induct (cdr x) (cdr y)))))
(defcong charlisteqv equal (make-character-list x) 1
:hints(("Goal"
:in-theory (enable chareqv)
:induct (my-induct x x-equiv)))))
(encapsulate
()
(local (defun my-induct (x y)
(if (atom x)
(list x y)
(my-induct (cdr x) (cdr y)))))
(local (defthm crock
(equal (charlisteqv x y)
(equal (make-character-list x)
(make-character-list y)))
:hints(("Goal"
:in-theory (enable chareqv)
:induct (my-induct x y)))))
(defcong charlisteqv equal (implode x) 1
:hints(("Goal"
:in-theory (disable implode-of-make-character-list)
:use ((:instance implode-of-make-character-list (x x))
(:instance implode-of-make-character-list (x x-equiv)))))))
(defthm charlisteqv-when-not-consp-left
(implies (not (consp x))
(equal (charlisteqv x y)
(atom y))))
(defthm charlisteqv-when-not-consp-right
(implies (not (consp y))
(equal (charlisteqv x y)
(atom x))))
(defthm charlisteqv-of-cons-right
(equal (charlisteqv x (cons a y))
(and (consp x)
(chareqv (car x) (double-rewrite a))
(charlisteqv (cdr x) (double-rewrite y)))))
(defthm charlisteqv-of-cons-left
(equal (charlisteqv (cons a x) y)
(and (consp y)
(chareqv (double-rewrite a) (car y))
(charlisteqv (double-rewrite x) (cdr y)))))
(defthm charlisteqv-when-not-same-lens
(implies (not (equal (len x) (len y)))
(not (charlisteqv x y)))))
(defsection str-fix
:parents (equivalences)
:short "Coerce to a string."
:long "<p>@(call str-fix) is the identity on @(see acl2::stringp)s, or
returns the empty string, @('\"\"'), for any non-string.</p>
<p>This is similar to other fixing functions like @(see fix) and @(see nfix).
See also @(see streqv).</p>"
(definlined str-fix (x)
(declare (xargs :guard t))
(if (stringp x)
x
""))
(local (in-theory (enable str-fix)))
(defthm str-fix-default
(implies (not (stringp x))
(equal (str-fix x)
"")))
(defthm str-fix-when-stringp
(implies (stringp x)
(equal (str-fix x)
x))))
(defsection streqv
:parents (equivalences)
:short "Case-sensitive string equivalence test."
:long "<p>@(call streqv) determines if @('x') and @('y') are equivalent when
interpreted as strings. That is, non-strings are first coerced to be the empty
string (via @(see str-fix)), then we see if these coerced arguments are
equal.</p>
<p>See also @(see istreqv) for a case-insensitive alternative.</p>"
(definlined streqv (x y)
(declare (xargs :guard t))
(equal (str-fix x) (str-fix y)))
(local (in-theory (enable streqv str-fix)))
(defequiv streqv)
(defthm streqv-of-str-fix
(streqv (str-fix x) x))
(defcong streqv equal (char x n) 1)
(defcong streqv equal (explode x) 1)
(defcong streqv equal (string-append x y) 1)
(defcong streqv equal (string-append x y) 2))
|