diff options
author | Richard Eisenberg <eir@cis.upenn.edu> | 2015-12-11 18:19:53 -0500 |
---|---|---|
committer | Richard Eisenberg <eir@cis.upenn.edu> | 2015-12-11 18:23:12 -0500 |
commit | 6746549772c5cc0ac66c0fce562f297f4d4b80a2 (patch) | |
tree | 96869fcfb5757651462511d64d99a3712f09e7fb /testsuite/tests/typecheck/should_compile/tc211.stderr | |
parent | 6e56ac58a6905197412d58e32792a04a63b94d7e (diff) | |
download | haskell-6746549772c5cc0ac66c0fce562f297f4d4b80a2.tar.gz |
Add kind equalities to GHC.
This implements the ideas originally put forward in
"System FC with Explicit Kind Equality" (ICFP'13).
There are several noteworthy changes with this patch:
* We now have casts in types. These change the kind
of a type. See new constructor `CastTy`.
* All types and all constructors can be promoted.
This includes GADT constructors. GADT pattern matches
take place in type family equations. In Core,
types can now be applied to coercions via the
`CoercionTy` constructor.
* Coercions can now be heterogeneous, relating types
of different kinds. A coercion proving `t1 :: k1 ~ t2 :: k2`
proves both that `t1` and `t2` are the same and also that
`k1` and `k2` are the same.
* The `Coercion` type has been significantly enhanced.
The documentation in `docs/core-spec/core-spec.pdf` reflects
the new reality.
* The type of `*` is now `*`. No more `BOX`.
* Users can write explicit kind variables in their code,
anywhere they can write type variables. For backward compatibility,
automatic inference of kind-variable binding is still permitted.
* The new extension `TypeInType` turns on the new user-facing
features.
* Type families and synonyms are now promoted to kinds. This causes
trouble with parsing `*`, leading to the somewhat awkward new
`HsAppsTy` constructor for `HsType`. This is dispatched with in
the renamer, where the kind `*` can be told apart from a
type-level multiplication operator. Without `-XTypeInType` the
old behavior persists. With `-XTypeInType`, you need to import
`Data.Kind` to get `*`, also known as `Type`.
* The kind-checking algorithms in TcHsType have been significantly
rewritten to allow for enhanced kinds.
* The new features are still quite experimental and may be in flux.
* TODO: Several open tickets: #11195, #11196, #11197, #11198, #11203.
* TODO: Update user manual.
Tickets addressed: #9017, #9173, #7961, #10524, #8566, #11142.
Updates Haddock submodule.
Diffstat (limited to 'testsuite/tests/typecheck/should_compile/tc211.stderr')
-rw-r--r-- | testsuite/tests/typecheck/should_compile/tc211.stderr | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/testsuite/tests/typecheck/should_compile/tc211.stderr b/testsuite/tests/typecheck/should_compile/tc211.stderr index 34a35f1781..d802dffe4e 100644 --- a/testsuite/tests/typecheck/should_compile/tc211.stderr +++ b/testsuite/tests/typecheck/should_compile/tc211.stderr @@ -1,5 +1,5 @@ -tc211.hs:17:8: +tc211.hs:17:8: error: Couldn't match expected type ‘forall a. a -> a’ with actual type ‘a2 -> a2’ In the expression: @@ -10,17 +10,17 @@ tc211.hs:17:8: (forall a. a -> a) -> [forall a. a -> a] -> [forall a. a -> a]) (head foo) foo -tc211.hs:18:22: +tc211.hs:18:22: error: Couldn't match type ‘forall a3. a3 -> a3’ with ‘a -> a’ - Expected type: [a -> a] - Actual type: [forall a. a -> a] + Expected type: [a -> a] + Actual type: [forall a. a -> a] In the first argument of ‘head’, namely ‘foo’ In the first argument of ‘(:) :: (forall a. a -> a) -> [forall a. a -> a] -> [forall a. a -> a]’, namely ‘(head foo)’ -tc211.hs:59:18: +tc211.hs:59:18: error: Couldn't match expected type ‘forall a. a -> a’ with actual type ‘a1 -> a1’ In the expression: @@ -33,7 +33,7 @@ tc211.hs:59:18: (forall a. a -> a) -> List (forall a. a -> a) -> List (forall a. a -> a) -tc211.hs:65:8: +tc211.hs:65:8: error: Couldn't match expected type ‘forall a. a -> a’ with actual type ‘a0 -> a0’ In the expression: @@ -46,11 +46,11 @@ tc211.hs:65:8: -> List (forall a. a -> a) -> List (forall a. a -> a)) (\ x -> x) Nil -tc211.hs:73:9: +tc211.hs:73:9: error: Couldn't match type ‘forall a4. a4 -> a4’ with ‘a3 -> a3’ - Expected type: List (forall a. a -> a) - -> (forall a. a -> a) -> a3 -> a3 - Actual type: List (a3 -> a3) -> (a3 -> a3) -> a3 -> a3 + Expected type: List (forall a. a -> a) + -> (forall a. a -> a) -> a3 -> a3 + Actual type: List (a3 -> a3) -> (a3 -> a3) -> a3 -> a3 In the expression: foo2 :: List (forall a. a -> a) -> (forall a. a -> a) -> (forall a. a -> a) |