Skip to content

Instantly share code, notes, and snippets.

View epsilonhalbe's full-sized avatar

Martin Heuschober epsilonhalbe

View GitHub Profile
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TupleSections #-}
{-# LANGUAGE ViewPatterns #-}
{-# LANGUAGE BangPatterns #-}
import Control.Monad
import Control.Monad.Random
@epsilonhalbe
epsilonhalbe / MyCombinatorics.hs
Created January 9, 2012 12:45
combinatorical functions for lambdaheads - 2012-01-09
module MyCombinatorics where
import Data.List ( (\\),
sort)
import Control.Applicative ( liftA2,
Applicative,
pure)
(^*) :: (a -> b) -> (b -> c) -> a -> c
f ^* g = g . f