michaelt

data Primitive = Num 
                |Chr 
                |Str 
                |Cnd Bool deriving (Show)
data T = K Int | R Int

-- >>> :set -XDataKinds
-- >>> :t Num
-- Num :: Primitive
-- >>> :k Num

michaelt

{-# LANGUAGE OverloadedStrings #-}
import Pipes
import Pipes.Group
import qualified Pipes.Prelude as P
import qualified Pipes.ByteString as PB
import qualified Pipes.Attoparsec as PA
import Data.Aeson
import Data.Aeson.Parser
import Data.Aeson.Types
import Data.Monoid

michaelt

import Control.Monad
import Control.Concurrent
import Control.Concurrent.STM
import System.Random
import Text.Printf

-- Forks
type Fork = TMVar Int
 
newFork :: Int -> IO Fork

michaelt

{-#LANGUAGE OverloadedStrings#-}

import Data.Aeson.Types
import Data.Aeson
import qualified Data.Vector as V
import qualified Data.ByteString.Lazy as L 
import Data.HashMap.Strict
import qualified Data.Text as T

-- this is backward maybe -- also doesn't crack open the Values

michaelt

countPackets p = 
  let v = AL.parse (CA.many packetValue) p
      r = fromMaybe [] $ AL.maybeResult v
  in r

michaelt

module HTML where

  class Tag a where
    toHTML :: a -> String


  data Attribute = Attribute {
    key :: String,
    value :: String
  } deriving Show

michaelt

{-# LANGUAGE ImplicitParams, ParallelListComp,MonadComprehensions #-}
import Control.Monad
import Control.Monad.Fix
import Control.Monad.Zip
import Control.Applicative
import Control.Concurrent
import Control.Concurrent.MVar
import Control.Exception 
import Prelude -- hiding (catch)
import Data.IORef

michaelt

import Control.Concurrent
import Control.Concurrent.Async
import Control.Applicative
import Control.Monad

import Data.Traversable

newtype Concurrently a = Concurrently { runConcurrently :: IO a }

instance Functor Concurrently where

michaelt

#!/usr/bin/env runghc

module Main where

{-
    Uninstall.hs - a Haskell uninstaller for Mac OS X
    
    This program is really far too big to be in a single file. However, I
    wanted it to be easily distributable and runnable, and so have kept it all
    together.

michaelt

{-# LANGUAGE GADTs #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE StandaloneDeriving #-}
{-# LANGUAGE DataKinds#-}
{-# LANGUAGE KindSignatures#-}
module RedBlackTree where

data Nat = Zero | Succ Nat deriving (Eq, Ord, Show)
type One = Succ Zero