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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
|
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE ViewPatterns #-}
{-# LANGUAGE PatternSynonyms #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE RecursiveDo #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE DeriveFunctor #-}
{-# OPTIONS_GHC -fno-warn-overlapping-patterns #-} -- TODO: remove
{-# OPTIONS_GHC -fno-warn-unused-binds #-} -- TODO: remove
-- {-# OPTIONS_GHC -O0 #-}
module LambdaCube.Compiler.Infer
( Binder (..), SName, Lit(..), Visibility(..), Export(..), Module(..)
, Exp (..), Neutral (..), ExpType, GlobalEnv
, pattern Var, pattern CaseFun, pattern TyCaseFun, pattern App_, pattern LabelEnd
, pattern Con, pattern TyCon, pattern Pi, pattern Lam, pattern Fun
, outputType, boolType, trueExp
, down, Subst (..), free
, litType
, initEnv, Env(..), pattern EBind2
, Infos(..), listInfos, ErrorMsg(..), PolyEnv(..), ErrorT, throwErrorTCM, parseLC, joinPolyEnvs, filterPolyEnv, inference_
, ImportItems (..)
, SI(..), Range(..)
, nType, conType, neutType, neutType', appTy, mkConPars, makeCaseFunPars, makeCaseFunPars'
, MaxDB(..), unfixlabel
) where
import Data.Monoid
import Data.Maybe
import qualified Data.Set as Set
import qualified Data.Map as Map
import Control.Monad.Except
import Control.Monad.Reader
import Control.Monad.Writer
import Control.Monad.State
import Control.Monad.Identity
import Control.Arrow hiding ((<+>))
import Control.DeepSeq
import LambdaCube.Compiler.Pretty hiding (Doc, braces, parens)
import LambdaCube.Compiler.Lexer
import LambdaCube.Compiler.Parser
-------------------------------------------------------------------------------- core expression representation
data Exp
= TType
| ELit Lit
| Con_ MaxDB ConName !Int [Exp]
| TyCon_ MaxDB TyConName [Exp]
| Pi_ MaxDB Visibility Exp Exp
| Lam_ MaxDB Exp
| Neut Neutral
| FixLabel_ Type{-type-} [Exp]{-args-} Exp{-def-} Exp{-fix def args-}
deriving (Show)
pattern FixLabel f xs e <- FixLabel_ f xs e _ where FixLabel f xs e = {-trace_ ("fixl: " ++ ppShow e ++ " " ++ ppShow xs) $ -} let x = FixLabel_ f [] e (subst 0 x e) in foldl app_ x xs
--app_ (FixLabel_ f xs e u) a = FixLabel_ f (xs ++ [a]) e (app_ u a)
data Neutral
= Fun_ MaxDB FunName !Int{-number of missing parameters-} [Exp]{-given parameters-} Neutral{-unfolded expression-}
| CaseFun__ MaxDB CaseFunName [Exp] Neutral
| TyCaseFun__ MaxDB TyCaseFunName [Exp] Neutral
| App__ MaxDB Neutral Exp
| Var_ !Int -- De Bruijn variable
| LabelEnd_ Exp
| Delta (SData ([Exp] -> Exp))
deriving (Show)
data ConName = ConName SName Int{-ordinal number, e.g. Zero:0, Succ:1-} Type
data TyConName = TyConName SName Int{-num of indices-} Type [(ConName, Type)]{-constructors-} CaseFunName
data FunName = FunName_ SName Type
pattern FunName a c = FunName_ a c
data CaseFunName = CaseFunName SName Type Int{-num of parameters-}
data TyCaseFunName = TyCaseFunName SName Type
type Type = Exp
type ExpType = (Exp, Type)
type SExp2 = SExp' ExpType
instance Show ConName where show (ConName n _ _) = n
instance Eq ConName where ConName _ n _ == ConName _ n' _ = n == n'
instance Show TyConName where show (TyConName n _ _ _ _) = n
instance Eq TyConName where TyConName n _ _ _ _ == TyConName n' _ _ _ _ = n == n'
instance Show FunName where show (FunName n _) = n
instance Eq FunName where FunName n _ == FunName n' _ = n == n'
instance Show CaseFunName where show (CaseFunName n _ _) = caseName n
instance Eq CaseFunName where CaseFunName n _ _ == CaseFunName n' _ _ = n == n'
instance Show TyCaseFunName where show (TyCaseFunName n _) = MatchName n
instance Eq TyCaseFunName where TyCaseFunName n _ == TyCaseFunName n' _ = n == n'
-------------------------------------------------------------------------------- auxiliary functions and patterns
infixl 2 `App`, `app_`
infixr 1 :~>
pattern Fun f i xs n <- Fun_ _ f i xs n where Fun f i xs n = Fun_ (foldMap maxDB_ xs <> iterateN i lowerDB (maxDB_ n)) f i xs n
pattern UFunN a b <- Neut (Fun (FunName a _) _ b _)
pattern UTFun a t b <- Neut (Fun (FunName a t) _ b _)
pattern DFun_ fn xs <- Fun fn 0 xs (Delta _) where
DFun_ fn@(FunName n _) xs = Fun fn 0 xs d where
d = Delta $ SData $ getFunDef n $ \xs -> Neut $ Fun fn 0 xs d
pattern DFun a b = Neut (DFun_ a b)
pattern FunN a b <- DFun (FunName a _) b
pattern TFun' a t b <- DFun_ (FunName a t) b where TFun' a t b = DFun_ (FunName a t) b
pattern TFun a t b = Neut (TFun' a t b)
pattern CaseFun_ a b c <- CaseFun__ _ a b c where CaseFun_ a b c = CaseFun__ (foldMap maxDB_ b <> maxDB_ c) a b c
pattern TyCaseFun_ a b c <- TyCaseFun__ _ a b c where TyCaseFun_ a b c = TyCaseFun__ (foldMap maxDB_ b <> maxDB_ c) a b c
pattern App_ a b <- App__ _ a b where App_ a b = App__ (maxDB_ a <> maxDB_ b) a b
pattern CaseFun a b c = Neut (CaseFun_ a b c)
pattern TyCaseFun a b c = Neut (TyCaseFun_ a b c)
pattern App a b <- Neut (App_ (Neut -> a) b)
pattern Var a = Neut (Var_ a)
conParams (conTypeName -> TyConName _ _ _ _ (CaseFunName _ _ pars)) = pars
mkConPars n (snd . getParams -> TyCon (TyConName _ _ _ _ (CaseFunName _ _ pars)) xs) = take (min n pars) xs
--mkConPars 0 TType = [] -- ?
mkConPars n x@Neut{} = error $ "mkConPars!: " ++ ppShow x
mkConPars n x = error $ "mkConPars: " ++ ppShow (n, x)
makeCaseFunPars te n = case neutType te n of
TyCon (TyConName _ _ _ _ (CaseFunName _ _ pars)) xs -> take pars xs
makeCaseFunPars' te n = case neutType' te n of
TyCon (TyConName _ _ _ _ (CaseFunName _ _ pars)) xs -> take pars xs
pattern Closed :: () => Up a => a -> a
pattern Closed a <- a where Closed a = closedExp a
pattern Con x n y <- Con_ _ x n y where Con x n y = Con_ (foldMap maxDB_ y) x n y
pattern ConN s a <- Con (ConName s _ _) _ a
pattern ConN' s a <- Con (ConName _ s _) _ a
tCon s i t a = Con (ConName s i t) 0 a
tCon_ k s i t a = Con (ConName s i t) k a
pattern TyCon x y <- TyCon_ _ x y where TyCon x y = TyCon_ (foldMap maxDB_ y) x y
pattern Lam y <- Lam_ _ y where Lam y = Lam_ (lowerDB (maxDB_ y)) y
pattern Pi v x y <- Pi_ _ v x y where Pi v x y = Pi_ (maxDB_ x <> lowerDB (maxDB_ y)) v x y
pattern TyConN s a <- TyCon (TyConName s _ _ _ _) a
pattern TTyCon s t a <- TyCon (TyConName s _ t _ _) a
tTyCon s t a cs = TyCon (TyConName s (error "todo: inum") t (map ((,) (error "tTyCon")) cs) $ CaseFunName (error "TTyCon-A") (error "TTyCon-B") $ length a) a
pattern TTyCon0 s <- TyCon (TyConName s _ TType _ _) []
tTyCon0 s cs = Closed $ TyCon (TyConName s 0 TType (map ((,) (error "tTyCon0")) cs) $ CaseFunName (error "TTyCon0-A") (error "TTyCon0-B") 0) []
pattern a :~> b = Pi Visible a b
pattern Unit <- TTyCon0 "'Unit" where Unit = tTyCon0 "'Unit" [Unit]
pattern TInt <- TTyCon0 "'Int" where TInt = tTyCon0 "'Int" $ error "cs 1"
pattern TNat <- TTyCon0 "'Nat" where TNat = tTyCon0 "'Nat" $ error "cs 3"
pattern TBool <- TTyCon0 "'Bool" where TBool = tTyCon0 "'Bool" $ error "cs 4"
pattern TFloat <- TTyCon0 "'Float" where TFloat = tTyCon0 "'Float" $ error "cs 5"
pattern TString <- TTyCon0 "'String" where TString = tTyCon0 "'String" $ error "cs 6"
pattern TChar <- TTyCon0 "'Char" where TChar = tTyCon0 "'Char" $ error "cs 7"
pattern TOrdering <- TTyCon0 "'Ordering" where TOrdering = tTyCon0 "'Ordering" $ error "cs 8"
pattern TOutput <- TTyCon0 "'Output" where TOutput = tTyCon0 "'Output" $ error "cs 9"
pattern TTuple0 <- TTyCon0 "'Tuple0" where TTuple0 = tTyCon0 "'Tuple0" $ error "cs 10"
pattern TVec a b <- TyConN "'VecS" {-(TType :~> TNat :~> TType)-} [b, a]
--pattern TTuple2 a b = TTyCon "'Tuple2" (TType :~> TType :~> TType) [a, b]
pattern TInterpolated a <- TyConN "'Interpolated" [a]
tFloating t = error "tFloating" --TFun "'Floating" (TType :~> TType) [t]
tInterpolated x = tTyCon "'Interpolated" (TType :~> TType) [x] [Pi Hidden TType $ Pi Hidden (tFloating $ Var 0) $ tInterpolated $ Var 1, error "cs 12'", error "cs 12''"]
pattern TList a <- TyConN "'List" [a] where TList a = tTyCon "'List" (TType :~> TType) [a] $ error "cs 11"
pattern Empty s <- TyCon (TyConName "'Empty" _ _ _ _) [EString s] where
Empty s = TyCon (TyConName "'Empty" (error "todo: inum2_") (TString :~> TType) (error "todo: tcn cons 3_") $ error "Empty") [EString s]
pattern TT <- ConN' _ _ where TT = Closed (tCon "TT" 0 Unit [])
nil = (tCon_ 1 "Nil" 0 (Pi Hidden TType $ TList (Var 0)) [])
cons a b = (tCon_ 1 "Cons" 1 (Pi Hidden TType $ Var 0 :~> TList (Var 1) :~> TList (Var 2)) [a, b])
pattern Zero <- ConN "Zero" _ where Zero = Closed (tCon "Zero" 0 TNat [])
pattern Succ n <- ConN "Succ" (n:_) where Succ n = tCon "Succ" 1 (TNat :~> TNat) [n]
pattern CstrT t a b = Neut (CstrT' t a b)
pattern CstrT' t a b = TFun' "'EqCT" (TType :~> Var 0 :~> Var 1 :~> TType) [t, a, b]
--pattern ReflCstr x = TFun "reflCstr" (TType :~> CstrT TType (Var 0) (Var 0)) [x]
pattern Coe a b w x = TFun "coe" (TType :~> TType :~> CstrT TType (Var 1) (Var 0) :~> Var 2 :~> Var 2) [a,b,w,x]
pattern ParEval t a b = TFun "parEval" (TType :~> Var 0 :~> Var 1 :~> Var 2) [t, a, b]
pattern Undef t = TFun "undefined" (Pi Hidden TType (Var 0)) [t]
pattern T2 a b = TFun "'T2" (TType :~> TType :~> TType) [a, b]
pattern T2C a b = TFun "t2C" (Unit :~> Unit :~> Unit) [a, b]
pattern CSplit a b c <- UFunN "'Split" [a, b, c]
pattern EInt a = ELit (LInt a)
pattern EFloat a = ELit (LFloat a)
pattern EChar a = ELit (LChar a)
pattern EString a = ELit (LString a)
pattern EBool a <- (getEBool -> Just a) where EBool = mkBool
pattern ENat n <- (fromNatE -> Just n) where ENat = toNatE
pattern ENat' n <- (fromNatE' -> Just n)
pattern NoTup <- (noTup -> True)
--pattern Sigma a b <- TyConN "Sigma" [a, Lam b] where Sigma a b = TTyCon "Sigma" (error "sigmatype") [a, Lam Visible a{-todo: don't duplicate-} b]
--pattern TVec a b = TTyCon "'Vec" (TNat :~> TType :~> TType) [a, b]
--pattern Tuple2 a b c d = tCon "Tuple2" 0 Tuple2Type [a, b, c, d]
--pattern Tuple0 = tCon "Tuple0" 0 TTuple0 []
--pattern TTuple0 :: Exp
--pattern TTuple0 <- _ where TTuple0 = TTyCon0 "'Tuple0"
--pattern Tuple2Type :: Exp
--pattern Tuple2Type <- _ where Tuple2Type = Pi Hidden TType $ Pi Hidden TType $ Var 1 :~> Var 1 :~> TTuple2 (Var 3) (Var 2)
--tTuple3 a b c = TTyCon "'Tuple3" (TType :~> TType :~> TType :~> TType) [a, b, c]
toNatE :: Int -> Exp
toNatE 0 = Zero
toNatE n | n > 0 = Closed (Succ (toNatE (n - 1)))
fromNatE :: Exp -> Maybe Int
fromNatE (ConN' 0 _) = Just 0
fromNatE (ConN' 1 [n]) = (1 +) <$> fromNatE n
fromNatE _ = Nothing
fromNatE' :: Exp -> Maybe Int
fromNatE' Zero = Just 0
fromNatE' (Succ n) = (1 +) <$> fromNatE' n
fromNatE' _ = Nothing
mkBool False = Closed $ tCon "False" 0 TBool []
mkBool True = Closed $ tCon "True" 1 TBool []
getEBool (ConN' 0 _) = Just False
getEBool (ConN' 1 _) = Just True
getEBool _ = Nothing
mkOrdering x = Closed $ case x of
LT -> tCon "LT" 0 TOrdering []
EQ -> tCon "EQ" 1 TOrdering []
GT -> tCon "GT" 2 TOrdering []
noTup (TyConN s _) = take 6 s /= "'Tuple" -- todo
noTup _ = False
conTypeName :: ConName -> TyConName
conTypeName (ConName _ _ t) = case snd $ getParams t of TyCon n _ -> n
outputType = TOutput
boolType = TBool
trueExp = EBool True
-------------------------------------------------------------------------------- label handling
pattern LabelEnd x = Neut (LabelEnd_ x)
pmLabel' :: FunName -> Int -> [Exp] -> Exp -> Exp
pmLabel' _ 0 _ (unfixlabel -> LabelEnd y) = y
pmLabel' (FunName_ _ _) 0 as (Neut (Delta (SData f))) = f as
pmLabel' f i xs (unfixlabel -> Neut y) = Neut $ Fun f i xs y
pmLabel' f i xs y = error $ "pmLabel: " ++ show (f, i, length xs, y)
pmLabel :: FunName -> Int -> [Exp] -> Exp -> Exp
pmLabel f i xs e = pmLabel' f (i + numLams e) xs (Neut $ dropLams e)
dropLams (unfixlabel -> Lam x) = dropLams x
dropLams (unfixlabel -> Neut x) = x
numLams (unfixlabel -> Lam x) = 1 + numLams x
numLams x = 0
unfixlabel (FixLabel_ _ _ _ a) = unfixlabel a
unfixlabel a = a
unlabelend (LabelEnd a) = unlabelend a
unlabelend a = a
-------------------------------------------------------------------------------- low-level toolbox
class Subst b a where
subst :: Int -> b -> a -> a
down :: (Subst Exp a, Up a{-used-}) => Int -> a -> Maybe a
down t x | used t x = Nothing
| otherwise = Just $ subst t (error "impossible: down" :: Exp) x
instance Eq Exp where
FixLabel_ _ a f _ == FixLabel_ _ a' f' _ = (f, a) == (f', a')
FixLabel_ _ _ _ a == a' = a == a'
a == FixLabel_ _ _ _ a' = a == a'
LabelEnd a == a' = a == a'
a == LabelEnd a' = a == a'
Lam a == Lam a' = a == a'
Pi a b c == Pi a' b' c' = (a, b, c) == (a', b', c')
Con a n b == Con a' n' b' = (a, n, b) == (a', n', b')
TyCon a b == TyCon a' b' = (a, b) == (a', b')
TType == TType = True
ELit l == ELit l' = l == l'
Neut a == Neut a' = a == a'
_ == _ = False
instance Eq Neutral where
Fun f i a _ == Fun f' i' a' _ = (f, i, a) == (f', i', a') -- TODO: compare by definition / compare by id
CaseFun_ a b c == CaseFun_ a' b' c' = (a, b, c) == (a', b', c')
TyCaseFun_ a b c == TyCaseFun_ a' b' c' = (a, b, c) == (a', b', c')
App_ a b == App_ a' b' = (a, b) == (a', b')
Var_ a == Var_ a' = a == a'
_ == _ = False
free x | cmpDB 0 x = mempty
free x = fold (\i k -> Set.fromList [k - i | k >= i]) 0 x
instance Up Exp where
up_ 0 = \_ e -> e
up_ n = f where
f i e | cmpDB i e = e
f i e = case e of
Lam_ md b -> Lam_ (upDB n md) (f (i+1) b)
Pi_ md h a b -> Pi_ (upDB n md) h (f i a) (f (i+1) b)
Con_ md s pn as -> Con_ (upDB n md) s pn $ map (f i) as
TyCon_ md s as -> TyCon_ (upDB n md) s $ map (f i) as
Neut x -> Neut $ up_ n i x
FixLabel_ fn xs y u -> FixLabel_ (f i fn) (f i <$> xs) (f (i+1) y) (f i u)
used i e
| cmpDB i e = False
| otherwise = ((getAny .) . fold ((Any .) . (==))) i e
fold f i = \case
FixLabel_ t x y _ -> {-fold f i t <> -} foldMap (fold f i) x -- <> fold f (i+1) y --todo
Lam b -> {-fold f i t <> todo: explain why this is not needed -} fold f (i+1) b
Pi _ a b -> fold f i a <> fold f (i+1) b
Con _ _ as -> foldMap (fold f i) as
TyCon _ as -> foldMap (fold f i) as
TType -> mempty
ELit _ -> mempty
Neut x -> fold f i x
maxDB_ = \case
Lam_ c _ -> c
Pi_ c _ _ _ -> c
Con_ c _ _ _ -> c
TyCon_ c _ _ -> c
Neut x -> maxDB_ x
FixLabel_ t x y _ -> maxDB_ t <> foldMap maxDB_ x <> lowerDB (maxDB_ y)
TType -> mempty
ELit _ -> mempty
closedExp = \case
Lam_ _ c -> Lam_ mempty c
Pi_ _ a b c -> Pi_ mempty a (closedExp b) c
Con_ _ a b c -> Con_ mempty a b (closedExp <$> c)
TyCon_ _ a b -> TyCon_ mempty a (closedExp <$> b)
Neut a -> Neut $ closedExp a
FixLabel_ fn xs b u -> FixLabel_ (closedExp fn) (closedExp <$> xs) (closedExp b) u
e@TType{} -> e
e@ELit{} -> e
instance Subst Exp Exp where
subst i0 x = f i0
where
f i (Neut n) = substNeut n
where
substNeut e | cmpDB i e = Neut e
substNeut e = case e of
Var_ k -> case compare k i of GT -> Var $ k - 1; LT -> Var k; EQ -> up (i - i0) x
CaseFun_ s as n -> evalCaseFun s (f i <$> as) (substNeut n)
TyCaseFun_ s as n -> evalTyCaseFun s (f i <$> as) (substNeut n)
App_ a b -> app_ (substNeut a) (f i b)
Fun fn c xs v -> pmLabel' fn c (f i <$> xs) $ f (i + c) $ Neut v
LabelEnd_ a -> LabelEnd $ f i a
d@Delta{} -> Neut d
f i e | cmpDB i e = e
f i e = case e of
FixLabel_ fn z v u -> FixLabel (f i fn) (f i <$> z) (f (i+1) v) --(f i u)
Lam b -> Lam (f (i+1) b)
Con s n as -> Con s n $ f i <$> as
Pi h a b -> Pi h (f i a) (f (i+1) b)
TyCon s as -> TyCon s $ f i <$> as
instance Up Neutral where
up_ 0 = \_ e -> e
up_ n = f where
f i e | cmpDB i e = e
f i e = case e of
Var_ k -> Var_ $ if k >= i then k+n else k
CaseFun__ md s as ne -> CaseFun__ (upDB n md) s (up_ n i <$> as) (up_ n i ne)
TyCaseFun__ md s as ne -> TyCaseFun__ (upDB n md) s (up_ n i <$> as) (up_ n i ne)
App__ md a b -> App__ (upDB n md) (up_ n i a) (up_ n i b)
Fun fn c x y -> Fun fn c (up_ n i <$> x) $ up_ n (i + c) y
LabelEnd_ x -> LabelEnd_ $ up_ n i x
d@Delta{} -> d
used i e
| cmpDB i e = False
| otherwise = ((getAny .) . fold ((Any .) . (==))) i e
fold f i = \case
Var_ k -> f i k
CaseFun_ _ as n -> foldMap (fold f i) as <> fold f i n
TyCaseFun_ _ as n -> foldMap (fold f i) as <> fold f i n
App_ a b -> fold f i a <> fold f i b
Fun _ j x d -> foldMap (fold f i) x <> fold f (i+j) d
LabelEnd_ x -> fold f i x
Delta{} -> mempty
maxDB_ = \case
Var_ k -> varDB k
CaseFun__ c _ _ _ -> c
TyCaseFun__ c _ _ _ -> c
App__ c a b -> c
Fun_ c _ _ _ _ -> c
LabelEnd_ x -> maxDB_ x
Delta{} -> mempty
closedExp = \case
x@Var_{} -> error "impossible"
CaseFun__ _ a as n -> CaseFun__ mempty a (closedExp <$> as) (closedExp n)
TyCaseFun__ _ a as n -> TyCaseFun__ mempty a (closedExp <$> as) (closedExp n)
App__ _ a b -> App__ mempty (closedExp a) (closedExp b)
Fun_ _ f i x y -> Fun_ mempty f i (closedExp <$> x) y
LabelEnd_ a -> LabelEnd_ (closedExp a)
d@Delta{} -> d
instance (Subst x a, Subst x b) => Subst x (a, b) where
subst i x (a, b) = (subst i x a, subst i x b)
varType' :: Int -> [Exp] -> Exp
varType' i vs = vs !! i
varType :: String -> Int -> Env -> (Binder, Exp)
varType err n_ env = f n_ env where
f n (EAssign i (x, _) es) = second (subst i x) $ f (if n < i then n else n+1) es
f n (EBind2 b t es) = if n == 0 then (b, up 1 t) else second (up 1) $ f (n-1) es
f n (ELet2 _ (x, t) es) = if n == 0 then (BLam Visible{-??-}, up 1 t) else second (up 1) $ f (n-1) es
f n e = either (error $ "varType: " ++ err ++ "\n" ++ show n_ ++ "\n" ++ ppShow env) (f n) $ parent e
-------------------------------------------------------------------------------- reduction
evalCaseFun a ps (Con n@(ConName _ i _) _ vs)
| i /= (-1) = foldl app_ (ps !!! (i + 1)) vs
| otherwise = error "evcf"
where
xs !!! i | i >= length xs = error $ "!!! " ++ show a ++ " " ++ show i ++ " " ++ show n ++ "\n" ++ ppShow ps
xs !!! i = xs !! i
evalCaseFun a b (Neut c) = CaseFun a b c
evalCaseFun a b (FixLabel_ _ _ _ c) = evalCaseFun a b c
evalCaseFun a b x = error $ "evalCaseFun: " ++ show (a, x)
evalTyCaseFun a b (Neut c) = TyCaseFun a b c
evalTyCaseFun a b (FixLabel_ _ _ _ c) = evalTyCaseFun a b c
evalTyCaseFun (TyCaseFunName "match'Type" ty) [_, t, f] TType = t
evalTyCaseFun (TyCaseFunName n ty) [_, t, f] (TyCon (TyConName n' _ _ _ _) vs) | n == n' = foldl app_ t vs
--evalTyCaseFun (TyCaseFunName n ty) [_, t, f] (DFun (FunName n' _) vs) | n == n' = foldl app_ t vs -- hack
evalTyCaseFun (TyCaseFunName n ty) [_, t, f] _ = f
evalCoe a b TT d = d
evalCoe a b t d = Coe a b t d
{- todo: generate
DFun n@(FunName "natElim" _) [a, z, s, Succ x] -> let -- todo: replace let with better abstraction
sx = s `app_` x
in sx `app_` eval (DFun n [a, z, s, x])
MT "natElim" [_, z, s, Zero] -> z
DFun na@(FunName "finElim" _) [m, z, s, n, ConN "FSucc" [i, x]] -> let six = s `app_` i `app_` x-- todo: replace let with better abstraction
in six `app_` eval (DFun na [m, z, s, i, x])
MT "finElim" [m, z, s, n, ConN "FZero" [i]] -> z `app_` i
-}
getFunDef s f = case s of
"unsafeCoerce" -> \case xs@[_, _, x] -> case x of Neut{} -> f xs; _ -> x
"'EqCT" -> \case [t, a, b] -> cstr t a b
"reflCstr" -> \case [a] -> reflCstr a
"coe" -> \case [a, b, t, d] -> evalCoe a b t d
"'T2" -> \case [a, b] -> t2 a b
"t2C" -> \case [a, b] -> t2C a b
"parEval" -> \case [t, a, b] -> parEval t a b
where
parEval _ (LabelEnd x) _ = LabelEnd x
parEval _ _ (LabelEnd x) = LabelEnd x
parEval t a b = ParEval t a b
-- general compiler primitives
"primAddInt" -> \case [EInt i, EInt j] -> EInt (i + j); xs -> f xs
"primSubInt" -> \case [EInt i, EInt j] -> EInt (i - j); xs -> f xs
"primModInt" -> \case [EInt i, EInt j] -> EInt (i `mod` j); xs -> f xs
"primSqrtFloat" -> \case [EFloat i] -> EFloat $ sqrt i; xs -> f xs
"primRound" -> \case [EFloat i] -> EInt $ round i; xs -> f xs
"primIntToFloat" -> \case [EInt i] -> EFloat $ fromIntegral i; xs -> f xs
"primIntToNat" -> \case [EInt i] -> ENat $ fromIntegral i; xs -> f xs
"primCompareInt" -> \case [EInt x, EInt y] -> mkOrdering $ x `compare` y; xs -> f xs
"primCompareFloat" -> \case [EFloat x, EFloat y] -> mkOrdering $ x `compare` y; xs -> f xs
"primCompareChar" -> \case [EChar x, EChar y] -> mkOrdering $ x `compare` y; xs -> f xs
"primCompareString" -> \case [EString x, EString y] -> mkOrdering $ x `compare` y; xs -> f xs
-- LambdaCube 3D specific primitives
"PrimGreaterThan" -> \case [t, _, _, _, _, _, _, x, y] | Just r <- twoOpBool (>) t x y -> r; xs -> f xs
"PrimGreaterThanEqual" -> \case [t, _, _, _, _, _, _, x, y] | Just r <- twoOpBool (>=) t x y -> r; xs -> f xs
"PrimLessThan" -> \case [t, _, _, _, _, _, _, x, y] | Just r <- twoOpBool (<) t x y -> r; xs -> f xs
"PrimLessThanEqual" -> \case [t, _, _, _, _, _, _, x, y] | Just r <- twoOpBool (<=) t x y -> r; xs -> f xs
"PrimEqualV" -> \case [t, _, _, _, _, _, _, x, y] | Just r <- twoOpBool (==) t x y -> r; xs -> f xs
"PrimNotEqualV" -> \case [t, _, _, _, _, _, _, x, y] | Just r <- twoOpBool (/=) t x y -> r; xs -> f xs
"PrimEqual" -> \case [t, _, _, x, y] | Just r <- twoOpBool (==) t x y -> r; xs -> f xs
"PrimNotEqual" -> \case [t, _, _, x, y] | Just r <- twoOpBool (/=) t x y -> r; xs -> f xs
"PrimSubS" -> \case [_, _, _, _, x, y] | Just r <- twoOp (-) x y -> r; xs -> f xs
"PrimSub" -> \case [_, _, x, y] | Just r <- twoOp (-) x y -> r; xs -> f xs
"PrimAddS" -> \case [_, _, _, _, x, y] | Just r <- twoOp (+) x y -> r; xs -> f xs
"PrimAdd" -> \case [_, _, x, y] | Just r <- twoOp (+) x y -> r; xs -> f xs
"PrimMulS" -> \case [_, _, _, _, x, y] | Just r <- twoOp (*) x y -> r; xs -> f xs
"PrimMul" -> \case [_, _, x, y] | Just r <- twoOp (*) x y -> r; xs -> f xs
"PrimDivS" -> \case [_, _, _, _, _, x, y] | Just r <- twoOp_ (/) div x y -> r; xs -> f xs
"PrimDiv" -> \case [_, _, _, _, _, x, y] | Just r <- twoOp_ (/) div x y -> r; xs -> f xs
"PrimModS" -> \case [_, _, _, _, _, x, y] | Just r <- twoOp_ modF mod x y -> r; xs -> f xs
"PrimMod" -> \case [_, _, _, _, _, x, y] | Just r <- twoOp_ modF mod x y -> r; xs -> f xs
"PrimNeg" -> \case [_, x] | Just r <- oneOp negate x -> r; xs -> f xs
"PrimAnd" -> \case [EBool x, EBool y] -> EBool (x && y); xs -> f xs
"PrimOr" -> \case [EBool x, EBool y] -> EBool (x || y); xs -> f xs
"PrimXor" -> \case [EBool x, EBool y] -> EBool (x /= y); xs -> f xs
"PrimNot" -> \case [TNat, _, _, EBool x] -> EBool $ not x; xs -> f xs
_ -> f
cstr = f []
where
f _ _ a a' | a == a' = Unit
f ns typ (LabelEnd a) a' = f ns typ a a'
f ns typ a (LabelEnd a') = f ns typ a a'
f ns typ (FixLabel_ _ _ _ a) a' = f ns typ a a'
f ns typ a (FixLabel_ _ _ _ a') = f ns typ a a'
f ns typ (Con a n xs) (Con a' n' xs') | a == a' && n == n' && length xs == length xs' =
if null xs then Unit else ff ns (foldl appTy (conType typ a) $ mkConPars n typ) $ zip xs xs'
f ns typ (TyCon a xs) (TyCon a' xs') | a == a' && length xs == length xs' =
ff ns (nType a) $ zip xs xs'
f (_: ns) typ{-down?-} (down 0 -> Just a) (down 0 -> Just a') = f ns typ a a'
f ns TType (Pi h a b) (Pi h' a' b') | h == h' = t2 (f ns TType a a') (f ((a, a'): ns) TType b b')
f [] TType (UFunN "'VecScalar" [a, b]) (TVec a' b') = t2 (f [] TNat a a') (f [] TType b b')
f [] TType (UFunN "'VecScalar" [a, b]) (UFunN "'VecScalar" [a', b']) = t2 (f [] TNat a a') (f [] TType b b')
f [] TType (UFunN "'VecScalar" [a, b]) t@(TTyCon0 n) | isElemTy n = t2 (f [] TNat a (ENat 1)) (f [] TType b t)
f [] TType t@(TTyCon0 n) (UFunN "'VecScalar" [a, b]) | isElemTy n = t2 (f [] TNat a (ENat 1)) (f [] TType b t)
-- f [] TType (UTFun "map" (Pi _ t _) [a, b]) (TyConN ":" [x, xs]) = f [] t a (cons x nil)
f [] TType (UTFun "'FragOps" (Pi _ t _) [a]) (TyConN "'FragmentOperation" [x]) = f [] t a (cons x nil)
f [] TType (UTFun "'FragOps" (Pi _ t _) [a]) (TyConN "'Tuple2" [TyConN "'FragmentOperation" [x], TyConN "'FragmentOperation" [y]]) = f [] t a $ cons x $ cons y nil
f ns@[] TType (TyConN "'Tuple2" [x, y]) (UFunN "'JoinTupleType" [x', y']) = t2 (f ns TType x x') (f ns TType y y')
f ns@[] TType (UFunN "'JoinTupleType" [x', y']) (TyConN "'Tuple2" [x, y]) = t2 (f ns TType x' x) (f ns TType y' y)
f ns@[] TType (UFunN "'JoinTupleType" [x', y']) x@NoTup = t2 (f ns TType x' x) (f ns TType y' TTuple0)
-- f ns@[] TType (UFunN "'InterpolatedType" [x'@Neut{}]) TTuple0 = f ns TType x' TTuple0
-- f ns@[] TType (UFunN "'InterpolatedType" [x'@Neut{}]) x@NoTup = f ns TType (tInterpolated x') x
-- f ns@[] TType (UFunN "'InterpolatedType" [x'@Neut{}]) (TInterpolated x) = f ns TType x' x
f ns@[] TType x@NoTup (UFunN "'InterpolatedType" [x'@Neut{}]) = f ns TType (tInterpolated x) x'
f [] typ a@Neut{} a' = CstrT typ a a'
f [] typ a a'@Neut{} = CstrT typ a a'
f ns typ a a' = Empty $ unlines [ "can not unify"
, ppShow a
, "with"
, ppShow a'
]
ff _ _ [] = Unit
ff ns tt@(Pi v t _) ((t1, t2'): ts) = t2 (f ns t t1 t2') $ ff ns (appTy tt t1) ts
ff ns t zs = error $ "ff: " -- ++ show (a, n, length xs', length $ mkConPars n typ) ++ "\n" ++ ppShow (nType a) ++ "\n" ++ ppShow (foldl appTy (nType a) $ mkConPars n typ) ++ "\n" ++ ppShow (zip xs xs') ++ "\n" ++ ppShow zs ++ "\n" ++ ppShow t
isElemTy n = n `elem` ["'Bool", "'Float", "'Int"]
reflCstr = \case
{-
Unit -> TT
TType -> TT -- ?
Con n xs -> foldl (t2C te{-todo: more precise env-}) TT $ map (reflCstr te{-todo: more precise env-}) xs
TyCon n xs -> foldl (t2C te{-todo: more precise env-}) TT $ map (reflCstr te{-todo: more precise env-}) xs
x -> {-error $ "reflCstr: " ++ show x-} ReflCstr x
-}
x -> TT
t2C TT TT = TT
t2C a b = T2C a b
t2 Unit a = a
t2 a Unit = a
t2 (Empty a) (Empty b) = Empty (a <> b)
t2 (Empty s) _ = Empty s
t2 _ (Empty s) = Empty s
t2 a b = T2 a b
oneOp :: (forall a . Num a => a -> a) -> Exp -> Maybe Exp
oneOp f = oneOp_ f f
oneOp_ f _ (EFloat x) = Just $ EFloat $ f x
oneOp_ _ f (EInt x) = Just $ EInt $ f x
oneOp_ _ _ _ = Nothing
twoOp :: (forall a . Num a => a -> a -> a) -> Exp -> Exp -> Maybe Exp
twoOp f = twoOp_ f f
twoOp_ f _ (EFloat x) (EFloat y) = Just $ EFloat $ f x y
twoOp_ _ f (EInt x) (EInt y) = Just $ EInt $ f x y
twoOp_ _ _ _ _ = Nothing
modF x y = x - fromIntegral (floor (x / y)) * y
twoOpBool :: (forall a . Ord a => a -> a -> Bool) -> Exp -> Exp -> Exp -> Maybe Exp
twoOpBool f t (EFloat x) (EFloat y) = Just $ EBool $ f x y
twoOpBool f t (EInt x) (EInt y) = Just $ EBool $ f x y
twoOpBool f t (EString x) (EString y) = Just $ EBool $ f x y
twoOpBool f t (EChar x) (EChar y) = Just $ EBool $ f x y
twoOpBool f TNat (ENat x) (ENat y) = Just $ EBool $ f x y
twoOpBool _ _ _ _ = Nothing
app_ :: Exp -> Exp -> Exp
app_ (Lam x) a = subst 0 a x
app_ (Con s n xs) a = if n < conParams s then Con s (n+1) xs else Con s n (xs ++ [a])
app_ (TyCon s xs) a = TyCon s (xs ++ [a])
app_ (FixLabel_ f xs e u) a = FixLabel_ f (xs ++ [a]) e (app_ u a)
app_ (Neut f) a = neutApp f a
neutApp (Fun f i xs e) a | i > 0 = pmLabel f (i-1) (xs ++ [a]) (subst (i-1) (up (i-1) a) $ Neut e)
neutApp (LabelEnd_ x) a = Neut $ LabelEnd_ (app_ x a) -- ???
neutApp d@Delta{} _ = Neut d
neutApp f a = Neut $ App_ f a
-------------------------------------------------------------------------------- constraints env
data CEnv a
= MEnd a
| Meta Exp (CEnv a)
| Assign !Int ExpType (CEnv a) -- De Bruijn index decreasing assign reservedOp, only for metavariables (non-recursive)
deriving (Show, Functor)
instance (Subst Exp a, Up a) => Up (CEnv a) where
up1_ i = \case
MEnd a -> MEnd $ up1_ i a
Meta a b -> Meta (up1_ i a) (up1_ (i+1) b)
Assign j a b -> handleLet i j $ \i' j' -> assign j' (up1_ i' a) (up1_ i' b)
where
handleLet i j f
| i > j = f (i-1) j
| i <= j = f i (j+1)
used i a = error "used @(CEnv _)"
fold _ _ _ = error "fold @(CEnv _)"
maxDB_ _ = error "maxDB_ @(CEnv _)"
instance (Subst Exp a, Up a) => Subst Exp (CEnv a) where
subst i x = \case
MEnd a -> MEnd $ subst i x a
Meta a b -> Meta (subst i x a) (subst (i+1) (up 1 x) b)
Assign j a b
| j > i, Just a' <- down i a -> assign (j-1) a' (subst i (subst (j-1) (fst a') x) b)
| j > i, Just x' <- down (j-1) x -> assign (j-1) (subst i x' a) (subst i x' b)
| j < i, Just a' <- down (i-1) a -> assign j a' (subst (i-1) (subst j (fst a') x) b)
| j < i, Just x' <- down j x -> assign j (subst (i-1) x' a) (subst (i-1) x' b)
| j == i -> Meta (cstr (snd a) x $ fst a) $ up1_ 0 b
--assign :: (Int -> Exp -> CEnv Exp -> a) -> (Int -> Exp -> CEnv Exp -> a) -> Int -> Exp -> CEnv Exp -> a
swapAssign _ clet i (Var j, t) b | i > j = clet j (Var (i-1), t) $ subst j (Var (i-1)) $ up1_ i b
swapAssign clet _ i a b = clet i a b
assign = swapAssign Assign Assign
-------------------------------------------------------------------------------- environments
-- SExp + Exp zipper
data Env
= EBind1 SI Binder Env SExp2 -- zoom into first parameter of SBind
| EBind2_ SI Binder Type Env -- zoom into second parameter of SBind
| EApp1 SI Visibility Env SExp2
| EApp2 SI Visibility ExpType Env
| ELet1 LI Env SExp2
| ELet2 LI ExpType Env
| EGlobal String{-full source of current module-} GlobalEnv [Stmt]
| ELabelEnd Env
| EAssign Int ExpType Env
| CheckType_ SI Type Env
| CheckIType SExp2 Env
-- | CheckSame Exp Env
| CheckAppType SI Visibility Type Env SExp2 --pattern CheckAppType _ h t te b = EApp1 _ h (CheckType t te) b
deriving Show
pattern EBind2 b e env <- EBind2_ _ b e env where EBind2 b e env = EBind2_ (debugSI "6") b e env
pattern CheckType e env <- CheckType_ _ e env where CheckType e env = CheckType_ (debugSI "7") e env
parent = \case
EAssign _ _ x -> Right x
EBind2 _ _ x -> Right x
EBind1 _ _ x _ -> Right x
EApp1 _ _ x _ -> Right x
EApp2 _ _ _ x -> Right x
ELet1 _ x _ -> Right x
ELet2 _ _ x -> Right x
CheckType _ x -> Right x
CheckIType _ x -> Right x
-- CheckSame _ x -> Right x
CheckAppType _ _ _ x _ -> Right x
ELabelEnd x -> Right x
EGlobal s x _ -> Left (s, x)
-------------------------------------------------------------------------------- simple typing
litType = \case
LInt _ -> TInt
LFloat _ -> TFloat
LString _ -> TString
LChar _ -> TChar
class NType a where nType :: a -> Type
instance NType FunName where nType (FunName _ t) = t
instance NType TyConName where nType (TyConName _ _ t _ _) = t
instance NType CaseFunName where nType (CaseFunName _ t _) = t
instance NType TyCaseFunName where nType (TyCaseFunName _ t) = t
conType (snd . getParams -> TyCon (TyConName _ _ _ cs _) _) (ConName _ n t) = t --snd $ cs !! n
neutType te = \case
App_ f x -> appTy (neutType te f) x
Var_ i -> snd $ varType "C" i te
CaseFun_ s ts n -> appTy (foldl appTy (nType s) $ makeCaseFunPars te n ++ ts) (Neut n)
TyCaseFun_ s [m, t, f] n -> foldl appTy (nType s) [m, t, Neut n, f]
Fun s _ a _ -> foldl appTy (nType s) a
neutType' te = \case
App_ f x -> appTy (neutType' te f) x
Var_ i -> varType' i te
CaseFun_ s ts n -> appTy (foldl appTy (nType s) $ makeCaseFunPars' te n ++ ts) (Neut n)
TyCaseFun_ s [m, t, f] n -> foldl appTy (nType s) [m, t, Neut n, f]
Fun s _ a _ -> foldl appTy (nType s) a
mkExpTypes t [] = []
mkExpTypes t@(Pi _ a _) (x: xs) = (x, t): mkExpTypes (appTy t x) xs
appTy (Pi _ a b) x = subst 0 x b
appTy t x = error $ "appTy: " ++ show t
-------------------------------------------------------------------------------- inference
type TCM m = ExceptT String (WriterT Infos m)
--runTCM = either error id . runExcept
expAndType s (e, t, si) = (e, t)
-- todo: do only if NoTypeNamespace extension is not on
lookupName s@('\'':s') m = expAndType s <$> (Map.lookup s m `mplus` Map.lookup s' m)
lookupName s m = expAndType s <$> Map.lookup s m
--elemIndex' s@('\'':s') m = elemIndex s m `mplus` elemIndex s' m
--elemIndex' s m = elemIndex s m
getDef te si s = maybe (throwError $ "can't find: " ++ s ++ " in " ++ showSI te si {- ++ "\nitems:\n" ++ intercalate ", " (take' "..." 10 $ Map.keys $ snd $ extractEnv te)-}) return (lookupName s $ snd $ extractEnv te)
{-
take' e n xs = case splitAt n xs of
(as, []) -> as
(as, _) -> as ++ [e]
-}
showSI :: Env -> SI -> String
showSI e = showSI_ (fst $ extractEnv e)
type ExpType' = CEnv ExpType
inferN :: forall m . Monad m => TraceLevel -> Env -> SExp2 -> TCM m ExpType'
inferN tracelevel = infer where
infer :: Env -> SExp2 -> TCM m ExpType'
infer te exp = (if tracelevel >= 1 then trace_ ("infer: " ++ showEnvSExp te exp) else id) $ (if debug then fmap (fmap{-todo-} $ recheck' "infer" te) else id) $ case exp of
SAnn x t -> checkN (CheckIType x te) t TType
SLabelEnd x -> infer (ELabelEnd te) x
SVar (si, _) i -> focus_' te exp (Var i, snd $ varType "C2" i te)
SLit si l -> focus_' te exp (ELit l, litType l)
STyped si et -> focus_' te exp et
SGlobal (si, s) -> focus_' te exp =<< getDef te si s
SApp si h a b -> infer (EApp1 (si `validate` [sourceInfo a, sourceInfo b]) h te b) a
SLet le a b -> infer (ELet1 le te b{-in-}) a{-let-} -- infer te SLamV b `SAppV` a)
SBind si h _ a b -> infer ((if h /= BMeta then CheckType_ (sourceInfo exp) TType else id) $ EBind1 si h te $ (if isPi h then TyType else id) b) a
checkN :: Env -> SExp2 -> Type -> TCM m ExpType'
checkN te x t = (if tracelevel >= 1 then trace_ $ "check: " ++ showEnvSExpType te x t else id) $ checkN_ te x t
checkN_ te e t
-- temporal hack
| x@(SGlobal (si, MatchName n)) `SAppV` SLamV (Wildcard_ siw _) `SAppV` a `SAppV` SVar siv v `SAppV` b <- e
= infer te $ x `SAppV` SLam Visible SType (STyped mempty (subst (v+1) (Var 0) $ up 1 t, TType)) `SAppV` a `SAppV` SVar siv v `SAppV` b
-- temporal hack
| x@(SGlobal (si, "'NatCase")) `SAppV` SLamV (Wildcard_ siw _) `SAppV` a `SAppV` b `SAppV` SVar siv v <- e
= infer te $ x `SAppV` STyped mempty (Lam $ subst (v+1) (Var 0) $ up 1 t, TNat :~> TType) `SAppV` a `SAppV` b `SAppV` SVar siv v
{-
-- temporal hack
| x@(SGlobal "'VecSCase") `SAppV` SLamV (SLamV (Wildcard _)) `SAppV` a `SAppV` b `SAppV` c `SAppV` SVar v <- e
= infer te $ x `SAppV` (SLamV (SLamV (STyped (subst (v+1) (Var 0) $ up 2 t, TType)))) `SAppV` a `SAppV` b `SAppV` c `SAppV` SVar v
-}
-- temporal hack
| SGlobal (si, "undefined") <- e = focus_' te e (Undef t, t)
| SLabelEnd x <- e = checkN (ELabelEnd te) x t
| SApp si h a b <- e = infer (CheckAppType si h t te b) a
| SLam h a b <- e, Pi h' x y <- t, h == h' = do
tellType te e t
let same = checkSame te a x
if same then checkN (EBind2 (BLam h) x te) b y else error $ "checkSame:\n" ++ show a ++ "\nwith\n" ++ showEnvExp te (x, TType)
| Pi Hidden a b <- t, notHiddenLam e = checkN (EBind2 (BLam Hidden) a te) (up1 e) b
| otherwise = infer (CheckType_ (sourceInfo e) t te) e
where
-- todo
notHiddenLam = \case
SLam Visible _ _ -> True
SGlobal (si,s) | (Lam _, Pi Hidden _ _) <- fromMaybe (error $ "infer: can't find: " ++ s) $ lookupName s $ snd $ extractEnv te -> False
| otherwise -> True
_ -> False
{-
-- todo
checkSame te (Wildcard _) a = return (te, True)
checkSame te x y = do
(ex, _) <- checkN te x TType
return $ ex == y
-}
checkSame te (Wildcard _) a = True
checkSame te (SGlobal (_,"'Type")) TType = True
checkSame te SType TType = True
checkSame te (SBind _ BMeta _ SType (STyped _ (Var 0, _))) a = True
checkSame te a b = error $ "checkSame: " ++ show (a, b)
hArgs (Pi Hidden _ b) = 1 + hArgs b
hArgs _ = 0
focus_' env si eet = tellType env si (snd eet) >> focus_ env eet
focus_ :: Env -> ExpType -> TCM m ExpType'
focus_ env eet@(e, et) = (if tracelevel >= 1 then trace_ $ "focus: " ++ showEnvExp env eet else id) $ (if debug then fmap (fmap{-todo-} $ recheck' "focus" env) else id) $ case env of
ELabelEnd te -> focus_ te (LabelEnd e, et)
-- CheckSame x te -> focus_ (EBind2_ (debugSI "focus_ CheckSame") BMeta (cstr x e) te) $ up 1 eet
CheckAppType si h t te b -- App1 h (CheckType t te) b
| Pi h' x (down 0 -> Just y) <- et, h == h' -> case t of
Pi Hidden t1 t2 | h == Visible -> focus_ (EApp1 si h (CheckType_ (sourceInfo b) t te) b) eet -- <<e>> b : {t1} -> {t2}
_ -> focus_ (EBind2_ (sourceInfo b) BMeta (cstr TType t y) $ EApp1 si h te b) $ up 1 eet
| otherwise -> focus_ (EApp1 si h (CheckType_ (sourceInfo b) t te) b) eet
EApp1 si h te b
| Pi h' x y <- et, h == h' -> checkN (EApp2 si h eet te) b x
| Pi Hidden x y <- et, h == Visible -> focus_ (EApp1 mempty Hidden env $ Wildcard $ Wildcard SType) eet -- e b --> e _ b
-- | CheckType (Pi Hidden _ _) te' <- te -> error "ok"
-- | CheckAppType Hidden _ te' _ <- te -> error "ok"
| otherwise -> infer (CheckType_ (sourceInfo b) (Var 2) $ cstr' h (up 2 et) (Pi Visible (Var 1) (Var 1)) (up 2 e) $ EBind2_ (sourceInfo b) BMeta TType $ EBind2_ (sourceInfo b) BMeta TType te) (up 3 b)
where
cstr' h x y e = EApp2 mempty h (evalCoe (up 1 x) (up 1 y) (Var 0) (up 1 e), up 1 y) . EBind2_ (sourceInfo b) BMeta (cstr TType x y)
ELet2 le (x{-let-}, xt) te -> focus_ te $ subst 0 (mkELet le x xt){-let-} eet{-in-}
CheckIType x te -> checkN te x e
CheckType_ si t te
| hArgs et > hArgs t
-> focus_ (EApp1 mempty Hidden (CheckType_ si t te) $ Wildcard $ Wildcard SType) eet
| hArgs et < hArgs t, Pi Hidden t1 t2 <- t
-> focus_ (CheckType_ si t2 $ EBind2 (BLam Hidden) t1 te) eet
| otherwise -> focus_ (EBind2_ si BMeta (cstr TType t et) te) $ up 1 eet
EApp2 si h (a, at) te -> focus_' te si (app_ a e, appTy at e) -- h??
EBind1 si h te b -> infer (EBind2_ (sourceInfo b) h e te) b
EBind2_ si (BLam h) a te -> focus_ te $ lamPi h a eet
EBind2_ si (BPi h) a te -> focus_' te si (Pi h a e, TType)
_ -> focus2 env $ MEnd eet
focus2 :: Env -> CEnv ExpType -> TCM m ExpType'
focus2 env eet = case env of
ELet1 le te b{-in-} -> infer (ELet2 le (replaceMetas' eet{-let-}) te) b{-in-}
EBind2_ si BMeta tt te
| Unit <- tt -> refocus te $ subst 0 TT eet
| Empty msg <- tt -> throwError $ "type error: " ++ msg ++ "\nin " ++ showSI te si ++ "\n"-- todo: better error msg
| T2 x y <- tt, let te' = EBind2_ si BMeta (up 1 y) $ EBind2_ si BMeta x te
-> refocus te' $ subst 2 (t2C (Var 1) (Var 0)) $ up 2 eet
| CstrT t a b <- tt, Just r <- cst (a, t) b -> r
| CstrT t a b <- tt, Just r <- cst (b, t) a -> r
| isCstr tt, EBind2 h x te' <- te{-, h /= BMeta todo: remove-}, Just x' <- down 0 tt, x == x'
-> refocus te $ subst 1 (Var 0) eet
| EBind2 h x te' <- te, h /= BMeta, Just b' <- down 0 tt
-> refocus (EBind2_ si h (up 1 x) $ EBind2_ si BMeta b' te') $ subst 2 (Var 0) $ up 1 eet
| ELet2 le (x, xt) te' <- te, Just b' <- down 0 tt
-> refocus (ELet2 le (up 1 x, up 1 xt) $ EBind2_ si BMeta b' te') $ subst 2 (Var 0) $ up 1 eet
| EBind1 si h te' x <- te -> refocus (EBind1 si h (EBind2_ si BMeta tt te') $ up1_ 1 x) eet
| ELet1 le te' x <- te, floatLetMeta $ snd $ replaceMetas' $ Meta tt $ eet
-> refocus (ELet1 le (EBind2_ si BMeta tt te') $ up1_ 1 x) eet
| CheckAppType si h t te' x <- te -> refocus (CheckAppType si h (up 1 t) (EBind2_ si BMeta tt te') $ up1 x) eet
| EApp1 si h te' x <- te -> refocus (EApp1 si h (EBind2_ si BMeta tt te') $ up1 x) eet
| EApp2 si h x te' <- te -> refocus (EApp2 si h (up 1 x) $ EBind2_ si BMeta tt te') eet
| CheckType_ si t te' <- te -> refocus (CheckType_ si (up 1 t) $ EBind2_ si BMeta tt te') eet
-- | CheckIType x te' <- te -> refocus (CheckType_ si (up 1 t) $ EBind2_ si BMeta tt te') eet
| ELabelEnd te' <- te -> refocus (ELabelEnd $ EBind2_ si BMeta tt te') eet
| otherwise -> focus2 te $ Meta tt eet
where
refocus = refocus_ focus2
cst :: ExpType -> Exp -> Maybe (TCM m ExpType')
cst x = \case
Var i | fst (varType "X" i te) == BMeta
, Just y <- down i x
-> Just $ join swapAssign (\i x -> refocus $ EAssign i x te) i y $ subst 0 {-ReflCstr y-}TT $ subst (i+1) (fst $ up 1 y) eet
_ -> Nothing
EAssign i b te -> case te of
EBind2_ si h x te' | i > 0, Just b' <- down 0 b
-> refocus' (EBind2_ si h (subst (i-1) (fst b') x) (EAssign (i-1) b' te')) eet
ELet2 le (x, xt) te' | i > 0, Just b' <- down 0 b
-> refocus' (ELet2 le (subst (i-1) (fst b') x, subst (i-1) (fst b') xt) (EAssign (i-1) b' te')) eet
ELet1 le te' x -> refocus' (ELet1 le (EAssign i b te') $ substS (i+1) (up 1 b) x) eet
EBind1 si h te' x -> refocus' (EBind1 si h (EAssign i b te') $ substS (i+1) (up 1 b) x) eet
CheckAppType si h t te' x -> refocus' (CheckAppType si h (subst i (fst b) t) (EAssign i b te') $ substS i b x) eet
EApp1 si h te' x -> refocus' (EApp1 si h (EAssign i b te') $ substS i b x) eet
EApp2 si h x te' -> refocus' (EApp2 si h (subst i (fst b) x) $ EAssign i b te') eet
CheckType_ si t te' -> refocus' (CheckType_ si (subst i (fst b) t) $ EAssign i b te') eet
ELabelEnd te' -> refocus' (ELabelEnd $ EAssign i b te') eet
EAssign j a te' | i < j
-> refocus' (EAssign (j-1) (subst i (fst b) a) $ EAssign i (up1_ (j-1) b) te') eet
t | Just te' <- pull i te -> refocus' te' eet
| otherwise -> swapAssign (\i x -> focus2 te . Assign i x) (\i x -> refocus' $ EAssign i x te) i b eet
-- todo: CheckSame Exp Env
where
refocus' = fix refocus_
pull i = \case
EBind2 BMeta _ te | i == 0 -> Just te
EBind2_ si h x te -> EBind2_ si h <$> down (i-1) x <*> pull (i-1) te
EAssign j b te -> EAssign (if j <= i then j else j-1) <$> down i b <*> pull (if j <= i then i+1 else i) te
_ -> Nothing
EGlobal{} -> return eet
_ -> case eet of
MEnd x -> throwError_ $ "focus todo: " ++ ppShow x
_ -> throwError_ $ "focus checkMetas: " ++ ppShow env ++ "\n" ++ ppShow (fst <$> eet)
where
refocus_ :: (Env -> CEnv ExpType -> TCM m ExpType') -> Env -> CEnv ExpType -> TCM m ExpType'
refocus_ _ e (MEnd at) = focus_ e at
refocus_ f e (Meta x at) = f (EBind2 BMeta x e) at
refocus_ _ e (Assign i x at) = focus2 (EAssign i x e) at
replaceMetas' = replaceMetas $ lamPi Hidden
lamPi h = (***) <$> const Lam <*> Pi h
replaceMetas bind = \case
Meta a t -> bind a $ replaceMetas bind t
Assign i x t | x' <- up1_ i x -> bind (cstr (snd x') (Var i) $ fst x') . up 1 . up1_ i $ replaceMetas bind t
MEnd t -> t
isCstr CstrT{} = True
isCstr (UFunN s [_]) = s `elem` ["'Eq", "'Ord", "'Num", "'CNum", "'Signed", "'Component", "'Integral", "'NumComponent", "'Floating"] -- todo: use Constraint type to decide this
isCstr _ = {- trace_ (ppShow c ++ show c) $ -} False
-------------------------------------------------------------------------------- re-checking
type Message = String
recheck :: Message -> Env -> ExpType -> ExpType
recheck msg e = recheck' msg e
-- todo: check type also
recheck' :: Message -> Env -> ExpType -> ExpType
recheck' msg' e (x, xt) = (recheck_ "main" (checkEnv e) (x, xt), xt)
where
checkEnv = \case
e@EGlobal{} -> e
EBind1 si h e b -> EBind1 si h (checkEnv e) b
EBind2_ si h t e -> EBind2_ si h (checkType e t) $ checkEnv e -- E [\(x :: t) -> e] -> check E [t]
ELet1 le e b -> ELet1 le (checkEnv e) b
ELet2 le x e -> ELet2 le (recheck'' "env" e x) $ checkEnv e
EApp1 si h e b -> EApp1 si h (checkEnv e) b
EApp2 si h a e -> EApp2 si h (recheck'' "env" e a) $ checkEnv e -- E [a x] -> check
EAssign i x e -> EAssign i (recheck'' "env" e $ up1_ i x) $ checkEnv e -- __ <i := x>
CheckType_ si x e -> CheckType_ si (checkType e x) $ checkEnv e
-- CheckSame x e -> CheckSame (recheck'' "env" e x) $ checkEnv e
CheckAppType si h x e y -> CheckAppType si h (checkType e x) (checkEnv e) y
recheck'' msg te a@(x, xt) = (recheck_ msg te a, xt)
checkType te e = recheck_ "check" te (e, TType)
recheck_ msg te = \case
(Var k, zt) -> Var k -- todo: check var type
(Lam b, Pi h a bt) -> Lam $ recheck_ "9" (EBind2 (BLam h) a te) (b, bt)
(Pi h a b, TType) -> Pi h (checkType te a) $ checkType (EBind2 (BPi h) a te) b
(ELit l, zt) -> ELit l -- todo: check literal type
(TType, TType) -> TType
(Neut (App_ a b), zt)
| (Neut a', at) <- recheck'' "app1" te (Neut a, neutType te a)
-> checkApps "a" [] zt (Neut . App_ a' . head) te at [b]
(Con s n as, zt) -> checkApps (show s) [] zt (Con s n . drop (conParams s)) te (conType zt s) $ mkConPars n zt ++ as
(TyCon s as, zt) -> checkApps (show s) [] zt (TyCon s) te (nType s) as
(CaseFun s@(CaseFunName _ t pars) as n, zt) -> checkApps (show s) [] zt (\xs -> evalCaseFun s (init $ drop pars xs) (last xs)) te (nType s) (makeCaseFunPars te n ++ as ++ [Neut n])
(TyCaseFun s [m, t, f] n, zt) -> checkApps (show s) [] zt (\[m, t, n, f] -> evalTyCaseFun s [m, t, f] n) te (nType s) [m, t, Neut n, f]
(FixLabel_ f xs x u, zt) -> checkApps "fixlab" [] zt (\xs -> FixLabel_ f xs x u) te f xs -- TODO: recheck x
(Neut (Fun f i a x), zt) -> checkApps "lab" [] zt (\xs -> Neut $ Fun f i xs x) te (nType f) a -- TODO: recheck x
(LabelEnd x, zt) -> LabelEnd $ recheck_ msg te (x, zt)
(Neut d@Delta{}, zt) -> Neut d
where
checkApps s acc zt f _ t []
| t == zt = f $ reverse acc
| otherwise =
error_ $ "checkApps' " ++ s ++ " " ++ msg ++ "\n" ++ showEnvExp te{-todo-} (t, TType) ++ "\n\n" ++ showEnvExp te (zt, TType)
checkApps s acc zt f te t@(Pi h x y) (b_: xs) = checkApps (s++"+") (b: acc) zt f te (appTy t b) xs where b = recheck_ "checkApps" te (b_, x)
checkApps s acc zt f te t _ =
error_ $ "checkApps " ++ s ++ " " ++ msg ++ "\n" ++ showEnvExp te{-todo-} (t, TType) ++ "\n\n" ++ showEnvExp e (x, xt)
getNeut (Neut a) = a
-- Ambiguous: (Int ~ F a) => Int
-- Not ambiguous: (Show a, a ~ F b) => b
ambiguityCheck :: String -> Exp -> Maybe String
ambiguityCheck s ty = case ambigVars ty of
[] -> Nothing
err -> Just $ s ++ " has ambiguous type:\n" ++ ppShow ty ++ "\nproblematic vars:\n" ++ show err
ambigVars :: Exp -> [(Int, Exp)]
ambigVars ty = [(n, c) | (n, c) <- hid, not $ any (`Set.member` defined) $ Set.insert n $ free c]
where
(defined, hid, i) = compDefined False ty
floatLetMeta :: Exp -> Bool
floatLetMeta ty = (i-1) `Set.member` defined
where
(defined, hid, i) = compDefined True ty
compDefined b ty = (defined, hid, i)
where
defined = dependentVars hid $ Set.map (if b then (+i) else id) $ free ty
i = length hid_
hid = zipWith (\k t -> (k, up (k+1) t)) (reverse [0..i-1]) hid_
(hid_, ty') = hiddenVars ty
hiddenVars (Pi Hidden a b) = first (a:) $ hiddenVars b
hiddenVars t = ([], t)
-- compute dependent type vars in constraints
-- Example: dependentVars [(a, b) ~ F b c, d ~ F e] [c] == [a,b,c]
dependentVars :: [(Int, Exp)] -> Set.Set Int -> Set.Set Int
dependentVars ie = cycle mempty
where
freeVars = free
cycle acc s
| Set.null s = acc
| otherwise = cycle (acc <> s) (grow s Set.\\ acc)
grow = flip foldMap ie $ \case
(n, t) -> (Set.singleton n <-> freeVars t) <> case t of
CstrT _{-todo-} ty f -> freeVars ty <-> freeVars f
CSplit a b c -> freeVars a <-> (freeVars b <> freeVars c)
_ -> mempty
where
a --> b = \s -> if Set.null $ a `Set.intersection` s then mempty else b
a <-> b = (a --> b) <> (b --> a)
-------------------------------------------------------------------------------- global env
type GlobalEnv = Map.Map SName (Exp, Type, (SI, MFixity))
-- monad used during elaborating statments -- TODO: use zippers instead
type ElabStmtM m = ReaderT (Extensions, String{-full source-}) (StateT GlobalEnv (ExceptT String (WriterT Infos m)))
extractEnv :: Env -> (String, GlobalEnv)
extractEnv = either id extractEnv . parent
initEnv :: GlobalEnv
initEnv = Map.fromList
[ (,) "'Type" (TType, TType, (debugSI "source-of-Type", Nothing))
]
extractDesugarInfo :: GlobalEnv -> DesugarInfo
extractDesugarInfo ge =
( Map.fromList
[ (n, f) | (n, (d, _, (si, Just f))) <- Map.toList ge ]
, Map.fromList $
[ (n, Left ((t, inum), map f cons))
| (n, ( (Con cn 0 []), _, si)) <- Map.toList ge, let TyConName t inum _ cons _ = conTypeName cn
] ++
[ (n, Right $ pars t)
| (n, ( (TyCon (TyConName _ _ t _ _) []), _, _)) <- Map.toList ge
]
)
where
f (ConName n _ _, ct) = (n, pars ct)
pars = length . filter ((==Visible) . fst) . fst . getParams
-------------------------------------------------------------------------------- infos
newtype Infos = Infos (Map.Map Range (Set.Set String))
deriving (NFData)
instance Monoid Infos where
mempty = Infos mempty
Infos x `mappend` Infos y = Infos $ Map.unionWith mappend x y
mkInfoItem (RangeSI r) i = Infos $ Map.singleton r $ Set.singleton i
mkInfoItem _ _ = mempty
listInfos (Infos m) = [(r, Set.toList i) | (r, i) <- Map.toList m]
-------------------------------------------------------------------------------- inference for statements
handleStmt :: MonadFix m => [Stmt] -> Stmt -> ElabStmtM m ()
handleStmt defs = \case
Primitive n mf (trSExp' -> t_) -> do
t <- inferType tr =<< ($ t_) <$> addF
tellStmtType (fst n) t
addToEnv n mf $ flip (,) t $ lamify t $ DFun (FunName (snd n) t)
Let n mf mt t_ -> do
af <- addF
let t__ = maybe id (flip SAnn . af) mt t_
(x, t) <- inferTerm (snd n) tr id $ trSExp' $ if usedS n t__ then SBuiltin "primFix" `SAppV` SLamV (substSG0 n t__) else t__
tellStmtType (fst n) t
addToEnv n mf (mkELet (True, n) x t, t)
{- -- hack
when (snd (getParams t) == TType) $ do
let ps' = fst $ getParams t
t'' = (TType :~> TType)
:~> addParams ps' (Var (length ps') `app_` DFun (FunName (snd n) t) (downTo 0 $ length ps'))
:~> TType
:~> Var 2 `app_` Var 0
:~> Var 3 `app_` Var 1
addToEnv (fst n, MatchName (snd n)) (lamify t'' $ \[m, tr, n', f] -> evalTyCaseFun (TyCaseFunName (snd n) t) [m, tr, f] n', t'')
-}
PrecDef{} -> return ()
Data s (map (second trSExp') -> ps) (trSExp' -> t_) addfa (map (second trSExp') -> cs) -> do
exs <- asks fst
af <- if addfa then gets $ addForalls exs . (snd s:) . defined' else return id
vty <- inferType tr $ addParamsS ps t_
tellStmtType (fst s) vty
let
pnum' = length $ filter ((== Visible) . fst) ps
inum = arity vty - length ps
mkConstr j (cn, af -> ct)
| c == SGlobal s && take pnum' xs == downToS (length . fst . getParamsS $ ct) pnum'
= do
cty <- removeHiddenUnit <$> inferType tr (addParamsS [(Hidden, x) | (Visible, x) <- ps] ct)
tellStmtType (fst cn) cty
let pars = zipWith (\x -> second $ STyped (debugSI "mkConstr1") . flip (,) TType . up_ (1+j) x) [0..] $ drop (length ps) $ fst $ getParams cty
act = length . fst . getParams $ cty
acts = map fst . fst . getParams $ cty
conn = ConName (snd cn) j cty
addToEnv cn (listToMaybe [f | PrecDef n f <- defs, n == cn]) (Con conn 0 [], cty)
return ( (conn, cty)
, addParamsS pars
$ foldl SAppV (SVar (debugSI "22", ".cs") $ j + length pars) $ drop pnum' xs ++ [apps' (SGlobal cn) (zip acts $ downToS (j+1+length pars) (length ps) ++ downToS 0 (act- length ps))]
)
| otherwise = throwError "illegal data definition (parameters are not uniform)" -- ++ show (c, cn, take pnum' xs, act)
where
(c, map snd -> xs) = getApps $ snd $ getParamsS ct
motive = addParamsS (replicate inum (Visible, Wildcard SType)) $
SPi Visible (apps' (SGlobal s) $ zip (map fst ps) (downToS inum $ length ps) ++ zip (map fst $ fst $ getParamsS t_) (downToS 0 inum)) SType
mdo
let tcn = TyConName (snd s) inum vty (map fst cons) cfn
let cfn = CaseFunName (snd s) ct $ length ps
addToEnv s (listToMaybe [f | PrecDef n f <- defs, n == s]) (TyCon tcn [], vty)
cons <- zipWithM mkConstr [0..] cs
ct <- inferType tr
( (\x -> traceD ("type of case-elim before elaboration: " ++ ppShow x) x) $ addParamsS
( [(Hidden, x) | (_, x) <- ps]
++ (Visible, motive)
: map ((,) Visible . snd) cons
++ replicate inum (Hidden, Wildcard SType)
++ [(Visible, apps' (SGlobal s) $ zip (map fst ps) (downToS (inum + length cs + 1) $ length ps) ++ zip (map fst $ fst $ getParamsS t_) (downToS 0 inum))]
)
$ foldl SAppV (SVar (debugSI "23", ".ct") $ length cs + inum + 1) $ downToS 1 inum ++ [SVar (debugSI "24", ".24") 0]
)
addToEnv (fst s, caseName (snd s)) Nothing (lamify ct $ \xs -> evalCaseFun cfn (init $ drop (length ps) xs) (last xs), ct)
let ps' = fst $ getParams vty
t = (TType :~> TType)
:~> addParams ps' (Var (length ps') `app_` TyCon tcn (downTo 0 $ length ps'))
:~> TType
:~> Var 2 `app_` Var 0
:~> Var 3 `app_` Var 1
addToEnv (fst s, MatchName (snd s)) Nothing (lamify t $ \[m, tr, n, f] -> evalTyCaseFun (TyCaseFunName (snd s) t) [m, tr, f] n, t)
stmt -> error $ "handleStmt: " ++ show stmt
mkELet (False, n) x xt = x
mkELet (True, n) x t{-type of x-}
| Just (t, f, i) <- getFix x 0 = fix $ \term -> pmLabel fn i [] $ Lam f `app_` FixLabel (nType fn) (downTo 0 i) term
| otherwise = pmLabel fn 0 [] x
where
fn = FunName (snd n) t
getFix (Lam z) i = getFix z (i+1)
getFix (FunN "primFix" [t, Lam f]) i = Just (t, f, i)
getFix _ _ = Nothing
removeHiddenUnit (Pi Hidden Unit (down 0 -> Just t)) = removeHiddenUnit t
removeHiddenUnit (Pi h a b) = Pi h a $ removeHiddenUnit b
removeHiddenUnit t = t
addParams ps t = foldr (uncurry Pi) t ps
addLams ps t = foldr (const Lam) t ps
lamify t x = addLams (fst $ getParams t) $ x $ downTo 0 $ arity t
{-
getApps' = second reverse . run where
run (App a b) = second (b:) $ run a
run x = (x, [])
-}
arity :: Exp -> Int
arity = length . fst . getParams
getParams :: Exp -> ([(Visibility, Exp)], Exp)
getParams (unlabelend -> Pi h a b) = first ((h, a):) $ getParams b
getParams x = ([], x)
getLams (Lam b) = getLams b
getLams x = x
getGEnv f = do
(exs, src) <- ask
gets (\ge -> EGlobal src ge mempty) >>= f
inferTerm msg tr f t = asks fst >>= \exs -> getGEnv $ \env -> let env' = f env in smartTrace exs $ \tr ->
fmap ((closedExp *** closedExp) . recheck msg env' . replaceMetas (lamPi Hidden)) $ lift (lift $ inferN (if tr then traceLevel exs else 0) env' t)
inferType tr t = asks fst >>= \exs -> getGEnv $ \env -> fmap (closedExp . fst . recheck "inferType" env . flip (,) TType . replaceMetas (Pi Hidden) . fmap fst) $ lift (lift $ inferN (if tr then traceLevel exs else 0) (CheckType_ (debugSI "inferType CheckType_") TType env) t)
addToEnv :: Monad m => SIName -> MFixity -> (Exp, Exp) -> ElabStmtM m ()
addToEnv (si, s) mf (x, t) = do
-- maybe (pure ()) throwError_ $ ambiguityCheck s t -- TODO
exs <- asks fst
when (trLight exs) $ mtrace (s ++ " :: " ++ ppShow t)
v <- gets $ Map.lookup s
case v of
Nothing -> modify $ Map.insert s (closedExp x, closedExp t, (si, mf))
Just (_, _, (si', _))
| sameSource si si' -> getGEnv $ \ge -> throwError $ "already defined " ++ s ++ " at " ++ showSI ge si ++ "\n and at " ++ showSI ge si'
| otherwise -> getGEnv $ \ge -> throwError $ "already defined " ++ s ++ " at " ++ showSI ge si ++ "\n and at " ++ showSourcePosSI si'
downTo n m = map Var [n+m-1, n+m-2..n]
defined' = Map.keys
addF = asks fst >>= \exs -> gets $ addForalls exs . defined'
tellType te si t = tell $ mkInfoItem (sourceInfo si) $ removeEscs $ showDoc $ mkDoc True (t, TType)
tellStmtType si t = getGEnv $ \te -> tellType te si t
-------------------------------------------------------------------------------- inference output
data PolyEnv = PolyEnv
{ getPolyEnv :: GlobalEnv
, infos :: Infos
}
filterPolyEnv p pe = pe { getPolyEnv = Map.filterWithKey (\k _ -> p k) $ getPolyEnv pe }
joinPolyEnvs :: MonadError ErrorMsg m => Bool -> [PolyEnv] -> m PolyEnv
joinPolyEnvs _ = return . foldr mappend' mempty' -- todo
where
mempty' = PolyEnv mempty mempty
PolyEnv a b `mappend'` PolyEnv a' b' = PolyEnv (a `mappend` a') (b `mappend` b')
-------------------------------------------------------------------------------- pretty print
-- todo: do this via conversion to SExp
instance PShow Exp where
pShowPrec _ = showDoc_ . mkDoc False
instance PShow (CEnv Exp) where
pShowPrec _ = showDoc_ . mkDoc False
instance PShow Env where
pShowPrec _ e = showDoc_ $ envDoc e $ pure $ shAtom $ underlined "<<HERE>>"
showEnvExp :: Env -> ExpType -> String
showEnvExp e c = showDoc $ envDoc e $ epar <$> mkDoc False c
showEnvSExp :: Up a => Env -> SExp' a -> String
showEnvSExp e c = showDoc $ envDoc e $ epar <$> sExpDoc c
showEnvSExpType :: Up a => Env -> SExp' a -> Exp -> String
showEnvSExpType e c t = showDoc $ envDoc e $ epar <$> (shAnn "::" False <$> sExpDoc c <**> mkDoc False (t, TType))
where
infixl 4 <**>
(<**>) :: NameDB (a -> b) -> NameDB a -> NameDB b
a <**> b = get >>= \s -> lift $ evalStateT a s <*> evalStateT b s
{-
expToSExp :: Exp -> SExp
expToSExp = \case
Fun x _ -> expToSExp x
FixLabel _ x -> expToSExp x
-- Var k -> shAtom <$> shVar k
App a b -> SApp Visible{-todo-} (expToSExp a) (expToSExp b)
{-
Lam h a b -> join $ shLam (used 0 b) (BLam h) <$> f a <*> pure (f b)
Bind h a b -> join $ shLam (used 0 b) h <$> f a <*> pure (f b)
Cstr a b -> shCstr <$> f a <*> f b
MT s xs -> foldl (shApp Visible) (shAtom s) <$> mapM f xs
CaseFun s xs -> foldl (shApp Visible) (shAtom $ show s) <$> mapM f xs
TyCaseFun s xs -> foldl (shApp Visible) (shAtom $ show s) <$> mapM f xs
ConN s xs -> foldl (shApp Visible) (shAtom s) <$> mapM f xs
TyConN s xs -> foldl (shApp Visible) (shAtom s) <$> mapM f xs
-- TType -> pure $ shAtom "Type"
ELit l -> pure $ shAtom $ show l
Assign i x e -> shLet i (f x) (f e)
LabelEnd x -> shApp Visible (shAtom "labend") <$> f x
-}
nameSExp :: SExp -> NameDB SExp
nameSExp = \case
SGlobal s -> pure $ SGlobal s
SApp h a b -> SApp h <$> nameSExp a <*> nameSExp b
SBind h a b -> newName >>= \n -> SBind h <$> nameSExp a <*> local (n:) (nameSExp b)
SLet a b -> newName >>= \n -> SLet <$> nameSExp a <*> local (n:) (nameSExp b)
STyped_ x (e, _) -> nameSExp $ expToSExp e -- todo: mark boundary
SVar i -> SGlobal <$> shVar i
-}
envDoc :: Env -> Doc -> Doc
envDoc x m = case x of
EGlobal{} -> m
EBind1 _ h ts b -> envDoc ts $ join $ shLam (used 0 b) h <$> m <*> pure (sExpDoc b)
EBind2 h a ts -> envDoc ts $ join $ shLam True h <$> mkDoc ts' (a, TType) <*> pure m
EApp1 _ h ts b -> envDoc ts $ shApp h <$> m <*> sExpDoc b
EApp2 _ h (Lam (Var 0), Pi Visible TType _) ts -> envDoc ts $ shApp h (shAtom "tyType") <$> m
EApp2 _ h a ts -> envDoc ts $ shApp h <$> mkDoc ts' a <*> m
ELet1 _ ts b -> envDoc ts $ shLet_ m (sExpDoc b)
ELet2 _ x ts -> envDoc ts $ shLet_ (mkDoc ts' x) m
EAssign i x ts -> envDoc ts $ shLet i (mkDoc ts' x) m
CheckType t ts -> envDoc ts $ shAnn ":" False <$> m <*> mkDoc ts' (t, TType)
CheckIType t ts -> envDoc ts $ shAnn ":" False <$> m <*> pure (shAtom "??") -- mkDoc ts' t
-- CheckSame t ts -> envDoc ts $ shCstr <$> m <*> mkDoc ts' t
CheckAppType si h t te b -> envDoc (EApp1 si h (CheckType_ (sourceInfo b) t te) b) m
ELabelEnd ts -> envDoc ts $ shApp Visible (shAtom "labEnd") <$> m
x -> error $ "envDoc: " ++ show x
where
ts' = False
class MkDoc a where
mkDoc :: Bool -> a -> Doc
instance MkDoc ExpType where
mkDoc ts e = mkDoc ts $ fst e
instance MkDoc Exp where
mkDoc ts e = fmap inGreen <$> f e
where
f = \case
FixLabel_ _ _ _ x -> f x
Neut x -> mkDoc ts x
-- Lam h a b -> join $ shLam (used 0 b) (BLam h) <$> f a <*> pure (f b)
Lam b -> join $ shLam True (BLam Visible) <$> f TType{-todo!-} <*> pure (f b)
Pi h a b -> join $ shLam (used 0 b) (BPi h) <$> f a <*> pure (f b)
ENat' n -> pure $ shAtom $ show n
Con s _ xs -> foldl (shApp Visible) (shAtom_ $ show s) <$> mapM f xs
TyConN s xs -> foldl (shApp Visible) (shAtom_ s) <$> mapM f xs
TType -> pure $ shAtom "Type"
ELit l -> pure $ shAtom $ show l
shAtom_ = shAtom . if ts then switchTick else id
instance MkDoc Neutral where
mkDoc ts e = fmap inGreen <$> f e
where
g = mkDoc ts
f = \case
CstrT' t a b -> shCstr <$> g (a, t) <*> g (b, t)
Fun s i (mkExpTypes (nType s) -> xs) _ -> foldl (shApp Visible) (shAtom_ $ show s) <$> mapM g xs
Var_ k -> shAtom <$> shVar k
App_ a b -> shApp Visible <$> g a <*> g b
CaseFun_ s xs n -> foldl (shApp Visible) (shAtom_ $ show s) <$> mapM g ({-mkExpTypes (nType s) $ makeCaseFunPars te n ++ -} xs ++ [Neut n])
TyCaseFun_ s [m, t, f] n -> foldl (shApp Visible) (shAtom_ $ show s) <$> mapM g (mkExpTypes (nType s) [m, t, Neut n, f])
TyCaseFun_ s _ n -> error $ "mkDoc TyCaseFun"
LabelEnd_ x -> shApp Visible (shAtom $ "labend") <$> g x
Delta{} -> return $ shAtom "^delta"
shAtom_ = shAtom . if ts then switchTick else id
instance MkDoc (CEnv Exp) where
mkDoc ts e = fmap inGreen <$> f e
where
f :: CEnv Exp -> Doc
f = \case
MEnd a -> mkDoc ts a
Meta a b -> join $ shLam True BMeta <$> mkDoc ts a <*> pure (f b)
Assign i (x, _) e -> shLet i (mkDoc ts x) (f e)
-------------------------------------------------------------------------------- main
smartTrace :: MonadError String m => Extensions -> (Bool -> m a) -> m a
smartTrace exs f | traceLevel exs >= 2 = f True
smartTrace exs f | traceLevel exs == 0 = f False
smartTrace exs f = catchError (f False) $ \err ->
trace_ (unlines
[ "---------------------------------"
, err
, "try again with trace"
, "---------------------------------"
]) $ f True
type TraceLevel = Int
traceLevel exs = if TraceTypeCheck `elem` exs then 1 else 0 :: TraceLevel -- 0: no trace
tr = False --traceLevel >= 2
trLight exs = traceLevel exs >= 1
inference_ :: PolyEnv -> Module -> ErrorT (WriterT Infos Identity) PolyEnv
inference_ (PolyEnv pe is) m = ff $ runWriter $ runExceptT $ mdo
let (x, dns) = definitions m ds
ds = mkDesugarInfo defs `joinDesugarInfo` extractDesugarInfo pe
defs <- either (throwError . ErrorMsg) return x
mapM_ (maybe (return ()) (throwErrorTCM . text)) dns
mapExceptT (fmap $ ErrorMsg +++ snd) . flip runStateT (initEnv <> pe) . flip runReaderT (extensions m, sourceCode m) . mapM_ (handleStmt defs) $ sortDefs ds defs
where
ff (Left e, is) = throwError e
ff (Right ge, is) = do
tell is
return $ PolyEnv ge is
|