mirror of
https://github.com/Smaug123/agdaproofs
synced 2025-10-07 21:08:39 +00:00
Problem 1 of Project Euler (#85)
This commit is contained in:
@@ -94,6 +94,10 @@ boolAnd : Bool → Bool → Bool
|
||||
boolAnd BoolTrue y = y
|
||||
boolAnd BoolFalse y = BoolFalse
|
||||
|
||||
boolOr : Bool → Bool → Bool
|
||||
boolOr BoolTrue y = BoolTrue
|
||||
boolOr BoolFalse y = y
|
||||
|
||||
typeCast : {a : _} {A : Set a} {B : Set a} (el : A) (pr : A ≡ B) → B
|
||||
typeCast {a} {A} {.A} elt refl = elt
|
||||
|
||||
|
Reference in New Issue
Block a user