1 (**************************************************************************)
4 (* ||A|| A project by Andrea Asperti *)
6 (* ||I|| Developers: *)
7 (* ||T|| The HELM team. *)
8 (* ||A|| http://helm.cs.unibo.it *)
10 (* \ / This file is distributed under the terms of the *)
11 (* v GNU General Public License Version 2 *)
13 (**************************************************************************)
15 (* ********************************************************************** *)
16 (* Progetto FreeScale *)
19 (* Cosimo Oliboni, oliboni@cs.unibo.it *)
21 (* Questo materiale fa parte della tesi: *)
22 (* "Formalizzazione Interattiva dei Microcontroller a 8bit FreeScale" *)
24 (* data ultima modifica 15/11/2007 *)
25 (* ********************************************************************** *)
27 include "nat/div_and_mod.ma".
28 include "nat/primes.ma".
29 include "list/list.ma".
30 include "datatypes/constructors.ma".
31 include "logic/connectives.ma".
35 (* ridefinizione degli operatori booleani, per evitare l'overloading di quelli normali *)
37 λb:bool.match b with [ true ⇒ false | false ⇒ true ].
40 λb1,b2:bool.match b1 with
41 [ true ⇒ b2 | false ⇒ false ].
44 λb1,b2:bool.match b1 with
45 [ true ⇒ true | false ⇒ b2 ].
48 λb1,b2:bool.match b1 with
53 λb1,b2:bool.match b1 with
55 | false ⇒ not_bool b2 ].
58 notation "hvbox(⊖ a)" non associative with precedence 36
59 for @{ 'not_bool $a }.
60 interpretation "not_bool" 'not_bool x = (not_bool x).
63 notation "hvbox(a break ⊗ b)" left associative with precedence 35
64 for @{ 'and_bool $a $b }.
65 interpretation "and_bool" 'and_bool x y = (and_bool x y).
68 notation "hvbox(a break ⊕ b)" left associative with precedence 34
69 for @{ 'or_bool $a $b }.
70 interpretation "or_bool" 'or_bool x y = (or_bool x y).
73 notation "hvbox(a break ⊙ b)" left associative with precedence 33
74 for @{ 'xor_bool $a $b }.
75 interpretation "xor_bool" 'xor_bool x y = (xor_bool x y).
77 (* ProdT e' gia' definito, aggiungo Prod3T e Prod4T e Prod5T *)
79 inductive Prod3T (T1:Type) (T2:Type) (T3:Type) : Type ≝
80 tripleT : T1 → T2 → T3 → Prod3T T1 T2 T3.
83 λT1.λT2.λT3.λp:Prod3T T1 T2 T3.match p with [ tripleT x _ _ ⇒ x ].
86 λT1.λT2.λT3.λp:Prod3T T1 T2 T3.match p with [ tripleT _ x _ ⇒ x ].
89 λT1.λT2.λT3.λp:Prod3T T1 T2 T3.match p with [ tripleT _ _ x ⇒ x ].
91 inductive Prod4T (T1:Type) (T2:Type) (T3:Type) (T4:Type) : Type ≝
92 quadrupleT : T1 → T2 → T3 → T4 → Prod4T T1 T2 T3 T4.
95 λT1.λT2.λT3.λT4.λp:Prod4T T1 T2 T3 T4.match p with [ quadrupleT x _ _ _ ⇒ x ].
98 λT1.λT2.λT3.λT4.λp:Prod4T T1 T2 T3 T4.match p with [ quadrupleT _ x _ _ ⇒ x ].
101 λT1.λT2.λT3.λT4.λp:Prod4T T1 T2 T3 T4.match p with [ quadrupleT _ _ x _ ⇒ x ].
104 λT1.λT2.λT3.λT4.λp:Prod4T T1 T2 T3 T4.match p with [ quadrupleT _ _ _ x ⇒ x ].
106 inductive Prod5T (T1:Type) (T2:Type) (T3:Type) (T4:Type) (T5:Type) : Type ≝
107 quintupleT : T1 → T2 → T3 → T4 → T5 → Prod5T T1 T2 T3 T4 T5.
110 λT1.λT2.λT3.λT4.λT5.λp:Prod5T T1 T2 T3 T4 T5.match p with [ quintupleT x _ _ _ _ ⇒ x ].
113 λT1.λT2.λT3.λT4.λT5.λp:Prod5T T1 T2 T3 T4 T5.match p with [ quintupleT _ x _ _ _ ⇒ x ].
116 λT1.λT2.λT3.λT4.λT5.λp:Prod5T T1 T2 T3 T4 T5.match p with [ quintupleT _ _ x _ _ ⇒ x ].
119 λT1.λT2.λT3.λT4.λT5.λp:Prod5T T1 T2 T3 T4 T5.match p with [ quintupleT _ _ _ x _ ⇒ x ].
122 λT1.λT2.λT3.λT4.λT5.λp:Prod5T T1 T2 T3 T4 T5.match p with [ quintupleT _ _ _ _ x ⇒ x ].
126 (* option map = match ... with [ None ⇒ None ? | Some .. ⇒ .. ] *)
128 λT1,T2:Type.λt:option T1.λf:T1 → option T2.
129 match t with [ None ⇒ None ? | Some x ⇒ (f x) ].
131 (* ********************** *)
132 (* TEOREMI/LEMMMI/ASSIOMI *)
133 (* ********************** *)
135 axiom mod_plus: ∀a,b,m. (a + b) \mod m = (a \mod m + b \mod m) \mod m.
136 axiom mod_mod: ∀a,n,m. n∣m → a \mod n = a \mod n \mod m.
137 axiom eq_mod_times_n_m_m_O: ∀n,m. O < m → n * m \mod m = O.
138 axiom eq_mod_to_eq_plus_mod: ∀a,b,c,m. a \mod m = b \mod m → (a+c) \mod m = (b+c) \mod m.
139 axiom eq_mod_times_times_mod: ∀a,b,n,m. m = a*n → (a*b) \mod m = a * (b \mod n).
140 axiom divides_to_eq_mod_mod_mod: ∀a,n,m. n∣m → a \mod m \mod n = a \mod n.
141 axiom le_to_le_plus_to_le : ∀a,b,c,d.b\leq d\rarr a+b\leq c+d\rarr a\leq c.
142 axiom or_lt_le : ∀n,m. n < m ∨ m ≤ n.
144 lemma le_to_lt: ∀n,m. n ≤ m → n < S m.
149 alias num (instance 0) = "natural number".
150 definition nat_of_bool ≝
151 λb:bool.match b return λ_.nat with [ true ⇒ 1 | false ⇒ 0 ].
153 theorem lt_trans: ∀x,y,z. x < y → y < z → x < z.
159 lemma leq_m_n_to_eq_div_n_m_S: ∀n,m:nat. 0 < m → m ≤ n → ∃z. n/m = S z.
162 apply (ex_intro ? ? (div_aux (pred n) (n-m) (pred m)));
167 clear Hcut; clear H2; clear H;
169 unfold in ⊢ (? ? % ?);
171 [ elim Hcut; clear Hcut;
173 rewrite > H; clear m;
174 change in ⊢ (? ? % ?) with
175 (match leb (S a1) a with
177 | false ⇒ S (div_aux a1 ((S a1) - S a) a)]);
179 [ apply (leb_elim (S a1) a);