llelf

> {-# LANGUAGE RankNTypes, DataKinds, KindSignatures, GADTs #-}

> import Unsafe.Coerce
> data M = A | B deriving (Show, Eq)


> data V1 :: M -> * where
>  V1A :: Int -> V1 A
>  V1B :: Double -> V1 B
>  V1a :: () -> V1 a

llelf

Betty:flamingra lelf$ cabal configure
Resolving dependencies...
Configuring flamingra-0.1.0.0...

Betty:flamingra lelf$ cabal haddock  --html-location='/package/$pkg-$version/docs' --contents-location='/package/$pkg-$version'
Running Haddock for flamingra-0.1.0.0...
Preprocessing library flamingra-0.1.0.0...
Haddock coverage:
   0% (  0 /  1) in 'I'mHereOnlyToPleaseHaddock'
Documentation created: dist/doc/html/flamingra/index.html

llelf

Betty:fake lelf$ cabal install "mtl-2.2.1" "text-1.2.1.1" "hashable-1.2.3.3" "parsec-3.1.9" "scientific-0.3.3.8" "attoparsec-0.13.0.0"
Resolving dependencies...
All the requested packages are already installed:
hashable-1.2.3.3
mtl-2.2.1
parsec-3.1.9
scientific-0.3.3.8
text-1.2.1.1
Use --reinstall if you want to reinstall anyway.

llelf

Betty:fake lelf$ cabal --version
cabal-install version 1.22.6.0
using version 1.22.4.0 of the Cabal library 

Betty:fake lelf$ cabal install "mtl-2.2.1" "text-1.2.1.1" "hashable-1.2.3.3" "parsec-3.1.9" "scientific-0.3.3.8" "kill-me-666.666"
Resolving dependencies...
All the requested packages are already installed:
hashable-1.2.3.3
mtl-2.2.1
parsec-3.1.9

llelf

import Data.List
import Data.Array
import Data.Maybe
import Data.Char
import Data.List.Split
import Control.Arrow

data File = A|B|C|D|E|F|G|H deriving (Enum,Show,Eq,Ord,Ix)
type Dist = Int

llelf

import Control.Arrow
import Data.List
import Data.Maybe
import Data.Ord
import qualified Data.Set as S

type State = (Integer,Integer)

data Vessel = A | B deriving (Show,Eq)

llelf

-- MIND YOUR EYES! DIRTY CODE AHEAD.

import Control.Monad
import qualified Data.Map as M
import qualified Data.Set as S
import Data.List
import System
import System.IO
import Data.List
import Data.Ord

llelf

import Control.Monad.Logic
import Data.List

foo :: Logic Bool
foo = do [c2,c3,c4,c5,c6,c7,cJ,cA] <- sequence . replicate 8 $ return True `mplus` return False
         guard $ c3 `thinks` sane cA
         guard $ c4 `thinks` not (not (sane c2) && not (sane c3))
         guard $ c5 `thinks` sane cA == sane c4
         guard $ c6 `thinks` sane cA && sane c2
         guard $ c7 `thinks` not (sane c5)

llelf

{-# LANGUAGE DeriveDataTypeable #-}

import Data.Generics.Zipper
import Data.Data


-- | our tree def
data Tree a = Empty | Fork a (Tree a) (Tree a)
              deriving (Typeable,Data)

llelf

module PI where

import Data.Number.CReal
import Data.List


fractPartToBase :: RealFrac x => Int -> x -> [Int]
fractPartToBase base x = unfoldr f x
    where f d = Just (d'int, d' - fromIntegral d'int)
              where d' = d * fromIntegral base