Mercurial > hg > Gears > GearsAgda

annotate logic.agda @ 609:79418701a283

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
add test and speciication
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Thu, 04 Nov 2021 16:35:11 +0900
parents 2075785a124a
children 0b791ae19543
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
579
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1 module logic where
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
3 open import Level
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
4 open import Relation.Nullary
604
2075785a124a new approach
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 586
diff changeset
5 open import Relation.Binary hiding (_⇔_)
586
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
6 open import Relation.Binary.PropositionalEquality
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
7
579
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
8 open import Data.Empty
586
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
9 open import Data.Nat hiding (_⊔_)
579
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
10
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
11
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
12 data Bool : Set where
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
13 true : Bool
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
14 false : Bool
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
15
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
16 record _∧_ {n m : Level} (A : Set n) ( B : Set m ) : Set (n ⊔ m) where
609
79418701a283 add test and speciication
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents: 604
diff changeset
17 constructor ⟪_,_⟫
579
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
18 field
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
19 proj1 : A
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
20 proj2 : B
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
21
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
22 data _∨_ {n m : Level} (A : Set n) ( B : Set m ) : Set (n ⊔ m) where
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
23 case1 : A → A ∨ B
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
24 case2 : B → A ∨ B
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
25
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
26 _⇔_ : {n m : Level } → ( A : Set n ) ( B : Set m ) → Set (n ⊔ m)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
27 _⇔_ A B = ( A → B ) ∧ ( B → A )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
28
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
29 contra-position : {n m : Level } {A : Set n} {B : Set m} → (A → B) → ¬ B → ¬ A
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
30 contra-position {n} {m} {A} {B} f ¬b a = ¬b ( f a )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
31
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
32 double-neg : {n : Level } {A : Set n} → A → ¬ ¬ A
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
33 double-neg A notnot = notnot A
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
34
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
35 double-neg2 : {n : Level } {A : Set n} → ¬ ¬ ¬ A → ¬ A
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
36 double-neg2 notnot A = notnot ( double-neg A )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
37
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
38 de-morgan : {n : Level } {A B : Set n} → A ∧ B → ¬ ( (¬ A ) ∨ (¬ B ) )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
39 de-morgan {n} {A} {B} and (case1 ¬A) = ⊥-elim ( ¬A ( _∧_.proj1 and ))
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
40 de-morgan {n} {A} {B} and (case2 ¬B) = ⊥-elim ( ¬B ( _∧_.proj2 and ))
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
41
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
42 dont-or :　{n m : Level} {A : Set n} { B : Set m } → A ∨ B → ¬ A → B
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
43 dont-or {A} {B} (case1 a) ¬A = ⊥-elim ( ¬A a )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
44 dont-or {A} {B} (case2 b) ¬A = b
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
45
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
46 dont-orb :　{n m : Level} {A : Set n} { B : Set m } → A ∨ B → ¬ B → A
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
47 dont-orb {A} {B} (case2 b) ¬B = ⊥-elim ( ¬B b )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
48 dont-orb {A} {B} (case1 a) ¬B = a
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
49
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
50
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
51 infixr 130 _∧_
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
52 infixr 140 _∨_
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
53 infixr 150 _⇔_
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
54
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
55 _/\_ : Bool → Bool → Bool
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
56 true /\ true = true
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
57 _ /\ _ = false
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
58
586
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
59 _<B?_ : ℕ → ℕ → Bool
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
60 ℕ.zero <B? x = true
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
61 ℕ.suc x <B? ℕ.zero = false
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
62 ℕ.suc x <B? ℕ.suc xx = x <B? xx
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
63
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
64 -- _<BT_ : ℕ → ℕ → Set
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
65 -- ℕ.zero <BT ℕ.zero = ⊤
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
66 -- ℕ.zero <BT ℕ.suc b = ⊤
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
67 -- ℕ.suc a <BT ℕ.zero = ⊥
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
68 -- ℕ.suc a <BT ℕ.suc b = a <BT b
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
69
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
70
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
71 _≟B_ : Decidable {A = Bool} _≡_
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
72 true ≟B true = yes refl
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
73 false ≟B false = yes refl
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
74 true ≟B false = no λ()
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
75 false ≟B true = no λ()
0ddfa505d612 isolate search function problem, and add hoareBinaryTree.agda.
ryokka
parents: 579
diff changeset
76
579
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
77 _\/_ : Bool → Bool → Bool
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
78 false \/ false = false
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
79 _ \/ _ = true
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
80
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
81 not_ : Bool → Bool
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
82 not true = false
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
83 not false = true
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
84
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
85 _<=>_ : Bool → Bool → Bool
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
86 true <=> true = true
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
87 false <=> false = true
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
88 _ <=> _ = false
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
89
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
90 infixr 130 _\/_
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
91 infixr 140 _/\_