summaryrefslogtreecommitdiff
path: root/testsuite/tests/rep-poly/T19615.hs
diff options
context:
space:
mode:
authorsheaf <sam.derbyshire@gmail.com>2021-10-15 23:09:39 +0200
committerMarge Bot <ben+marge-bot@smart-cactus.org>2021-10-17 14:06:46 -0400
commit81740ce83976e9d6b68594f8a4b489452cca56e5 (patch)
tree7b41d1529975c2f78eaced81e26e4722d34c212f /testsuite/tests/rep-poly/T19615.hs
parent65bf3992aebb3c08f0c4e13a3fb89dd5620015a9 (diff)
downloadhaskell-81740ce83976e9d6b68594f8a4b489452cca56e5.tar.gz
Introduce Concrete# for representation polymorphism checks
PHASE 1: we never rewrite Concrete# evidence. This patch migrates all the representation polymorphism checks to the typechecker, using a new constraint form Concrete# :: forall k. k -> TupleRep '[] Whenever a type `ty` must be representation-polymorphic (e.g. it is the type of an argument to a function), we emit a new `Concrete# ty` Wanted constraint. If this constraint goes unsolved, we report a representation-polymorphism error to the user. The 'FRROrigin' datatype keeps track of the context of the representation-polymorphism check, for more informative error messages. This paves the way for further improvements, such as allowing type families in RuntimeReps and improving the soundness of typed Template Haskell. This is left as future work (PHASE 2). fixes #17907 #20277 #20330 #20423 #20426 updates haddock submodule ------------------------- Metric Decrease: T5642 -------------------------
Diffstat (limited to 'testsuite/tests/rep-poly/T19615.hs')
-rw-r--r--testsuite/tests/rep-poly/T19615.hs17
1 files changed, 17 insertions, 0 deletions
diff --git a/testsuite/tests/rep-poly/T19615.hs b/testsuite/tests/rep-poly/T19615.hs
new file mode 100644
index 0000000000..8d71ca925e
--- /dev/null
+++ b/testsuite/tests/rep-poly/T19615.hs
@@ -0,0 +1,17 @@
+{-# LANGUAGE RankNTypes #-}
+{-# LANGUAGE PolyKinds #-}
+{-# LANGUAGE DataKinds #-}
+{-# LANGUAGE TypeFamilies #-}
+module T19615 where
+
+import GHC.Exts
+
+class Call (r :: RuntimeRep) where
+ type Lev (a :: TYPE r)
+ lift' :: (a :: TYPE r) -> (Lev a -> b) -> b
+ mapF :: forall r' (a :: TYPE r) (b :: TYPE r'). Call r' => (a -> b) -> Lev a -> Lev b
+
+instance Call LiftedRep where
+ type Lev a = a
+ lift' a k = k a
+ mapF f x = lift' (f x) id