gip

data A = A Text
data B = B Text A

data ActionC t next = InsertC t (t -> next)
instance Functor (ActionC t) where
  fmap f (InsertC a b)= InsertC a (f . b)

insertC a = liftF (InsertC a id)

proC txt1 txt2 = do

gip

Keybase proof

I hereby claim:

• I am gip on github.
• I am gip (https://keybase.io/gip) on keybase.
• I have a public key whose fingerprint is C37D 0FB7 7B78 BEDC 3C97 9CCD 3683 DA89 90E8 2A1C

To claim this, I am signing this object:

gip

-- Esper http://tech.esper.com/2015/03/08/maze-navigation-challenge/
-- Gilles Pirio
-- run with runghc maze.hs

import qualified Data.Map as M
import qualified Data.Set as S
import qualified Data.List as L

import Control.Monad
import System.Environment

gip

944140643

gip

24674714