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
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
(* src/eval.ml *)
(* Tree-walking evaluator for the T language — Phase 1 Alpha *)
open Ast
(* --- Error Construction Helpers --- *)
(** Create a structured error value *)
let rec desugar_nse_expr (expr : Ast.expr) : Ast.expr =
let loc = expr.loc in
match expr.node with
| ColumnRef field ->
(* $field → row.field *)
Ast.mk_expr ?loc (DotAccess { target = Ast.mk_expr ?loc (Var "row"); field })
| BinOp { op; left; right } ->
(* Recursively transform both sides *)
Ast.mk_expr ?loc (BinOp { op; left = desugar_nse_expr left; right = desugar_nse_expr right })
| BroadcastOp { op; left; right } ->
Ast.mk_expr ?loc (BroadcastOp { op; left = desugar_nse_expr left; right = desugar_nse_expr right })
| UnOp { op; operand } ->
Ast.mk_expr ?loc (UnOp { op; operand = desugar_nse_expr operand })
| Call { fn; args } ->
Ast.mk_expr ?loc (Call { fn = desugar_nse_expr fn;
args = List.map (fun (n, e) -> (n, desugar_nse_expr e)) args })
| IfElse { cond; then_; else_ } ->
Ast.mk_expr ?loc (IfElse {
cond = desugar_nse_expr cond;
then_ = desugar_nse_expr then_;
else_ = desugar_nse_expr else_
})
| Match { scrutinee; cases } ->
Ast.mk_expr ?loc (Match {
scrutinee = desugar_nse_expr scrutinee;
cases = List.map (fun (pattern, body) -> (pattern, desugar_nse_expr body)) cases;
})
| ListLit items ->
Ast.mk_expr ?loc (ListLit (List.map (fun (n, e) -> (n, desugar_nse_expr e)) items))
| DictLit entries ->
Ast.mk_expr ?loc (DictLit (List.map (fun (k, v) -> (k, desugar_nse_expr v)) entries))
| DotAccess { target; field } ->
Ast.mk_expr ?loc (DotAccess { target = desugar_nse_expr target; field })
| Block stmts ->
(* We need to desugar inside statements too *)
Ast.mk_expr ?loc (Block (List.map desugar_nse_stmt stmts))
| RawCode _ -> expr (* Foreign code, opaque *)
| Unquote e -> Ast.mk_expr ?loc (Unquote (desugar_nse_expr e))
| UnquoteSplice e -> Ast.mk_expr ?loc (UnquoteSplice (desugar_nse_expr e))
| _ -> expr
and desugar_nse_stmt stmt =
let loc = stmt.loc in
match stmt.node with
| Expression e -> Ast.mk_stmt ?loc (Expression (desugar_nse_expr e))
| Assignment { name; typ; expr } -> Ast.mk_stmt ?loc (Assignment { name; typ; expr = desugar_nse_expr expr })
| Reassignment { name; expr } -> Ast.mk_stmt ?loc (Reassignment { name; expr = desugar_nse_expr expr })
| Import _ | ImportPackage _ | ImportFrom _ | ImportFileFrom _ -> stmt
let rec expr_uses_named_scope_fields fields (expr : Ast.expr) : bool =
let uses_var name = List.mem name fields in
match expr.node with
| Var name -> uses_var name
| ColumnRef _ -> false
| BinOp { left; right; _ } | BroadcastOp { left; right; _ } ->
expr_uses_named_scope_fields fields left || expr_uses_named_scope_fields fields right
| UnOp { operand; _ } -> expr_uses_named_scope_fields fields operand
| Call { fn; args } ->
expr_uses_named_scope_fields fields fn
|| List.exists (fun (_, arg) -> expr_uses_named_scope_fields fields arg) args
| IfElse { cond; then_; else_ } ->
expr_uses_named_scope_fields fields cond
|| expr_uses_named_scope_fields fields then_
|| expr_uses_named_scope_fields fields else_
| Match { scrutinee; cases } ->
expr_uses_named_scope_fields fields scrutinee
|| List.exists (fun (_, body) -> expr_uses_named_scope_fields fields body) cases
| ListLit items ->
List.exists (fun (_, item) -> expr_uses_named_scope_fields fields item) items
| DictLit pairs ->
List.exists (fun (_, value) -> expr_uses_named_scope_fields fields value) pairs
| DotAccess { target; _ } -> expr_uses_named_scope_fields fields target
| Block stmts ->
List.exists (fun stmt ->
match stmt.node with
| Expression e -> expr_uses_named_scope_fields fields e
| Assignment { expr; _ } | Reassignment { expr; _ } ->
expr_uses_named_scope_fields fields expr
| Import _ | ImportPackage _ | ImportFrom _ | ImportFileFrom _ -> false
) stmts
| Lambda _ | Value _ | RawCode _ | ShellExpr _ -> false
| Unquote e | UnquoteSplice e -> expr_uses_named_scope_fields fields e
| PipelineDef _ | IntentDef _ | ListComp _ -> false
(** Rewrite bare field names from a scoped predicate to [root.field], while
leaving all other variables unchanged.
[root] is the record variable to target (for example ["node"]) and
[fields] lists the bare names that should be rewritten. For example,
with [root = "node"] and [fields = ["name"; "diagnostics"]],
[name == "x"] becomes [node.name == "x"]. *)
let rec desugar_named_scope_expr ~root ~fields (expr : Ast.expr) : Ast.expr =
let loc = expr.loc in
let wrap_field name =
Ast.mk_expr ?loc (DotAccess { target = Ast.mk_expr ?loc (Var root); field = name })
in
match expr.node with
| Var name when List.mem name fields -> wrap_field name
| Var _ -> expr (* Non-scoped variable or other identifier — preserve unchanged (exhaustive fallback) *)
| BinOp { op; left; right } ->
Ast.mk_expr ?loc
(BinOp {
op;
left = desugar_named_scope_expr ~root ~fields left;
right = desugar_named_scope_expr ~root ~fields right;
})
| BroadcastOp { op; left; right } ->
Ast.mk_expr ?loc
(BroadcastOp {
op;
left = desugar_named_scope_expr ~root ~fields left;
right = desugar_named_scope_expr ~root ~fields right;
})
| UnOp { op; operand } ->
Ast.mk_expr ?loc
(UnOp { op; operand = desugar_named_scope_expr ~root ~fields operand })
| Call { fn; args } ->
Ast.mk_expr ?loc
(Call {
fn = desugar_named_scope_expr ~root ~fields fn;
args =
List.map
(fun (name, arg) -> (name, desugar_named_scope_expr ~root ~fields arg))
args;
})
| IfElse { cond; then_; else_ } ->
Ast.mk_expr ?loc
(IfElse {
cond = desugar_named_scope_expr ~root ~fields cond;
then_ = desugar_named_scope_expr ~root ~fields then_;
else_ = desugar_named_scope_expr ~root ~fields else_;
})
| Match { scrutinee; cases } ->
Ast.mk_expr ?loc
(Match {
scrutinee = desugar_named_scope_expr ~root ~fields scrutinee;
cases =
List.map
(fun (pattern, body) -> (pattern, desugar_named_scope_expr ~root ~fields body))
cases;
})
| ListLit items ->
Ast.mk_expr ?loc
(ListLit
(List.map
(fun (name, item) -> (name, desugar_named_scope_expr ~root ~fields item))
items))
| DictLit entries ->
Ast.mk_expr ?loc
(DictLit
(List.map
(fun (key, value) -> (key, desugar_named_scope_expr ~root ~fields value))
entries))
| DotAccess { target; field } ->
Ast.mk_expr ?loc
(DotAccess { target = desugar_named_scope_expr ~root ~fields target; field })
| Block stmts ->
Ast.mk_expr ?loc
(Block
(List.map
(fun stmt ->
let stmt_loc = stmt.loc in
match stmt.node with
| Expression e ->
Ast.mk_stmt ?loc:stmt_loc
(Expression (desugar_named_scope_expr ~root ~fields e))
| Assignment { name; typ; expr } ->
Ast.mk_stmt ?loc:stmt_loc
(Assignment {
name;
typ;
expr = desugar_named_scope_expr ~root ~fields expr;
})
| Reassignment { name; expr } ->
Ast.mk_stmt ?loc:stmt_loc
(Reassignment {
name;
expr = desugar_named_scope_expr ~root ~fields expr;
})
| Import _ | ImportPackage _ | ImportFrom _ | ImportFileFrom _ -> stmt)
stmts))
| Unquote e ->
Ast.mk_expr ?loc (Unquote (desugar_named_scope_expr ~root ~fields e))
| UnquoteSplice e ->
Ast.mk_expr ?loc (UnquoteSplice (desugar_named_scope_expr ~root ~fields e))
| Lambda _ | Value _ | RawCode _ | ShellExpr _ | ColumnRef _ | PipelineDef _ | IntentDef _ | ListComp _ ->
expr
(** Field names exposed on read-pipeline node records and available for
concise NSE predicate auto-wrapping in [which_nodes].
This is an alias to the canonical definition in {!Ast.Utils} to avoid
drift between the evaluator and the pipeline package. *)
let node_record_scope_fields = Ast.Utils.node_record_scope_fields
(** Global flag to control warning output (e.g., for tests) *)
let show_warnings = ref true
let current_node_warning_emitter : (Ast.node_warning -> unit) option ref = ref None
let current_node_suppression_requested = ref false
let request_warning_suppression () =
current_node_suppression_requested := true
let emit_node_warning warning =
match !current_node_warning_emitter with
| Some emit -> emit warning
| None -> ()
(** Temporarily capture structured node warnings emitted while evaluating [f].
Restores the previous emitter even if [f] raises. *)
let capture_node_warnings f =
let warnings = ref [] in
current_node_suppression_requested := false;
let previous = !current_node_warning_emitter in
current_node_warning_emitter :=
Some (fun warning -> warnings := warning :: !warnings);
Fun.protect
(fun () ->
let value = f () in
(value, List.rev !warnings))
~finally:(fun () -> current_node_warning_emitter := previous)
let source_location ?file pos : Ast.source_location =
{
file;
line = pos.Lexing.pos_lnum;
column = max 1 (pos.Lexing.pos_cnum - pos.Lexing.pos_bol + 1);
}
let attach_location location value =
match value, location with
| VError err, Some loc when err.location = None -> VError { err with location = Some loc }
| _ -> value
let attach_expr_location (expr : Ast.expr) value =
attach_location expr.loc value
let strip_dollar_prefix s =
if String.length s <= 1 then
s
else if s.[0] = '$' then
String.sub s 1 (String.length s - 1)
else
s
let take_prefix n xs =
List.filteri (fun i _ -> i < n) xs
let drop_prefix n xs =
List.filteri (fun i _ -> i >= n) xs
let attach_stmt_location (stmt : Ast.stmt) value =
attach_location stmt.loc value
let pipeline_error_message ~node_name ~detail =
let prefix = Printf.sprintf "Pipeline node `%s` failed" node_name in
if String.starts_with ~prefix detail then detail
else prefix ^ ": " ^ detail
let annotate_pipeline_error ?runtime node_name = function
| VError err ->
let context = match runtime with
| Some r -> if List.mem_assoc "runtime" err.context then err.context else ("runtime", VString r) :: err.context
| None -> err.context
in
VError { err with message = pipeline_error_message ~node_name ~detail:err.message; context }
| value -> value
(** Parse error text shaped like ["Function `name` ..."] and return the
extracted function name. Returns [fallback] when no such fragment exists. *)
let extract_function_name_from_error fallback message =
let prefix = "Function `" in
let prefix_len = String.length prefix in
let len = String.length message in
let rec find idx =
if idx + prefix_len > len then fallback
else if String.sub message idx prefix_len = prefix then
let start = idx + prefix_len in
match String.index_from_opt message start '`' with
| Some stop when stop > start -> String.sub message start (stop - start)
| _ -> fallback
else find (idx + 1)
in
find 0
(** Convert a node value into structured node-error metadata when it is a [VError]. *)
let node_error_of_value node_name = function
| VError err ->
Some {
Ast.ne_kind = Ast.Utils.error_code_to_string err.code;
ne_fn = extract_function_name_from_error node_name err.message;
ne_message = err.message;
ne_na_count = err.na_count;
}
| _ -> None
(** Inherit a warning from a dependency and mark its source as upstream.
If the warning was already upstream, its original source is preserved
to maintain the full provenance of the issue. *)
let inherit_warning dep_name warning =
let inherited_source =
match warning.Ast.nw_source with
| Ast.WarningOwn -> Ast.WarningUpstream dep_name
| Ast.WarningUpstream origin -> Ast.WarningUpstream origin
in
{ warning with Ast.nw_source = inherited_source }
(** Remove duplicate warnings from a list.
Duplicates are identified by comparing all structural fields (kind, function,
NA count, affected indices, message, and source). Only the first occurrence
of any distinct warning is retained to keep diagnostics reports concise. *)
let dedupe_warnings warnings =
let seen = Hashtbl.create (List.length warnings) in
let warning_dedup_key warning =
let source_key =
match warning.Ast.nw_source with
| Ast.WarningOwn -> "own"
| Ast.WarningUpstream node -> "upstream:" ^ node
in
(* Use a record-like string representation for the key to ensure uniqueness *)
Printf.sprintf "k:%s|f:%s|n:%d|i:%s|m:%s|s:%s"
warning.Ast.nw_kind
warning.Ast.nw_fn
warning.Ast.nw_na_count
(String.concat "," (List.map string_of_int warning.Ast.nw_na_indices))
warning.Ast.nw_message
source_key
in
warnings
|> List.fold_left (fun acc warning ->
let key = warning_dedup_key warning in
if Hashtbl.mem seen key then acc
else begin
Hashtbl.add seen key ();
warning :: acc
end
) []
|> List.rev
(** Build the diagnostics for a node by combining freshly emitted warnings,
inherited dependency warnings, and structured error metadata derived from
the node value when it is a [VError]. *)
let build_node_diagnostics node_name node_deps own_warnings diagnostics_so_far value =
let upstream_warnings =
node_deps
|> List.concat_map (fun dep_name ->
match List.assoc_opt dep_name diagnostics_so_far with
| Some diagnostics ->
List.map (inherit_warning dep_name) diagnostics.Ast.nd_warnings
| None -> [])
in
let upstream_errors =
node_deps
|> List.filter (fun dep_name ->
match List.assoc_opt dep_name diagnostics_so_far with
| Some diagnostics -> diagnostics.Ast.nd_error <> None
| None -> false)
in
let suppressed = !current_node_suppression_requested in
current_node_suppression_requested := false;
let is_error = match value with VError _ -> true | _ -> false in
{
Ast.nd_warnings = dedupe_warnings (own_warnings @ upstream_warnings);
nd_error = node_error_of_value node_name value;
nd_warnings_suppressed = suppressed;
nd_recovered = (upstream_errors <> [] && not is_error);
nd_upstream_errors = upstream_errors;
}
(** Print a compact stderr summary of warning and error diagnostics for a
materialized pipeline when warning output is enabled. *)
let print_pipeline_diagnostics_summary node_diagnostics =
let warning_nodes =
node_diagnostics
|> List.filter_map (fun (name, diagnostics) ->
if Ast.Utils.node_has_own_warnings diagnostics then Some (name, diagnostics) else None)
in
let error_nodes =
node_diagnostics
|> List.filter_map (fun (name, diagnostics) ->
match diagnostics.Ast.nd_error with
| Some error -> Some (name, error)
| None -> None)
in
let recovered_nodes =
node_diagnostics
|> List.filter (fun (_, diagnostics) -> diagnostics.Ast.nd_recovered)
in
if !show_warnings && (warning_nodes <> [] || error_nodes <> [] || recovered_nodes <> []) then begin
flush stdout;
Printf.eprintf
"Pipeline summary: %d node(s) with warnings, %d error(s), %d recovered\n%!"
(List.length warning_nodes)
(List.length error_nodes)
(List.length recovered_nodes);
List.iter (fun (name, diagnostics) ->
let own_warnings =
diagnostics.Ast.nd_warnings
|> List.filter (fun warning ->
match warning.Ast.nw_source with
| Ast.WarningOwn -> true
| Ast.WarningUpstream _ -> false)
in
let na_total =
List.fold_left (fun acc warning -> acc + warning.Ast.nw_na_count) 0 own_warnings
in
if own_warnings <> [] then
if diagnostics.Ast.nd_warnings_suppressed then
Printf.eprintf " ○ %s — warnings suppressed by caller (%d NAs ignored)\n%!"
name
na_total
else
Printf.eprintf " ⚠ %s — %d warning(s), %d affected NA slot(s)\n%!"
name
(List.length own_warnings)
na_total
) warning_nodes;
List.iter (fun (name, diagnostics) ->
match diagnostics.Ast.nd_error with
| Some error -> Printf.eprintf " ✖ %s — %s\n%!" name error.Ast.ne_message
| None -> ()
) node_diagnostics;
List.iter (fun (name, _) ->
Printf.eprintf " ❍ %s — Recovered from upstream failure.\n%!" name
) recovered_nodes
end
(** Check if an expression uses NSE (contains $field references) *)
let rec uses_nse (expr : Ast.expr) : bool =
match expr.node with
| ColumnRef _ -> true
| BinOp { left; right; _ } -> uses_nse left || uses_nse right
| BroadcastOp { left; right; _ } -> uses_nse left || uses_nse right
| UnOp { operand; _ } -> uses_nse operand
| Call { fn; args } -> uses_nse fn || List.exists (fun (_, e) -> uses_nse e) args
| IfElse { cond; then_; else_ } ->
uses_nse cond || uses_nse then_ || uses_nse else_
| Match { scrutinee; cases } ->
uses_nse scrutinee || List.exists (fun (_, body) -> uses_nse body) cases
| ListLit items -> List.exists (fun (_, e) -> uses_nse e) items
| DictLit pairs -> List.exists (fun (_, e) -> uses_nse e) pairs
| DotAccess { target; _ } -> uses_nse target
| RawCode _ -> false
| Block stmts -> List.exists uses_nse_stmt stmts
| Unquote e -> uses_nse e
| UnquoteSplice e -> uses_nse e
| _ -> false
and uses_nse_stmt stmt =
match stmt.node with
| Expression e -> uses_nse e
| Assignment { expr; _ } -> uses_nse expr
| Reassignment { expr; _ } -> uses_nse expr
| Import _ | ImportPackage _ | ImportFrom _ | ImportFileFrom _ -> false
let is_standard_package = function
| "core"
| "strcraft"
| "base"
| "chrono"
| "math"
| "stats"
| "dataframe"
| "colcraft"
| "pipeline"
| "explain" -> true
| _ -> false
(* --- Scalar and Broadcasting Logic --- *)
(** Evaluate scalar binary operations.
Strictly handles scalar values (Int, Float, Bool, String).
Does NOT handle lists, vectors, or broadcasting. *)
let eval_scalar_binop op v1 v2 =
match (op, v1, v2) with
(* Propagate errors first *)
| (_, VError _, _) -> v1
| (_, _, VError _) -> v2
| ((Plus | Minus), (VDate _ | VDatetime _), VNA _) -> (VNA NAGeneric)
| ((Plus | Minus), VNA _, (VDate _ | VDatetime _ | VPeriod _)) -> (VNA NAGeneric)
| ((Plus | Minus), (VDate _ | VDatetime _), VPeriod p) ->
if op = Plus then Chrono.add_period_to_value v1 p
else Chrono.add_period_to_value v1 (Chrono.negate_period p)
| (Plus, VPeriod p1, VPeriod p2) ->
VPeriod {
p_years = p1.p_years + p2.p_years;
p_months = p1.p_months + p2.p_months;
p_days = p1.p_days + p2.p_days;
p_hours = p1.p_hours + p2.p_hours;
p_minutes = p1.p_minutes + p2.p_minutes;
p_seconds = p1.p_seconds + p2.p_seconds;
p_micros = p1.p_micros + p2.p_micros;
}
| (Minus, (VDate _ | VDatetime _), (VDate _ | VDatetime _)) ->
Chrono.date_diff_period v1 v2
(* Then handle NA *)
| (_, VNA _, _) | (_, _, VNA _) ->
Error.na_predicate_error "Operation on NA: NA values do not propagate implicitly. Handle missingness explicitly."
(* Arithmetic *)
| (Plus, VInt a, VInt b) -> VInt (a + b)
| (Plus, VFloat a, VFloat b) -> VFloat (a +. b)
| (Plus, VInt a, VFloat b) -> VFloat (float_of_int a +. b)
| (Plus, VFloat a, VInt b) -> VFloat (a +. float_of_int b)
| (Plus, VString _, VString _) ->
Error.type_error "String concatenation with '+' is not supported. Use 'str_join([a, b], sep)' or 'paste(a, b, sep)' instead."
| (Minus, VInt a, VInt b) -> VInt (a - b)
| (Minus, VFloat a, VFloat b) -> VFloat (a -. b)
| (Minus, VInt a, VFloat b) -> VFloat (float_of_int a -. b)
| (Minus, VFloat a, VInt b) -> VFloat (a -. float_of_int b)
| (Mul, VInt a, VInt b) -> VInt (a * b)
| (Mul, VFloat a, VFloat b) -> VFloat (a *. b)
| (Mul, VInt a, VFloat b) -> VFloat (float_of_int a *. b)
| (Mul, VFloat a, VInt b) -> VFloat (a *. float_of_int b)
| (Div, VInt _, VInt 0) -> Error.division_by_zero ()
| (Div, VInt a, VInt b) -> VFloat (float_of_int a /. float_of_int b)
| (Div, VFloat _, VFloat b) when b = 0.0 -> Error.division_by_zero ()
| (Div, VFloat a, VFloat b) -> VFloat (a /. b)
| (Div, VInt a, VFloat b) -> if b = 0.0 then Error.division_by_zero () else VFloat (float_of_int a /. b)
| (Div, VFloat a, VInt b) -> if b = 0 then Error.division_by_zero () else VFloat (a /. float_of_int b)
| (Mod, VInt a, VInt b) -> if b = 0 then Error.division_by_zero () else VInt (a mod b)
| (Mod, VFloat a, VFloat b) -> if b = 0.0 then Error.division_by_zero () else VFloat (mod_float a b)
| (Mod, VInt a, VFloat b) -> if b = 0.0 then Error.division_by_zero () else VFloat (mod_float (float_of_int a) b)
| (Mod, VFloat a, VInt b) -> if b = 0 then Error.division_by_zero () else VFloat (mod_float a (float_of_int b))
(* Comparison *)
| (Eq, VInt a, VFloat b) -> VBool (float_of_int a = b)
| (Eq, VFloat a, VInt b) -> VBool (a = float_of_int b)
| (Eq, a, b) -> VBool (a = b)
| (NEq, VInt a, VFloat b) -> VBool (float_of_int a <> b)
| (NEq, VFloat a, VInt b) -> VBool (a <> float_of_int b)
| (NEq, a, b) -> VBool (a <> b)
| (Lt, VInt a, VInt b) -> VBool (a < b)
| (Lt, VFloat a, VFloat b) -> VBool (a < b)
| (Lt, VInt a, VFloat b) -> VBool (float_of_int a < b)
| (Lt, VFloat a, VInt b) -> VBool (a < float_of_int b)
| (Lt, VDate a, VDate b) -> VBool (a < b)
| (Lt, VDatetime (a, _), VDatetime (b, _)) -> VBool (Int64.compare a b < 0)
| (Gt, VInt a, VInt b) -> VBool (a > b)
| (Gt, VFloat a, VFloat b) -> VBool (a > b)
| (Gt, VInt a, VFloat b) -> VBool (float_of_int a > b)
| (Gt, VFloat a, VInt b) -> VBool (a > float_of_int b)
| (Gt, VDate a, VDate b) -> VBool (a > b)
| (Gt, VDatetime (a, _), VDatetime (b, _)) -> VBool (Int64.compare a b > 0)
| (LtEq, VInt a, VInt b) -> VBool (a <= b)
| (LtEq, VFloat a, VFloat b) -> VBool (a <= b)
| (LtEq, VInt a, VFloat b) -> VBool (float_of_int a <= b)
| (LtEq, VFloat a, VInt b) -> VBool (a <= float_of_int b)
| (LtEq, VDate a, VDate b) -> VBool (a <= b)
| (LtEq, VDatetime (a, _), VDatetime (b, _)) -> VBool (Int64.compare a b <= 0)
| (GtEq, VInt a, VInt b) -> VBool (a >= b)
| (GtEq, VFloat a, VFloat b) -> VBool (a >= b)
| (GtEq, VInt a, VFloat b) -> VBool (float_of_int a >= b)
| (GtEq, VFloat a, VInt b) -> VBool (a >= float_of_int b)
| (GtEq, VDate a, VDate b) -> VBool (a >= b)
| (GtEq, VDatetime (a, _), VDatetime (b, _)) -> VBool (Int64.compare a b >= 0)
(* Boolean / Bitwise *)
| (BitAnd, VInt a, VInt b) -> VInt (a land b)
| (BitOr, VInt a, VInt b) -> VInt (a lor b)
| (BitAnd, VBool a, VBool b) -> VBool (a && b)
| (BitOr, VBool a, VBool b) -> VBool (a || b)
(* Error handling *)
| (And, _, _) | (Or, _, _) ->
Error.internal_error "Short-circuit operators should not reach eval_scalar_binop"
(* Improved Error Messages for Bitwise Ops *)
| (BitOr, _, _) | (BitAnd, _, _) as op_tuple ->
let (op, l, r) = op_tuple in
(* Check if we have a vector/list involved to give a helpful hint *)
let is_sequence v = match v with VList _ | VVector _ -> true | _ -> false in
if is_sequence l || is_sequence r then
let op_str = if op = BitOr then "|" else "&" in
let elem_op_str = if op = BitOr then ".|" else ".&" in
let hint = Printf.sprintf "Use `%s` for element-wise boolean operations." elem_op_str in
Error.op_type_error_with_hint op_str "Bool" "Bool" hint
else
(* Fallback for other invalid types (e.g. 1 | "a") *)
let op_name = if op = BitOr then "|" else "&" in
Error.op_type_error op_name (Utils.type_name l) (Utils.type_name r)
| (op, l, r) ->
let op_name = match op with
| Plus -> "+" | Minus -> "-" | Mul -> "*" | Div -> "/"
| Lt -> "<" | Gt -> ">" | LtEq -> "<=" | GtEq -> ">=" | Eq -> "==" | NEq -> "!="
| BitAnd -> "&" | BitOr -> "|"
| _ -> "operator"
in
match Ast.type_conversion_hint (Utils.type_name l) (Utils.type_name r) with
| Some hint -> Error.op_type_error_with_hint op_name (Utils.type_name l) (Utils.type_name r) hint
| None -> Error.op_type_error op_name (Utils.type_name l) (Utils.type_name r)
(** Broadcasting engine.
Applies eval_scalar_binop across lists/vectors. *)
let rec broadcast2 op v1 v2 =
match v1, v2 with
(* Propagate errors *)
| VError _, _ -> v1
| _, VError _ -> v2
(* List-List *)
| VList l1, VList l2 ->
let len1 = List.length l1 in
let len2 = List.length l2 in
if len1 <> len2 then
Error.broadcast_length_error len1 len2
else
let res = List.map2 (fun (n1, x) (n2, y) ->
let name = match n1, n2 with Some s, _ -> Some s | _, Some s -> Some s | _ -> None in
(name, broadcast2 op x y)
) l1 l2 in
VList res
(* Vector-Vector *)
| VVector arr1, VVector arr2 ->
let len1 = Array.length arr1 in
let len2 = Array.length arr2 in
if len1 <> len2 then
Error.broadcast_length_error len1 len2
else
VVector (Array.map2 (fun x y -> broadcast2 op x y) arr1 arr2)
(* Vector-Scalar *)
| VVector arr, scalar ->
VVector (Array.map (fun x -> broadcast2 op x scalar) arr)
(* Scalar-Vector *)
| scalar, VVector arr ->
VVector (Array.map (fun x -> broadcast2 op scalar x) arr)
(* List-Scalar *)
| VList l, scalar ->
VList (List.map (fun (n, x) -> (n, broadcast2 op x scalar)) l)
(* Scalar-List *)
| scalar, VList l ->
VList (List.map (fun (n, x) -> (n, broadcast2 op scalar x)) l)
(* NDArray-NDArray elementwise *)
| VNDArray a1, VNDArray a2 ->
if a1.shape <> a2.shape then
Error.make_error ValueError "NDArray shapes must match for element-wise operations."
else
let first_error = ref None in
let out = Array.init (Array.length a1.data) (fun i ->
match eval_scalar_binop op (VFloat a1.data.(i)) (VFloat a2.data.(i)) with
| VInt n -> float_of_int n
| VFloat f -> f
| VBool b -> if b then 1.0 else 0.0
| VError _ as err ->
first_error := Some err;
nan
| _ -> nan
) in
begin match !first_error with
| Some err -> err
| None ->
if Array.exists Float.is_nan out then
Error.type_error "NDArray element-wise operation produced non-numeric results."
else VNDArray { shape = Array.copy a1.shape; data = out }
end
(* NDArray-Scalar *)
| VNDArray arr, scalar ->
(match scalar with
| VError _ -> scalar
| _ ->
let first_error = ref None in
let out = Array.init (Array.length arr.data) (fun i ->
match eval_scalar_binop op (VFloat arr.data.(i)) scalar with
| VInt n -> float_of_int n
| VFloat f -> f
| VBool b -> if b then 1.0 else 0.0
| VError _ as err ->
first_error := Some err;
nan
| _ -> nan
) in
match !first_error with
| Some err -> err
| None ->
if Array.exists Float.is_nan out then
Error.type_error "NDArray operation requires numeric scalar values."
else VNDArray { shape = Array.copy arr.shape; data = out })
(* Scalar-NDArray *)
| scalar, VNDArray arr ->
(match scalar with
| VError _ -> scalar
| _ ->
let first_error = ref None in
let out = Array.init (Array.length arr.data) (fun i ->
match eval_scalar_binop op scalar (VFloat arr.data.(i)) with
| VInt n -> float_of_int n
| VFloat f -> f
| VBool b -> if b then 1.0 else 0.0
| VError _ as err ->
first_error := Some err;
nan
| _ -> nan
) in
match !first_error with
| Some err -> err
| None ->
if Array.exists Float.is_nan out then
Error.type_error "NDArray operation requires numeric scalar values."
else VNDArray { shape = Array.copy arr.shape; data = out })
(* Scalar-Scalar *)
| s1, s2 ->
eval_scalar_binop op s1 s2
let uniq_preserve (items : string list) : string list =
let seen = Hashtbl.create (List.length items) in
List.filter
(fun item ->
if Hashtbl.mem seen item then false
else begin
Hashtbl.add seen item ();
true
end)
items
let combinations_of_size size lst =
let rec aux k prefix rest acc =
match k, rest with
| 0, _ ->
let combo = List.rev prefix in
combo :: acc
| _, [] ->
acc
| k, x :: xs ->
let acc = aux (k - 1) (x :: prefix) xs acc in
aux k prefix xs acc
in
aux size [] lst [] |> List.rev
let expand_formula_interaction (factors : string list) : string list =
let factors = uniq_preserve factors in
let n = List.length factors in
let rec loop size acc =
if size > n then
List.rev acc
else
let terms =
combinations_of_size size factors
|> List.map (String.concat ":")
in
loop (size + 1) (List.rev_append terms acc)
in
loop 1 []
let rec extract_formula_product_factors (expr : Ast.expr) : string list option =
match expr.node with
| Var s -> Some [ s ]
| BinOp { op = Mul; left; right } ->
(match extract_formula_product_factors left, extract_formula_product_factors right with
| Some lhs, Some rhs -> Some (lhs @ rhs)
| _ -> None)
| _ -> None
(** Extract variable names from a formula expression.
Supports additive terms and interaction expansion via `*`.
Returns predictor/response names in model-matrix order. *)
let rec extract_formula_vars (expr : Ast.expr) : string list =
match expr.node with
| Var s -> [ s ]
| BinOp { op = Plus; left; right } ->
uniq_preserve (extract_formula_vars left @ extract_formula_vars right)
| BinOp { op = Mul; _ } ->
(match extract_formula_product_factors expr with
| Some factors -> expand_formula_interaction factors
| None -> [])
| Value (VInt 1) -> [] (* Intercept term: y ~ x + 1 *)
| _ -> [] (* Unsupported formula syntax *)
(* Module-level mutable ref to track accumulated imports for pipeline propagation *)
let current_imports : Ast.stmt list ref = ref []
let dedent = Nix_unparse.dedent
let eval_shell_expr _env_ref cmd =
let cmd = dedent cmd in
let stripped = String.trim cmd in
if stripped = "cd" || String.starts_with ~prefix:"cd " stripped then
let path = if stripped = "cd" then Sys.getenv_opt "HOME" |> Option.value ~default:"."
else String.trim (String.sub stripped 3 (String.length stripped - 3)) in
let path = if String.starts_with ~prefix:"~" path then
let home = Sys.getenv_opt "HOME" |> Option.value ~default:"." in
if String.length path <= 1 then home
else home ^ String.sub path 1 (String.length path - 1)
else path in
(try
Sys.chdir path;
VShellResult { sr_stdout = ""; sr_stderr = ""; sr_exit_code = 0 }
with Sys_error msg ->
VShellResult { sr_stdout = ""; sr_stderr = "No such directory: " ^ path ^ " (" ^ msg ^ ")"; sr_exit_code = 1 })
else
try
let ic, oc, ec = Unix.open_process_full cmd (Unix.environment ()) in
close_out_noerr oc;
let stdout_buf = Buffer.create 128 in
let stderr_buf = Buffer.create 128 in
(try
while true do Buffer.add_char stdout_buf (input_char ic) done
with End_of_file -> ());
(try
while true do Buffer.add_char stderr_buf (input_char ec) done
with End_of_file -> ());
let status = Unix.close_process_full (ic, oc, ec) in
let stdout = Buffer.contents stdout_buf in
let stderr = Buffer.contents stderr_buf |> String.trim in
let exit_code = match status with
| Unix.WEXITED n -> n
| Unix.WSIGNALED n -> -(abs n)
| Unix.WSTOPPED n -> -(abs n)
in
VShellResult { sr_stdout = stdout; sr_stderr = stderr; sr_exit_code = exit_code }
with
| Unix.Unix_error (Unix.ENOENT, _, _) ->
VShellResult { sr_stdout = ""; sr_stderr = "command not found"; sr_exit_code = 127 }
| _ ->
VShellResult { sr_stdout = ""; sr_stderr = "failed to execute shell command"; sr_exit_code = 1 }
(** Produce a NameError for `name`, lazily computing a "Did you mean …?"
suggestion only when we need to build the error value.
This avoids materializing Env.bindings on every unbound-variable access. *)
let name_error_with_lazy_suggestion name env_ref =
let names =
Env.bindings !env_ref
|> List.filter (fun (name, v) ->
match v with
| VSymbol _ -> false
| _ -> not (String.starts_with ~prefix:"__" name)
)
|> List.map fst
in
match Ast.suggest_name name names with
| Some suggestion -> Error.name_error_with_suggestion name suggestion
| None -> Error.name_error name
let vexpr v = match v with
| VExpr e -> e
| VQuo { q_expr; _ } -> q_expr (* strip env; used only for splice/inject *)
| _ -> Ast.mk_expr (Value v)
let varexpr name = Ast.mk_expr (Var name)
let add_fresh_match_binding bindings name value =
match List.assoc_opt name bindings with
| Some _ -> None
| None -> Some ((name, value) :: bindings)
let merge_match_bindings bindings additions =
List.fold_left
(fun acc (name, value) ->
match acc with
| None -> None
| Some current -> add_fresh_match_binding current name value)
(Some bindings)
additions
let rec match_pattern (pattern : Ast.match_pattern) (value : Ast.value)
: (string * Ast.value) list option =
match pattern, value with
| PWildcard, _ -> Some []
| PVar name, matched -> Some [ (name, matched) ]
| PNA, VNA _ -> Some []
| PError field, VError err ->
begin
match field with
| Some name -> Some [ (name, VString err.message) ]
| None -> Some []
end
| PList (patterns, rest_name), VList items ->
let rec match_list remaining_patterns remaining_items bindings =
match remaining_patterns, remaining_items with
| [], rest_items ->
begin
match rest_name with
| Some name -> add_fresh_match_binding bindings name (VList rest_items)
| None -> if rest_items = [] then Some bindings else None
end
| _ :: _, [] -> None
| pattern :: rest_patterns, (_, item_value) :: rest_items ->
begin
match match_pattern pattern item_value with
| None -> None
| Some matched_bindings ->
begin
match merge_match_bindings bindings matched_bindings with
| None -> None
| Some combined -> match_list rest_patterns rest_items combined
end
end
in
match_list patterns items []
| _ -> None
let rec eval_match (env_ref : environment ref) scrutinee cases =
let scrutinee_value = eval_expr env_ref scrutinee in
let rec eval_cases = function
| [] ->
begin
match scrutinee_value with
(* Preserve the original error when no arm handles it. *)
| VError _ as err -> err
| _ -> Error.match_error "Match expression did not match any pattern."
end
| (pattern, body) :: rest ->
begin
match match_pattern pattern scrutinee_value with
| None -> eval_cases rest
| Some bindings ->
let scoped_env =
List.fold_left
(fun env (name, value) -> Env.add name value env)
!env_ref
bindings
in
eval_expr (ref scoped_env) body
end
in
eval_cases cases
and eval_expr (env_ref : environment ref) (expr : Ast.expr) : value =
let result =
match expr.node with
| Unquote inner -> VUnquote (eval_expr env_ref inner)
| UnquoteSplice inner -> VUnquoteSplice (eval_expr env_ref inner)
| ShellExpr cmd -> eval_shell_expr env_ref cmd
| Value (VSymbol s) when String.length s > 0 && s.[0] = '^' ->
(match Serialization_registry.lookup (String.sub s 1 (String.length s - 1)) with
| Some ser -> VSerializer ser
| None -> VSymbol s)
| Value v -> v
| Var s ->
(match Env.find_opt s !env_ref with
| Some v -> v
| None ->
(match !Ast.node_resolver s with
| Some v -> v
| None -> name_error_with_lazy_suggestion s env_ref))
| ColumnRef field ->
(match Env.find_opt ("$" ^ field) !env_ref with
| Some v -> v
| None -> VSymbol ("$" ^ field))
| BinOp { op; left; right } -> eval_binop env_ref op left right
| BroadcastOp { op; left; right } ->
let v1 = eval_expr env_ref left in
let v2 = eval_expr env_ref right in
broadcast2 op v1 v2
| UnOp { op; operand } -> eval_unop env_ref op operand
| IfElse { cond; then_; else_ } ->
let cond_val = eval_expr env_ref cond in
(match cond_val with
| VError _ as e -> e
| VNA _ -> Error.na_predicate_error "Cannot use NA as a condition"
| VBool true -> eval_expr env_ref then_
| VBool false -> eval_expr env_ref else_
| _ -> make_error TypeError ("If condition must be Bool, got " ^ Utils.type_name cond_val))
| Match { scrutinee; cases } ->
eval_match env_ref scrutinee cases
| Call { fn = { node = Var "expr"; _ }; args } ->
(match args with
| [(_name, e)] -> VExpr (quote_expr env_ref e)
| _ -> make_error ArityError "expr() expects exactly 1 argument")
| Call { fn = { node = Var "exprs"; _ }; args } ->
VList (List.map (fun (name, e) -> (name, VExpr (quote_expr env_ref e))) args)
(* quo/quos capture the expression WITH the current lexical environment (quosure) *)
| Call { fn = { node = Var "quo"; _ }; args } ->
(match args with
| [(_name, e)] -> VQuo { q_expr = quote_expr env_ref e; q_env = !env_ref }
| _ -> make_error ArityError "quo() expects exactly 1 argument")
| Call { fn = { node = Var "quos"; _ }; args } ->
let current_env = !env_ref in
VList (List.map (fun (name, e) ->
(name, VQuo { q_expr = quote_expr env_ref e; q_env = current_env })
) args)
| Call { fn = { node = Var "eval"; _ }; args } ->
(match args with
| [(_name, e)] ->
(match eval_expr env_ref e with
| VExpr quoted -> eval_expr env_ref quoted
| VQuo { q_expr; q_env } -> eval_expr (ref q_env) q_expr
| v -> v)
| _ -> make_error ArityError "eval() expects exactly 1 argument")
| Call { fn = { node = Var "enquo"; _ }; args } ->
(match args with
| [(_, { node = Var name; _ })] ->
let q_env = match Env.find_opt "__q_caller_env__" !env_ref with
| Some (VEnv e) -> e
| _ -> !env_ref
in
(match Env.find_opt ("__q_" ^ name) !env_ref with
| Some (VExpr q) -> VQuo { q_expr = q; q_env }
| _ -> Error.make_error NameError (Printf.sprintf "enquo: argument `%s` not found in current call context." name))
| _ -> Error.make_error ArityError "enquo() expects exactly 1 symbol argument")
| Call { fn = { node = Var "enquos"; _ }; args } ->
let q_env = match Env.find_opt "__q_caller_env__" !env_ref with
| Some (VEnv e) -> e
| _ -> !env_ref
in
let wrap_as_quo = fun (name, v) -> match v with
| VExpr e -> (name, VQuo { q_expr = e; q_env })
| other -> (name, other)
in
(match args with
| [(_, { node = Var name; _ })] when name = "..." ->
(match Env.find_opt "__q_dots" !env_ref with
| Some (VList q_dots) -> VList (List.map wrap_as_quo q_dots)
| _ -> VList [])
| [] ->
(match Env.find_opt "__q_dots" !env_ref with
| Some (VList q_dots) -> VList (List.map wrap_as_quo q_dots)
| _ -> VList [])
| _ -> Error.make_error ArityError "enquos() expects no arguments or `...`")
| Call { fn = { node = Var name; _ }; args }
when List.mem name ["node"; "py"; "pyn"; "rn"; "qn"; "shn"] ->
let fn_name = name in
let lookup_arg name default =
match List.assoc_opt (Some name) args with
| Some e -> e
| None ->
(match name with
| "command" ->
(match List.filter (fun (k, _) -> k = None) args with
| [(_, c)] -> c | _ -> default)
| _ -> default)
in
(* Eagerly evaluate serializer/deserializer args in the current env.
This lets users define serializers as top-level variables or import
them from .t files. The result is re-wrapped as Value(v) so the Nix
emitter (which calls eval_expr_safe with empty env) can still
resolve the value at code-generation time.
IMPORTANT: only evaluate when the user actually supplied the arg —
the default sentinels (varexpr "text", varexpr "default") are NOT
string literals but variable-name look-ups that would fail in env. *)
let lookup_serializer_arg name default =
match List.assoc_opt (Some name) args with
| Some e ->
let v = eval_expr env_ref e in
Ast.mk_expr (Ast.Value v)
| None -> default
in
let lookup_env_vars () =
let is_env_value = function
| VString _ | VSymbol _ | VInt _ | VFloat _ | VBool _ | VNA _ -> true
| _ -> false
in
let is_valid_env_var_name key =
let is_initial = function
| 'A' .. 'Z' | 'a' .. 'z' | '_' -> true
| _ -> false
in
let is_continue = function
| 'A' .. 'Z' | 'a' .. 'z' | '0' .. '9' | '_' -> true
| _ -> false
in
String.length key > 0
&& is_initial key.[0]
&& let rec loop idx =
idx >= String.length key
|| (is_continue key.[idx] && loop (idx + 1))
in
loop 1
in
match List.assoc_opt (Some "env_vars") args with
| None -> Ok []
| Some e ->
(match eval_expr env_ref e with
| VDict pairs ->
(match List.find_opt (fun (key, _) -> not (is_valid_env_var_name key)) pairs with
| Some (key, _) ->
Error (Error.type_error
(Printf.sprintf
"Function `%s` expects `env_vars` key `%s` to be a valid environment variable name ([A-Za-z_][A-Za-z0-9_]*)."
fn_name key))
| None ->
(match List.find_opt (fun (_, v) -> not (is_env_value v)) pairs with
| None -> Ok pairs
| Some (key, _) ->
Error (Error.type_error
(Printf.sprintf "Function `%s` expects environment variable `%s` to be a String, Symbol, Int, Float, Bool, or NA." fn_name key))))
| VNA _ -> Ok []
| _ ->
Error (Error.type_error (Printf.sprintf "Function `%s` expects `env_vars` to be a Dict." fn_name)))
in
let lookup_dependencies () =
match List.assoc_opt (Some "deps") args with
| None -> Ok None
| Some e ->
let extract_dep_name expr =
match expr.node with
| Var s -> Some s
| Value (VString s) | Value (VSymbol s) ->
if String.starts_with ~prefix:"^" s then
Some (String.sub s 1 (String.length s - 1))
else Some s
| _ -> None
in
let deps_type_error () =
Error (Error.type_error (Printf.sprintf "Function `%s` expects `deps` to be a List of identifiers, Strings or Symbols." fn_name))
in
let rec extract_dep_names items =
match items with
| [] -> Ok []
| (_, item_e) :: rest ->
(match extract_dep_name item_e with
| Some dep ->
(match extract_dep_names rest with
| Ok deps -> Ok (dep :: deps)
| Error _ as err -> err)
| None -> deps_type_error ())
in
(match e.node with
| ListLit items ->
(match extract_dep_names items with
| Ok deps -> Ok (Some deps)
| Error _ as err -> err)
| _ ->
(match extract_dep_name e with
| Some s -> Ok (Some [s])
| None -> deps_type_error ()))
in
let lookup_runtime_args () =
let rec is_arg_value ~allow_list = function
| VString _ | VSymbol _ | VInt _ | VFloat _ | VBool _ | VNA _ -> true
| VList items when allow_list ->
List.for_all (fun (_, v) -> is_arg_value ~allow_list:false v) items
| _ -> false
in
match List.assoc_opt (Some "args") args with
| None -> Ok []
| Some e ->
(match eval_expr env_ref e with
| VDict pairs ->
(match List.find_opt (fun (_, v) -> not (is_arg_value ~allow_list:true v)) pairs with
| None -> Ok pairs
| Some (key, _) ->
Error (Error.type_error
(Printf.sprintf "Function `%s` expects runtime arg `%s` to be a String, Symbol, Int, Float, Bool, NA, or List of those values." fn_name key)))
| VList items ->
(match List.find_opt (fun (_, v) -> not (is_arg_value ~allow_list:false v)) items with
| None -> Ok (List.mapi (fun i (_, v) -> (string_of_int i, v)) items)
| Some _ ->
Error (Error.type_error
(Printf.sprintf "Function `%s` expects `args` list items to be String, Symbol, Int, Float, Bool, or NA values." fn_name)))
| VNA _ -> Ok []
| _ ->
Error (Error.type_error (Printf.sprintf "Function `%s` expects `args` to be a Dict or List." fn_name)))
in
let lookup_list name =
match List.assoc_opt (Some name) args with
| Some { node = ListLit items; _ } -> List.map snd items
| Some expr -> [expr]
| None -> []
in
let eval_string name default =
match eval_expr env_ref (lookup_arg name (vexpr (VString default))) with
| VString s -> s | VSymbol s -> s | _ -> default
in
let eval_bool name default =
match eval_expr env_ref (lookup_arg name (vexpr (VBool default))) with
| VBool b -> b | _ -> default
in
(* Evaluate the optional script argument — must be a string path to a .R, .py, or .qmd file *)
let explicit_script_path_opt =
match List.assoc_opt (Some "script") args with
| Some e ->
(match eval_expr env_ref e with
| VString s -> Some s
| VSymbol s -> Some s
| _ -> None)
| None -> None
in
let shell_opt =
match List.assoc_opt (Some "shell") args with
| Some e -> (match eval_expr env_ref e with VString s -> Some s | VSymbol s -> Some s | _ -> None)
| None -> None
in
let shell_args = lookup_list "shell_args" in
let command = lookup_arg "command" (vexpr ((VNA NAGeneric))) in
(match lookup_env_vars (), lookup_runtime_args (), lookup_dependencies () with
| Error err, _, _ | _, Error err, _ | _, _, Error err -> err
| Ok un_env_vars, Ok un_args, Ok un_dependencies ->
let arg_path_opt =
let find_path key =
match List.assoc_opt key un_args with
| Some (VString s) -> Some s
| Some (VSymbol s) -> Some s
| _ -> None
in
List.find_map find_path [ "path"; "file"; "qmd_file"; "input" ]
in
let has_command = match command.node with Value ((VNA NAGeneric)) -> false | _ -> true in
let execution_path_opt =
match explicit_script_path_opt with
| Some _ as s -> s
| None -> if has_command then None else arg_path_opt
in
if has_command && explicit_script_path_opt <> None then
Error.make_error TypeError (Printf.sprintf "%s() cannot use both 'command' and 'script' arguments — choose one." fn_name)
else
let default_runtime = match name with
| "py" | "pyn" -> "Python"
| "rn" -> "R"
| "qn" -> "Quarto"
| "shn" -> "sh"
| _ -> "T"
in
(* Auto-detect runtime from script/arg extension only if not explicit *)
let runtime =
let explicit = eval_string "runtime" "" in
if explicit <> "" then explicit
else match explicit_script_path_opt with
| Some path -> (match Filename.extension path with ".R" -> "R" | ".py" -> "Python" | ".qmd" -> "Quarto" | ".sh" -> "sh" | _ -> default_runtime)
| None -> (match arg_path_opt with
| Some path when not has_command -> (match Filename.extension path with ".R" -> "R" | ".py" -> "Python" | ".qmd" -> "Quarto" | ".sh" -> "sh" | _ -> default_runtime)
| _ -> default_runtime)
in
if has_command && runtime = "Quarto" then
Error.make_error TypeError "Quarto nodes require a script and do not support inlined `command` blocks."
else
let un_command, un_script =
match execution_path_opt with
| Some path ->
let ids = try
let ic = open_in path in
let content = Fun.protect ~finally:(fun () -> close_in ic) (fun () ->
let n = in_channel_length ic in
let buf = Bytes.create n in
really_input ic buf 0 n;
Bytes.to_string buf)
in Ast.extract_identifiers content
with Sys_error _ | End_of_file -> []
in (Ast.mk_expr (RawCode { raw_text = ""; raw_identifiers = ids }), Some path)
| None -> (command, None)
in
let base_includes = lookup_list "includes" in
let un_includes =
match arg_path_opt with
| Some p when has_command ->
let already_included = List.exists (function { node = Value (VString s); _ } | { node = Value (VSymbol s); _ } -> s = p | _ -> false) base_includes in
if already_included then base_includes else base_includes @ [vexpr (VString p)]
| _ -> base_includes
in
if runtime = "Quarto" && un_script = None then
Error.make_error TypeError
"Node with runtime `Quarto` requires `script` or `args.path`/`args.file`/`args.qmd_file`/`args.input` to point to a `.qmd` file."
else if runtime <> "T" && runtime <> "Quarto" then
match un_command.node with
| RawCode _ ->
VNode {
un_command; un_script; un_runtime = runtime;
un_serializer = lookup_serializer_arg "serializer" (match runtime with "sh" -> varexpr "text" | _ -> varexpr "default");
un_deserializer = lookup_serializer_arg "deserializer" (varexpr "default");
un_env_vars; un_args;
un_shell = shell_opt;
un_shell_args = shell_args;
un_functions = lookup_list "functions";
un_includes;
un_noop = eval_bool "noop" false;
un_dependencies;
}
| Value (VString _) | Value (VSymbol _) | Value ((VNA NAGeneric)) when runtime = "sh" ->
VNode {
un_command; un_script; un_runtime = runtime;
un_serializer = lookup_serializer_arg "serializer" (varexpr "text");
un_deserializer = lookup_serializer_arg "deserializer" (varexpr "default");
un_env_vars; un_args;
un_shell = shell_opt;
un_shell_args = shell_args;
un_functions = lookup_list "functions";
un_includes;
un_noop = eval_bool "noop" false;
un_dependencies;
}
| _ when Option.is_some un_script ->
VNode {
un_command; un_script; un_runtime = runtime;
un_serializer = lookup_serializer_arg "serializer" (match runtime with "sh" -> varexpr "text" | _ -> varexpr "default");
un_deserializer = lookup_serializer_arg "deserializer" (varexpr "default");
un_env_vars; un_args;
un_shell = shell_opt;
un_shell_args = shell_args;
un_functions = lookup_list "functions";
un_includes;
un_noop = eval_bool "noop" false;
un_dependencies;
}
| _ ->
let msg = Printf.sprintf "Node with runtime `%s` requires command to be wrapped in <{ ... }> blocks (RawCode), or use the 'script' argument to point to a .R, .py, .sh, or .qmd file." runtime in
Error.make_error TypeError msg
else
VNode {
un_command; un_script; un_runtime = runtime;
un_serializer = lookup_serializer_arg "serializer" (varexpr "default");
un_deserializer = lookup_serializer_arg "deserializer" (varexpr "default");
un_env_vars; un_args;
un_shell = shell_opt;
un_shell_args = shell_args;
un_functions = lookup_list "functions";
un_includes;
un_noop = eval_bool "noop" false;
un_dependencies;
}
)
| Call { fn; args } ->
let fn_val = Utils.unwrap_value (eval_expr env_ref fn) in
eval_call env_ref fn_val args
| Lambda l -> VLambda { l with env = Some !env_ref } (* Capture the current environment *)
(* Structural expressions *)
| ListLit items -> eval_list_lit env_ref items
| DictLit pairs -> eval_dict_lit env_ref pairs
| DotAccess { target; field } -> eval_dot_access env_ref target field
| RawCode { raw_text; _ } -> VRawCode raw_text
| ListComp _ -> Error.internal_error "List comprehensions are not yet implemented"
| Block stmts -> eval_block env_ref stmts
| PipelineDef nodes -> eval_pipeline env_ref nodes
| IntentDef pairs -> eval_intent env_ref pairs
in
attach_expr_location expr result
and eval_block env_ref stmts =
let rec loop () = function
| [] -> (VNA NAGeneric)
| [stmt] ->
let (v, new_env) = eval_statement !env_ref stmt in
env_ref := new_env;
v
| stmt :: rest ->
let (_, new_env) = eval_statement !env_ref stmt in
env_ref := new_env;
loop () rest
in
loop () stmts
(* --- Phase 6: Intent Block Evaluation --- *)
(** Evaluate an intent block definition *)
and eval_intent env_ref pairs =
let evaluated = List.map (fun (k, e) ->
let v = eval_expr env_ref e in
match v with
| VString s -> Ok (k, s)
| VError _ -> Error v
| _ -> Ok (k, Utils.value_to_string v)
) pairs in
match List.find_opt (fun r -> match r with Error _ -> true | _ -> false) evaluated with
| Some (Error e) -> e
| _ ->
let fields = List.map (fun r -> match r with Ok p -> p | _ -> ("", "")) evaluated in
VIntent { intent_fields = fields }
(* --- Phase 3: Pipeline Evaluation --- *)
(** Extract free variable names from an expression *)
and free_vars (expr : Ast.expr) : string list =
let rec collect is_call_target = function
| { node = Value _; _ } -> []
| { node = Var s; _ } -> if is_call_target then [] else [s]
| { node = ColumnRef _; _ } -> []
| { node = Call { fn; args }; _ } ->
collect true fn @ List.concat_map (fun (_, e) -> collect false e) args
| { node = Lambda { body; params; _ }; _ } ->
let bound = params in
List.filter (fun v -> not (List.mem v bound)) (collect false body)
| { node = IfElse { cond; then_; else_ }; _ } ->
collect false cond @ collect false then_ @ collect false else_
| { node = Match { scrutinee; cases }; _ } ->
let collect_case (pattern, body) =
let rec bound_vars = function
| PWildcard | PNA -> []
| PVar name -> [name]
| PError None -> []
| PError (Some name) -> [name]
| PList (patterns, rest) ->
let names = List.concat_map bound_vars patterns in
match rest with
| Some name -> name :: names
| None -> names
in
let bound = bound_vars pattern in
List.filter (fun v -> not (List.mem v bound)) (collect false body)
in
collect false scrutinee @ List.concat_map collect_case cases
| { node = ListLit items; _ } -> List.concat_map (fun (_, e) -> collect false e) items
| { node = ListComp _; _ } -> []
| { node = DictLit pairs; _ } -> List.concat_map (fun (_, e) -> collect false e) pairs
| { node = BinOp { left; right; _ }; _ } -> collect false left @ collect false right
| { node = UnOp { operand; _ }; _ } -> collect false operand
| { node = BroadcastOp { left; right; _ }; _ } -> collect false left @ collect false right
| { node = DotAccess { target; _ }; _ } -> collect false target
| { node = RawCode { raw_identifiers; _ }; _ } -> raw_identifiers (* Lexically extracted identifiers for dependency detection *)
| { node = Block stmts; _ } -> List.concat_map (collect_stmt false) stmts
| { node = PipelineDef _; _ } -> []
| { node = IntentDef pairs; _ } -> List.concat_map (fun (_, e) -> collect false e) pairs
| { node = Unquote e; _ } | { node = UnquoteSplice e; _ } -> collect false e
| { node = ShellExpr _; _ } -> []
and collect_stmt is_call_target = function
| { node = Expression e; _ } -> collect is_call_target e
| { node = Assignment { expr; _ }; _ } -> collect false expr
| { node = Reassignment { expr; _ }; _ } -> collect false expr
| { node = Import _ | ImportPackage _ | ImportFrom _ | ImportFileFrom _; _ } -> []
in
let vars = collect false expr in
List.sort_uniq String.compare vars
(** Topological sort of pipeline nodes based on dependencies *)
and topo_sort (nodes : (string * 'a) list) (deps : (string * string list) list) : (string list, string) result =
let node_names = List.map fst nodes in
let visited = Hashtbl.create (List.length nodes) in
let in_progress = Hashtbl.create (List.length nodes) in
let order = ref [] in
let rec visit name =
if Hashtbl.mem visited name then Ok ()
else if Hashtbl.mem in_progress name then Error name
else begin
Hashtbl.add in_progress name true;
let node_deps = match List.assoc_opt name deps with Some d -> d | None -> [] in
let result = List.fold_left (fun acc dep ->
match acc with
| Error _ as e -> e
| Ok () ->
if List.mem dep node_names then visit dep
else Ok ()
) (Ok ()) node_deps in
match result with
| Error _ as e -> e
| Ok () ->
Hashtbl.remove in_progress name;
Hashtbl.add visited name true;
order := name :: !order;
Ok ()
end
in
let result = List.fold_left (fun acc name ->
match acc with
| Error _ as e -> e
| Ok () -> visit name
) (Ok ()) node_names in
match result with
| Error name -> Error name
| Ok () -> Ok (List.rev !order)
(** Evaluate a pipeline definition *)
and eval_pipeline ?(verbose=true) env_ref (nodes : (string * Ast.expr) list) : value =
let default_un expr = {
un_command = expr;
un_script = None;
un_runtime = "T";
un_serializer = varexpr "default";
un_deserializer = varexpr "default";
un_env_vars = [];
un_args = [];
un_shell = None;
un_shell_args = [];
un_functions = [];
un_includes = [];
un_noop = false;
un_dependencies = None;
} in
(* Desugar nodes into enriched structures with defaults.
We evaluate potential node expressions early so pre-defined nodes
(e.g. `p = pipeline { data = data_node }`) are correctly imported.
If a NameError occurs (e.g. `b = a` referencing an undefined sibling `a`),
we catch it and defer it as an unbuilt node so pipeline topological
sorting can resolve it as an internal dependency. *)
let desugar_node (name, node_expr) : (string * Ast.unbuilt_node, value) result =
let is_node_call = match node_expr.node with
| Call { fn = { node = Var ("node" | "py" | "pyn" | "rn" | "qn" | "shn"); _ }; _ }
| Var _ | ColumnRef _ | DotAccess _ | Value (VNode _) | Value (VComputedNode _) -> true
| _ -> false
in
if is_node_call then
match eval_expr env_ref node_expr with
| VNode un -> Ok (name, un)
| VComputedNode cn ->
Ok (name, {
un_command = vexpr (VComputedNode cn);
un_script = None;
un_runtime = cn.cn_runtime;
un_serializer = vexpr (VString cn.cn_serializer);
un_deserializer = varexpr "default";
un_env_vars = [];
un_args = [];
un_shell = None;
un_shell_args = [];
un_functions = [];
un_includes = [];
un_noop = false;
un_dependencies = None;
})
| VError { code = NameError; _ } -> Ok (name, default_un node_expr)
| VError _ as e -> Error e
| _ -> Ok (name, default_un node_expr)
else
Ok (name, default_un node_expr)
in
let rec desugar_all acc = function
| [] -> Ok (List.rev acc)
| node :: rest ->
(match desugar_node node with
| Error err -> Error err
| Ok res -> desugar_all (res :: acc) rest)
in
match desugar_all [] nodes with
| Error err -> err
| Ok desugared_nodes ->
(* Compute dependencies based on the 'command' part of the desugared node.
A free variable counts as a pipeline dependency iff it is:
(a) the name of another node defined in THIS pipeline block, or
(b) NOT bound in the outer environment at all — meaning it is an unresolved
reference intended to be satisfied by another pipeline via `chain`. *)
let node_names = List.map fst desugared_nodes in
let rec compute_deps acc = function
| [] -> Ok (List.rev acc)
| (name, un) :: rest ->
(match un.un_dependencies with
| Some explicit ->
if List.mem name explicit then
Error (Error.structural_error (Printf.sprintf
"Self-referential node: `%s` lists itself in `deps`." name))
else
(* Validate that all explicit deps are known sibling nodes in this pipeline *)
let unknown = List.filter (fun d -> not (List.mem d node_names)) explicit in
if unknown <> [] then
Error (Error.structural_error (Printf.sprintf
"Node `%s`: explicit `deps` contains unknown node(s): %s. All dependencies must be nodes declared in the same pipeline."
name (String.concat ", " (List.map (fun d -> "`" ^ d ^ "`") unknown))))
else
compute_deps ((name, explicit) :: acc) rest
| None ->
let fv = free_vars un.un_command in
let is_raw = match un.un_command.node with RawCode _ -> true | _ -> false in
let has_self_ref = List.exists (fun v -> v = name) fv in
if has_self_ref && not is_raw then
Error (Error.structural_error (Printf.sprintf
"Self-referential node detected in command for node: `%s`." name))
else
let node_deps = List.filter (fun v ->
v <> name && (
(* Always: sibling node in the same pipeline *)
List.mem v node_names ||
(* T expressions only: unresolved names are cross-pipeline deps (chain).
For RawCode (R/Python), we can't distinguish foreign identifiers from
intended cross-pipeline refs, so we conservatively exclude them. *)
(not is_raw && not (Env.mem v !env_ref))
)
) fv in
compute_deps ((name, node_deps) :: acc) rest)
in
match compute_deps [] desugared_nodes with
| Error e -> e
| Ok deps ->
(* No-op propagation: if a node is noop, all its transitive dependents are noop *)
let desugared_nodes =
let rec propagate current =
let changed = ref false in
let next = List.map (fun (name, un) ->
if un.un_noop then (name, un)
else
let my_deps = match List.assoc_opt name deps with Some d -> d | None -> [] in
let has_noop_dep = List.exists (fun d ->
match List.find_opt (fun (dn_name, _) -> dn_name = d) current with
| Some (_, dep_un) -> dep_un.Ast.un_noop
| None -> false
) my_deps in
if has_noop_dep then (changed := true; (name, { un with un_noop = true }))
else (name, un)
) current in
if !changed then propagate next else next
in
propagate desugared_nodes
in
(* Validation: Cross-runtime dependencies must have explicit deserializer *)
let runtime_mapping = List.map (fun (name, un) -> (name, un.un_runtime)) desugared_nodes in
let validation_errors = List.filter_map (fun (name, un) ->
let my_runtime = un.un_runtime in
let my_deps = match List.assoc_opt name deps with Some d -> d | None -> [] in
let offenders = List.filter (fun dname ->
match List.assoc_opt dname runtime_mapping with
| Some dep_runtime ->
dep_runtime <> my_runtime &&
my_runtime <> "Quarto" &&
my_runtime <> "sh" &&
my_runtime <> "T" &&
(match un.un_deserializer.node with Var "default" -> true | _ -> false)
| None -> false (* External dependency — we don't know its runtime yet *)
) my_deps in
if offenders <> [] then
let offender = List.hd offenders in
let offender_runtime = match List.assoc_opt offender runtime_mapping with Some r -> r | None -> "Unknown" in
Some (Printf.sprintf "Node `%s` (%s) depends on `%s` (%s) but has no explicit deserializer."
name my_runtime offender offender_runtime)
else None
) desugared_nodes in
if validation_errors <> [] then
Error.make_error StructuralError (List.hd validation_errors)
else
(* Topological sort *)
match topo_sort desugared_nodes deps with
| Error cycle_node ->
Error.structural_error (Printf.sprintf "Pipeline has a dependency cycle involving node `%s`." cycle_node)
| Ok exec_order ->
let node_map = desugared_nodes in
let eval_or_defer name un current_env_ref =
if un.un_noop then VSymbol (Printf.sprintf "<noop:%s>" name)
else if un.un_runtime = "T" then
let node_deps = match List.assoc_opt name deps with Some d -> d | None -> [] in
let is_unbuilt d =
match Env.find_opt d !current_env_ref with
| Some (VComputedNode _) -> true
| Some _ -> false
| None ->
(* If d is not in the environment, it must either be a sibling node
in this pipeline or a latent cross-pipeline dependency that will
be resolved later (e.g., via union). In both cases, we must defer. *)
true
in
let is_raw = match un.un_command.node with RawCode _ -> true | _ -> false in
if is_raw || List.exists is_unbuilt node_deps then
VComputedNode {
cn_name = name;
cn_runtime = "T";
cn_path = "<unbuilt>";
cn_serializer = Nix_unparse.expr_to_string un.un_serializer;
cn_class = "Unknown";
cn_dependencies = node_deps;
}
else
let get_strategy dep_name =
let rec lookup_in_list target = function
| [] -> None
| (Some n, e) :: _ when n = target -> Some e
| _ :: rest -> lookup_in_list target rest
in
let rec lookup_in_dict target = function
| [] -> None
| (n, e) :: _ when n = target -> Some e
| _ :: rest -> lookup_in_dict target rest
in
let strategy_expr = match un.un_deserializer.node with
| Ast.ListLit items -> (match lookup_in_list dep_name items with Some e -> e | None -> un.un_deserializer)
| Ast.DictLit items -> (match lookup_in_dict dep_name items with Some e -> e | None -> un.un_deserializer)
| _ -> un.un_deserializer
in
match strategy_expr.node with
| Ast.Value (Ast.VString s) -> s
| Ast.Var s -> s
| _ -> "default"
in
let env_with_deserialized = List.fold_left (fun acc dname ->
let strategy = get_strategy dname in
match Env.find_opt dname acc with
| Some (VComputedNode cn) when strategy = "json" && cn.cn_serializer = "json" ->
(match Serialization.read_json cn.cn_path with
| Ok v -> Env.add dname v acc
| Error msg ->
Printf.eprintf "Warning: Automatic JSON deserialization failed for dependency `%s` of node `%s`: %s\n%!" dname name msg;
acc)
| Some (VComputedNode cn) when strategy = "pmml" && cn.cn_serializer = "pmml" ->
(match Pmml_utils.read_pmml cn.cn_path with
| Ok v -> Env.add dname (Pmml_utils.attach_source_path cn.cn_path v) acc
| Error msg ->
Printf.eprintf "Warning: Automatic PMML deserialization failed for dependency `%s` of node `%s`: %s\n%!" dname name msg;
acc)
| _ -> acc
) !current_env_ref node_deps in
let result = eval_expr (ref env_with_deserialized) un.un_command in
match result with
| VError { code = MissingArtifactError; _ } ->
(* Fallback: if execution failed because of missing artifact, defer to Nix *)
VComputedNode {
cn_name = name;
cn_runtime = un.un_runtime;
cn_path = "<unbuilt>";
cn_serializer = Nix_unparse.unparse_expr un.un_serializer;
cn_class = "Unknown";
cn_dependencies = node_deps;
}
| _ -> result |> annotate_pipeline_error ~runtime:un.un_runtime name
else VComputedNode {
cn_name = name;
cn_runtime = un.un_runtime;
cn_path = "<unbuilt>";
cn_serializer = Nix_unparse.expr_to_string un.un_serializer;
cn_class = "Unknown";
cn_dependencies = (match List.assoc_opt name deps with Some d -> d | None -> []);
}
in
let (results, diagnostics, _) = List.fold_left (fun (results, diagnostics, current_env_ref) name ->
let un = match List.assoc_opt name node_map with Some u -> u | None ->
{ Ast.un_command = Ast.mk_expr (Ast.Value (VNA NAGeneric)); un_script = None; un_runtime = "T";
un_serializer = Ast.mk_expr (Ast.Var "default"); un_deserializer = Ast.mk_expr (Ast.Var "default");
un_env_vars = []; un_args = []; un_shell = None; un_shell_args = [];
un_functions = []; un_includes = []; un_noop = false; un_dependencies = None } in
let node_deps = match List.assoc_opt name deps with Some d -> d | None -> [] in
let (v, own_warnings) = capture_node_warnings (fun () -> eval_or_defer name un current_env_ref) in
let node_diagnostics =
build_node_diagnostics name node_deps own_warnings diagnostics v
in
current_env_ref := Env.add name v !current_env_ref;
((name, v) :: results, (name, node_diagnostics) :: diagnostics, current_env_ref)
) ([], [], ref !env_ref) exec_order in
let p_nodes = List.rev results in
let p_node_diagnostics = List.rev diagnostics in
if verbose then print_pipeline_diagnostics_summary p_node_diagnostics;
VPipeline {
p_nodes;
p_exprs = List.map (fun (name, un) -> (name, un.un_command)) desugared_nodes;
p_deps = deps;
p_imports = !current_imports;
p_runtimes = runtime_mapping;
p_serializers = List.map (fun (name, un) -> (name, un.un_serializer)) desugared_nodes;
p_deserializers = List.map (fun (name, un) -> (name, un.un_deserializer)) desugared_nodes;
p_env_vars = List.map (fun (name, un) -> (name, un.un_env_vars)) desugared_nodes;
p_args = List.map (fun (name, un) -> (name, un.un_args)) desugared_nodes;
p_shells = List.map (fun (name, un) -> (name, un.un_shell)) desugared_nodes;
p_shell_args = List.map (fun (name, un) -> (name, un.un_shell_args)) desugared_nodes;
p_functions = List.map (fun (name, un) -> (name, un.un_functions)) desugared_nodes;
p_includes = List.map (fun (name, un) -> (name, un.un_includes)) desugared_nodes;
p_noops = List.map (fun (name, un) -> (name, un.un_noop)) desugared_nodes;
p_scripts = List.map (fun (name, un) -> (name, un.un_script)) desugared_nodes;
p_explicit_deps = List.map (fun (name, un) -> (name, un.un_dependencies)) desugared_nodes;
p_node_diagnostics;
}
(** Re-run a pipeline *)
and rerun_pipeline ?(strict=false) ?(verbose=true) env_ref (prev : Ast.pipeline_result) : value =
let node_names = List.map fst prev.p_exprs in
let desugared_nodes = List.map (fun (name, expr) ->
(name, {
Ast.un_command = expr;
un_script = (match List.assoc_opt name prev.p_scripts with Some s -> s | None -> None);
un_runtime = (match List.assoc_opt name prev.p_runtimes with Some r -> r | None -> "T");
un_serializer = (match List.assoc_opt name prev.p_serializers with Some s -> s | None -> Ast.mk_expr (Ast.Var "default"));
un_deserializer = (match List.assoc_opt name prev.p_deserializers with Some d -> d | None -> Ast.mk_expr (Ast.Var "default"));
un_env_vars = (match List.assoc_opt name prev.p_env_vars with Some vars -> vars | None -> []);
un_args = (match List.assoc_opt name prev.p_args with Some runtime_args -> runtime_args | None -> []);
un_shell = (match List.assoc_opt name prev.p_shells with Some s -> s | None -> None);
un_shell_args = (match List.assoc_opt name prev.p_shell_args with Some s_args -> s_args | None -> []);
un_functions = (match List.assoc_opt name prev.p_functions with Some f -> f | None -> []);
un_includes = (match List.assoc_opt name prev.p_includes with Some i -> i | None -> []);
un_noop = (match List.assoc_opt name prev.p_noops with Some b -> b | None -> false);
un_dependencies = (match List.assoc_opt name prev.p_explicit_deps with Some d -> d | None -> None);
})
) prev.p_exprs in
match topo_sort desugared_nodes prev.p_deps with
| Error cycle_node ->
Error.value_error (Printf.sprintf "Pipeline has a dependency cycle involving node `%s`." cycle_node)
| Ok exec_order ->
let rerun_eval_or_defer name un current_env_ref =
if un.un_noop then VSymbol (Printf.sprintf "<noop:%s>" name)
else if un.un_runtime = "T" then
let node_deps = match List.assoc_opt name prev.p_deps with Some d -> d | None -> [] in
let is_unbuilt d =
match Env.find_opt d !current_env_ref with
| Some (VComputedNode _) -> true
| Some _ -> false
| None -> true
in
let is_raw = match un.un_command.node with RawCode _ -> true | _ -> false in
if is_raw || List.exists is_unbuilt node_deps then
VComputedNode {
cn_name = name;
cn_runtime = "T";
cn_path = "<unbuilt>";
cn_serializer = Nix_unparse.expr_to_string un.un_serializer;
cn_class = "Unknown";
cn_dependencies = node_deps;
}
else
let get_strategy dep_name =
let rec lookup_in_list target = function
| [] -> None | (Some n, e) :: _ when n = target -> Some e | _ :: rest -> lookup_in_list target rest
in
let rec lookup_in_dict target = function
| [] -> None | (n, e) :: _ when n = target -> Some e | _ :: rest -> lookup_in_dict target rest
in
let strategy_expr = match un.un_deserializer.node with
| Ast.ListLit items -> (match lookup_in_list dep_name items with Some e -> e | None -> un.un_deserializer)
| Ast.DictLit items -> (match lookup_in_dict dep_name items with Some e -> e | None -> un.un_deserializer)
| _ -> un.un_deserializer
in
match strategy_expr.node with
| Ast.Value (Ast.VString s) -> s
| Ast.Var s -> s
| _ -> "default"
in
let env_with_deserialized = List.fold_left (fun acc dname ->
let strategy = get_strategy dname in
match Env.find_opt dname acc with
| Some (VComputedNode cn) when strategy = "json" && cn.cn_serializer = "json" ->
(match Serialization.read_json cn.cn_path with Ok v -> Env.add dname v acc | Error _ -> acc)
| Some (VComputedNode cn) when strategy = "pmml" && cn.cn_serializer = "pmml" ->
(match Pmml_utils.read_pmml cn.cn_path with Ok v -> Env.add dname (Pmml_utils.attach_source_path cn.cn_path v) acc | Error _ -> acc)
| _ -> acc
) !current_env_ref node_deps in
let result = eval_expr (ref env_with_deserialized) un.un_command in
match result with
| VError { code = MissingArtifactError; _ } ->
VComputedNode {
cn_name = name; cn_runtime = un.un_runtime; cn_path = "<unbuilt>";
cn_serializer = Nix_unparse.unparse_expr un.un_serializer; cn_class = "Unknown";
cn_dependencies = node_deps;
}
| _ -> result |> annotate_pipeline_error ~runtime:un.un_runtime name
else
let node_deps = match List.assoc_opt name prev.p_deps with Some d -> d | None -> [] in
if strict then begin
match List.find_opt (fun d -> not (List.mem d node_names) && not (Env.mem d !env_ref)) node_deps with
| Some missing ->
Error.make_error NameError (Printf.sprintf "Pipeline node `%s` depends on unknown identifier `%s`." name missing)
| None ->
VComputedNode {
cn_name = name; cn_runtime = un.un_runtime; cn_path = "<unbuilt>";
cn_serializer = (match un.un_serializer.node with Ast.Value (Ast.VString s) -> s | _ -> Nix_unparse.unparse_expr un.un_serializer);
cn_class = "Unknown"; cn_dependencies = node_deps;
}
end else
VComputedNode {
cn_name = name; cn_runtime = un.un_runtime; cn_path = "<unbuilt>";
cn_serializer = (match un.un_serializer.node with Ast.Value (Ast.VString s) -> s | _ -> Nix_unparse.unparse_expr un.un_serializer);
cn_class = "Unknown"; cn_dependencies = node_deps;
}
in
let (results, diagnostics, _, _) = List.fold_left (fun (results, diagnostics, current_env_ref, changed) name ->
let un = match List.assoc_opt name desugared_nodes with Some u -> u | None ->
{ Ast.un_command = Ast.mk_expr (Ast.Value (VNA NAGeneric)); un_script = None; un_runtime = "T";
un_serializer = Ast.mk_expr (Ast.Var "default"); un_deserializer = Ast.mk_expr (Ast.Var "default");
un_env_vars = []; un_args = []; un_shell = None; un_shell_args = [];
un_functions = []; un_includes = []; un_noop = false; un_dependencies = None } in
let node_deps = match List.assoc_opt name prev.p_deps with Some d -> d | None -> [] in
let deps_changed = List.exists (fun d -> List.mem d changed) node_deps in
let fv = free_vars un.un_command in
let external_deps = List.filter (fun v -> not (List.mem v node_names)) fv in
let external_changed = List.exists (fun v ->
let old_val = Env.find_opt v !env_ref in
let prev_val = match List.assoc_opt v prev.p_nodes with Some x -> Some x | None -> None in
old_val <> prev_val
) external_deps in
if deps_changed || external_changed then begin
let (v, own_warnings) = capture_node_warnings (fun () -> rerun_eval_or_defer name un current_env_ref) in
let node_diagnostics =
build_node_diagnostics name node_deps own_warnings diagnostics v
in
current_env_ref := Env.add name v !current_env_ref;
((name, v) :: results, (name, node_diagnostics) :: diagnostics, current_env_ref, name :: changed)
end else begin
let cached = match List.assoc_opt name prev.p_nodes with
| Some v -> v
| None -> VNA NAGeneric
in
let cached_diagnostics =
match List.assoc_opt name prev.p_node_diagnostics with
| Some diagnostics -> diagnostics
| None -> Ast.Utils.empty_node_diagnostics
in
current_env_ref := Env.add name cached !current_env_ref;
((name, cached) :: results, (name, cached_diagnostics) :: diagnostics, current_env_ref, changed)
end
) ([], [], ref !env_ref, []) exec_order in
let p_node_diagnostics = List.rev diagnostics in
if verbose then print_pipeline_diagnostics_summary p_node_diagnostics;
VPipeline { prev with p_nodes = List.rev results; p_node_diagnostics }
(** Evaluate a splice operand (!!!) and expand its elements as named pairs.
Used by quote_expr in Call args, ListLit items, and DictLit pairs. *)
and splice_into_named_pairs env_ref fallback_name e =
match eval_expr env_ref e with
| VList items -> List.map (fun (n, v) -> (n, vexpr v)) items
| VDict items -> List.map (fun (k, v) -> (Some k, vexpr v)) items
| VVector arr -> Array.to_list arr |> List.map (fun v -> (None, vexpr v))
| other ->
let msg = "!!! operand must evaluate to a List, Vector, or Dict, got "
^ Utils.type_name other in
[(fallback_name, vexpr (make_error TypeError msg))]
(** Evaluate a splice operand for DictLit pairs (string-keyed). *)
and splice_into_dict_pairs env_ref fallback_key e =
match eval_expr env_ref e with
| VDict items -> List.map (fun (k, v) -> (k, vexpr v)) items
| VList items ->
List.map (fun (name, v) ->
let key = match name with Some n -> n | None -> fallback_key in
(key, vexpr v)
) items
| other ->
let msg = "!!! operand must evaluate to a List, Vector, or Dict, got "
^ Utils.type_name other in
[(fallback_key, vexpr (make_error TypeError msg))]
and extract_name_opt v =
let strip_dollar s =
if String.length s > 0 && s.[0] = '$' then String.sub s 1 (String.length s - 1) else s
in
match v with
| VString s -> Some s
| VSymbol s -> Some (strip_dollar s)
| VExpr e ->
(match e.node with
| Var s -> Some s
| ColumnRef s -> Some s
| Value (VString s) -> Some s
| Value (VSymbol s) -> Some (strip_dollar s)
| _ -> Some (Nix_unparse.unparse_expr e))
| VQuo { q_expr = e; _ } ->
(match e.node with
| Var s -> Some s
| ColumnRef s -> Some s
| Value (VString s) -> Some s
| Value (VSymbol s) -> Some (strip_dollar s)
| _ -> Some (Nix_unparse.unparse_expr e))
| _ -> None
(** Expand a !!name := value dynamic argument inside a quoting context.
@param env_ref The current evaluation environment reference (for evaluating n_expr).
@param loc Source location to attach to any generated error expressions.
@param n_expr The expression for the left-hand name (must eval to String/Symbol).
@param v_expr The expression for the right-hand value.
@return A pair of type [(string option * Ast.expr)]:
[(Some name_str, quoted_value)] on success, or
[(None, error_expression)] when the name does not evaluate to a
String or Symbol. The caller should propagate the error expression
so it surfaces at evaluation time. *)
and quote_dyn_arg env_ref loc n_expr v_expr =
let q = quote_expr env_ref in
let name_val = eval_expr env_ref n_expr in
match extract_name_opt name_val with
| Some name_str -> (Some name_str, q v_expr)
| None ->
(None, Ast.mk_expr ?loc (Value (make_error TypeError
(Printf.sprintf "!! := requires a String or Symbol as the left-hand name, got %s"
(Utils.type_name name_val)))))
(** Quote an expression: recursively walk the AST, leaving it unevaluated
except where !! (unquote) and !!! (unquote-splice) request evaluation. *)
and quote_expr (env_ref : environment ref) (expr : Ast.expr) : Ast.expr =
let q = quote_expr env_ref in
let qs = quote_stmt env_ref in
let qpair (n, e) = (n, q e) in
let loc = expr.loc in
match expr.node with
(* ── Unquoting ─────────────────────────────────────────────── *)
| Unquote e ->
(match eval_expr env_ref e with
| VExpr ex -> ex
| VQuo { q_expr; _ } -> q_expr (* strip env: !! injects just the expression *)
| v -> Ast.mk_expr ?loc (Value v))
| UnquoteSplice _ ->
Ast.mk_expr ?loc (Value (make_error TypeError
"!!! can only be used inside a Call, List, or Dict literal within expr()"))
(* ── Compound forms that support !!! splicing and !! dynamic names ── *)
| Call { fn; args } ->
let quoted_args = List.concat_map (fun (name, arg) ->
match name, arg.node with
| None, Call { fn = { node = Var "__dynamic_arg__"; _ }; args = [(_, n_expr); (_, v_expr)] } ->
[quote_dyn_arg env_ref loc n_expr v_expr]
| _, UnquoteSplice e -> splice_into_named_pairs env_ref name e
| _ -> [(name, q arg)]
) args in
Ast.mk_expr ?loc (Call { fn = q fn; args = quoted_args })
| ListLit items ->
let quoted = List.concat_map (fun (name, item) ->
match name, item.node with
| None, Call { fn = { node = Var "__dynamic_arg__"; _ }; args = [(_, n_expr); (_, v_expr)] } ->
[quote_dyn_arg env_ref loc n_expr v_expr]
| _, UnquoteSplice e -> splice_into_named_pairs env_ref name e
| _ -> [(name, q item)]
) items in
Ast.mk_expr ?loc (ListLit quoted)
| DictLit pairs ->
let quoted = List.concat_map (fun (k, v) ->
match v.node with
| UnquoteSplice e -> splice_into_dict_pairs env_ref k e
| Call { fn = { node = Var "__dynamic_arg__"; _ }; args = [(_, n_expr); (_, v_expr)] } ->
let (opt_name, qv) = quote_dyn_arg env_ref loc n_expr v_expr in
(* When name extraction failed, opt_name is None and qv is a VError expression.
Use "__dyn_error__" as the placeholder key so the dict stays structurally valid
and the error is unambiguous when the dict is evaluated. *)
let name_str = match opt_name with Some n -> n | None -> "__dyn_error__" in
[(name_str, qv)]
| _ -> [(k, q v)]
) pairs in
Ast.mk_expr ?loc (DictLit quoted)
(* ── Binary / unary operators ──────────────────────────────── *)
| BinOp { op; left; right } -> Ast.mk_expr ?loc (BinOp { op; left = q left; right = q right })
| BroadcastOp { op; left; right } -> Ast.mk_expr ?loc (BroadcastOp { op; left = q left; right = q right })
| UnOp { op; operand } -> Ast.mk_expr ?loc (UnOp { op; operand = q operand })
(* ── Control flow / structure ───────────────────────────────── *)
| IfElse { cond; then_; else_ } ->
Ast.mk_expr ?loc (IfElse { cond = q cond; then_ = q then_; else_ = q else_ })
| Match { scrutinee; cases } ->
Ast.mk_expr ?loc (Match {
scrutinee = q scrutinee;
cases = List.map (fun (pattern, body) -> (pattern, q body)) cases;
})
| Block stmts -> Ast.mk_expr ?loc (Block (List.map qs stmts))
| Lambda l -> Ast.mk_expr ?loc (Lambda { l with body = q l.body })
| DotAccess { target; field } -> Ast.mk_expr ?loc (DotAccess { target = q target; field })
(* ── Named-pair containers ─────────────────────────────────── *)
| PipelineDef nodes -> Ast.mk_expr ?loc (PipelineDef (List.map qpair nodes))
| IntentDef fields -> Ast.mk_expr ?loc (IntentDef (List.map qpair fields))
(* ── List comprehension ────────────────────────────────────── *)
| ListComp { expr = e; clauses } ->
let qclause = function
| CFor { var; iter } -> CFor { var; iter = q iter }
| CFilter filter_expr -> CFilter (q filter_expr)
in
Ast.mk_expr ?loc (ListComp { expr = q e; clauses = List.map qclause clauses })
(* ── Leaves (Value, Var, ColumnRef, RawCode) pass through ── *)
| _ -> expr
and quote_stmt (env_ref : environment ref) (stmt : Ast.stmt) : Ast.stmt =
let q = quote_expr env_ref in
let loc = stmt.loc in
match stmt.node with
| Expression e -> Ast.mk_stmt ?loc (Expression (q e))
| Assignment { name; typ; expr } -> Ast.mk_stmt ?loc (Assignment { name; typ; expr = q expr })
| Reassignment { name; expr } -> Ast.mk_stmt ?loc (Reassignment { name; expr = q expr })
| _ -> stmt
and eval_list_lit env_ref items =
let rec process_items acc = function
| [] -> VList (List.rev acc)
| (name, e) :: rest ->
let v = match e.node with
| Call { fn = { node = Var "__dynamic_arg__"; _ }; args = [(_, n_expr); (_, v_expr)] } ->
let n_val = eval_expr env_ref n_expr in
(match extract_name_opt n_val with
| None -> make_error TypeError (Printf.sprintf "!! := requires a String or Symbol as the left-hand name, got %s" (Utils.type_name n_val))
| Some n -> VDynamicArg (n, eval_expr env_ref v_expr))
| _ -> eval_expr env_ref e
in
match v with
| VError _ as err -> err
| VUnquote inner -> process_items ((name, inner) :: acc) rest
| VUnquoteSplice sv ->
let units = match sv with
| VList items -> items
| VVector vx -> Array.to_list vx |> List.map (fun x -> (None, x))
| VDict d -> List.map (fun (k, v) -> (Some k, v)) d
| _ -> [(name, sv)]
in
process_items (List.rev_append units acc) rest
| VDynamicArg (n, v) ->
process_items ((Some n, v) :: acc) rest
| _ -> process_items ((name, v) :: acc) rest
in
process_items [] items
and eval_dict_lit env_ref items =
let rec process_pairs acc = function
| [] -> VDict (List.rev acc)
| (k, e) :: rest ->
let v = match e.node with
| Call { fn = { node = Var "__dynamic_arg__"; _ }; args = [(_, n_expr); (_, v_expr)] } ->
let n_val = eval_expr env_ref n_expr in
(match extract_name_opt n_val with
| None -> make_error TypeError (Printf.sprintf "!! := requires a String or Symbol as the left-hand name, got %s" (Utils.type_name n_val))
| Some n -> VDynamicArg (n, eval_expr env_ref v_expr))
| _ -> eval_expr env_ref e
in
match v with
| VError _ as err -> err
| VUnquote inner -> process_pairs ((k, inner) :: acc) rest
| VUnquoteSplice sv ->
let units = match sv with
| VDict d -> d
| VList items -> List.map (fun (n, v) -> (match n with Some name -> name | None -> "expr"), v) items
| VVector vx -> Array.to_list vx |> List.mapi (fun i x -> (string_of_int i, x))
| _ -> [(k, sv)]
in
process_pairs (List.rev_append units acc) rest
| VDynamicArg (n, v) ->
process_pairs ((n, v) :: acc) rest
| _ -> process_pairs ((k, v) :: acc) rest
in
process_pairs [] items
and eval_dot_access env_ref target_expr field =
let target_val = eval_expr env_ref target_expr in
match target_val with
| VNodeResult { diagnostics; _ } ->
(match field with
| "warnings" ->
(match Utils.node_diagnostics_to_value diagnostics with
| VDict p -> (match List.assoc_opt "warnings" p with Some v -> v | None -> VNA NAGeneric)
| _ -> VNA NAGeneric)
| "error" ->
(match Utils.node_diagnostics_to_value diagnostics with
| VDict p -> (match List.assoc_opt "error" p with Some v -> v | None -> VNA NAGeneric)
| _ -> VNA NAGeneric)
| _ -> eval_dot_access_val env_ref (Utils.unwrap_value target_val) field)
| _ -> eval_dot_access_val env_ref target_val field
and eval_dot_access_val _env_ref target_val field =
(* Helper: check if any column name in the table starts with the given prefix *)
let has_column_prefix arrow_table prefix =
let pfx = prefix ^ "." in
let pfx_len = String.length pfx in
List.exists (fun c -> String.length c > pfx_len &&
String.sub c 0 pfx_len = pfx)
(Arrow_table.column_names arrow_table)
in
match target_val with
| VDict pairs ->
(match List.assoc_opt field pairs with
| Some v -> v
| None ->
(* Check for partial dot-access on a DataFrame (e.g. df.Petal -> df."Petal.Length").
Internal keys __partial_dot_df__ and __partial_dot_prefix__ carry the original
DataFrame and accumulated prefix through chained dot accesses. *)
(match List.assoc_opt "__partial_dot_df__" pairs with
| Some (VDataFrame { arrow_table; _ } as df_val) ->
let prefix = (match List.assoc_opt "__partial_dot_prefix__" pairs with
| Some (VString s) -> s | _ -> "") in
let compound = prefix ^ "." ^ field in
(match Arrow_column.get_column arrow_table compound with
| Some col_view -> VVector (Array.of_list (Arrow_column.column_view_to_list col_view))
| None ->
if has_column_prefix arrow_table compound
then VDict [("__partial_dot_df__", df_val);
("__partial_dot_prefix__", VString compound)]
else Error.index_error (0) (0) (* Placeholder as original did not have index info, using KeyError context *)
|> fun _ -> Error.make_error KeyError (Printf.sprintf "Column `%s` not found in DataFrame." compound))
| _ ->
(* Check for partial dot-access on a plain dict with compound keys
(e.g. row.Petal.Length where dict has key "Petal.Length").
Internal keys __partial_dot_dict__ and __partial_dot_prefix__ carry the
original dict pairs and accumulated prefix through chained dot accesses. *)
(match List.assoc_opt "__partial_dot_dict__" pairs with
| Some (VDict orig_pairs) ->
let prefix = (match List.assoc_opt "__partial_dot_prefix__" pairs with
| Some (VString s) -> s | _ -> "") in
let compound = if prefix = "" then field else prefix ^ "." ^ field in
(match List.assoc_opt compound orig_pairs with
| Some v -> v
| None ->
let cpfx = compound ^ "." in
let cpfx_len = String.length cpfx in
if List.exists (fun (k, _) ->
String.length k > cpfx_len && String.sub k 0 cpfx_len = cpfx) orig_pairs
then VDict [("__partial_dot_dict__", VDict orig_pairs);
("__partial_dot_prefix__", VString compound)]
else Error.make_error KeyError (Printf.sprintf "Key `%s` not found in Dict." compound))
| _ ->
(* Check if any keys have this field as a dotted prefix *)
let pfx = field ^ "." in
let pfx_len = String.length pfx in
if List.exists (fun (k, _) ->
String.length k > pfx_len && String.sub k 0 pfx_len = pfx) pairs
then VDict [("__partial_dot_dict__", VDict pairs);
("__partial_dot_prefix__", VString field)]
else Error.make_error KeyError (Printf.sprintf "Key `%s` not found in Dict." field))))
| VSymbol s ->
(match field with
| "path" ->
(match !Ast.node_resolver s with
| Some (VComputedNode cn) -> VString cn.cn_path
| Some (VNode _) -> VString "<unbuilt>"
| _ -> Error.make_error KeyError (Printf.sprintf "Symbol `%s` has no field `path` (and no built node with this name was found)." s))
| _ -> Error.make_error Ast.KeyError (Printf.sprintf "Symbol has no field `%s`" field))
| VList named_items ->
(match List.find_opt (fun (name, _) -> name = Some field) named_items with
| Some (_, v) -> v
| None -> Error.make_error KeyError (Printf.sprintf "List has no named element `%s`." field))
| VDataFrame ({ arrow_table; _ } as df) ->
(* Use column views for efficient access — avoids redundant copies
when the column data is already available in the Arrow table. *)
(match Arrow_column.get_column arrow_table field with
| Some col_view -> VVector (Array.of_list (Arrow_column.column_view_to_list col_view))
| None ->
(* Column not found — check if there are columns with this prefix (e.g. "Petal.Length")
to support R-style dotted column names via chained dot access (df.Petal.Length) *)
if has_column_prefix arrow_table field
then VDict [("__partial_dot_df__", VDataFrame df);
("__partial_dot_prefix__", VString field)]
else Error.make_error KeyError (Printf.sprintf "Column `%s` not found in DataFrame." field))
| VPipeline { p_nodes; _ } ->
(match List.assoc_opt field p_nodes with
| Some v -> v
| None -> Error.make_error KeyError (Printf.sprintf "Node `%s` not found in Pipeline." field))
| VComputedNode cn ->
(match field with
| "name" -> VString cn.cn_name
| "runtime" -> VString cn.cn_runtime
| "path" -> VString cn.cn_path
| "serializer" -> VString cn.cn_serializer
| "class" -> VString cn.cn_class
| "dependencies" -> VList (List.map (fun d -> (None, VString d)) cn.cn_dependencies)
| _ -> Error.make_error Ast.KeyError (Printf.sprintf "ComputedNode has no field `%s`" field))
| VNode un ->
(match field with
| "command" -> VString (Nix_unparse.unparse_expr un.un_command)
| "script" -> (match un.un_script with Some p -> VString p | None -> (VNA NAGeneric))
| "runtime" -> VString un.un_runtime
| "path" -> VString "<unbuilt>"
| "serializer" -> VString (Nix_unparse.unparse_expr un.un_serializer)
| "deserializer" -> VString (Nix_unparse.unparse_expr un.un_deserializer)
| "args" -> VDict un.un_args
| "shell" -> (match un.un_shell with Some s -> VString s | None -> (VNA NAGeneric))
| "shell_args" -> VList (List.map (fun e -> (None, VString (Nix_unparse.unparse_expr e))) un.un_shell_args)
| "noop" -> VBool un.un_noop
| _ -> Error.make_error Ast.KeyError (Printf.sprintf "Node has no field `%s`" field))
| VSerializer s ->
(match field with
| "writer" -> s.s_writer
| "reader" -> s.s_reader
| "format" -> VString s.s_format
| "r_writer" -> (match s.s_r_writer with Some sw -> VRawCode sw | None -> (VNA NAGeneric))
| "r_reader" -> (match s.s_r_reader with Some sr -> VRawCode sr | None -> (VNA NAGeneric))
| "py_writer" -> (match s.s_py_writer with Some sw -> VRawCode sw | None -> (VNA NAGeneric))
| "py_reader" -> (match s.s_py_reader with Some sr -> VRawCode sr | None -> (VNA NAGeneric))
| _ -> Error.make_error Ast.KeyError (Printf.sprintf "Serializer has no field `%s`" field))
| VLens _ -> Error.make_error Ast.TypeError (Printf.sprintf "Field `%s` not found on Lens." field)
| VShellResult sr ->
(match field with
| "stdout" -> VString sr.sr_stdout
| "stderr" -> VString sr.sr_stderr
| "exit_code" -> VInt sr.sr_exit_code
| _ -> Error.make_error Ast.KeyError
(Printf.sprintf "ShellResult has no field `%s`. Available fields: stdout, stderr, exit_code." field))
| VError ({ code; message; context; location; na_count } as err) ->
(* Structured field access for Error values mirrors explain(error):
error_code, error_message, context, na_count, and optional
location-derived file/line/column fields (NA when unavailable).
Unknown fields preserve prior behavior by returning the original
error unchanged. *)
(match field with
| "error_code" -> VString (Utils.error_code_to_string code)
| "error_message" -> VString message
| "context" -> VDict context
| "na_count" -> VInt na_count
| "file" ->
(match location with
| Some { file = Some file; _ } -> VString file
| _ -> VNA NAGeneric)
| "line" ->
(match location with
| Some { line; _ } -> VInt line
| None -> VNA NAGeneric)
| "column" ->
(match location with
| Some { column; _ } -> VInt column
| None -> VNA NAGeneric)
| _ -> VError err)
| VNA _ -> Error.type_error "Cannot access field on NA."
| other -> Error.type_error (Printf.sprintf "Cannot access field `%s` on %s." field (Utils.type_name other))
and lambda_arity_error params args =
Error.arity_error (List.length params) (List.length args)
and autoquote_name_error ?location () =
make_error ?location TypeError
"Auto-quoted parameters expect a bare name, $column, String, or Symbol."
and autoquote_name_of_expr (expr : Ast.expr) : (string, value) result =
let normalize name =
let trimmed = String.trim name in
if trimmed = "" then Error (autoquote_name_error ?location:expr.loc ())
else Ok trimmed
in
match expr.node with
| Var name -> normalize name
| ColumnRef name -> normalize name
| Value (VString name) -> normalize name
| Value (VSymbol name) -> normalize (strip_dollar_prefix name)
| _ -> Error (autoquote_name_error ?location:expr.loc ())
and autoquote_capture_expr (expr : Ast.expr) : (Ast.expr * value, value) result =
match autoquote_name_of_expr expr with
| Ok name ->
let loc = expr.loc in
Ok (Ast.mk_expr ?loc (ColumnRef name), VSymbol name)
| Error _ as err -> err
and expand_autoquoted_unquotes (env_ref : environment ref) (expr : Ast.expr) : Ast.expr =
let loc = expr.loc in
let expand = expand_autoquoted_unquotes env_ref in
let expand_stmt stmt =
let stmt_loc = stmt.loc in
match stmt.node with
| Expression e -> Ast.mk_stmt ?loc:stmt_loc (Expression (expand e))
| Assignment { name; typ; expr = e } -> Ast.mk_stmt ?loc:stmt_loc (Assignment { name; typ; expr = expand e })
| Reassignment { name; expr = e } -> Ast.mk_stmt ?loc:stmt_loc (Reassignment { name; expr = expand e })
| Import _ | ImportPackage _ | ImportFrom _ | ImportFileFrom _ -> stmt
in
match expr.node with
| Unquote { node = Var name; _ } ->
(match Env.find_opt ("__aq_" ^ name) !env_ref with
| Some (VExpr captured) -> captured
| _ -> expr)
| Call { fn; args } ->
Ast.mk_expr ?loc (Call { fn = expand fn; args = List.map (fun (name, e) -> (name, expand e)) args })
| BinOp { op; left; right } ->
Ast.mk_expr ?loc (BinOp { op; left = expand left; right = expand right })
| BroadcastOp { op; left; right } ->
Ast.mk_expr ?loc (BroadcastOp { op; left = expand left; right = expand right })
| UnOp { op; operand } ->
Ast.mk_expr ?loc (UnOp { op; operand = expand operand })
| IfElse { cond; then_; else_ } ->
Ast.mk_expr ?loc (IfElse { cond = expand cond; then_ = expand then_; else_ = expand else_ })
| Match { scrutinee; cases } ->
Ast.mk_expr ?loc (Match { scrutinee = expand scrutinee; cases = List.map (fun (pattern, body) -> (pattern, expand body)) cases })
| ListLit items ->
Ast.mk_expr ?loc (ListLit (List.map (fun (name, e) -> (name, expand e)) items))
| ListComp { expr = inner; clauses } ->
let clauses =
List.map (function
| CFor { var; iter } -> CFor { var; iter = expand iter }
| CFilter filter_expr -> CFilter (expand filter_expr)
) clauses
in
Ast.mk_expr ?loc (ListComp { expr = expand inner; clauses })
| DictLit pairs ->
Ast.mk_expr ?loc (DictLit (List.map (fun (name, e) -> (name, expand e)) pairs))
| DotAccess { target; field } ->
Ast.mk_expr ?loc (DotAccess { target = expand target; field })
| PipelineDef nodes ->
Ast.mk_expr ?loc (PipelineDef (List.map (fun (name, e) -> (name, expand e)) nodes))
| IntentDef pairs ->
Ast.mk_expr ?loc (IntentDef (List.map (fun (name, e) -> (name, expand e)) pairs))
| Unquote inner ->
Ast.mk_expr ?loc (Unquote (expand inner))
| UnquoteSplice inner ->
Ast.mk_expr ?loc (UnquoteSplice (expand inner))
| Lambda l ->
Ast.mk_expr ?loc (Lambda { l with body = expand l.body })
| Block stmts ->
Ast.mk_expr ?loc (Block (List.map expand_stmt stmts))
| Value _ | Var _ | ColumnRef _ | RawCode _ | ShellExpr _ -> expr
and eval_call env_ref fn_val raw_args =
let current_builtin_name =
match fn_val with
| VBuiltin { b_name; _ } -> b_name
| _ -> None
in
let lambda_autoquote_flags =
match fn_val with
| VLambda { autoquote_params; _ } -> Some (Array.of_list autoquote_params)
| _ -> None
in
(* We capture canonicalized autoquote expressions while processing arguments so
the later lambda-application path can expose them through `__aq_<name>`
without re-walking/evaluating the original argument list. *)
let autoquote_captured_exprs : (int * Ast.expr) list ref = ref [] in
let is_autoquoted_fixed_param index =
match lambda_autoquote_flags with
| Some flags when index < Array.length flags -> flags.(index)
| _ -> false
in
let make_scoped_lambda param body =
Ast.mk_expr (Lambda {
params = [param];
autoquote_params = [false];
param_types = [None];
return_type = None;
generic_params = [];
variadic = false;
body;
env = None;
})
in
let make_row_lambda body = make_scoped_lambda "row" body in
let make_node_lambda body = make_scoped_lambda "node" body in
(* NSE auto-transformation: if an argument is a complex expression containing
ColumnRef nodes (not a bare ColumnRef), wrap it in a lambda \(row) <desugared>
before evaluation. Bare ColumnRef stays as-is (evaluates to VSymbol). *)
let uses_nse_builtin name =
match name with
| Some ("mutate" | "mutate_node"
| "summarize" | "summarize_node"
| "filter" | "filter_node"
| "which_nodes"
| "select" | "select_node"
| "arrange" | "arrange_node"
| "group_by" | "group_by_node"
| "count" | "count_node"
| "rename" | "rename_node"
| "pivot_longer" | "pivot_longer_node"
| "pivot_wider" | "pivot_wider_node"
| "node" | "py" | "pyn" | "rn" | "qn" | "shn" | "inspect") -> true
| _ -> false
in
let transform_nse_args args =
if not (uses_nse_builtin current_builtin_name) then args
else
List.map (fun (name, expr) ->
let expr = expand_autoquoted_unquotes env_ref expr in
let loc = expr.loc in
match expr.node with
| Call { fn = { node = Var "n"; _ }; args = [] }
when current_builtin_name = Some "summarize" && Option.is_some name ->
(name, make_row_lambda (Ast.mk_expr (Call { fn = varexpr "n"; args = [(None, varexpr "row")] })))
| ColumnRef _ -> (name, expr) (* bare $col → keep, evaluates to VSymbol *)
| Call { fn = { node = Var "__dynamic_arg__"; _ }; args = [n_arg; (v_name, v_expr)] } ->
(* Support NSE inside the value part of a dynamic argument (!!name := <NSE>) *)
if uses_nse v_expr then
let desugared = desugar_nse_expr v_expr in
(name, Ast.mk_expr ?loc (Call { fn = Ast.mk_expr ?loc (Var "__dynamic_arg__");
args = [n_arg; (v_name, make_row_lambda desugared)] }))
else
(name, expr)
| ListLit items when List.for_all (fun (_, e) -> match e.node with ColumnRef _ -> true | _ -> false) items ->
(name, expr) (* list of bare $cols → keep as-is *)
| _ when current_builtin_name = Some "which_nodes"
&& expr_uses_named_scope_fields node_record_scope_fields expr ->
let desugared = desugar_named_scope_expr ~root:"node" ~fields:node_record_scope_fields expr in
(name, make_node_lambda desugared)
| _ when uses_nse expr ->
(* Complex expression with NSE → wrap in a scoped lambda.
The only positional Call expressions that stay raw are selector helpers
passed to select/select_node, where the call itself interprets the NSE
arguments. Predicate/row expressions such as filter_node(is_na($x))
must be wrapped so they evaluate against the current row/node scope. *)
(match name, expr.node with
| None, Call _
when current_builtin_name = Some "select"
|| current_builtin_name = Some "select_node" ->
(name, expr)
| None, BinOp { op = (Pipe | MaybePipe); _ } -> (name, expr)
| _ ->
let desugared = desugar_nse_expr expr in
(name, make_row_lambda desugared))
| _ -> (name, expr)
) args
in
let raw_args = transform_nse_args raw_args in
(* Special case: rm() needs to capture symbols before evaluation to remove variables by name.
Without this, rm(x) evaluates x to its value and then tries to remove a variable
named with that VALUE (e.g. if x="val", it removes variable "val", not "x").
This also handles the R-style rm(list = ...) named argument. *)
if current_builtin_name = Some "rm" then (
List.iter (fun (arg_name, e) ->
match arg_name with
| Some "list" ->
let v = eval_expr env_ref e in
(match v with
| VList items ->
List.iter (fun (_, item) ->
match extract_name_opt item with
| Some s -> env_ref := Env.remove s !env_ref
| None -> ()) items
| _ ->
(match extract_name_opt v with
| Some s -> env_ref := Env.remove s !env_ref
| None -> ()))
| _ ->
match e.node with
| Var s -> env_ref := Env.remove s !env_ref
| ColumnRef s -> env_ref := Env.remove ("$" ^ s) !env_ref
| _ ->
let v = eval_expr env_ref e in
(match extract_name_opt v with
| Some s -> env_ref := Env.remove s !env_ref
| None -> ())
) raw_args;
(VNA NAGeneric)
) else begin
let rec process_args_spliced acc param_index = function
| [] -> acc
| (name, e) :: rest ->
if is_autoquoted_fixed_param param_index then
let next_acc =
match autoquote_capture_expr e with
| Ok (captured_expr, captured_value) ->
autoquote_captured_exprs := (param_index, captured_expr) :: !autoquote_captured_exprs;
acc @ [(name, captured_value)]
| Error err ->
acc @ [(name, err)]
in
process_args_spliced next_acc (param_index + 1) rest
else
let v = match e.node with
| Call { fn = { node = Var "__dynamic_arg__"; _ }; args = [(_, name_expr); (_, value_expr)] } ->
let n_val = eval_expr env_ref name_expr in
(match extract_name_opt n_val with
| None -> make_error TypeError (Printf.sprintf "!! := requires a String or Symbol as the left-hand name, got %s" (Utils.type_name n_val))
| Some n -> VDynamicArg (n, eval_expr env_ref value_expr))
| _ -> eval_expr env_ref e
in
match v with
| VUnquote inner -> process_args_spliced (acc @ [(name, inner)]) (param_index + 1) rest
| VUnquoteSplice sv ->
let units = match sv with
| VList items -> items
| VVector vx -> Array.to_list vx |> List.map (fun x -> (None, x))
| VDict d -> List.map (fun (k, v) -> (Some k, v)) d
| _ -> [(name, sv)]
in
process_args_spliced (acc @ units) (param_index + List.length units) rest
| VDynamicArg (n, v) ->
process_args_spliced (acc @ [(Some n, v)]) (param_index + 1) rest
| _ -> process_args_spliced (acc @ [(name, v)]) (param_index + 1) rest
in
let named_args = process_args_spliced [] 0 raw_args in
(* Apply a user lambda, including the autoquote-specific `__aq_<name>` bindings
used to re-expand `!!param` inside NSE-aware builtins. *)
let apply_lambda base_env params autoquote_params param_types return_type variadic body =
let args_vals = List.map snd named_args in
let n_params = List.length params in
let n_args = List.length args_vals in
if (not variadic && n_params <> n_args) || (variadic && n_args < n_params) then
lambda_arity_error params args_vals
else
let fixed_args = take_prefix n_params args_vals in
let autoquote_error =
List.find_map (fun (value, is_autoquoted) ->
if is_autoquoted then
match value with
| VError _ as e -> Some e
| _ -> None
else
None
) (List.combine fixed_args autoquote_params)
in
match autoquote_error with
| Some err -> err
| None ->
let type_errors = List.filter_map (fun (v, t_opt) ->
match t_opt with
| Some t when not (Ast.is_compatible v t) ->
let expected = Ast.Utils.typ_to_string t in
let got = Ast.Utils.type_name v in
Some (Printf.sprintf "Expected %s, got %s" expected got)
| _ -> None
) (List.combine fixed_args param_types) in
if type_errors <> [] then
Error.type_error (String.concat "; " type_errors)
else
let call_env =
List.fold_left2
(fun current_env name value -> Env.add name value current_env)
base_env params fixed_args
in
let caller_env = !env_ref in
let call_raw_args = List.map snd raw_args in
let fixed_raw_args = take_prefix n_params call_raw_args in
let call_env = List.fold_left2 (fun acc name e ->
Env.add ("__q_" ^ name) (VExpr e) acc
) call_env params fixed_raw_args in
let call_env =
List.fold_left (fun acc (index, captured_expr) ->
match List.nth_opt params index with
| Some name -> Env.add ("__aq_" ^ name) (VExpr captured_expr) acc
| None -> acc
) call_env !autoquote_captured_exprs
in
let call_env = Env.add "__q_caller_env__" (VEnv caller_env) call_env in
let call_env = if variadic then
let dots_vals = if n_args > n_params then drop_prefix n_params args_vals |> List.map (fun v -> (None, v)) else [] in
let dots_exprs = if n_args > n_params then drop_prefix n_params raw_args |> List.map (fun (n, e) -> (n, VExpr e)) else [] in
let env = Env.add "..." (VList dots_vals) call_env in
Env.add "__q_dots" (VList dots_exprs) env
else call_env in
let call_env_ref = ref call_env in
let result = eval_expr call_env_ref body in
(match return_type with
| Some t when not (Error.is_error_value result) && not (Ast.is_compatible result t) ->
let expected = Ast.Utils.typ_to_string t in
let got = Ast.Utils.type_name result in
Error.type_error (Printf.sprintf "Function returned %s, but expected %s" got expected)
| _ -> result)
in
match fn_val with
| VBuiltin { b_name; b_arity; b_variadic; b_func } ->
let arg_count = List.length named_args in
if not b_variadic && arg_count <> b_arity then
match b_name with
| Some name -> Error.arity_error_named name b_arity arg_count
| None -> Error.arity_error b_arity arg_count
else
b_func named_args env_ref
| VLambda { params; autoquote_params; param_types; return_type; variadic; body; env = Some closure_env; _ } ->
apply_lambda closure_env params autoquote_params param_types return_type variadic body
| VLambda { params; autoquote_params; param_types; return_type; variadic; body; env = None; _ } ->
apply_lambda !env_ref params autoquote_params param_types return_type variadic body
| VSymbol s ->
(* Try to look up the symbol in the env — might be a function name *)
(match Env.find_opt s !env_ref with
| Some fn -> eval_call env_ref fn raw_args
| None ->
(* Special case: symbols starting with $ are column references.
Wrap them in a row-accessor lambda so they are callable by verbs (NSE). *)
if String.length s > 0 && s.[0] = '$' then
let field = String.sub s 1 (String.length s - 1) in
let fn = VLambda { params = ["row"]; autoquote_params = [false]; param_types = [None]; return_type = None; generic_params = []; variadic = false;
body = Ast.mk_expr (DotAccess { target = Ast.mk_expr (Var "row"); field }); env = Some !env_ref } in
eval_call env_ref fn raw_args
else
let names =
Env.bindings !env_ref
|> List.filter (fun (name, v) ->
match v with
| VSymbol _ -> false
| _ -> not (String.starts_with ~prefix:"__" name)
)
|> List.map fst
in
match Ast.suggest_name s names with
| Some suggestion -> Error.name_error_with_suggestion s suggestion
| None -> Error.name_error s)
(* Propagate the original error — the caller tried to invoke an error
value as a function. We keep the original error (not a generic
TypeError) so that the root cause is visible. Example:
x = 1 / 0; x(1) → Error(DivisionByZero: ...) *)
| VExpr e ->
(* Calling an expression value: evaluate it.
If exactly one VDict argument is provided, use it as a data mask.
We add both the plain key and the '$'-prefixed key to support ColumnRef lookup. *)
let env_to_use = match named_args with
| [(_, VDict d)] ->
let merged = List.fold_left (fun acc (k, v) ->
Env.add k v (Env.add ("$" ^ k) v acc)
) !env_ref d in
ref merged
| _ -> env_ref
in
eval_expr env_to_use e
| VQuo { q_expr; q_env } ->
(* Calling a quosure: evaluate in its captured environment.
If exactly one VDict argument is provided, use it as a data mask overlay.
We add both the plain key and the '$'-prefixed key to support ColumnRef lookup. *)
let env_to_use = match named_args with
| [(_, VDict d)] ->
let merged = List.fold_left (fun acc (k, v) ->
Env.add k v (Env.add ("$" ^ k) v acc)
) q_env d in
ref merged
| _ -> ref q_env
in
eval_expr env_to_use q_expr
| VError _ as e -> e
| VNA _ -> Error.type_error "Cannot call NA as a function."
| _ -> Error.not_callable_error (Utils.type_name fn_val)
end
and eval_binop env_ref op left right =
(* Pipe is special: x |> f(y) becomes f(x, y), x |> f becomes f(x) *)
match op with
| Formula ->
(* Formulas are not evaluated - they're data structures *)
let lhs_vars = extract_formula_vars left in
let rhs_vars = extract_formula_vars right in
VFormula {
response = lhs_vars;
predictors = rhs_vars;
raw_lhs = left;
raw_rhs = right;
}
| Pipe ->
let lval = eval_expr env_ref left in
(match lval with
| VError _ as e -> e
| _ ->
match right.node with
| Call { fn; args } ->
(* Insert pipe value as first argument *)
let fn_val = eval_expr env_ref fn in
eval_call env_ref fn_val ((None, vexpr lval) :: args)
| _ ->
(* RHS is a bare function name or expression *)
let fn_val = eval_expr env_ref right in
eval_call env_ref fn_val [(None, vexpr lval)]
)
| MaybePipe ->
let lval = eval_expr env_ref left in
(* Unconditional pipe — always forward, even errors *)
(match right.node with
| Call { fn; args } ->
let fn_val = eval_expr env_ref fn in
eval_call env_ref fn_val ((None, vexpr lval) :: args)
| _ ->
let fn_val = eval_expr env_ref right in
eval_call env_ref fn_val [(None, vexpr lval)]
)
(* Logical (Short-circuiting) *)
| And ->
let lval = eval_expr env_ref left in
(match lval with
| VError _ as e -> e
| VBool false -> VBool false
| VBool true ->
let rval = eval_expr env_ref right in
(match rval with
| VError _ as e -> e
| VBool b -> VBool b
| VNA _ -> Error.na_predicate_error "Cannot use NA as a condition in &&"
| _ -> make_error TypeError ("Right operand of && must be Bool, got " ^ Utils.type_name rval))
| VNA _ -> Error.na_predicate_error "Cannot use NA as a condition in &&"
| _ -> make_error TypeError ("Left operand of && must be Bool, got " ^ Utils.type_name lval))
| Or ->
let lval = eval_expr env_ref left in
(match lval with
| VError _ as e -> e
| VBool true -> VBool true
| VBool false ->
let rval = eval_expr env_ref right in
(match rval with
| VError _ as e -> e
| VBool b -> VBool b
| VNA _ -> Error.na_predicate_error "Cannot use NA as a condition in ||"
| _ -> make_error TypeError ("Right operand of || must be Bool, got " ^ Utils.type_name rval))
| VNA _ -> Error.na_predicate_error "Cannot use NA as a condition in ||"
| _ -> make_error TypeError ("Left operand of || must be Bool, got " ^ Utils.type_name lval))
(* Membership Operator *)
| In ->
let lval = Utils.unwrap_value (eval_expr env_ref left) in
let rval = Utils.unwrap_value (eval_expr env_ref right) in
(match (lval, rval) with
| (VError _, _) -> lval
| (_, VError _) -> rval
| _ ->
(* Helper: check if item is in haystack (handling errors/NA) *)
let rec find_in item lst =
match lst with
| [] -> VBool false
| h :: t ->
let res = eval_scalar_binop Eq item h in
match res with
| VBool true -> VBool true
| VBool false -> find_in item t
| VError _ as err -> err
| _ -> find_in item t
in
(match rval with
| VList haystack ->
let haystack_vals = List.map snd haystack in
(match lval with
| VList needles ->
let res = List.map (fun (n, needle) ->
(n, find_in needle haystack_vals)
) needles in
VList res
| needle ->
find_in needle haystack_vals)
| _ -> make_error TypeError ("Right operand of 'in' must be a List, got " ^ Utils.type_name rval)))
(* All other binary operators *)
| _ ->
let lval_raw = eval_expr env_ref left in
let rval_raw = eval_expr env_ref right in
let lval = Utils.unwrap_value lval_raw in
let rval = Utils.unwrap_value rval_raw in
match (op, lval, rval) with
| _, VError _, _ -> lval
| _, _, VError _ -> rval
| (Plus | Minus | Mul | Div | Mod | Lt | Gt | LtEq | GtEq | Eq | NEq | BitAnd | BitOr), _, _ ->
(match lval, rval with
| VNDArray _, _ | _, VNDArray _
| Ast.VVector _, _ | _, Ast.VVector _
| Ast.VList _, _ | _, Ast.VList _ ->
let op_str = match op with
| Plus -> "+" | Minus -> "-" | Mul -> "*" | Div -> "/" | Mod -> "%"
| Lt -> "<" | Gt -> ">" | LtEq -> "<=" | GtEq -> ">="
| Eq -> "==" | NEq -> "!="
| BitAnd -> "&" | BitOr -> "|"
| _ -> "??"
in
let dot_op = "." ^ op_str in
let msg = Printf.sprintf "Operator '%s' is defined for scalars only.\nUse '%s' for element-wise (broadcast) operations." op_str dot_op in
Error.type_error msg
| _ -> eval_scalar_binop op lval rval)
| _ -> eval_scalar_binop op lval rval
and eval_unop env_ref op operand =
let v = Utils.unwrap_value (eval_expr env_ref operand) in
match v with VError _ as e -> e | _ ->
match v with
| VNA _ -> Error.na_predicate_error "Operation on NA: NA values do not propagate implicitly. Handle missingness explicitly."
| _ ->
match (op, v) with
| (Not, VBool b) -> VBool (not b)
| (Not, other) -> make_error TypeError (Printf.sprintf "Operand of 'not' must be Bool, got %s" (Utils.type_name other))
| (Neg, VInt i) -> VInt (-i)
| (Neg, VFloat f) -> VFloat (-.f)
| (Neg, other) -> make_error TypeError (Printf.sprintf "Cannot negate %s" (Utils.type_name other))
(* --- Statement & Program Evaluation --- *)
and eval_statement (env : environment) (stmt : stmt) : value * environment =
let (v, env') =
match stmt.node with
| Expression e ->
let env_ref = ref env in
let v = eval_expr env_ref e in
(match e.node with
| ShellExpr _ ->
(match v with
| VShellResult sr -> print_string sr.sr_stdout; flush stdout; ((VNA NAGeneric), !env_ref)
| _ -> (v, !env_ref))
| _ -> (v, !env_ref))
| Assignment { name; expr; _ } ->
if Env.mem name env then
let msg = Printf.sprintf "Cannot reassign immutable variable '%s'. Use ':=' to overwrite or rm() to delete the variable." name in
(make_error NameError msg, env)
else
let env_ref = ref env in
let v = eval_expr env_ref expr in
let new_env = Env.add name v !env_ref in
(match v with
| VError _ -> (v, new_env)
| _ -> ((VNA NAGeneric), new_env))
| Reassignment { name; expr } ->
if not (Env.mem name env) then
let msg = Printf.sprintf "Cannot overwrite '%s': variable not defined. Use '=' for first assignment." name in
(make_error NameError msg, env)
else
let env_ref = ref env in
let v = eval_expr env_ref expr in
if !show_warnings then begin
Printf.eprintf "Warning: overwriting variable '%s'\n" name;
flush stderr
end;
let new_env = Env.add name v !env_ref in
(match v with
| VError _ -> (v, new_env)
| _ -> ((VNA NAGeneric), new_env))
| Import filename ->
(try
let ch = open_in filename in
let content = really_input_string ch (in_channel_length ch) in
close_in ch;
let lexbuf = Lexing.from_string content in
lexbuf.lex_curr_p <- { lexbuf.lex_curr_p with pos_fname = filename };
(try
let program = Parser.program Lexer.token lexbuf in
let (_v, new_env) = eval_program program env in
current_imports := !current_imports @ [Ast.mk_stmt (Import filename)];
((VNA NAGeneric), new_env)
with
| Lexer.SyntaxError msg ->
let pos = Lexing.lexeme_start_p lexbuf in
(make_error
~location:(source_location ~file:filename pos)
SyntaxError
(Printf.sprintf "Import syntax error in '%s': %s" filename msg),
env)
| Parser.Error ->
let pos = Lexing.lexeme_start_p lexbuf in
(make_error
~location:(source_location ~file:filename pos)
SyntaxError
(Printf.sprintf "Import parse error in '%s'" filename),
env))
with
| Sys_error msg ->
(make_error FileError (Printf.sprintf "Import failed: %s" msg), env))
| ImportPackage pkg_name ->
if is_standard_package pkg_name then begin
current_imports := !current_imports @ [Ast.mk_stmt (ImportPackage pkg_name)];
((VNA NAGeneric), env)
end else
(match Package_loader.load_package ~do_eval_program:eval_program pkg_name env with
| Ok new_env ->
current_imports := !current_imports @ [Ast.mk_stmt (ImportPackage pkg_name)];
((VNA NAGeneric), new_env)
| Error msg -> (make_error FileError msg, env))
| ImportFrom { package; names } ->
(match Package_loader.load_package_selective ~do_eval_program:eval_program package names env with
| Ok new_env ->
current_imports := !current_imports @ [Ast.mk_stmt (ImportFrom { package; names })];
((VNA NAGeneric), new_env)
| Error msg -> (make_error FileError msg, env))
| ImportFileFrom { filename; names } ->
(try
let ch = open_in filename in
let content = really_input_string ch (in_channel_length ch) in
close_in ch;
let lexbuf = Lexing.from_string content in
lexbuf.lex_curr_p <- { lexbuf.lex_curr_p with pos_fname = filename };
(try
let program = Parser.program Lexer.token lexbuf in
let (_v, temp_env) = eval_program program env in
let new_bindings =
Env.fold (fun name value acc ->
if Env.mem name env then acc
else (name, value) :: acc
) temp_env []
in
let result_env_ref = ref env in
let missing_names = ref [] in
List.iter (fun (spec : Ast.import_spec) ->
match List.assoc_opt spec.import_name new_bindings with
| None -> missing_names := spec.import_name :: !missing_names
| Some value ->
let target_name = match spec.import_alias with
| Some alias -> alias
| None -> spec.import_name
in
result_env_ref := Env.add target_name value !result_env_ref
) names;
if !missing_names <> [] then
let msg = Printf.sprintf "Name(s) not found in '%s': %s" filename (String.concat ", " (List.rev !missing_names)) in
(make_error NameError msg, env)
else begin
current_imports := !current_imports @ [Ast.mk_stmt (ImportFileFrom { filename; names })];
((VNA NAGeneric), !result_env_ref)
end
with
| Lexer.SyntaxError msg ->
let pos = Lexing.lexeme_start_p lexbuf in
(make_error
~location:(source_location ~file:filename pos)
SyntaxError
(Printf.sprintf "Import syntax error in '%s': %s" filename msg),
env)
| Parser.Error ->
let pos = Lexing.lexeme_start_p lexbuf in
(make_error
~location:(source_location ~file:filename pos)
SyntaxError
(Printf.sprintf "Import parse error in '%s'" filename),
env))
with
| Sys_error msg ->
(make_error FileError (Printf.sprintf "Import failed: %s" msg), env))
in
(attach_stmt_location stmt v, env')
and eval_program ?(resilient=true) (program : program) (env : environment) : value * environment =
let rec go env = function
| [] -> ((VNA NAGeneric), env)
| [stmt] -> eval_statement env stmt
| stmt :: rest ->
let (v, new_env) = eval_statement env stmt in
(match v with
| VError err when not resilient || err.code = StructuralError -> (v, new_env)
| _ -> go new_env rest)
in
go env program
(* --- Built-in Functions --- *)
let make_builtin ?name ?(variadic=false) ?(unwrap=true) arity func =
let arg_proj = if unwrap then (fun (_, v) -> Ast.Utils.unwrap_value v) else (fun (_, v) -> v) in
VBuiltin { b_name = name; b_arity = arity; b_variadic = variadic;
b_func = (fun named_args env_ref -> func (List.map arg_proj named_args) !env_ref) }
let make_builtin_named ?name ?(variadic=false) ?(unwrap=true) arity func =
let arg_proj = if unwrap then (fun (n, v) -> (n, Ast.Utils.unwrap_value v)) else (fun (n, v) -> (n, v)) in
VBuiltin { b_name = name; b_arity = arity; b_variadic = variadic;
b_func = (fun named_args env_ref -> func (List.map arg_proj named_args) !env_ref) }
let eval_call_immutable env fn_val raw_args =
eval_call (ref env) fn_val raw_args
let eval_expr_immutable env expr =
eval_expr (ref env) expr