AndrasKovacs

open import Data.List
open import Data.Nat
open import Relation.Binary.PropositionalEquality
open import Function
open import Data.Product
open import Data.Sum

data _▶_≡_ {A : Set}(x : A) : List A → List A → Set where
  here  : ∀ {xs} → x ▶ xs ≡ (x ∷ xs)

AndrasKovacs

{-# LANGUAGE 
    LambdaCase, GADTs, TypeOperators, TypeFamilies, DataKinds #-}

data Type = TInt | TBool | Type :=> Type

-- Needs GHC >= 7.8
type family Interp (t :: Type) where
    Interp TInt      = Int
    Interp TBool     = Bool 
    Interp (a :=> b) = Interp a -> Interp b

quchen

13:15 <xQuasar>      | HASKELL IS FOR FUCKIN FAGGOTS. YOU'RE ALL A BUNCH OF 
                     | FUCKIN PUSSIES
13:15 <xQuasar>      | JAVASCRIPT FOR LIFE FAGS
13:16 <luite>        | hello
13:16 <ChongLi>      | somebody has a mental illness!
13:16 <merijn>       | Wow...I suddenly see the error of my ways and feel 
                     | compelled to write Node.js!
13:16 <genisage>     | hi
13:16 <luite>        | you might be pleased to learn that you can compile 
                     | haskell to javascript now

frosty

--# Main
-- based on untextured raycaster example: http://lodev.org/cgtutor/raycasting.html

MAPWIDTH = 24
MAPHEIGHT = 24

worldMap = {
  {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
  {1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1},
  {1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1},