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
|
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE ViewPatterns #-}
{-# LANGUAGE PatternSynonyms #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE NoMonomorphismRestriction #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE ScopedTypeVariables #-}
module LambdaCube.Compiler.Parser
( SData(..)
, NameDB, caseName, pattern MatchName
, sourceInfo, SI(..), debugSI
, Module(..), Visibility(..), Binder(..), SExp'(..), Extension(..), Extensions
, pattern SVar, pattern SType, pattern Wildcard, pattern SAppV, pattern SLamV, pattern SAnn
, pattern SBuiltin, pattern SPi, pattern Primitive, pattern SRHS, pattern SLam, pattern Parens
, pattern TyType, pattern SLet
, debug, isPi, iterateN, traceD
, parseLC, runDefParser
, pattern UncurryS, pattern AppsS, downToS, addForalls
, Up (..), up1, up
, Doc, shLam, shApp, shLet, shLet_, shAtom, shAnn, shVar, epar, showDoc, showDoc_, sExpDoc, shCstr, shTuple
, mtrace
, trSExp', usedS, deBruijnify, mapS
, Stmt (..), Export (..), ImportItems (..)
, DesugarInfo
) where
import Data.Monoid
import Data.Maybe
import Data.List
import Data.Char
import Data.String
import Data.Function
import qualified Data.Map as Map
import qualified Data.Set as Set
import qualified Data.IntMap as IM
import qualified Data.IntSet as IS
import Control.Monad.Except
import Control.Monad.Reader
import Control.Monad.Writer
import Control.Monad.State
import Control.Arrow hiding ((<+>))
import Control.Applicative
--import Debug.Trace
import qualified LambdaCube.Compiler.Pretty as BodyParser
import LambdaCube.Compiler.Pretty hiding (Doc, braces, parens)
import LambdaCube.Compiler.Lexer
-------------------------------------------------------------------------------- utils
(<&>) = flip (<$>)
dropNth i xs = take i xs ++ drop (i+1) xs
iterateN n f e = iterate f e !! n
mtrace s = trace_ s $ return ()
unfoldNat z s 0 = z
unfoldNat z s n | n > 0 = s $ unfoldNat z s (n-1)
data Void
instance Show Void where show = elimVoid
instance Eq Void where x == y = elimVoid x
elimVoid :: Void -> a
elimVoid _ = error "impossible"
-- supplementary data: data with no semantic relevance
newtype SData a = SData a
instance Show (SData a) where show _ = "SData"
instance Eq (SData a) where _ == _ = True
instance Ord (SData a) where _ `compare` _ = EQ
traceD x = if debug then trace_ x else id
debug = False--True--tr
try = try_
-------------------------------------------------------------------------------- expression representation
data SExp' a
= SLit SI Lit
| SGlobal SIName
| SApp_ SI Visibility (SExp' a) (SExp' a)
| SBind_ SI Binder (SData SIName){-parameter name-} (SExp' a) (SExp' a)
| SVar_ (SData SIName) !Int
| SLet_ SI (SData SIName) (SExp' a) (SExp' a) -- let x = e in f --> SLet e f{-x is Var 0-}
| STyped a
deriving (Eq, Show)
type SExp = SExp' Void
data Binder
= BPi Visibility
| BLam Visibility
| BMeta -- a metavariable is like a floating hidden lambda
deriving (Eq, Show)
data Visibility = Hidden | Visible
deriving (Eq, Show)
dummyName s = (debugSI s, "v_" ++ s)
dummyName' = SData . dummyName
sVar = SVar . dummyName
pattern SBind v x a b <- SBind_ _ v x a b
where SBind v x a b = SBind_ (sourceInfo a <> sourceInfo b) v x a b
pattern SPi h a b <- SBind (BPi h) _ a b
where SPi h a b = SBind (BPi h) (dummyName' "SPi") a b
pattern SLam h a b <- SBind (BLam h) _ a b
where SLam h a b = SBind (BLam h) (dummyName' "SLam") a b
pattern Wildcard t <- SBind BMeta _ t (SVar _ 0)
where Wildcard t = SBind BMeta (dummyName' "Wildcard") t (sVar "Wildcard2" 0)
pattern SLet n a b <- SLet_ _ (SData n) a b
where SLet n a b = SLet_ (sourceInfo a <> sourceInfo b) (SData n) a b
pattern SLamV a = SLam Visible (Wildcard SType) a
pattern SVar a b = SVar_ (SData a) b
pattern SApp h a b <- SApp_ _ h a b
where SApp h a b = SApp_ (sourceInfo a <> sourceInfo b) h a b
pattern SAppH a b = SApp Hidden a b
pattern SAppV a b = SApp Visible a b
pattern SAppV2 f a b = f `SAppV` a `SAppV` b
infixl 2 `SAppV`, `SAppH`
pattern SBuiltin s <- SGlobal (_, s)
where SBuiltin s = SGlobal (debugSI $ "builtin " ++ s, s)
pattern SRHS a = SBuiltin "^rhs" `SAppV` a
pattern Section e = SBuiltin "^section" `SAppV` e
pattern SType = SBuiltin "'Type"
pattern Parens e = SBuiltin "parens" `SAppV` e
pattern SAnn a t = SBuiltin "typeAnn" `SAppH` t `SAppV` a
pattern TyType a = SAnn a SType
sLit = SLit mempty
isPi (BPi _) = True
isPi _ = False
pattern UncurryS :: [(Visibility, SExp' a)] -> SExp' a -> SExp' a
pattern UncurryS ps t <- (getParamsS -> (ps, t))
where UncurryS ps t = foldr (uncurry SPi) t ps
getParamsS (SPi h t x) = first ((h, t):) $ getParamsS x
getParamsS x = ([], x)
pattern AppsS :: SExp' a -> [(Visibility, SExp' a)] -> SExp' a
pattern AppsS f args <- (getApps -> (f, args))
where AppsS = foldl $ \a (v, b) -> SApp v a b
getApps = second reverse . run where
run (SApp h a b) = second ((h, b):) $ run a
run x = (x, [])
-- todo: remove
downToS err n m = [sVar (err ++ "_" ++ show i) (n + i) | i <- [m-1, m-2..0]]
instance SourceInfo (SExp' a) where
sourceInfo = \case
SGlobal (si, _) -> si
SBind_ si _ _ _ _ -> si
SApp_ si _ _ _ -> si
SLet_ si _ _ _ -> si
SVar (si, _) _ -> si
SLit si _ -> si
STyped _ -> mempty
instance SetSourceInfo SExp where
setSI si = \case
SBind_ _ a b c d -> SBind_ si a b c d
SApp_ _ a b c -> SApp_ si a b c
SLet_ _ le a b -> SLet_ si le a b
SVar (_, n) i -> SVar (si, n) i
SGlobal (_, n) -> SGlobal (si, n)
SLit _ l -> SLit si l
STyped v -> elimVoid v
-------------------------------------------------------------------------------- low-level toolbox
class Up a where
up_ :: Int -> Int -> a -> a
up_ n i = iterateN n $ up1_ i
up1_ :: Int -> a -> a
up1_ = up_ 1
foldVar :: Monoid e => (Int{-level-} -> Int{-index-} -> e) -> Int -> a -> e
usedVar :: Int -> a -> Bool
usedVar = (getAny .) . foldVar ((Any .) . (==))
closedExp :: a -> a
closedExp a = a
instance (Up a, Up b) => Up (a, b) where
up_ n i (a, b) = (up_ n i a, up_ n i b)
usedVar i (a, b) = usedVar i a || usedVar i b
foldVar f i (a, b) = foldVar f i a <> foldVar f i b
closedExp (a, b) = (closedExp a, closedExp b)
instance Up a => Up [a] where
up_ i k = map (up_ i k)
up n = up_ n 0
up1 = up1_ 0
foldS
:: Monoid m
=> (Int -> t -> m)
-> (SIName -> Int -> m)
-> (SIName -> Int -> Int -> m)
-> Int
-> SExp' t
-> m
foldS h g f = fs
where
fs i = \case
SApp _ a b -> fs i a <> fs i b
SLet _ a b -> fs i a <> fs (i+1) b
SBind_ _ _ _ a b -> fs i a <> fs (i+1) b
SVar sn j -> f sn j i
SGlobal sn -> g sn i
x@SLit{} -> mempty
STyped x -> h i x
foldName f = foldS (\_ -> elimVoid) (\sn _ -> f sn) mempty 0
usedS :: SIName -> SExp -> Bool
usedS n = getAny . foldName (Any . (== n))
mapS
:: (Int -> a -> SExp' a)
-> (SIName -> Int -> SExp' a)
-> (SIName -> Int -> Int{-level-} -> SExp' a)
-> Int
-> SExp' a
-> SExp' a
mapS hh gg f2 = g where
g i = \case
SApp_ si v a b -> SApp_ si v (g i a) (g i b)
SLet_ si x a b -> SLet_ si x (g i a) (g (i+1) b)
SBind_ si k si' a b -> SBind_ si k si' (g i a) (g (i+1) b)
SVar sn j -> f2 sn j i
SGlobal sn -> gg sn i
STyped x -> hh i x
x@SLit{} -> x
instance Up Void where
up_ _ _ = elimVoid
foldVar _ _ = elimVoid
instance Up a => Up (SExp' a) where
up_ n = mapS (\i x -> STyped $ up_ n i x) (const . SGlobal) (\sn j i -> SVar sn $ if j < i then j else j+n)
foldVar f = foldS (foldVar f) mempty $ \sn j i -> f j i
-- rearrange free variables
-- up_ n k == rearrange k (+n)
class Rearrange a where
rearrange :: Int -> (Int -> Int) -> a -> a
rSubst :: Rearrange a => Int -> Int -> a -> a
rSubst i j = rearrange 0 $ \k -> if k == i then j else if k > i then k - 1 else k
rUp :: Rearrange a => Int -> Int -> a -> a
rUp n l = rearrange l $ \k -> if k >= 0 then k + n else k
instance Rearrange a => Rearrange [a] where
rearrange l f = map $ rearrange l f
instance (Rearrange a, Rearrange b) => Rearrange (Either a b) where
rearrange l f = rearrange l f +++ rearrange l f
instance (Rearrange a, Rearrange b) => Rearrange (a, b) where
rearrange l f = rearrange l f *** rearrange l f
instance Rearrange SExp where
rearrange i f = mapS (\_ -> elimVoid) (const . SGlobal) (\sn j i -> SVar sn $ if j < i then j else i + f (j - i)) i
-- replace names with de bruijn indices
class DeBruijnify a where
deBruijnify_ :: Int -> [SIName] -> a -> a
deBruijnify = deBruijnify_ 0
instance (DeBruijnify a, DeBruijnify b) => DeBruijnify (a, b) where
deBruijnify_ k ns = deBruijnify_ k ns *** deBruijnify_ k ns
instance (DeBruijnify a, DeBruijnify b) => DeBruijnify (Either a b) where
deBruijnify_ k ns = deBruijnify_ k ns +++ deBruijnify_ k ns
instance (DeBruijnify a) => DeBruijnify [a] where
deBruijnify_ k ns = fmap (deBruijnify_ k ns)
instance DeBruijnify SExp where
deBruijnify_ j xs
= mapS (\_ -> elimVoid) (\sn x -> maybe (SGlobal sn) (\i -> SVar sn $ i + x) $ elemIndex sn xs)
(\sn j k -> SVar sn $ if j >= k then j + l else j) j
where
l = length xs
trSExp :: (a -> b) -> SExp' a -> SExp' b
trSExp f = g where
g = \case
SApp_ si v a b -> SApp_ si v (g a) (g b)
SLet_ si x a b -> SLet_ si x (g a) (g b)
SBind_ si k si' a b -> SBind_ si k si' (g a) (g b)
SVar sn j -> SVar sn j
SGlobal sn -> SGlobal sn
SLit si l -> SLit si l
STyped a -> STyped $ f a
trSExp' :: SExp -> SExp' a
trSExp' = trSExp elimVoid
-------------------------------------------------------------------------------- parser type
type BodyParser = Parse DesugarInfo PostponedCheck
type PostponedCheck = Maybe LCParseError
data LCParseError
= MultiplePatternVars [[SIName]]
| OperatorMismatch (SIName, Fixity) (SIName, Fixity)
| ParseError ParseError
instance Show LCParseError where
show = \case
MultiplePatternVars xs -> "multiple pattern vars:\n" ++ unlines [n ++ " is defined at " ++ ppShow si | ns <- xs, (si, n) <- ns]
OperatorMismatch (op, f) (op', f') -> "Operator precedences don't match:\n" ++ show f ++ " at " ++ showSI (fst op) ++ "\n" ++ show f' ++ " at " ++ showSI (fst op')
ParseError p -> show p
type DesugarInfo = (FixityMap, ConsMap)
type ConsMap = Map.Map SName{-constructor name-}
(Either ((SName{-case eliminator name-}, Int{-num of indices-}), [(SName, Int)]{-constructors with arities-})
Int{-arity-})
getFixity :: DesugarInfo -> SName -> Fixity
getFixity (fm, _) n = fromMaybe (InfixL, 9) $ Map.lookup n fm
dsInfo :: BodyParser DesugarInfo
dsInfo = asks desugarInfo
-------------------------------------------------------------------------------- builtin precedences
data Prec
= PrecAtom -- ( _ ) ...
| PrecAtom'
| PrecProj -- _ ._ {left}
| PrecSwiz -- _%_ {left}
| PrecApp -- _ _ {left}
| PrecOp
| PrecArr -- _ -> _ {right}
| PrecEq -- _ ~ _
| PrecAnn -- _ :: _ {right}
| PrecLet -- _ := _
| PrecLam -- \ _ -> _ {right} {accum}
deriving (Eq, Ord)
-------------------------------------------------------------------------------- expression parsing
parseType mb = maybe id option mb (reservedOp "::" *> typeNS (parseTerm PrecLam))
typedIds mb = (,) <$> commaSep1 upperLower <*> parseType mb
hiddenTerm p q = (,) Hidden <$ reservedOp "@" <*> typeNS p <|> (,) Visible <$> q
telescope mb = fmap mkTelescope $ many $ hiddenTerm
(typedId <|> maybe empty (tvar . pure) mb)
(try "::" typedId <|> maybe ((,) (mempty, "") <$> typeNS (parseTerm PrecAtom)) (tvar . pure) mb)
where
tvar x = (,) <$> patVar <*> x
typedId = parens $ tvar $ parseType mb
mkTelescope = go []
where
go ns [] = (ns, [])
go ns ((v, (n, e)): ts) = second ((v, deBruijnify ns e):) $ go (n: ns) ts
parseTerm p = appRange $ flip setSI <$> (dsInfo >>= flip parseTerm_ p)
parseTerm_ :: DesugarInfo -> Prec -> BodyParser SExp
parseTerm_ ge = \case
PrecLam ->
do level PrecAnn $ \t -> mkPi <$> (Visible <$ reservedOp "->" <|> Hidden <$ reservedOp "=>") <*> pure t <*> parseTerm PrecLam
<|> mkIf <$ reserved "if" <*> parseTerm PrecLam <* reserved "then" <*> parseTerm PrecLam <* reserved "else" <*> parseTerm PrecLam
<|> do reserved "forall"
(fe, ts) <- telescope $ Just $ Wildcard SType
f <- SPi . const Hidden <$ reservedOp "." <|> SPi . const Visible <$ reservedOp "->"
t' <- deBruijnify fe <$> parseTerm PrecLam
return $ foldr (uncurry f) t' ts
<|> do expNS $ do
(fe, ts) <- reservedOp "\\" *> telescopePat <* reservedOp "->"
t' <- deBruijnify fe <$> parseTerm PrecLam
return $ foldr (uncurry (patLam id ge)) t' ts
<|> compileCase ge <$ reserved "case" <*> parseTerm PrecLam <* reserved "of" <*> do
identation False $ do
(fe, p) <- longPattern
(,) p . deBruijnify fe <$> parseRHS "->"
PrecAnn -> level PrecOp $ \t -> SAnn t <$> parseType Nothing
PrecOp -> (notOp False <|> notExp) >>= calculatePrecs ge where
notExp = (++) <$> ope <*> notOp True
notOp x = (++) <$> try "expression" ((++) <$> ex PrecApp <*> option [] ope) <*> notOp True
<|> if x then option [] (try "lambda" $ ex PrecLam) else mzero
ope = pure . Left <$> (rhsOperator <|> appRange (flip (,) "'EqCTt" <$ reservedOp "~"))
ex pr = pure . Right <$> parseTerm pr
PrecApp ->
AppsS <$> try "record" (SGlobal <$> upperCase <* symbol "{")
<*> commaSep ((,) Visible <$ lowerCase{-TODO-} <* reservedOp "=" <*> parseTerm PrecLam)
<* symbol "}"
<|> AppsS <$> parseTerm PrecSwiz <*> many (hiddenTerm (parseTerm PrecSwiz) $ parseTerm PrecSwiz)
PrecSwiz -> level PrecProj $ \t ->
mkSwizzling t <$> lexeme (try "swizzling" $ char '%' *> manyNM 1 4 (satisfy (`elem` ("xyzwrgba" :: String))))
PrecProj -> level PrecAtom $ \t ->
try "projection" $ mkProjection t <$ char '.' <*> sepBy1 lowerCase (char '.')
PrecAtom ->
mkLit <$> try "literal" parseLit
<|> Wildcard (Wildcard SType) <$ reserved "_"
<|> mkLets ge <$ reserved "let" <*> parseDefs <* reserved "in" <*> parseTerm PrecLam
<|> SGlobal <$> lowerCase
<|> SGlobal <$> upperCase_
<|> braces (mkRecord <$> commaSep ((,) <$> lowerCase <* symbol ":" <*> parseTerm PrecLam))
<|> char '\'' *> ppa switchNamespace
<|> ppa id
where
level pr f = parseTerm_ ge pr >>= \t -> option t $ f t
ppa tick =
brackets ( (parseTerm PrecLam >>= \e ->
mkDotDot e <$ reservedOp ".." <*> parseTerm PrecLam
<|> foldr ($) (BCons e BNil) <$ reservedOp "|" <*> commaSep (generator <|> letdecl <|> boolExpression)
<|> mkList . tick <$> asks namespace <*> ((e:) <$> option [] (symbol "," *> commaSep1 (parseTerm PrecLam)))
) <|> mkList . tick <$> asks namespace <*> pure [])
<|> parens (SGlobal <$> try "opname" (symbols <* lookAhead (symbol ")")) <|> mkTuple . tick <$> asks namespace <*> commaSep (parseTerm PrecLam))
mkSwizzling term = swizzcall . map (sc . synonym)
where
swizzcall [] = error "impossible: swizzling parsing returned empty pattern"
swizzcall [x] = SBuiltin "swizzscalar" `SAppV` term `SAppV` x
swizzcall xs = SBuiltin "swizzvector" `SAppV` term `SAppV` foldl SAppV (SBuiltin $ "V" ++ show (length xs)) xs
sc c = SBuiltin ['S', c]
synonym 'r' = 'x'
synonym 'g' = 'y'
synonym 'b' = 'z'
synonym 'a' = 'w'
synonym c = c
mkProjection = foldl $ \exp field -> SBuiltin "project" `SAppV` litString field `SAppV` exp
-- Creates: RecordCons @[("x", _), ("y", _), ("z", _)] (1.0, 2.0, 3.0)))
mkRecord (unzip -> (names, values))
= SBuiltin "RecordCons" `SAppH` foldr BCons BNil (mkRecItem <$> names) `SAppV` foldr HCons HNil values
mkRecItem l = SBuiltin "RecItem" `SAppV` litString l `SAppV` Wildcard SType
litString = uncurry SLit . second LString
mkTuple _ [Section e] = e
mkTuple ExpNS [Parens e] = HCons e HNil
mkTuple TypeNS [Parens e] = HList $ BCons e BNil
mkTuple _ [x] = Parens x
mkTuple ExpNS xs = foldr HCons HNil xs
mkTuple TypeNS xs = HList $ foldr BCons BNil xs
mkList TypeNS [x] = BList x
mkList _ xs = foldr BCons BNil xs
mkLit n@LInt{} = SBuiltin "fromInt" `SAppV` sLit n
mkLit l = sLit l
mkIf b t f = SBuiltin "primIfThenElse" `SAppV` b `SAppV` t `SAppV` f
mkDotDot e f = SBuiltin "fromTo" `SAppV` e `SAppV` f
calculatePrecs :: DesugarInfo -> [Either SIName SExp] -> BodyParser SExp
calculatePrecs dcls = go where
go (Right e: xs) = waitOp False e [] xs
go xs@(Left (_, "-"): _) = waitOp False (mkLit $ LInt 0) [] xs
go (Left op: xs) = Section . SLamV <$> waitExp True (sVar "leftSection" 0) [] op xs
go _ = error "impossible"
waitExp lsec e acc op (Right t: xs) = waitOp lsec e ((op, if lsec then up 1 t else t): acc) xs
waitExp lsec e acc op [] | lsec = fail "two-sided section is not allowed"
| otherwise = fmap (Section . SLamV) . calcPrec' e $ (op, sVar "rightSection" 0): map (second (up 1)) acc
waitExp _ _ _ _ _ = fail "two operator is not allowed next to each-other"
waitOp lsec e acc (Left op: xs) = waitExp lsec e acc op xs
waitOp lsec e acc [] = calcPrec' e acc
waitOp lsec e acc _ = error "impossible"
calcPrec' e = postponedCheck dcls . calcPrec (\op x y -> SGlobal op `SAppV` x `SAppV` y) (getFixity dcls . snd) e . reverse
generator, letdecl, boolExpression :: BodyParser (SExp -> SExp)
generator = do
(dbs, pat) <- try "generator" $ longPattern <* reservedOp "<-"
checkPattern dbs
exp <- parseTerm PrecLam
return $ \e ->
SBuiltin "concatMap"
`SAppV` SLamV (compileGuardTree id id ge $ compilePatts [pat] (Right $ deBruijnify dbs e) `mappend` In (GuardLeaf BNil))
`SAppV` exp
letdecl = mkLets ge <$ reserved "let" <*> (compileFunAlts' =<< valueDef)
boolExpression = (\pred e -> SBuiltin "primIfThenElse" `SAppV` pred `SAppV` e `SAppV` BNil) <$> parseTerm PrecLam
mkPi Hidden xs b = foldr (sNonDepPi Hidden) b $ getTTuple xs
mkPi h a b = sNonDepPi h a b
sNonDepPi h a b = SPi h a $ up1 b
-- builtin heterogenous list
pattern HList a = SBuiltin "'HList" `SAppV` a
pattern HCons a b = SBuiltin "HCons" `SAppV` a `SAppV` b
pattern HNil = SBuiltin "HNil"
-- builtin list
pattern BList a = SBuiltin "'List" `SAppV` a
pattern BCons a b = SBuiltin "Cons" `SAppV` a `SAppV` b
pattern BNil = SBuiltin "Nil"
getTTuple (HList (getList -> Just xs)) = xs
getTTuple x = [x]
getList BNil = Just []
getList (BCons x (getList -> Just y)) = Just (x:y)
getList _ = Nothing
patLam :: (SExp -> SExp) -> DesugarInfo -> (Visibility, SExp) -> Pat -> SExp -> SExp
patLam f ge (v, t) p e = SLam v t $ compileGuardTree f f ge $ compilePatts [p] $ Right e
-------------------------------------------------------------------------------- pattern representation
data Pat
= PVar SIName -- Int
| PCon_ SI SIName [ParPat]
| ViewPat_ SI SExp ParPat
| PatType_ SI ParPat SExp
deriving Show
-- parallel patterns like v@(f -> [])@(Just x)
newtype ParPat = ParPat [Pat]
deriving Show
pattern PWildcard = ParPat []
pattern PCon n pp <- PCon_ _ n pp
where PCon n pp = PCon_ (fst n <> sourceInfo pp) n pp
pattern ViewPat e pp <- ViewPat_ _ e pp
where ViewPat e pp = ViewPat_ (sourceInfo e <> sourceInfo pp) e pp
pattern PatType pp e <- PatType_ _ pp e
where PatType pp e = PatType_ (sourceInfo e <> sourceInfo pp) pp e
pattern SimpPats ps <- (traverse simpleParPat -> Just ps)
where SimpPats ps = ParPat . (:[]) <$> ps
simpleParPat (ParPat [p]) = Just p
simpleParPat _ = Nothing
pattern PConSimp n ps = PCon n (SimpPats ps)
pattern ViewPatSimp e p = ViewPat e (ParPat [p])
pattern PatTypeSimp p t = PatType (ParPat [p]) t
pattern PBuiltin n ps <- PConSimp (_, n) ps
where PBuiltin n ps = PConSimp (debugSI $ "pattern_" ++ n, n) ps
pattern PParens p = ViewPatSimp (SBuiltin "parens") p
mapP :: (Int -> SExp -> SExp) -> Int -> Pat -> Pat
mapP f i = \case
PVar n -> PVar n
PCon_ si n ps -> PCon_ si n (upPats (mapPP f) i ps)
ViewPat_ si e p -> ViewPat_ si (f i e) (mapPP f i p)
PatType_ si p t -> PatType_ si (mapPP f i p) (f i t)
mapPP f i = \case
ParPat ps -> ParPat $ upPats (mapP f) i ps
upPats g k [] = []
upPats g k (p: ps) = g k p: upPats g (k + patVars p) ps
instance Rearrange Pat where
rearrange k f = mapP (`rearrange` f) k
instance Rearrange ParPat where
rearrange k f = mapPP (`rearrange` f) k
getPVars = \case
PVar n -> [n]
PCon _ pp -> foldMap getPPVars pp
ViewPat e pp -> getPPVars pp
PatType pp e -> getPPVars pp
getPPVars = \case
ParPat pp -> foldMap getPVars pp
-- number of pattern variables
class PatVars a where patVars :: a -> Int
instance PatVars Pat where patVars = length . getPVars
instance PatVars ParPat where patVars = length . getPPVars
instance PatVars a => PatVars [a] where patVars = sum . map patVars
instance SourceInfo ParPat where
sourceInfo (ParPat ps) = sourceInfo ps
instance SourceInfo Pat where
sourceInfo = \case
PVar (si,_) -> si
PCon_ si _ _ -> si
ViewPat_ si _ _ -> si
PatType_ si _ _ -> si
instance SetSourceInfo Pat where
setSI si = \case
PVar (_, n) -> PVar (si, n)
PCon_ _ a b -> PCon_ si a b
ViewPat_ _ a b -> ViewPat_ si a b
PatType_ _ a b -> PatType_ si a b
-------------------------------------------------------------------------------- pattern parsing
parsePat p = appRange $ flip setSI <$> parsePat_ p
parsePat_ :: Prec -> BodyParser Pat -- TODO: ParPat
parsePat_ = \case
PrecAnn ->
patType <$> parsePat PrecOp <*> parseType (Just $ Wildcard SType)
PrecOp ->
join $ calculatePatPrecs <$> dsInfo <*> p_
where
p_ = (,) <$> parsePat PrecApp <*> option [] (colonSymbols >>= p)
p op = do (exp, op') <- try "pattern" ((,) <$> parsePat PrecApp <*> colonSymbols)
((op, exp):) <$> p op'
<|> pure . (,) op <$> parsePat PrecAnn
PrecApp ->
PConSimp <$> upperCase_ <*> many (parsePat PrecAtom)
<|> parsePat_ PrecAtom
PrecAtom ->
mkLit <$> asks namespace <*> try "literal" parseLit
<|> flip PCon [] <$> upperCase_
<|> PVar <$> patVar -- TODO: PWildcard
<|> char '\'' *> ppa switchNamespace
<|> ppa id
where
ppa tick =
brackets (mkListPat . tick <$> asks namespace <*> patlist)
<|> parens (mkTupPat . tick <$> asks namespace <*> patlist)
litP = flip ViewPatSimp (PBuiltin "True" []) . SAppV (SBuiltin "==")
mkLit TypeNS (LInt n) = unfoldNat (PBuiltin "Zero" []) (PBuiltin "Succ" . (:[])) n -- todo: elim this alternative
mkLit _ n@LInt{} = litP (SBuiltin "fromInt" `SAppV` sLit n)
mkLit _ n = litP (sLit n)
patlist = commaSep $ parsePat PrecAnn
mkListPat TypeNS [p] = PBuiltin "'List" [p]
mkListPat ns ps = foldr (\p ps -> PBuiltin "Cons" [p, ps]) (PBuiltin "Nil" []) ps
--mkTupPat :: [Pat] -> Pat
mkTupPat TypeNS [PParens x] = mkTTup [x]
mkTupPat ns [PParens x] = mkTup [x]
mkTupPat _ [x] = PParens x
mkTupPat TypeNS ps = mkTTup ps
mkTupPat ns ps = mkTup ps
mkTTup ps = PBuiltin "'HList" [mkListPat ExpNS ps]
mkTup ps = foldr (\a b -> PBuiltin "HCons" [a, b]) (PBuiltin "HNil" []) ps
patType p (Wildcard SType) = p
patType p t = PatTypeSimp p t
calculatePatPrecs dcls (e, xs) = postponedCheck dcls $ calcPrec (\op x y -> PConSimp op [x, y]) (getFixity dcls . snd) e xs
longPattern = parsePat PrecAnn <&> (reverse . getPVars &&& id)
telescopePat = do
(a, b) <- fmap (reverse . foldMap (getPVars . snd) &&& id) $ many $ uncurry f <$> hiddenTerm (parsePat PrecAtom) (parsePat PrecAtom)
checkPattern a
return (a, b)
where
f h (PParens p) = second PParens $ f h p
f h (PatTypeSimp p t) = ((h, t), p)
f h p = ((h, Wildcard SType), p)
checkPattern :: [SIName] -> BodyParser ()
checkPattern ns = lift $ tell $ pure $
case [ns' | ns' <- group . sort . filter (not . null . snd) $ ns
, not . null . tail $ ns'] of
[] -> Nothing
xs -> Just $ MultiplePatternVars xs
postponedCheck dcls x = do
lift $ tell [either (\(op, op') -> Just $ OperatorMismatch (op, getFixity dcls $ snd op) (op', getFixity dcls $ snd op')) (const Nothing) x]
return $ either (const $ error "impossible") id x
-------------------------------------------------------------------------------- pattern match compilation
data Lets a
= LLet SExp (Lets a)
| In a
deriving Show
lLet (SVar _ i) l = rSubst 0 i l
lLet e l = LLet e l
mapLets f h l = \case
In e -> In $ h l e
LLet e x -> LLet (f l e) $ mapLets f h (l+1) x
instance Rearrange a => Rearrange (Lets a) where
rearrange l f = mapLets (`rearrange` f) (`rearrange` f) l
-- TODO: support type signature?
data GuardTree
= GuardNode SExp SName{-TODO:SIName-} [SIName] GuardTrees GuardTrees
| GuardLeaf SExp
| GTError
deriving Show
type GuardTrees = Lets GuardTree
instance Monoid GuardTrees where
mempty = In GTError
LLet e x `mappend` y = LLet e (x `mappend` rUp 1 0 y)
In (GuardNode e n ps t ts) `mappend` y = In $ GuardNode e n ps t (ts `mappend` y)
In GTError `mappend` y = y
x `mappend` _ = x
mapGT :: (Int -> ParPat -> ParPat) -> (Int -> SExp -> SExp) -> Int -> GuardTree -> GuardTree
mapGT f h k = \case
GuardNode e c pps gt el -> GuardNode (h k e) c pps (mapGTs f h (k + length pps) gt) (mapGTs f h k el)
GuardLeaf e -> GuardLeaf $ h k e
GTError -> GTError
mapGTs f h = mapLets h (mapGT f h)
instance Rearrange GuardTree where
rearrange l f = mapGT (`rearrange` f) (`rearrange` f) l
guardNode :: Pat -> SExp -> GuardTrees -> GuardTrees
guardNode (PVar sn) e gt = lLet e gt
guardNode (PParens p) e gt = guardNode p e gt
guardNode (ViewPat f p) e gt = guardNode' p (f `SAppV` e) gt
guardNode (PCon sn ps) e gt = In $ GuardNode e (snd sn) ((\(v, _, _) -> v) <$> ws) gt' mempty
where
n = length ps
ws = [(ns, SVar ns (n-1-i+d), rUp n d p) | (i, p, d) <- zip3 [0..] ps $ sums $ map patVars ps, let ns = dummyName $ "gn" ++ show i]
gt' = foldr f (rUp n (patVars ps) gt) ws
f (v, e, p) gt = guardNode' p e gt
guardNode' (ParPat ps) e gt = case ps of
[] -> gt
[p] -> guardNode p e gt
-- TODO: ps
sums = scanl (+) 0
compilePatts :: [Pat] -> Either [(SExp, SExp)] SExp -> GuardTrees
compilePatts ps gu = foldr f gu' $ zip3 ps [0..] $ sums $ map patVars ps
where
n = length ps
f (p, i, d) g = guardNode (rUp n d p) (sVar "xcp" $ n-1-i + d) g
gu' = case rUp n (patVars ps) gu of
Right e -> In $ GuardLeaf e
Left gs -> mconcat [guardNode (PBuiltin "True" []) ge (In $ GuardLeaf e) | (ge, e) <- gs]
compileGuardTree :: (SExp -> SExp) -> (SExp -> SExp) -> DesugarInfo -> GuardTrees -> SExp
compileGuardTree ulend lend adts = guardTreeToCases
where
guardTreeToCases :: GuardTrees -> SExp
guardTreeToCases = \case
In GTError -> ulend $ SBuiltin "undefined"
In (GuardLeaf e) -> lend e
ts@(In (GuardNode f s _ _ _)) -> case Map.lookup s (snd adts) of
Nothing -> error $ "Constructor is not defined: " ++ s
Just (Left ((casename, inum), cns)) ->
foldl SAppV (SGlobal (debugSI "compileGuardTree2", casename) `SAppV` iterateN (1 + inum) SLamV (Wildcard (Wildcard SType)))
[ iterateN n SLamV $ guardTreeToCases $ filterGuardTree (up n f) cn 0 n $ rUp n 0 ts | (cn, n) <- cns ]
`SAppV` f
Just (Right n) -> SGlobal (debugSI "compileGuardTree3", MatchName s)
`SAppV` SLamV (Wildcard SType)
`SAppV` iterateN n SLamV (guardTreeToCases $ filterGuardTree (up n f) s 0 n $ rUp n 0 ts)
`SAppV` f
`SAppV` guardTreeToCases (filterGuardTree' f s ts)
filterGuardTree' :: SExp -> SName{-constr.-} -> GuardTrees -> GuardTrees
filterGuardTree' f s = \case
In (GuardNode f' s' ps gs (filterGuardTree' f s -> el))
| f /= f' || s /= s' -> In $ GuardNode f' s' ps (filterGuardTree' (up (length ps) f) s gs) el
| otherwise -> el
In x -> In x
filterGuardTree :: SExp -> SName{-constr.-} -> Int -> Int{-number of constr. params-} -> GuardTrees -> GuardTrees
filterGuardTree f s k ns = \case
In (GuardNode f' s' ps gs (filterGuardTree f s k ns -> el))
| f /= f' -> In $ GuardNode f' s' ps (filterGuardTree (up su f) s (su + k) ns gs) el
| s == s' -> filterGuardTree f s k ns $ foldr lLet gs (replicate su $ sVar "30" $ k+ns-1) <> el
| otherwise -> el
where
su = length ps
In x -> In x
compileGuardTrees ulend adts = compileGuardTree ulend SRHS adts . mconcat
compileGuardTrees' ge = foldr1 (SAppV2 $ SBuiltin "parEval" `SAppV` Wildcard SType) . map (compileGuardTrees id ge . (:[]))
compileCase ge x cs
= SLamV (compileGuardTree id id ge $ mconcat [compilePatts [p] e | (p, e) <- cs]) `SAppV` x
-------------------------------------------------------------------------------- declaration representation
data Stmt
= Let SIName (Maybe SExp) SExp
| Data SIName [(Visibility, SExp)]{-parameters-} SExp{-type-} Bool{-True:add foralls-} [(SIName, SExp)]{-constructor names and types-}
| PrecDef SIName Fixity
-- eliminated during parsing
| TypeFamily SIName [(Visibility, SExp)]{-parameters-} SExp{-type-}
| Class SIName [SExp]{-parameters-} [(SIName, SExp)]{-method names and types-}
| Instance SIName [Pat]{-parameter patterns-} [SExp]{-constraints-} [Stmt]{-method definitions-}
| TypeAnn SIName SExp -- intermediate
| FunAlt SIName [((Visibility, SExp), Pat)] (Either [(SExp, SExp)]{-guards-} SExp{-no guards-})
deriving (Show)
pattern Primitive n t <- Let n (Just t) (SBuiltin "undefined") where Primitive n t = Let n (Just t) $ SBuiltin "undefined"
instance PShow Stmt where
pShowPrec p = \case
Let (_, n) ty e -> text n </> "=" <+> maybe (pShow e) (\ty -> pShow e </> "::" <+> pShow ty) ty
Data (_, n) ps ty fa cs -> "data" <+> text n
PrecDef (_, n) i -> "precedence" <+> text n <+> text (show i)
instance DeBruijnify Stmt where
deBruijnify_ k v (FunAlt n ts gue) = FunAlt n (map (second $ mapP (`deBruijnify_` v) k) ts) $ deBruijnify_ k v gue
-------------------------------------------------------------------------------- declaration parsing
parseDef :: BodyParser [Stmt]
parseDef =
do reserved "data" *> do
x <- typeNS upperCase
(npsd, ts) <- telescope (Just SType)
t <- deBruijnify npsd <$> parseType (Just SType)
let mkConTy mk (nps', ts') =
( if mk then Just nps' else Nothing
, foldr (uncurry SPi) (foldl SAppV (SGlobal x) $ downToS "a1" (length ts') $ length ts) ts')
(af, cs) <- option (True, []) $
do fmap ((,) True) $ (reserved "where" >>) $ identation True $ second ((,) Nothing . deBruijnify npsd) <$> typedIds Nothing
<|> (,) False <$ reservedOp "=" <*>
sepBy1 ((,) <$> (pure <$> upperCase)
<*> do do braces $ mkConTy True . second (zipWith (\i (v, e) -> (v, deBruijnify_ i npsd e)) [0..])
<$> telescopeDataFields
<|> mkConTy False . second (zipWith (\i (v, e) -> (v, deBruijnify_ i npsd e)) [0..])
<$> telescope Nothing
)
(reservedOp "|")
mkData <$> dsInfo <*> pure x <*> pure ts <*> pure t <*> pure af <*> pure (concatMap (\(vs, t) -> (,) <$> vs <*> pure t) cs)
<|> do reserved "class" *> do
x <- typeNS upperCase
(nps, ts) <- telescope (Just SType)
cs <- option [] $ (reserved "where" >>) $ identation True $ typedIds Nothing
return $ pure $ Class x (map snd ts) (concatMap (\(vs, t) -> (,) <$> vs <*> pure (deBruijnify nps t)) cs)
<|> do reserved "instance" *> do
typeNS $ do
constraints <- option [] $ try "constraint" $ getTTuple <$> parseTerm PrecOp <* reservedOp "=>"
x <- upperCase
(nps, args) <- telescopePat
cs <- expNS $ option [] $ reserved "where" *> identation False (deBruijnify nps <$> funAltDef (Just lhsOperator) varId)
pure . Instance x ({-todo-}map snd args) (deBruijnify (nps <> [x]) <$> constraints) <$> compileFunAlts' cs
<|> do reserved "type" *> do
typeNS $ do
reserved "family" *> do
x <- upperCase
(nps, ts) <- telescope (Just SType)
t <- deBruijnify nps <$> parseType (Just SType)
option {-open type family-}[TypeFamily x ts t] $ do
cs <- (reserved "where" >>) $ identation True $ funAltDef Nothing $ mfilter (== x) upperCase
-- closed type family desugared here
compileFunAlts (compileGuardTrees id) [TypeAnn x $ UncurryS ts t] cs
<|> pure <$ reserved "instance" <*> funAltDef Nothing upperCase
<|> do x <- upperCase
(nps, ts) <- telescope $ Just (Wildcard SType)
rhs <- deBruijnify nps <$ reservedOp "=" <*> parseTerm PrecLam
compileFunAlts (compileGuardTrees id)
[{-TypeAnn x $ UncurryS ts $ SType-}{-todo-}]
[FunAlt x (zip ts $ map PVar $ reverse nps) $ Right rhs]
<|> do try "typed ident" $ (\(vs, t) -> TypeAnn <$> vs <*> pure t) <$> typedIds Nothing
<|> fmap . flip PrecDef <$> parseFixity <*> commaSep1 rhsOperator
<|> pure <$> funAltDef (Just lhsOperator) varId
<|> valueDef
where
telescopeDataFields :: BodyParser ([SIName], [(Visibility, SExp)])
telescopeDataFields = mkTelescope <$> commaSep ((,) Visible <$> ((,) <$> lowerCase <*> parseType Nothing))
mkData ge x ts t af cs = Data x ts t af (second snd <$> cs): concatMap mkProj (nub $ concat [fs | (_, (Just fs, _)) <- cs])
where
mkProj fn
= [ FunAlt fn [((Visible, Wildcard SType), PConSimp cn $ replicate (length fs) $ PVar (mempty, "generated_name1"))] $ Right $ sVar "proj" i
| (cn, (Just fs, _)) <- cs, (i, fn') <- zip [0..] fs, fn' == fn
]
parseRHS tok = do
fmap Left . some $ (,) <$ reservedOp "|" <*> parseTerm PrecOp <* reservedOp tok <*> parseTerm PrecLam
<|> do
reservedOp tok
rhs <- parseTerm PrecLam
f <- option id $ mkLets <$ reserved "where" <*> dsInfo <*> parseDefs
return $ Right $ f rhs
parseDefs = identation True parseDef >>= compileFunAlts' . concat
funAltDef parseOpName parseName = do
(n, (fee, tss)) <-
case parseOpName of
Nothing -> mzero
Just opName -> try "operator definition" $ do
(e', a1) <- longPattern
n <- opName
(e'', a2) <- longPattern
lookAhead $ reservedOp "=" <|> reservedOp "|"
let fee = e'' <> e'
checkPattern fee
return (n, (fee, (,) (Visible, Wildcard SType) <$> [a1, mapP (`deBruijnify_` e') 0 a2]))
<|> do try "lhs" $ (,) <$> parseName <*> telescopePat <* lookAhead (reservedOp "=" <|> reservedOp "|")
FunAlt n tss . deBruijnify fee <$> parseRHS "="
valueDef :: BodyParser [Stmt]
valueDef = do
(dns, p) <- try "pattern" $ longPattern <* reservedOp "="
checkPattern dns
e <- parseTerm PrecLam
ds <- dsInfo
return $ desugarValueDef ds p e
desugarValueDef ds p e
= FunAlt n [] (Right e)
: [ FunAlt x [] $ Right $ compileCase ds (SGlobal n) [(p, Right $ SVar x i)]
| (i, x) <- zip [0..] dns
]
where
dns = reverse $ getPVars p
n = mangleNames dns
mangleNames xs = (foldMap fst xs, "_" ++ intercalate "_" (map snd xs))
mkLets :: DesugarInfo -> [Stmt]{-where block-} -> SExp{-main expression-} -> SExp{-big let with lambdas; replaces global names with de bruijn indices-}
mkLets ds = mkLets' . sortDefs ds where
mkLets' [] e = e
mkLets' (Let n mt x: ds) e
= SLet n (maybe id (flip SAnn . addForalls {-todo-}[] []) mt x') (deBruijnify [n] $ mkLets' ds e)
where
x' = if usedS n x then SBuiltin "primFix" `SAppV` SLamV (deBruijnify [n] x) else x
mkLets' (x: ds) e = error $ "mkLets: " ++ show x
addForalls :: Extensions -> [SName] -> SExp -> SExp
addForalls exs defined x = foldl f x [v | v@(_, vh:_) <- reverse $ names x, snd v `notElem'` ("fromInt"{-todo: remove-}: defined), isLower vh]
where
f e v = SPi Hidden (Wildcard SType) $ deBruijnify [v] e
notElem' s@('\'':s') m = notElem s m && notElem s' m
notElem' s m = s `notElem` m
names :: SExp -> [SIName]
names = nub . foldName pure
{-
defined defs = ("'Type":) $ flip foldMap defs $ \case
TypeAnn (_, x) _ -> [x]
Let (_, x) _ _ _ _ -> [x]
Data (_, x) _ _ _ cs -> x: map (snd . fst) cs
Class (_, x) _ cs -> x: map (snd . fst) cs
TypeFamily (_, x) _ _ -> [x]
x -> error $ unwords ["defined: Impossible", show x, "cann't be here"]
-}
-------------------------------------------------------------------------------- declaration desugaring
data StmtNode = StmtNode
{ snId :: !Int
, snValue :: Stmt
, snChildren :: [StmtNode]
, snRevChildren :: [StmtNode]
}
sortDefs :: DesugarInfo -> [Stmt] -> [Stmt]
sortDefs ds xs = concatMap (desugarMutual ds . map snValue) $ scc snId snChildren snRevChildren nodes
where
nodes = zipWith mkNode [0..] xs
where
mkNode i s = StmtNode i s (nubBy ((==) `on` snId) $ catMaybes $ (`Map.lookup` defMap) <$> need)
(fromMaybe [] $ IM.lookup i revMap)
where
need = Set.toList $ case s of
PrecDef{} -> mempty
Let _ mt e -> foldMap names mt <> names e
Data _ ps t _ cs -> foldMap (names . snd) ps <> names t <> foldMap (names . snd) cs
names = foldName Set.singleton
revMap = IM.unionsWith (++) [IM.singleton (snId c) [n] | n <- nodes, c <- snChildren n]
defMap = Map.fromList [(s, n) | n <- nodes, s <- def $ snValue n]
where
def = \case
PrecDef{} -> mempty
Let n _ _ -> [n]
Data n _ _ _ cs -> n: map fst cs
desugarMutual _ [x] = [x]
desugarMutual ds xs = xs
{-
= FunAlt n [] (Right e)
: [ FunAlt x [] $ Right $ compileCase ds (SGlobal n) [(p, Right $ SVar x i)]
| (i, x) <- zip [0..] dns
]
where
dns = reverse $ getPVars p
n = mangleNames dns
(ps, es) = unzip [(n, e) | Let n ~Nothing ~Nothing [] e <- xs]
tup = "Tuple" ++ show (length xs)
e = deBruijnify ps $ foldl SAppV (SBuiltin tup) es
p = PCon (mempty, tup) $ map (ParPat . pure . PVar) ps
-}
------------------------------------------------------------------------ strongly connected component calculation
type Children k = k -> [k]
data Task a = Return a | Visit a
scc :: forall k . (k -> Int) -> Children k -> Children k -> [k]{-roots-} -> [[k]]
scc key children revChildren
= filter (not . null) . uncurry (revMapWalk revChildren) . revPostOrderWalk children
where
revPostOrderWalk :: Children k -> [k] -> (IS.IntSet, [k])
revPostOrderWalk children = collect IS.empty [] . map Visit where
collect s acc [] = (s, acc)
collect s acc (Return h: t) = collect s (h: acc) t
collect s acc (Visit h: t)
| key h `IS.member` s = collect s acc t
| otherwise = collect (IS.insert (key h) s) acc $ map Visit (children h) ++ Return h: t
revMapWalk :: Children k -> IS.IntSet -> [k] -> [[k]]
revMapWalk children = f []
where
f acc s [] = acc
f acc s (h:t) = f (c: acc) s' t
where (s', c) = collect s [] [h]
collect s acc [] = (s, acc)
collect s acc (h:t)
| not (key h `IS.member` s) = collect s acc t
| otherwise = collect (IS.delete (key h) s) (h: acc) (children h ++ t)
------------------------------------------------------------------------
compileFunAlts' ds = fmap concat . sequence $ map (compileFunAlts (compileGuardTrees SRHS) ds) $ groupBy h ds where
h (FunAlt n _ _) (FunAlt m _ _) = m == n
h _ _ = False
--compileFunAlts :: forall m . Monad m => Bool -> (SExp -> SExp) -> (SExp -> SExp) -> DesugarInfo -> [Stmt] -> [Stmt] -> m [Stmt]
compileFunAlts (compilegt :: DesugarInfo -> [GuardTrees] -> SExp) ds xs = dsInfo >>= \ge -> case xs of
[Instance{}] -> return []
[Class n ps ms] -> do
cd <- compileFunAlts' $
[ TypeAnn n $ foldr (SPi Visible) SType ps ]
++ [ FunAlt n (map noTA ps) $ Right $ foldr (SAppV2 $ SBuiltin "'T2") (SBuiltin "'Unit") cstrs | Instance n' ps cstrs _ <- ds, n == n' ]
++ [ FunAlt n (replicate (length ps) (noTA $ PVar (debugSI "compileFunAlts1", "generated_name0"))) $ Right $ SBuiltin "'Empty" `SAppV` sLit (LString $ "no instance of " ++ snd n ++ " on ???")]
cds <- sequence
[ compileFunAlts'
$ TypeAnn m (UncurryS (map ((,) Hidden) ps) $ SPi Hidden (foldl SAppV (SGlobal n) $ downToS "a2" 0 $ length ps) $ up1 t)
: as
| (m, t) <- ms
-- , let ts = fst $ getParamsS $ up1 t
, let as = [ FunAlt m p $ Right {- -$ SLam Hidden (Wildcard SType) $ up1 -} $ SLet m' e $ SVar mempty 0
| Instance n' i cstrs alts <- ds, n' == n
, Let m' ~Nothing e <- alts, m' == m
, let p = zip ((,) Hidden <$> ps) i ++ [((Hidden, Wildcard SType), PVar (mempty, ""))]
-- , let ic = patVars i
]
]
return $ cd ++ concat cds
[TypeAnn n t] -> return [Primitive n t | snd n `notElem` [n' | FunAlt (_, n') _ _ <- ds]]
tf@[TypeFamily n ps t] -> case [d | d@(FunAlt n' _ _) <- ds, n' == n] of
[] -> return [Primitive n $ UncurryS ps t]
alts -> compileFunAlts compileGuardTrees' [TypeAnn n $ UncurryS ps t] alts
[p@PrecDef{}] -> return [p]
fs@(FunAlt n vs _: _) -> case map head $ group [length vs | FunAlt _ vs _ <- fs] of
[num]
| num == 0 && length fs > 1 -> fail $ "redefined " ++ snd n ++ " at " ++ ppShow (fst n)
| n `elem` [n' | TypeFamily n' _ _ <- ds] -> return []
| otherwise -> return
[ Let n
(listToMaybe [t | TypeAnn n' t <- ds, n' == n])
$ foldr (uncurry SLam . fst) (compilegt ge [compilePatts (map snd vs) gsx | FunAlt _ vs gsx <- fs]) vs
]
_ -> fail $ "different number of arguments of " ++ snd n ++ " at " ++ ppShow (fst n)
x -> return x
where
noTA x = ((Visible, Wildcard SType), x)
-------------------------------------------------------------------------------- desugar info
mkDesugarInfo :: [Stmt] -> DesugarInfo
mkDesugarInfo ss =
( Map.fromList $ ("'EqCTt", (Infix, -1)): [(s, f) | PrecDef (_, s) f <- ss]
, Map.fromList $
[hackHList (cn, Left ((caseName t, pars ty), (snd *** pars) <$> cs)) | Data (_, t) ps ty _ cs <- ss, ((_, cn), ct) <- cs]
++ [(t, Right $ pars $ UncurryS ps ty) | Data (_, t) ps ty _ _ <- ss]
-- ++ [(t, Right $ length xs) | Let (_, t) _ (Just ty) xs _ <- ss]
++ [("'Type", Right 0)]
)
where
pars (UncurryS l _) = length $ filter ((== Visible) . fst) l -- todo
hackHList ("HCons", _) = ("HCons", Left (("hlistConsCase", -1), [("HCons", 2)]))
hackHList ("HNil", _) = ("HNil", Left (("hlistNilCase", -1), [("HNil", 0)]))
hackHList x = x
-------------------------------------------------------------------------------- module exports
data Export = ExportModule SIName | ExportId SIName
parseExport :: HeaderParser Export
parseExport =
ExportModule <$ reserved "module" <*> moduleName
<|> ExportId <$> varId
-------------------------------------------------------------------------------- module imports
data ImportItems
= ImportAllBut [SIName]
| ImportJust [SIName]
importlist = parens $ commaSep upperLower
-------------------------------------------------------------------------------- language pragmas
type Extensions = [Extension]
data Extension
= NoImplicitPrelude
| TraceTypeCheck
deriving (Enum, Eq, Ord, Show)
extensionMap :: Map.Map String Extension
extensionMap = Map.fromList $ map (show &&& id) [toEnum 0 .. ]
parseExtensions :: HeaderParser [Extension]
parseExtensions
= try "pragma" (symbol "{-#") *> symbol "LANGUAGE" *> commaSep (lexeme ext) <* symbolWithoutSpace "#-}" <* simpleSpace
where
ext = do
s <- some $ satisfy isAlphaNum
maybe
(fail $ "language extension expected instead of " ++ s)
return
(Map.lookup s extensionMap)
-------------------------------------------------------------------------------- modules
data Module = Module
{ extensions :: Extensions
, moduleImports :: [(SIName, ImportItems)]
, moduleExports :: Maybe [Export]
, definitions :: DefParser
}
type DefParser = DesugarInfo -> (Either ParseError [Stmt], [PostponedCheck])
type HeaderParser = Parse () ()
parseModule :: HeaderParser Module
parseModule = do
exts <- concat <$> many parseExtensions
whiteSpace
header <- optional $ do
modn <- reserved "module" *> moduleName
exps <- optional (parens $ commaSep parseExport)
reserved "where"
return (modn, exps)
let mkIDef _ n i h _ = (n, f i h)
where
f Nothing Nothing = ImportAllBut []
f (Just h) Nothing = ImportAllBut h
f Nothing (Just i) = ImportJust i
idefs <- many $
mkIDef <$ reserved "import"
<*> optional (reserved "qualified")
<*> moduleName
<*> optional (reserved "hiding" *> importlist)
<*> optional importlist
<*> optional (reserved "as" *> moduleName)
(env, st) <- getParseState
return Module
{ extensions = exts
, moduleImports = [((mempty, "Prelude"), ImportAllBut []) | NoImplicitPrelude `notElem` exts] ++ idefs
, moduleExports = join $ snd <$> header
, definitions = \ge -> runParse (parseDefs <* eof) (env { desugarInfo = ge }, st)
}
parseLC :: Int -> FilePath -> String -> Either ParseError Module
parseLC fid f str
= fst $ runParse parseModule $ parseState (FileInfo fid f str) ()
--type DefParser = DesugarInfo -> (Either ParseError [Stmt], [PostponedCheck])
runDefParser :: (MonadFix m, MonadError LCParseError m) => DesugarInfo -> DefParser -> m ([Stmt], DesugarInfo)
runDefParser ds_ dp = do
(defs, dns, ds) <- mfix $ \ ~(_, _, ds) -> do
let (x, dns) = dp (ds <> ds_)
defs <- either (throwError . ParseError) return x
return (defs, dns, mkDesugarInfo defs)
mapM_ (maybe (return ()) throwError) dns
return (sortDefs ds defs, ds)
-------------------------------------------------------------------------------- pretty print
instance Up a => PShow (SExp' a) where
pShowPrec _ = showDoc_ . sExpDoc
type Doc = NameDB PrecString
-- name De Bruijn indices
type NameDB a = StateT [String] (Reader [String]) a
showDoc :: Doc -> String
showDoc = str . flip runReader [] . flip evalStateT (flip (:) <$> iterate ('\'':) "" <*> ['a'..'z'])
showDoc_ :: Doc -> BodyParser.Doc
showDoc_ = text . str . flip runReader [] . flip evalStateT (flip (:) <$> iterate ('\'':) "" <*> ['a'..'z'])
sExpDoc :: Up a => SExp' a -> Doc
sExpDoc = \case
SGlobal (_,s) -> pure $ shAtom s
SAnn a b -> shAnn ":" False <$> sExpDoc a <*> sExpDoc b
TyType a -> shApp Visible (shAtom "tyType") <$> sExpDoc a
SApp h a b -> shApp h <$> sExpDoc a <*> sExpDoc b
Wildcard t -> shAnn ":" True (shAtom "_") <$> sExpDoc t
SBind_ _ h _ a b -> join $ shLam (usedVar 0 b) h <$> sExpDoc a <*> pure (sExpDoc b)
SLet _ a b -> shLet_ (sExpDoc a) (sExpDoc b)
STyped _{-(e,t)-} -> pure $ shAtom "<<>>" -- todo: expDoc e
SVar _ i -> shAtom <$> shVar i
SLit _ l -> pure $ shAtom $ show l
shVar i = asks lookupVarName where
lookupVarName xs | i < length xs && i >= 0 = xs !! i
lookupVarName _ = "V" ++ show i
newName = gets head <* modify tail
shLet i a b = shAtom <$> shVar i >>= \i' -> local (dropNth i) $ shLam' <$> (cpar . shLet' (fmap inBlue i') <$> a) <*> b
shLet_ a b = newName >>= \i -> shLam' <$> (cpar . shLet' (shAtom i) <$> a) <*> local (i:) b
shLam usedVar h a b = newName >>= \i ->
let lam = case h of
BPi _ -> shArr
_ -> shLam'
p = case h of
BMeta -> cpar . shAnn ":" True (shAtom $ inBlue i)
BLam h -> vpar h
BPi h -> vpar h
vpar Hidden = brace . shAnn ":" True (shAtom $ inGreen i)
vpar Visible = ann (shAtom $ inGreen i)
ann | usedVar = shAnn ":" False
| otherwise = const id
in lam (p a) <$> local (i:) b
-----------------------------------------
data PS a = PS Prec a deriving (Functor)
type PrecString = PS String
getPrec (PS p _) = p
prec i s = PS i (s i)
str (PS _ s) = s
lpar, rpar :: PrecString -> Prec -> String
lpar (PS i s) j = par (i >. j) s where
PrecLam >. i = i > PrecAtom'
i >. PrecLam = i >= PrecArr
PrecApp >. PrecApp = False
i >. j = i >= j
rpar (PS i s) j = par (i >. j) s where
PrecLam >. PrecLam = False
PrecLam >. i = i > PrecAtom'
PrecArr >. PrecArr = False
PrecAnn >. PrecAnn = False
i >. j = i >= j
par True s = "(" ++ s ++ ")"
par False s = s
isAtom = (==PrecAtom) . getPrec
isAtom' = (<=PrecAtom') . getPrec
shAtom = PS PrecAtom
shAtom' = PS PrecAtom'
shTuple xs = prec PrecAtom $ \_ -> case xs of
[x] -> "((" ++ str x ++ "))"
xs -> "(" ++ intercalate ", " (map str xs) ++ ")"
shAnn _ True x y | str y `elem` ["Type", inGreen "Type"] = x
shAnn s simp x y | isAtom x && isAtom y = shAtom' $ str x <> s <> str y
shAnn s simp x y = prec PrecAnn $ lpar x <> " " <> const s <> " " <> rpar y
shApp Hidden x y = prec PrecApp $ lpar x <> " " <> const (str $ brace y)
shApp h x y = prec PrecApp $ lpar x <> " " <> rpar y
shArr x y | isAtom x && isAtom y = shAtom' $ str x <> "->" <> str y
shArr x y = prec PrecArr $ lpar x <> " -> " <> rpar y
shCstr x y | isAtom x && isAtom y = shAtom' $ str x <> "~" <> str y
shCstr x y = prec PrecEq $ lpar x <> " ~ " <> rpar y
shLet' x y | isAtom x && isAtom y = shAtom' $ str x <> ":=" <> str y
shLet' x y = prec PrecLet $ lpar x <> " := " <> rpar y
shLam' x y | PrecLam <- getPrec y = prec PrecLam $ "\\" <> lpar x <> " " <> pure (dropC $ str y)
where
dropC (ESC s (dropC -> x)) = ESC s x
dropC (x: xs) = xs
shLam' x y | isAtom x && isAtom y = shAtom' $ "\\" <> str x <> "->" <> str y
shLam' x y = prec PrecLam $ "\\" <> lpar x <> " -> " <> rpar y
brace s = shAtom $ "{" <> str s <> "}"
cpar s | isAtom' s = s -- TODO: replace with lpar, rpar
cpar s = shAtom $ par True $ str s
epar = fmap underlined
instance IsString (Prec -> String) where fromString = const
|