better namespace handling in pretty print

1 files changed, 61 insertions, 61 deletions

diff --git a/testdata/Internals.out b/testdata/Internals.out
index 06c09de3..af664ddd 100644
--- a/testdata/Internals.out
+++ b/testdata/Internals.out
@@ -5,86 +5,86 @@ parens :: forall a . a -> a
 undefined :: forall a . a
 primFix :: forall a . (a -> a) -> a
 'Unit :: Type
-TT :: 'Unit
-'UnitCase :: forall (a :: 'Unit -> Type) -> a TT -> forall (b :: 'Unit) -> a b
-match'Unit :: forall (a :: Type -> Type) -> a 'Unit -> forall b -> a b -> a b
+TT :: Unit
+'UnitCase :: forall (a :: Unit -> Type) -> a 'TT -> forall (b :: Unit) -> a b
+match'Unit :: forall (a :: Type -> Type) -> a Unit -> forall b -> a b -> a b
 'String :: Type
-'StringCase :: forall (a :: 'String -> Type) (b :: 'String) -> a b
-match'String :: forall (a :: Type -> Type) -> a 'String -> forall b -> a b -> a b
-'Empty :: 'String -> Type
-'EmptyCase :: forall (a :: 'String) . forall (b :: 'Empty a -> Type) (c :: 'Empty a) -> b c
-match'Empty :: forall (a :: Type -> Type) -> (forall (b :: 'String) -> a ('Empty b)) -> forall c -> a c -> a c
+'StringCase :: forall (a :: String -> Type) (b :: String) -> a b
+match'String :: forall (a :: Type -> Type) -> a String -> forall b -> a b -> a b
+'Empty :: String -> Type
+'EmptyCase :: forall (a :: String) . forall (b :: Empty a -> Type) (c :: Empty a) -> b c
+match'Empty :: forall (a :: Type -> Type) -> (forall (b :: String) -> a (Empty b)) -> forall c -> a c -> a c
 unsafeCoerce :: forall a b . a -> b
 'EqCT :: forall a -> a -> a -> Type
 parEval :: forall a -> a -> a -> a
 'T2 :: Type -> Type -> Type
 match'Type :: forall (a :: Type -> Type) -> a Type -> forall b -> a b -> a b
 'EqCTt :: forall a . a -> a -> Type
-t2C :: 'Unit -> 'Unit -> 'Unit
+t2C :: Unit -> Unit -> Unit
 'Int :: Type
-'IntCase :: forall (a :: 'Int -> Type) (b :: 'Int) -> a b
-match'Int :: forall (a :: Type -> Type) -> a 'Int -> forall b -> a b -> a b
+'IntCase :: forall (a :: Int -> Type) (b :: Int) -> a b
+match'Int :: forall (a :: Type -> Type) -> a Int -> forall b -> a b -> a b
 'Word :: Type
-'WordCase :: forall (a :: 'Word -> Type) (b :: 'Word) -> a b
-match'Word :: forall (a :: Type -> Type) -> a 'Word -> forall b -> a b -> a b
+'WordCase :: forall (a :: Word -> Type) (b :: Word) -> a b
+match'Word :: forall (a :: Type -> Type) -> a Word -> forall b -> a b -> a b
 'Float :: Type
-'FloatCase :: forall (a :: 'Float -> Type) (b :: 'Float) -> a b
-match'Float :: forall (a :: Type -> Type) -> a 'Float -> forall b -> a b -> a b
+'FloatCase :: forall (a :: Float -> Type) (b :: Float) -> a b
+match'Float :: forall (a :: Type -> Type) -> a Float -> forall b -> a b -> a b
 'Char :: Type
-'CharCase :: forall (a :: 'Char -> Type) (b :: 'Char) -> a b
-match'Char :: forall (a :: Type -> Type) -> a 'Char -> forall b -> a b -> a b
+'CharCase :: forall (a :: Char -> Type) (b :: Char) -> a b
+match'Char :: forall (a :: Type -> Type) -> a Char -> forall b -> a b -> a b
 'Bool :: Type
-False :: 'Bool
-True :: 'Bool
-'BoolCase :: forall (a :: 'Bool -> Type) -> a False -> a True -> forall (b :: 'Bool) -> a b
-match'Bool :: forall (a :: Type -> Type) -> a 'Bool -> forall b -> a b -> a b
+False :: Bool
+True :: Bool
+'BoolCase :: forall (a :: Bool -> Type) -> a 'False -> a 'True -> forall (b :: Bool) -> a b
+match'Bool :: forall (a :: Type -> Type) -> a Bool -> forall b -> a b -> a b
 'Ordering :: Type
-LT :: 'Ordering
-EQ :: 'Ordering
-GT :: 'Ordering
-'OrderingCase :: forall (a :: 'Ordering -> Type) -> a LT -> a EQ -> a GT -> forall (b :: 'Ordering) -> a b
-match'Ordering :: forall (a :: Type -> Type) -> a 'Ordering -> forall b -> a b -> a b
+LT :: Ordering
+EQ :: Ordering
+GT :: Ordering
+'OrderingCase :: forall (a :: Ordering -> Type) -> a 'LT -> a 'EQ -> a 'GT -> forall (b :: Ordering) -> a b
+match'Ordering :: forall (a :: Type -> Type) -> a Ordering -> forall b -> a b -> a b
 'Nat :: Type
-Zero :: 'Nat
-Succ :: 'Nat -> 'Nat
-'NatCase :: forall (a :: 'Nat -> Type) -> a 0 -> (forall (b :: 'Nat) -> a (Succ b)) -> forall (c :: 'Nat) -> a c
-match'Nat :: forall (a :: Type -> Type) -> a 'Nat -> forall b -> a b -> a b
-primIntToWord :: 'Int -> 'Word
-primIntToFloat :: 'Int -> 'Float
-primIntToNat :: 'Int -> 'Nat
-primCompareInt :: 'Int -> 'Int -> 'Ordering
-primCompareWord :: 'Word -> 'Word -> 'Ordering
-primCompareFloat :: 'Float -> 'Float -> 'Ordering
-primCompareChar :: 'Char -> 'Char -> 'Ordering
-primCompareString :: 'String -> 'String -> 'Ordering
-primNegateInt :: 'Int -> 'Int
-primNegateWord :: 'Word -> 'Word
-primNegateFloat :: 'Float -> 'Float
-primAddInt :: 'Int -> 'Int -> 'Int
-primSubInt :: 'Int -> 'Int -> 'Int
-primModInt :: 'Int -> 'Int -> 'Int
-primSqrtFloat :: 'Float -> 'Float
-primRound :: 'Float -> 'Int
-primIfThenElse :: forall a . 'Bool -> a -> a -> a
-isEQ :: 'Ordering -> 'Bool
+Zero :: Nat
+Succ :: Nat -> Nat
+'NatCase :: forall (a :: Nat -> Type) -> a 0 -> (forall (b :: Nat) -> a ('Succ b)) -> forall (c :: Nat) -> a c
+match'Nat :: forall (a :: Type -> Type) -> a Nat -> forall b -> a b -> a b
+primIntToWord :: Int -> Word
+primIntToFloat :: Int -> Float
+primIntToNat :: Int -> Nat
+primCompareInt :: Int -> Int -> Ordering
+primCompareWord :: Word -> Word -> Ordering
+primCompareFloat :: Float -> Float -> Ordering
+primCompareChar :: Char -> Char -> Ordering
+primCompareString :: String -> String -> Ordering
+primNegateInt :: Int -> Int
+primNegateWord :: Word -> Word
+primNegateFloat :: Float -> Float
+primAddInt :: Int -> Int -> Int
+primSubInt :: Int -> Int -> Int
+primModInt :: Int -> Int -> Int
+primSqrtFloat :: Float -> Float
+primRound :: Float -> Int
+primIfThenElse :: forall a . Bool -> a -> a -> a
+isEQ :: Ordering -> Bool
 'Num :: Type -> Type
-fromInt :: forall a . 'Num a => 'Int -> a
-compare :: forall a . 'Num a => a -> a -> 'Ordering
-negate :: forall a . 'Num a => a -> a
+fromInt :: forall a . Num a => Int -> a
+compare :: forall a . Num a => a -> a -> Ordering
+negate :: forall a . Num a => a -> a
 'Eq :: Type -> Type
-== :: forall a . 'Eq a => a -> a -> 'Bool
+== :: forall a . Eq a => a -> a -> Bool
 'List :: Type -> Type
-Nil :: forall a . 'List a
-Cons :: forall a . a -> 'List a -> 'List a
-'ListCase :: forall a . forall (b :: 'List a -> Type) -> b Nil -> (forall (c :: a) (d :: 'List a) -> b (Cons c d)) -> forall (e :: 'List a) -> b e
-match'List :: forall (a :: Type -> Type) -> (forall b -> a ('List b)) -> forall c -> a c -> a c
-'HList :: 'List Type -> Type
+Nil :: forall a . List a
+Cons :: forall a . a -> List a -> List a
+'ListCase :: forall a . forall (b :: List a -> Type) -> b 'Nil -> (forall (c :: a) (d :: List a) -> b ('Cons c d)) -> forall (e :: List a) -> b e
+match'List :: forall (a :: Type -> Type) -> (forall b -> a (List b)) -> forall c -> a c -> a c
+'HList :: List Type -> Type
 HNil :: ()
-HCons :: forall a (b :: 'List Type) . a -> 'HList b -> 'HList (Cons a b)
-'HListCase :: forall (a :: forall (b :: 'List Type) -> 'HList b -> Type) -> a Nil () -> (forall c (d :: 'List Type) . forall (e :: c) (f :: 'HList d) -> a (Cons c d) (HCons c d e f)) -> forall (g :: 'List Type) . forall (h :: 'HList g) -> a g h
-match'HList :: forall (a :: Type -> Type) -> (forall (b :: 'List Type) -> a ('HList b)) -> forall c -> a c -> a c
+HCons :: forall a (b :: List Type) . a -> HList b -> HList ('Cons a b)
+'HListCase :: forall (a :: forall (b :: List Type) -> HList b -> Type) -> a 'Nil () -> (forall c (d :: List Type) . forall (e :: c) (f :: HList d) -> a ('Cons c d) ('HCons c d e f)) -> forall (g :: List Type) . forall (h :: HList g) -> a g h
+match'HList :: forall (a :: Type -> Type) -> (forall (b :: List Type) -> a (HList b)) -> forall c -> a c -> a c
 hlistNilCase :: forall a -> a -> () -> a
-hlistConsCase :: forall a (b :: 'List Type) . forall c -> (a -> 'HList b -> c) -> 'HList (Cons a b) -> c
+hlistConsCase :: forall a (b :: List Type) . forall c -> (a -> HList b -> c) -> HList ('Cons a b) -> c
 ------------ tooltips
 testdata/Internals.lc 6:1-6:8  forall a . a -> a
 testdata/Internals.lc 6:13-6:14  _b