1 {-# LANGUAGE ExistentialQuantification #-}
2 {-# LANGUAGE RankNTypes #-}
4 module Symantic.Printer where
6 import Data.Function (($))
7 import Data.String (String)
12 newtype Printer prov a = Printer {unPrinter :: TermAST prov}
13 print :: Printer prov a -> TermAST prov
15 print2 :: String -> Printer prov a1 -> Printer prov a2 -> Printer prov a3
16 print2 n (Printer aT) (Printer bT) = Printer $ BinTree2 (BinTree2 (BinTree0 (TokenTermAtom n)) aT) bT