twanvl

data Spine a
  = NS (NS a a (a,a,a))
  | AS (AS a a a)
  deriving (Show)

-- non-adjacent spine: list of increasing size trees, with no two trees of adjacent index
data NS a b c
  = Nil
  | NMore (NS a c (a,b,c))
  | NCons b (NS a (a,b,c) (a,c,(a,b,c)))

twanvl

{-#LANGUAGE NoMonomorphismRestriction #-}
module Main (main) where

import Control.Monad (void)
import Control.Monad.Identity
import Criterion.Main
import qualified Data.Conduit      as C
import qualified Data.Conduit.Combinators as CC
import qualified Data.Conduit.List as C
import qualified Data.Machine      as M