... | ... | @@ -469,7 +469,7 @@ f x = ($(do { xi <- reify 'x; ... }), |
|
|
|
|
|
Here, `reify` can be used to examine the type of `x`. But the type
|
|
|
of `x` isn't fully known until the type checker has seen the
|
|
|
term `(x && True)`. So in current TH it's going to be unpredicatable
|
|
|
term `(x && True)`. So in current TH it's going to be unpredictable
|
|
|
what you see for `x`, which is hardly satisfactory.
|
|
|
|
|
|
|
... | ... | |