Agda であそぼ

data : Set where
@erutuf13 : ->
: ->
Haskell Agda Coq : ->

• AoPa(Algebra of Programming in Agda)

( )

Agda

( )

Agda . . .

multS : (m n : N) -> m + m * n == m * S n
multS O _ = eqrefl
multS (S m) n =
eqtrans (eqsuc (plusassoc m n (m * n)))
(eqtrans (eqsuc
(eqplus’ (m + n) (n + m) (m * n) (pluscomm m n)))
(eqtrans (eqsuc (eqsym (plusassoc n m (m * n))))
(eqsuc (eqplus (m + m * n) (m * S n) n (multS m n)))))

eqtrans : {A : Set} {n m l : A}
-> n == m -> m == l -> n == l

Algebraic Reasoning !

multS (S m) n =
proof
S m + S m * n
==[ eqrefl ]
S (m + n + m * n)
==[ eqsuc (plusassoc m n (m * n)) ]
S ((m + n) + m * n)
==[ eqsuc (eqplus’ (m + n) (n + m) (m * n)
(pluscomm m n)) ]
S ((n + m) + m * n)
==[ eqsuc (eqsym (plusassoc n m (m * n))) ]
S (n + m + m * n)
==[ eqsuc (eqplus (m + m * n) (m * S n) n
(multS m n)) ]
S (n + m * S n)
==[ eqrefl ]
S m * S n
qed

data _IsEqualTo_ A : Set (x y : A) : Set1 where
relTo : (x=y : x == y) -> x IsEqualTo y

proof_ : forall A : Set x y : A
-> x IsEqualTo y -> x == y
proof relTo x=y = x=y

_==[_]_ : forall A : Set y z : A -> (x : A)
-> x == y -> y IsEqualTo z -> x IsEqualTo z
_ ==[ x=y ] relTo y=z = relTo (eqtrans x=y y=z)

_qed : forall A : Set -> (x : A) -> x IsEqualTo x
_qed _ = relTo eqrefl

proof_ < _qed = _==[_]_

Relation.Binary.PreorderReasoning

( )

Algebra of Programming

(* - )

isort-der : ∃(λf → ordered? ◦ permute ⊒ fun f)

isort-der : ∃ (λf → ordered? permute ⊒ fun f )
isort-der = ( ,
(⊒-begin
⊒ ⟨ -monotonic-r permute-is-fold ⟩
ordered? perm
⊒ ⟨ ⊒-reﬂ ⟩
ordered? foldR combine nil
⊒ ⟨ foldR-fusion-⊒ ordered? ins-step ins-base ⟩
foldR (fun (uncurry insert)) nil
⊒ ⟨ foldR-to-foldr insert [] ⟩
fun (foldr insert [])
⊒ ■))

isort : List Val -> List Val
isort = proj1 isort-der

Algebra of Programming

Algebra of Programming Style ( )

isort AoPA (Algebra of Programming in Agda)

Agda であそぼ

More Related Content

What's hot

What's hot (20)

Similar to Agda であそぼ

Similar to Agda であそぼ (20)

Recently uploaded

Recently uploaded (20)

Agda であそぼ