3 ================================================================================
5 `$d6' :: `{PrelBase.Eval (Pair a b)}'
7 _/\_ `$x0' `$x1' -> `PrelBase.void'
8 `$d5' :: `{PrelBase.Eval (LList alpha)}'
10 _/\_ `$x0' -> `PrelBase.void'
11 `$d3' :: `{PrelBase.Eval (Tree t)}'
13 _/\_ `$x0' -> `PrelBase.void'
14 `$d2' :: `{PrelBase.Eval (A a)}'
16 _/\_ `$x0' -> `PrelBase.void'
17 `$d1' :: `{PrelBase.Eval (Foo baz)}'
19 _/\_ `$x0' -> `PrelBase.void'
20 `MkFoo' :: `Foo (Foo baz) -> Foo baz'
22 _/\_ `$x0' -> \ `$x1' :: `Foo (Foo $x0)'
24 `MkFoo' {_@_ `$x0' `$x1'}
25 `MkA' :: `a -> A a -> A a'
27 _/\_ `$x0' -> \ `$x1' :: `$x0'
28 `$x1' `$x2' :: `A $x0'
30 `MkA' {_@_ `$x0' `$x1' `$x2'}
31 `Mkpair' :: `a -> b -> Pair a b'
33 _/\_ `$x0' `$x1' -> \ `$x2' :: `$x0'
36 `Mkpair' {_@_ `$x0' _@_ `$x1' `$x2' `$x3'}
37 `Leaf' :: `t -> Tree t'
39 _/\_ `$x0' -> \ `$x1' :: `$x0'
41 `Leaf' {_@_ `$x0' `$x1'}
42 `Node' :: `Tree t -> Tree t -> Tree t'
44 _/\_ `$x0' -> \ `$x1' :: `Tree $x0'
45 `$x1' `$x2' :: `Tree $x0'
47 `Node' {_@_ `$x0' `$x1' `$x2'}
51 `Succ' :: `Nat -> Nat'
56 `Nill' :: `LList alpha'
58 _/\_ `$x0' -> `Nill' {_@_ `$x0'}
59 `Conss' :: `alpha -> LList alpha -> LList alpha'
61 _/\_ `$x0' -> \ `$x1' :: `$x0'
62 `$x1' `$x2' :: `LList $x0'
64 `Conss' {_@_ `$x0' `$x1' `$x2'}
66 `app' :: `LList taCh -> LList taCh -> LList taCh'
68 _/\_ `$x0' -> \ `$x1' :: `LList $x0'
69 `$x1' `$x2' :: `LList $x0'
72 `Conss' `$x3' `$x4' ->
76 `app' _@_ `$x0' `$x4' `$x2'
77 } in `Conss' {_@_ `$x0' `$x3' `$x5'};
80 `Conss' `$x6' `$x7' -> `Conss' {_@_ `$x0' `$x6' `$x7'};
81 `Nill' -> `Nill' {_@_ `$x0'};
91 `$d7' :: `{PrelBase.Eval Boolean}'
94 `$d4' :: `{PrelBase.Eval Nat}'