This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
runghc Main.hs preview | |
LInitialising | |
[ 0ms] Creating store | |
istening on http://0.0.0.0:8000/ | |
[ 5ms] Creating provider | |
Adding new compilers | |
Compiling css/bootstrap.css | |
[ 646ms] Total compile time | |
[ 1ms] Routing to css/bootstrap.css | |
Compiling css/bootstrap.min.css |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Command: (default View) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
acm |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
open import Data.Vec |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
as F using (Fin; zero; suc) | |
open import Data.List as L using (List; []; _∷_) | |
open import Data.Vec as V using (Vec; []; _∷_) | |
open import Category.Monad | |
open import Category.Monad.Indexed | |
private | |
module Monadic {m} {M : Set m → Set m} (Mon : RawMonad M) where |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
n + n ≡ m + m |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
module Logic where | |
data _∧_ (P Q : Set) : Set where | |
conj : P → Q → P ∧ Q | |
data _∨_ (P Q : Set) : Set where | |
injl : P → P ∨ Q | |
injr : Q → P ∨ Q |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#-} | |
module Hurkens where | |
⊥ : Set | |
⊥ = (A : Set) -> A | |
¬_ : Set -> Set | |
¬ A = A -> ⊥ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Exercise: 4 stars, optional (filter_challenge) | |
filter : ∀ {A : Set} → (A → Bool) → List A → List A |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
thm l1 l2 l p merge all-l1 all-l2 = {! |