Skip to content

Instantly share code, notes, and snippets.

View tel's full-sized avatar
✍️

Joseph Abrahamson tel

✍️
View GitHub Profile
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
Command: (default View)
@tel
tel / tdl.tex
Created December 7, 2012 20:50
acm
open import Data.Vec
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
n + n ≡ m + m
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
#-}
module Hurkens where
⊥ : Set
⊥ = (A : Set) -> A
¬_ : Set -> Set
¬ A = A -> ⊥
Exercise: 4 stars, optional (filter_challenge)
filter : ∀ {A : Set} → (A → Bool) → List A → List A
thm l1 l2 l p merge all-l1 all-l2 = {!