Package word-bits: Word to bit-list conversions

Information

name	word-bits
version	1.33
description	Word to bit-list conversions
author	Joe Hurd <joe@gilith.com>
license	MIT
requires	bool natural list word-def
show	Data.Bool Data.List Data.Word Data.Word.Bits Number.Natural

Files

Package tarball word-bits-1.33.tgz
Theory file word-bits.thy (included in the package tarball)

Defined Constants

Data
- Word
  - and
  - bit
  - not
  - or
  - shiftLeft
  - shiftRight
  - Bits
    - compare
    - fromWord
    - normal
    - toWord

Theorems

⊦ ∀w. normal (fromWord w)

⊦ ∀w. w ≤ w

⊦ toWord [] = 0

⊦ toNatural (toWord []) = 0

⊦ ∀w. ¬(w < w)

⊦ ∀w. toWord (fromWord w) = w

⊦ ∀w. length (fromWord w) = width

⊦ ∀q. compare q [] [] ⇔ q

⊦ ∀l. normal l ⇔ length l = width

⊦ ∀w. not w = toWord (map (¬) (fromWord w))

⊦ ∀w. fromWord w = map (bit w) (interval 0 width)

⊦ ∀l. toNatural (toWord l) < exp 2 (length l)

⊦ ∀l. length l = width ⇔ fromWord (toWord l) = l

⊦ ∀w1 w2. fromWord w1 = fromWord w2 ⇔ w1 = w2

⊦ ∀w1 w2. fromWord w1 = fromWord w2 ⇒ w1 = w2

⊦ ∀w n. bit w n ⇔ odd (toNatural (shiftRight w n))

⊦ ∀w1 w2. compare F (fromWord w1) (fromWord w2) ⇔ w1 < w2

⊦ ∀w1 w2. compare T (fromWord w1) (fromWord w2) ⇔ w1 ≤ w2

⊦ ∀l. width ≤ length l ⇒ fromWord (toWord l) = take width l

⊦ ∀w1 w2. and w1 w2 = toWord (zipWith (∧) (fromWord w1) (fromWord w2))

⊦ ∀w1 w2. or w1 w2 = toWord (zipWith (∨) (fromWord w1) (fromWord w2))

⊦ ∀l n. shiftLeft (toWord l) n = toWord (replicate n F @ l)

⊦ ∀w1 w2 w3. w1 < w2 ∧ w2 < w3 ⇒ w1 < w3

⊦ ∀w1 w2 w3. w1 < w2 ∧ w2 ≤ w3 ⇒ w1 < w3

⊦ ∀w1 w2 w3. w1 ≤ w2 ∧ w2 < w3 ⇒ w1 < w3

⊦ ∀w1 w2 w3. w1 ≤ w2 ∧ w2 ≤ w3 ⇒ w1 ≤ w3

⊦ ∀n. toWord (odd n :: fromWord (fromNatural (n div 2))) = fromNatural n

⊦ ∀w n. bit w n ⇔ odd (toNatural w div exp 2 n)

⊦ ∀w n. shiftLeft w n = fromNatural (exp 2 n * toNatural w)

⊦ ∀w n. shiftRight w n = fromNatural (toNatural w div exp 2 n)

⊦ ∀l.
length l ≤ width ⇒
fromWord (toWord l) = l @ replicate (width - length l) F

⊦ ∀q w1 w2.
compare q (fromWord w1) (fromWord w2) ⇔ if q then w1 ≤ w2 else w1 < w2

⊦ ∀w1 w2. (∀i. i < width ⇒ (bit w1 i ⇔ bit w2 i)) ⇒ w1 = w2

⊦ ∀l. 2 * toNatural (toWord l) + 1 < exp 2 (suc (length l))

⊦ ∀l n. bit (toWord l) n ⇔ n < width ∧ n < length l ∧ nth n l

⊦ ∀n.
    fromNatural n =
    toWord
      (if n = 0 then [] else odd n :: fromWord (fromNatural (n div 2)))

⊦ ∀l.
    fromWord (toWord l) =
    if length l ≤ width then l @ replicate (width - length l) F
    else take width l

⊦ ∀h t.
toWord (h :: t) =
if h then shiftLeft (toWord t) 1 + 1 else shiftLeft (toWord t) 1

⊦ ∀h t.
toNatural (toWord (h :: t)) =
(2 * toNatural (toWord t) + if h then 1 else 0) mod modulus

⊦ ∀h t.
2 * toNatural (toWord t) + (if h then 1 else 0) <
exp 2 (suc (length t))

⊦ ∀l n.
    length l ≤ width ⇒
    shiftRight (toWord l) n =
    if length l ≤ n then toWord [] else toWord (drop n l)

⊦ ∀l n.
    width ≤ length l ⇒
    shiftRight (toWord l) n =
    if width ≤ n then toWord [] else toWord (drop n (take width l))

⊦ ∀q h1 h2 t1 t2.
compare q (h1 :: t1) (h2 :: t2) ⇔
compare (¬h1 ∧ h2 ∨ ¬(h1 ∧ ¬h2) ∧ q) t1 t2

⊦ ∀l n.
    shiftRight (toWord l) n =
    if length l ≤ width then
      if length l ≤ n then toWord [] else toWord (drop n l)
    else if width ≤ n then toWord []
    else toWord (drop n (take width l))

Input Type Operators

→
bool
Data
- List
  - list
- Word
  - word
Number
- Natural
  - natural

Input Constants

=
select
Data
- Bool
  - ∀
  - ∧
  - ⇒
  - ∃
  - ∨
  - ¬
  - cond
  - F
  - T
- List
  - ::
  - @
  - []
  - drop
  - head
  - interval
  - length
  - map
  - nth
  - replicate
  - tail
  - take
  - zipWith
- Word
  - +
  - <
  - ≤
  - fromNatural
  - modulus
  - toNatural
  - width
Number
- Natural
  - *
  - +
  - -
  - <
  - ≤
  - bit0
  - bit1
  - div
  - even
  - exp
  - mod
  - odd
  - suc
  - zero

Assumptions

⊦ T

⊦ ¬(modulus = 0)

⊦ ¬F ⇔ T

⊦ ¬T ⇔ F

⊦ even 0 ⇔ T

⊦ odd 0 ⇔ F

⊦ length [] = 0

⊦ bit0 0 = 0

⊦ ∀t. t ⇒ t

⊦ ∀n. 0 ≤ n

⊦ ∀n. n ≤ n

⊦ F ⇔ ∀p. p

⊦ ∀t. t ∨ ¬t

⊦ ∀x. toNatural x < modulus

⊦ ∀n. 0 < suc n

⊦ ∀n. n < suc n

⊦ ∀n. n ≤ suc n

⊦ (¬) = λp. p ⇒ F

⊦ (∃) = λp. p ((select) p)

⊦ ∀t. (∀x. t) ⇔ t

⊦ ∀t. (λx. t x) = t

⊦ (∀) = λp. p = λx. T

⊦ ∀x. replicate 0 x = []

⊦ ∀t. ¬¬t ⇔ t

⊦ ∀t. (T ⇔ t) ⇔ t

⊦ ∀t. (t ⇔ T) ⇔ t

⊦ ∀t. F ∧ t ⇔ F

⊦ ∀t. T ∧ t ⇔ t

⊦ ∀t. t ∧ F ⇔ F

⊦ ∀t. t ∧ T ⇔ t

⊦ ∀t. t ∧ t ⇔ t

⊦ ∀t. F ⇒ t ⇔ T

⊦ ∀t. T ⇒ t ⇔ t

⊦ ∀t. t ⇒ T ⇔ T

⊦ ∀t. F ∨ t ⇔ t

⊦ ∀t. T ∨ t ⇔ T

⊦ ∀t. t ∨ F ⇔ t

⊦ ∀t. t ∨ T ⇔ T

⊦ ∀x. fromNatural (toNatural x) = x

⊦ ∀n. ¬(suc n = 0)

⊦ ∀n. even n ∨ odd n

⊦ ∀m. m < 0 ⇔ F

⊦ ∀n. 0 * n = 0

⊦ ∀n. 0 + n = n

⊦ ∀m. m + 0 = m

⊦ ∀m. m - 0 = m

⊦ ∀n. n - n = 0

⊦ ∀m. interval m 0 = []

⊦ ∀l. [] @ l = l

⊦ ∀l. drop 0 l = l

⊦ ∀f. map f [] = []

⊦ modulus = exp 2 width

⊦ ∀t. (F ⇔ t) ⇔ ¬t

⊦ ∀t. (t ⇔ F) ⇔ ¬t

⊦ ∀t. t ⇒ F ⇔ ¬t

⊦ ∀x. toNatural x div modulus = 0

⊦ ∀n. even (2 * n)

⊦ ∀n. bit1 n = suc (bit0 n)

⊦ ∀n. ¬even n ⇔ odd n

⊦ ∀n. ¬odd n ⇔ even n

⊦ ∀m. exp m 0 = 1

⊦ ∀m. m * 1 = m

⊦ ∀n. n div 1 = n

⊦ ∀n. exp n 1 = n

⊦ ∀n. n mod 1 = 0

⊦ ∀m. 1 * m = m

⊦ ∀l. take (length l) l = l

⊦ ∀m n. m ≤ m + n

⊦ ∀m n. n ≤ m + n

⊦ (⇒) = λp q. p ∧ q ⇔ p

⊦ ∀t. (t ⇔ T) ∨ (t ⇔ F)

⊦ ∀n. odd (suc (2 * n))

⊦ ∀m. suc m = m + 1

⊦ ∀n. even (suc n) ⇔ ¬even n

⊦ ∀m. m ≤ 0 ⇔ m = 0

⊦ ∀x. toNatural (fromNatural x) = x mod modulus

⊦ ∀t1 t2. (if F then t1 else t2) = t2

⊦ ∀t1 t2. (if T then t1 else t2) = t1

⊦ ∀h t. head (h :: t) = h

⊦ ∀h t. tail (h :: t) = t

⊦ ∀n x. length (replicate n x) = n

⊦ ∀m n. length (interval m n) = n

⊦ ∀n. 0 < n ⇔ ¬(n = 0)

⊦ ∀n. bit0 (suc n) = suc (suc (bit0 n))

⊦ ∀x y. x = y ⇒ y = x

⊦ ∀h t. nth 0 (h :: t) = h

⊦ ∀t1 t2. t1 ∧ t2 ⇔ t2 ∧ t1

⊦ ∀t1 t2. t1 ∨ t2 ⇔ t2 ∨ t1

⊦ ∀m n. m * n = n * m

⊦ ∀m n. m + n = n + m

⊦ ∀m n. m = n ⇒ m ≤ n

⊦ ∀m n. m < n ⇒ m ≤ n

⊦ ∀m n. m ≤ n ∨ n ≤ m

⊦ ∀m n. m + n - m = n

⊦ ∀l f. length (map f l) = length l

⊦ ∀n. n < modulus ⇒ n mod modulus = n

⊦ ∀n. 2 * n = n + n

⊦ ∀n. n mod modulus mod modulus = n mod modulus

⊦ ∀h t. length (h :: t) = suc (length t)

⊦ ∀x y. x < y ⇔ ¬(y ≤ x)

⊦ ∀m n. ¬(m < n ∧ n ≤ m)

⊦ ∀m n. ¬(m ≤ n ∧ n < m)

⊦ ∀m n. ¬(m < n) ⇔ n ≤ m

⊦ ∀m n. ¬(m ≤ n) ⇔ n < m

⊦ ∀m n. m < suc n ⇔ m ≤ n

⊦ ∀m n. suc m ≤ n ⇔ m < n

⊦ ∀m. m = 0 ∨ ∃n. m = suc n

⊦ (∧) = λp q. (λf. f p q) = λf. f T T

⊦ ∀n. even n ⇔ n mod 2 = 0

⊦ ∀n. ¬(n = 0) ⇒ 0 mod n = 0

⊦ ∀p. ¬(∀x. p x) ⇔ ∃x. ¬p x

⊦ (∃) = λp. ∀q. (∀x. p x ⇒ q) ⇒ q

⊦ ∀t1 t2. ¬t1 ⇒ ¬t2 ⇔ t2 ⇒ t1

⊦ ∀x y. x < y ⇔ toNatural x < toNatural y

⊦ ∀x y. x ≤ y ⇔ toNatural x ≤ toNatural y

⊦ ∀x y. toNatural x = toNatural y ⇒ x = y

⊦ ∀m n. m < n ⇒ m div n = 0

⊦ ∀m n. m < n ⇒ m mod n = m

⊦ ∀m n. m + suc n = suc (m + n)

⊦ ∀m n. suc m + n = suc (m + n)

⊦ ∀m n. m < m + n ⇔ 0 < n

⊦ ∀m n. suc m = suc n ⇔ m = n

⊦ ∀m n. suc m < suc n ⇔ m < n

⊦ ∀m n. suc m ≤ suc n ⇔ m ≤ n

⊦ ∀m n. m + n = m ⇔ n = 0

⊦ ∀n. odd n ⇔ n mod 2 = 1

⊦ ∀x n. replicate (suc n) x = x :: replicate n x

⊦ ∀m n. even (m * n) ⇔ even m ∨ even n

⊦ ∀m n. even (m + n) ⇔ even m ⇔ even n

⊦ ∀m n. exp m (suc n) = m * exp m n

⊦ ∀m n. ¬(n = 0) ⇒ m mod n < n

⊦ ∀m n. ¬(n = 0) ⇒ m div n ≤ m

⊦ ∀m n. ¬(n = 0) ⇒ m mod n ≤ m

⊦ ∀l m. length (l @ m) = length l + length m

⊦ ∀m n. m ≤ n ⇔ ∃d. n = m + d

⊦ (∨) = λp q. ∀r. (p ⇒ r) ⇒ (q ⇒ r) ⇒ r

⊦ ∀m n. m ≤ n ⇔ m < n ∨ m = n

⊦ ∀m n. n ≤ m ⇒ n + (m - n) = m

⊦ ∀m n. n ≤ m ⇒ m - n + n = m

⊦ ∀m n. interval m (suc n) = m :: interval (suc m) n

⊦ ∀m n. m ≤ n ∧ n ≤ m ⇔ m = n

⊦ ∀n l. n ≤ length l ⇒ length (take n l) = n

⊦ ∀p. (∀x y. p x y) ⇔ ∀y x. p x y

⊦ ∀p q. p ∨ (∃x. q x) ⇔ ∃x. p ∨ q x

⊦ ∀x y. toNatural (x + y) = (toNatural x + toNatural y) mod modulus

⊦ ∀m n. ¬(m = 0) ⇒ m * n div m = n

⊦ ∀m n. ¬(m = 0) ⇒ m * n mod m = 0

⊦ ∀x y z. x = y ∧ y = z ⇒ x = z

⊦ ∀t1 t2 t3. (t1 ∨ t2) ∨ t3 ⇔ t1 ∨ t2 ∨ t3

⊦ ∀n x i. i < n ⇒ nth i (replicate n x) = x

⊦ ∀m n p. m * (n * p) = m * n * p

⊦ ∀m n p. m + (n + p) = m + n + p

⊦ ∀m n p. m + n < m + p ⇔ n < p

⊦ ∀m n p. n + m < p + m ⇔ n < p

⊦ ∀m n p. m + n ≤ m + p ⇔ n ≤ p

⊦ ∀m n p. m < n ∧ n < p ⇒ m < p

⊦ ∀m n p. m < n ∧ n ≤ p ⇒ m < p

⊦ ∀m n p. m ≤ n ∧ n < p ⇒ m < p

⊦ ∀m n p. m ≤ n ∧ n ≤ p ⇒ m ≤ p

⊦ ∀l h t. (h :: t) @ l = h :: t @ l

⊦ ∀p. (∀x. ∃y. p x y) ⇔ ∃y. ∀x. p x (y x)

⊦ ∀m n. n < m ⇒ suc (m - suc n) = m - n

⊦ ∀m n. n ≤ m ⇒ (m - n = 0 ⇔ m = n)

⊦ ∀m n. m ≤ suc n ⇔ m = suc n ∨ m ≤ n

⊦ ∀m n. m * n = 0 ⇔ m = 0 ∨ n = 0

⊦ ∀f h t. map f (h :: t) = f h :: map f t

⊦ ∀P. P 0 ∧ (∀n. P n ⇒ P (suc n)) ⇒ ∀n. P n

⊦ ∀m n. ¬(n = 0) ⇒ (m div n = 0 ⇔ m < n)

⊦ ∀m n. exp m n = 0 ⇔ m = 0 ∧ ¬(n = 0)

⊦ ∀m n i. i < n ⇒ nth i (interval m n) = m + i

⊦ ∀m n p. m * (n + p) = m * n + m * p

⊦ ∀m n p. exp m (n + p) = exp m n * exp m p

⊦ ∀m n. m mod modulus * (n mod modulus) mod modulus = m * n mod modulus

⊦ ∀m n. (m mod modulus + n mod modulus) mod modulus = (m + n) mod modulus

⊦ ∀p q. (∀x. p x ∧ q x) ⇔ (∀x. p x) ∧ ∀x. q x

⊦ ∀p q. (∃x. p x) ∨ (∃x. q x) ⇔ ∃x. p x ∨ q x

⊦ ∀m n. ¬(n = 0) ⇒ m div n * n + m mod n = m

⊦ ∀P. P [] ∧ (∀a0 a1. P a1 ⇒ P (a0 :: a1)) ⇒ ∀x. P x

⊦ ∀h t n. n < length t ⇒ nth (suc n) (h :: t) = nth n t

⊦ ∀n h t. n ≤ length t ⇒ drop (suc n) (h :: t) = drop n t

⊦ ∀m n p. m * n = m * p ⇔ m = 0 ∨ n = p

⊦ ∀m n p. m * n ≤ m * p ⇔ m = 0 ∨ n ≤ p

⊦ ∀f l i. i < length l ⇒ nth i (map f l) = f (nth i l)

⊦ ∀m n p. m * n < m * p ⇔ ¬(m = 0) ∧ n < p

⊦ ∀NIL' CONS'.
∃fn. fn [] = NIL' ∧ ∀a0 a1. fn (a0 :: a1) = CONS' a0 a1 (fn a1)

⊦ ∀m n p. ¬(n = 0) ⇒ m * (p mod n) mod n = m * p mod n

⊦ ∀m n p. ¬(n * p = 0) ⇒ m div n div p = m div (n * p)

⊦ ∀m n p. ¬(n * p = 0) ⇒ m mod (n * p) mod n = m mod n

⊦ ∀n l i. n ≤ length l ∧ i < n ⇒ nth i (take n l) = nth i l

⊦ ∀m n q r. m = q * n + r ∧ r < n ⇒ m div n = q

⊦ ∀m n q r. m = q * n + r ∧ r < n ⇒ m mod n = r

⊦ ∀m n p. ¬(n * p = 0) ⇒ m div n mod p = m mod (n * p) div n

⊦ ∀l m.
length l = length m ∧ (∀i. i < length l ⇒ nth i l = nth i m) ⇒ l = m

⊦ ∀x m n.
exp x m ≤ exp x n ⇔ if x = 0 then m = 0 ⇒ n = 0 else x = 1 ∨ m ≤ n

⊦ ∀k l m.
k < length l + length m ⇒
nth k (l @ m) = if k < length l then nth k l else nth (k - length l) m

⊦ ∀a b n.
¬(n = 0) ⇒
((a + b) mod n = a mod n + b mod n ⇔ (a + b) div n = a div n + b div n)