8 :: List a = Nil | Cons a (List a)
11 :: R = {i :: Int, q :: T}
12 :: Muta a = Muta (Mutb a)
13 :: Mutb a = Mutb (Muta a)
14 derive gToStruct NInt, T, List, R, Muta, Mutb, (,), (), [], (,,), Maybe, Either
15 derive gPotInf NInt, T, List, R, Muta, Mutb, (,), (), [], (,,), Maybe, Either
17 Start = let (l, r) = (toCParser (unBox t2)) in concat r
19 t :: Box String (List (Muta Int))
20 // t :: Box GTSState NInt
23 t2 :: Box GTSState [Either Int Bool]
24 // t2 :: Box GTSState (Either Int Bool)
25 // t2 :: Box GTSState [Int]