blob: b30245b3afd42f827934629e1fedf067222629ad (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
--Testing GADTs, type families as well as a ton of crazy type stuff
:set -Wno-redundant-constraints
:set -Wno-simplifiable-class-constraints
:set -XGADTs
:set -XTypeFamilies
:set -XFunctionalDependencies
:set -XFlexibleContexts
:set -XFlexibleInstances
:set -XUndecidableInstances
data A
data B
data C
:{
data ABorC t where
Foo :: Int -> ABorC A
Bar :: Bool -> ABorC A
Baz :: Char -> ABorC B
Quz :: ABorC B
Yud :: String -> ABorC C
Myp :: Double -> ABorC C
:}
data HTrue
data HFalse
class TypeEq x y b | x y -> b
instance {-# OVERLAPS #-} (HTrue ~ b) => TypeEq x x b
instance {-# OVERLAPS #-} (HTrue ~ b) => TypeEq x x b
instance {-# OVERLAPS #-} (HFalse ~ b) => TypeEq x y b
type family Or a b
type instance Or HTrue HTrue = HTrue
type instance Or HTrue HFalse = HTrue
type instance Or HFalse HTrue = HTrue
type instance Or HFalse HFalse = HFalse
let f :: (Or a c ~ HTrue, TypeEq t A a, TypeEq t C c) => ABorC t -> Int ; f x = 1
-- Weird test case: (TypeEq t C c) and (TypeEq t C c) are both simplifiable
f $ Foo 1
f $ Bar True
f $ Baz 'a'
f $ Quz
f $ Yud "a"
f $ Myp 4.3
|
