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
|
<!DOCTYPE html>
<html lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<meta name="generator" content="AsciiDoc 8.6.8">
<title>References</title>
<link rel="stylesheet" href="./asciidoc.css" type="text/css">
<link rel="stylesheet" href="./pygments.css" type="text/css">
<script type="text/javascript" src="./asciidoc.js"></script>
<script type="text/javascript">
/*<![CDATA[*/
asciidoc.install();
/*]]>*/
</script>
<link rel="stylesheet" href="./mlton.css" type="text/css"/>
</head>
<body class="article">
<div id="banner">
<div id="banner-home">
<a href="./Home">MLton 20130715</a>
</div>
</div>
<div id="header">
<h1>References</h1>
</div>
<div id="content">
<div id="preamble">
<div class="sectionbody">
<div class="paragraph"><p><a href="References#AAA">A</a>
<a href="References#BBB">B</a>
<a href="References#CCC">C</a>
<a href="References#DDD">D</a>
<a href="References#EEE">E</a>
<a href="References#FFF">F</a>
<a href="References#GGG">G</a>
<a href="References#HHH">H</a>
<a href="References#III">I</a>
<a href="References#JJJ">J</a>
<a href="References#KKK">K</a>
<a href="References#LLL">L</a>
<a href="References#MMM">M</a>
<a href="References#NNN">N</a>
<a href="References#OOO">O</a>
<a href="References#PPP">P</a>
<a href="References#QQQ">Q</a>
<a href="References#RRR">R</a>
<a href="References#SSS">S</a>
<a href="References#TTT">T</a>
<a href="References#UUU">U</a>
<a href="References#VVV">V</a>
<a href="References#WWW">W</a>
<a href="References#XXX">X</a>
<a href="References#YYY">Y</a>
<a href="References#ZZZ">Z</a></p></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_aaa_a_a"><a id="AAA"></a>A</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="AcarEtAl06"></a>
<a href="http://ttic.uchicago.edu/%7Eumut/papers/pldi06.html">An Experimental Analysis of Self-Adjusting Computation</a>
Umut Acar, Guy Blelloch, Matthias Blume, and Kanat Tangwongsan.
<a href="References#PLDI">PLDI</a> 2006.
</p>
</li>
<li>
<p>
<a id="Appel92"></a>
<a href="http://us.cambridge.org/titles/catalogue.asp?isbn=0521416957">Compiling with Continuations</a>
(<a href="http://www.addall.com/New/submitNew.cgi?query=0-521-41695-7&type=ISBN&location=10000&state=&dispCurr=USD">addall</a>).
ISBN 0521416957.
Andrew W. Appel.
Cambridge University Press, 1992.
</p>
</li>
<li>
<p>
<a id="Appel93"></a>
<a href="http://citeseer.ist.psu.edu/appel92critique.html">A Critique of Standard ML</a>.
Andrew W. Appel.
<a href="References#JFP">JFP</a> 1993.
</p>
</li>
<li>
<p>
<a id="Appel98"></a>
<a href="http://us.cambridge.org/titles/catalogue.asp?isbn=0521582741">Modern Compiler Implementation in ML</a>
(<a href="http://www.addall.com/New/submitNew.cgi?query=0-521-58274-1&type=ISBN&location=10000&state=&dispCurr=USD">addall</a>).
ISBN 0521582741
Andrew W. Appel.
Cambridge University Press, 1998.
</p>
</li>
<li>
<p>
<a id="AppelJim97"></a>
Shrinking Lambda Expressions in Linear Time.
Andrew Appel and Trevor Jim.
<a href="References#JFP">JFP</a> 1997.
</p>
</li>
<li>
<p>
<a id="AppelEtAl94"></a>
<a href="http://www.smlnj.org/doc/ML-Lex/manual.html">A lexical analyzer generator for Standard ML. Version 1.6.0</a>
Andrew W. Appel, James S. Mattson, and David R. Tarditi. 1994
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_bbb_a_b"><a id="BBB"></a>B</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="BaudinetMacQueen85"></a>
<a href="http://citeseer.ist.psu.edu/baudinet85tree.html">Tree Pattern Matching for ML</a>.
Marianne Baudinet, David MacQueen. 1985.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes the match compiler used in an early version of
<a href="SMLNJ">SML/NJ</a>.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="BentonEtAl98"></a>
<a href="http://citeseer.ist.psu.edu/benton98compiling.html">Compiling Standard ML to Java Bytecodes</a>.
Nick Benton, Andrew Kennedy, and George Russell.
<a href="References#ICFP">ICFP</a> 1998.
</p>
</li>
<li>
<p>
<a id="BentonKennedy99"></a>
<a href="http://citeseer.ist.psu.edu/benton99interlanguage.html">Interlanguage Working Without Tears: Blending SML with Java</a>.
Nick Benton and Andrew Kennedy.
<a href="References#ICFP">ICFP</a> 1999.
</p>
</li>
<li>
<p>
<a id="BentonKennedy01"></a>
<a href="http://citeseer.ist.psu.edu/388363.html">Exceptional Syntax</a>.
Nick Benton and Andrew Kennedy.
<a href="References#JFP">JFP</a> 2001.
</p>
</li>
<li>
<p>
<a id="BentonEtAl04"></a>
<a href="http://www.research.microsoft.com/%7Enick/p53-Benton.pdf">Adventures in Interoperability: The SML.NET Experience</a>.
Nick Benton, Andrew Kennedy, and Claudio Russo.
<a href="References#PPDP">PPDP</a> 2004.
</p>
</li>
<li>
<p>
<a id="BentonEtAl04_2"></a>
<a href="http://research.microsoft.com/%7Eakenn/sml/ShrinkingReductionsInSMLNet.pdf">Shrinking Reductions in SML.NET</a>.
Nick Benton, Andrew Kennedy, Sam Lindley and Claudio Russo.
<a href="References#IFL">IFL</a> 2004.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes a linear-time implementation of an
<a href="References#AppelJim97">Appel-Jim shrinker</a>, using a mutable IL, and shows
that it yields nice speedups in SML.NET’s compile times. There are
also benchmarks showing that SML.NET when compiled by MLton runs
roughly five times faster than when compiled by SML/NJ.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Benton05"></a>
<a href="http://research.microsoft.com/%7Enick/benton03.pdf">Embedded Interpreters</a>.
Nick Benton.
<a href="References#JFP">JFP</a> 2005.
</p>
</li>
<li>
<p>
<a id="Berry91"></a>
<a href="http://www.lfcs.inf.ed.ac.uk/reports/91/ECS-LFCS-91-148/index.html">The Edinburgh SML Library</a>.
Dave Berry.
University of Edinburgh Technical Report ECS-LFCS-91-148, 1991.
</p>
</li>
<li>
<p>
<a id="BerryEtAl93"></a>
<a href="http://portal.acm.org/citation.cfm?id=143191">A semantics for ML concurrency primitives</a>.
Dave Berry, Robin Milner, and David N. Turner.
<a href="References#POPL">POPL</a> 1992.
</p>
</li>
<li>
<p>
<a id="Berry93"></a>
Lessons From the Design of a Standard ML Library.
Dave Berry.
<a href="References#JFP">JFP</a> 1993.
</p>
</li>
<li>
<p>
<a id="Bertelsen98"></a>
<a href="http://citeseer.ist.psu.edu/bertelsen98compiling.html">Compiling SML to Java Bytecode</a>.
Peter Bertelsen.
Master’s Thesis, 1998.
</p>
</li>
<li>
<p>
<a id="Berthomieu00"></a>
<a href="http://www.laas.fr/%7Ebernard/oo/ooml.html">OO Programming styles in ML</a>.
Bernard Berthomieu.
LAAS Report #2000111, 2000.
</p>
</li>
<li>
<p>
<a id="Blume01"></a>
<a href="http://citeseer.ist.psu.edu/blume01nolongerforeign.html">No-Longer-Foreign: Teaching an ML compiler to speak C "natively"</a>.
Matthias Blume.
<a href="References#BABEL">BABEL</a> 2001.
</p>
</li>
<li>
<p>
<a id="Blume01_02"></a>
<a href="http://ttic.uchicago.edu/%7Eblume/pgraph/proposal.pdf">Portable library descriptions for Standard ML</a>.
Matthias Blume. 2001.
</p>
</li>
<li>
<p>
<a id="Boehm03"></a>
<a href="http://citeseer.ist.psu.edu/640926.html">Destructors, Finalizers, and Synchronization</a>.
Hans Boehm.
<a href="References#POPL">POPL</a> 2003.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Discusses a number of issues in the design of finalizers. Many of the
design choices are consistent with <a href="MLtonFinalizable">MLtonFinalizable</a>.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_ccc_a_c"><a id="CCC"></a>C</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="CejtinEtAl00"></a>
<a href="References.attachments/CejtinEtAl00.pdf">Flow-directed Closure Conversion for Typed Languages</a>.
Henry Cejtin, Suresh Jagannathan, and Stephen Weeks.
<a href="References#ESOP">ESOP</a> 2000.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes MLton’s closure-conversion algorithm, which translates from
its simply-typed higher-order intermediate language to its
simply-typed first-order intermediate language.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="ChengBlelloch01"></a>
<a href="http://citeseer.ist.psu.edu/493194.html">A Parallel, Real-Time Garbage Collector</a>.
Perry Cheng and Guy E. Blelloch.
<a href="References#PLDI">PLDI</a> 2001.
</p>
</li>
<li>
<p>
<a id="Claessen00"></a>
<a href="http://www.md.chalmers.se/%7Ekoen/Papers/quick.ps">QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs</a>.
Koen Claessen and John Hughes.
<a href="References#ICFP">ICFP</a> 2000.
</p>
</li>
<li>
<p>
<a id="Clinger98"></a>
<a href="http://citeseer.ist.psu.edu/clinger98proper.html">Proper Tail Recursion and Space Efficiency</a>.
William D. Clinger.
<a href="References#PLDI">PLDI</a> 1998.
</p>
</li>
<li>
<p>
<a id="CooperMorrisett90"></a>
<a href="http://citeseer.ist.psu.edu/cooper90adding.html">Adding Threads to Standard ML</a>.
Eric C. Cooper and J. Gregory Morrisett.
CMU Technical Report CMU-CS-90-186, 1990.
</p>
</li>
<li>
<p>
<a id="CouttsEtAl07"></a>
<a href="http://www.cse.unsw.edu.au/%7Edons/papers/CLS07.html">Stream Fusion: From Lists to Streams to Nothing at All</a>.
Duncan Coutts, Roman Leshchinskiy, and Don Stewart.
Submitted for publication. April 2007.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_ddd_a_d"><a id="DDD"></a>D</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="DamasMilner82"></a>
<a href="http://portal.acm.org/citation.cfm?id=582176">Principal Type-Schemes for Functional Programs</a>.
Luis Damas and Robin Milner.
<a href="References#POPL">POPL</a> 1982.
</p>
</li>
<li>
<p>
<a id="Danvy98"></a>
<a href="http://citeseer.ist.psu.edu/danvy98functional.html">Functional Unparsing</a>.
Olivier Danvy.
BRICS Technical Report RS 98-12, 1998.
</p>
</li>
<li>
<p>
<a id="Deboer05"></a>
<a href="http://www.cis.ksu.edu/%7Estough/eXene/dusty-thesis.pdf">Exhancements to eXene</a>.
Dustin B. Deboer.
Master of Science Thesis, 2005.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes ways to improve widget concurrency, handling of input focus,
X resources and selections.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="DoligezLeroy93"></a>
<a href="http://citeseer.ist.psu.edu/doligez93concurrent.html">A Concurrent, Generational Garbage Collector for a Multithreaded Implementation of ML</a>.
Damien Doligez and Xavier Leroy.
<a href="References#POPL">POPL</a> 1993.
</p>
</li>
<li>
<p>
<a id="Dreyer07"></a>
<a href="http://ttic.uchicago.edu/%7Edreyer/papers/mtc/main-long.pdf">Modular Type Classes</a>.
Derek Dreyer, Robert Harper, Manuel M.T. Chakravarty.
University of Chicago Technical Report TR-2007-02, 2006.
</p>
</li>
<li>
<p>
<a id="DreyerBlume07"></a>
<a href="http://ttic.uchicago.edu/%7Edreyer/papers/infmod/main-short.pdf">Principal Type Schemes for Modular Programs</a>.
Derek Dreyer and Matthias Blume.
<a href="References#ESOP">ESOP</a> 2007.
</p>
</li>
<li>
<p>
<a id="Dubois95"></a>
<a href="ftp://ftp.inria.fr/INRIA/Projects/cristal/Francois.Rouaix/generics.dvi.Z">Extensional Polymorphism</a>.
Catherin Dubois, Francois Rouaix, and Pierre Weis.
<a href="References#POPL">POPL</a> 1995.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>An extension of ML that allows the definition of ad-hoc polymorphic
functions by inspecting the type of their argument.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_eee_a_e"><a id="EEE"></a>E</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Elsman03"></a>
<a href="http://www.it-c.dk/research/mlkit/papers.html">Garbage Collection Safety for Region-based Memory Management</a>.
Martin Elsman.
<a href="References#TLDI">TLDI</a> 2003.
</p>
</li>
<li>
<p>
<a id="Elsman04"></a>
<a href="http://www.itu.dk/people/mael/papers.html">Type-Specialized Serialization with Sharing</a>
Martin Elsman. University of Copenhagen. IT University Technical
Report TR-2004-43, 2004.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_fff_a_f"><a id="FFF"></a>F</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="FelleisenFreidman98"></a>
<a href="http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=4787">The Little MLer</a>
(<a href="http://www3.addall.com/New/submitNew.cgi?query=026256114X&type=ISBN">addall</a>).
ISBN 026256114X.
Matthias Felleisen and Dan Freidman.
The MIT Press, 1998.
</p>
</li>
<li>
<p>
<a id="FlattFindler04"></a>
<a href="http://www.cs.utah.edu/plt/kill-safe/">Kill-Safe Synchronization Abstractions</a>.
Matthew Flatt and Robert Bruce Findler.
<a href="References#PLDI">PLDI</a> 2004.
</p>
</li>
<li>
<p>
<a id="FluetWeeks01"></a>
<a href="References.attachments/FluetWeeks01.pdf">Contification Using Dominators</a>.
Matthew Fluet and Stephen Weeks.
<a href="References#ICFP">ICFP</a> 2001.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes contification, a generalization of tail-recursion
elimination that is an optimization operating on MLton’s static single
assignment (SSA) intermediate language.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="FluetPucella02"></a>
<a href="http://arxiv.org/abs/cs.PL/0403034">Phantom Types and Subtyping</a>.
Matthew Fluet and Riccardo Pucella.
<a href="References#TCS">TCS</a> 2002.
</p>
</li>
<li>
<p>
<a id="Furuse01"></a>
<a href="http://pauillac.inria.fr/%7Efuruse/publications/jfla2001.ps.gz">Generic Polymorphism in ML</a>.
J. Furuse.
<a href="References#JFLA">JFLA</a> 2001.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>The formalism behind G’CAML, which has an approach to ad-hoc
polymorphism based on <a href="References#Dubois95">Dubois95</a>, the differences being in how
type checking works an an improved compilation approach for typecase
that does the matching at compile time, not run time.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_ggg_a_g"><a id="GGG"></a>G</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="GansnerReppy93"></a>
<a href="http://citeseer.ist.psu.edu/gansner93multithreaded.html">A Multi-Threaded Higher-order User Interface Toolkit</a>.
Emden R. Gansner and John H. Reppy.
User Interface Software, 1993.
</p>
</li>
<li>
<p>
<a id="GansnerReppy04"></a>
<a href="http://titles.cambridge.org/catalogue.asp?isbn=0521794781">The Standard ML Basis Library</a>.
(<a href="http://www3.addall.com/New/submitNew.cgi?query=0521794781&type=ISBN">addall</a>)
ISBN 0521794781.
Emden R. Gansner and John H. Reppy.
Cambridge University Press, 2004.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>An introduction and overview of the <a href="BasisLibrary">Basis Library</a>,
followed by a detailed description of each module. The module
descriptions are also available
<a href="http://www.standardml.org/Basis">online</a>.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="GrossmanEtAl02"></a>
<a href="http://www.eecs.harvard.edu/%7Egreg/cyclone/">Region-based Memory Management in Cyclone</a>.
Dan Grossman, Greg Morrisett, Trevor Jim, Michael Hicks, Yanling
Wang, and James Cheney.
<a href="References#PLDI">PLDI</a> 2002.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_hhh_a_h"><a id="HHH"></a>H</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="HallenbergEtAl02"></a>
<a href="http://www.it-c.dk/research/mlkit/papers.html">Combining Region Inference and Garbage Collection</a>.
Niels Hallenberg, Martin Elsman, and Mads Tofte.
<a href="References#PLDI">PLDI</a> 2002.
</p>
</li>
<li>
<p>
<a id="HansenRichel99"></a>
<a href="http://www.it.dtu.dk/introSML">Introduction to Programming Using SML</a>
(<a href="http://www3.addall.com/New/submitNew.cgi?query=0201398206&type=ISBN">addall</a>).
ISBN 0201398206.
Michael R. Hansen, Hans Rischel.
Addison-Wesley, 1999.
</p>
</li>
<li>
<p>
<a id="HarperEtAl93"></a>
<a href="http://citeseer.comp.nus.edu.sg/11210.html">Typing First-Class Continuations in ML</a>.
Robert Harper, Bruce F. Duba, and David MacQueen.
<a href="References#JFP">JFP</a> 1993.
</p>
</li>
<li>
<p>
<a id="HarperMitchell92"></a>
<a href="http://citeseer.ist.psu.edu/harper92type.html">On the Type Structure of Standard ML</a>.
Robert Harper and John C. Mitchell.
<a href="References#TOPLAS">TOPLAS</a> 1992.
</p>
</li>
<li>
<p>
<a id="HauserBenson04"></a>
<a href="http://doi.ieeecomputersociety.org/10.1109/CSD.2004.1309122">On the Practicality and Desirability of Highly-concurrent, Mostly-functional Programming</a>.
Carl H. Hauser and David B. Benson.
<a href="References#ACSD">ACSD</a> 2004.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes the use of <a href="ConcurrentML"> Concurrent ML</a> in implementing
the Ped text editor. Argues that using large numbers of threads and
message passing style are is a practical and effective ways of
modularizing a program.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="HeckmanWilhelm97"></a>
<a href="http://rw4.cs.uni-sb.de/%7Eheckmann/abstracts/neuform.html">A Functional Description of TeX’s Formula Layout</a>.
Reinhold Heckmann and Reinhard Wilhelm.
<a href="References#JFP">JFP</a> 1997.
</p>
</li>
<li>
<p>
<a id="HicksEtAl03"></a>
<a href="http://www.eecs.harvard.edu/%7Egreg/cyclone/">Safe and Flexible Memory Management in Cyclone</a>.
Mike Hicks, Greg Morrisett, Dan Grossman, and Trevor Jim.
University of Maryland Technical Report CS-TR-4514, 2003.
</p>
</li>
<li>
<p>
<a id="Hurd04"></a>
<a href="http://www.cl.cam.ac.uk/%7Ejeh1004/research/papers/fasthol.pdf">Compiling HOL4 to Native Code</a>.
Joe Hurd.
<a href="References#TPHOLs">TPHOLs</a> 2004.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes a port of HOL from Moscow ML to MLton, the difficulties
encountered in compiling large programs, and the speedups achieved
(roughly 10x).</p></div>
</div>
<div class="attribution">
</div></div>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_iii_a_i"><a id="III"></a>I</h2>
<div class="sectionbody">
<div class="paragraph"><p></p></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_jjj_a_j"><a id="JJJ"></a>J</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Jones99"></a>
<a href="http://www.cs.kent.ac.uk/people/staff/rej/gcbook/gcbook.html">Garbage Collection: Algorithms for Automatic Memory Management</a>
(<a href="http://www3.addall.com/New/submitNew.cgi?query=0471941484&type=ISBN">addall</a>).
ISBN 0471941484.
Richard Jones.
John Wiley & Sons, 1999.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_kkk_a_k"><a id="KKK"></a>K</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Kahrs93"></a>
<a href="http://www.cs.kent.ac.uk/pubs/1993/569/index.html">Mistakes and Ambiguities in the Definition of Standard ML</a>.
Stefan Kahrs.
University of Edinburgh Technical Report ECS-LFCS-93-257, 1993.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes a number of problems with the
<a href="References#MilnerEtAl90">1990 Definition</a>, many of which were fixed in the
<a href="References#MilnerEtAl97">1997 Definition</a>.</p></div>
<div class="paragraph"><p>Also see the <a href="http://www.cs.kent.ac.uk/%7Esmk/errors-new.ps.Z">addenda</a>
published in 1996.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Karvonen07"></a>
<a href="http://dl.acm.org/citation.cfm?doid=1292535.1292547">Generics for the Working ML’er</a>.
Vesa Karvonen.
<a href="References#ML">ML</a> 2007.
</p>
</li>
<li>
<p>
<a id="Kennedy04"></a>
<a href="http://research.microsoft.com/%7Eakenn/fun/picklercombinators.pdf">Pickler Combinators</a>.
Andrew Kennedy.
<a href="References#JFP">JFP</a> 2004.
</p>
</li>
<li>
<p>
<a id="KoserEtAl03"></a>
<a href="http://www.cs.princeton.edu/%7Ehlarsen/work/dpcool-paper.pdf">sml2java: A Source To Source Translator</a>.
Justin Koser, Haakon Larsen, Jeffrey A. Vaughan.
<a href="References#DPCOOL">DPCOOL</a> 2003.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_lll_a_l"><a id="LLL"></a>L</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Lang99"></a>
<a href="http://citeseer.nj.nec.com/lang99faster.html">Faster Algorithms for Finding Minimal Consistent DFAs</a>.
Kevin Lang. 1999.
</p>
</li>
<li>
<p>
<a id="LarsenNiss04"></a>
<a href="http://www.it-c.dk/%7Ehniss/publications/freenix2004.pdf">mGTK: An SML binding of Gtk+</a>.
Ken Larsen and Henning Niss.
USENIX Annual Technical Conference, 2004.
</p>
</li>
<li>
<p>
<a id="Leroy90"></a>
<a href="http://citeseer.ist.psu.edu/leroy90zinc.html">The ZINC Experiment: an Economical Implementation of the ML Language</a>.
Xavier Leroy.
Technical report 117, INRIA, 1990.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>A detailed explanation of the design and implementation of a bytecode
compiler and interpreter for ML with a machine model aimed at
efficient implementation.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Leroy93"></a>
<a href="http://pauillac.inria.fr/%7Exleroy/leroy.html">Polymorphism by Name for References and Continuations</a>.
Xavier Leroy.
<a href="References#POPL">POPL</a> 1993.
</p>
</li>
<li>
<p>
<a id="LeungGeorge98"></a>
<a href="http://citeseer.ist.psu.edu/637416.html">MLRISC Annotations</a>.
Allen Leung and Lal George. 1998.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_mmm_a_m"><a id="MMM"></a>M</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="MarlowEtAl01"></a>
<a href="http://www.haskell.org/%7Esimonmar/papers/async.ps.gz">Asynchronous Exceptions in Haskell</a>.
Simon Marlow, Simon Peyton Jones, Andy Moran and John Reppy.
<a href="References#PLDI">PLDI</a> 2001.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>An asynchronous exception is a signal that one thread can send to
another, and is useful for the receiving thread to treat as an
exception so that it can clean up locks or other state relevant to its
current context.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="MacQueenEtAl84"></a>
<a href="http://portal.acm.org/citation.cfm?id=800017.800528">An Ideal Model for Recursive Polymorphic Types</a>.
David MacQueen, Gordon Plotkin, Ravi Sethi.
<a href="References#POPL">POPL</a> 1984.
</p>
</li>
<li>
<p>
<a id="Matthews91"></a>
<a href="http://www.lfcs.inf.ed.ac.uk/reports/91/ECS-LFCS-91-174/index.html">A Distributed Concurrent Implementation of Standard ML</a>.
David Matthews.
University of Edinburgh Technical Report ECS-LFCS-91-174, 1991.
</p>
</li>
<li>
<p>
<a id="Matthews95"></a>
<a href="http://www.lfcs.inf.ed.ac.uk/reports/95/ECS-LFCS-95-335/">Papers on Poly/ML</a>.
David C. J. Matthews.
University of Edinburgh Technical Report ECS-LFCS-95-335, 1995.
</p>
</li>
<li>
<p>
<a href="http://www.lfcs.inf.ed.ac.uk/reports/97/ECS-LFCS-97-375/">That About Wraps it Up: Using FIX to Handle Errors Without Exceptions, and Other Programming Tricks</a>.
Bruce J. McAdam.
University of Edinburgh Technical Report ECS-LFCS-97-375, 1997.
</p>
</li>
<li>
<p>
<a id="MeierNorgaard93"></a>
<a href="http://www.itu.dk/stud/speciale/bmkn/">A Just-In-Time Backend for Moscow ML 2.00 in SML</a>.
Bjarke Meier, Kristian Nørgaard.
Masters Thesis, 2003.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>A just-in-time compiler using GNU Lightning, showing a speedup of up
to four times over Moscow ML’s usual bytecode interpreter.</p></div>
<div class="paragraph"><p>The full report is only available in Danish.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Milner78"></a>
A Theory of Type Polymorphism in Programming.
Robin Milner.
Journal of Computer and System Sciences, 1978.
</p>
</li>
<li>
<p>
<a id="Milner82"></a>
<a href="http://www.dcs.ed.ac.uk/home/stg/tutorial/papers/evolved.pdf">How ML Evolved</a>.
Robin Milner.
Polymorphism—The ML/LCF/Hope Newsletter, 1983.
</p>
</li>
<li>
<p>
<a id="MilnerTofte90"></a>
<a href="http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=8988">Commentary on Standard ML</a> (<a href="http://www.itu.dk/people/tofte/publ/1991commentaryBody.pdf">online pdf</a>).
(<a href="http://www3.addall.com/New/submitNew.cgi?query=0262631327&type=ISBN">addall</a>)
ISBN 0262631327.
Robin Milner and Mads Tofte.
The MIT Press, 1990.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Introduces and explains the notation and approach used in
<a href="References#MilnerEtAl90">The Definition of Standard ML</a>.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="MilnerEtAl90"></a>
<a href="http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=7945">The Definition of Standard ML</a>.
(<a href="http://www3.addall.com/New/submitNew.cgi?query=0262631326&type=ISBN">addall</a>)
ISBN 0262631326.
Robin Milner, Mads Tofte, and Robert Harper.
The MIT Press, 1990.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Superseded by <a href="References#MilnerEtAl97">The Definition of Standard ML (Revised)</a>.
Accompanied by the <a href="References#MilnerTofte90">Commentary on Standard ML</a>.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="MilnerEtAl97"></a>
<a href="http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=3874">The Definition of Standard ML (Revised)</a>.
(<a href="http://www3.addall.com/New/submitNew.cgi?query=0262631814&type=ISBN">addall</a>)
ISBN 0262631814.
Robin Milner, Mads Tofte, Robert Harper, and David MacQueen.
The MIT Press, 1997.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>A terse and formal specification of Standard ML’s syntax and
semantics. Supersedes <a href="References#MilnerEtAl90">The Definition of Standard ML</a>.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="ML2000"></a>
<a href="http://www.cs.cmu.edu/%7Erwh/papers/ml2000/ml2000.pdf">Principles and a Preliminary Design for ML2000</a>.
The ML2000 working group, 1999.
</p>
</li>
<li>
<p>
<a id="Morentsen99"></a>
<a href="http://www.daimi.au.dk/CPnets/workshop99/papers/Mortensen.ps.gz">Automatic Code Generation from Coloured Petri Nets for an Access Control System</a>.
Kjeld H. Mortensen.
Workshop on Practical Use of Coloured Petri Nets and Design/CPN, 1999.
</p>
</li>
<li>
<p>
<a id="MorrisettTolmach93"></a>
<a href="http://portal.acm.org/affiliated/citation.cfm?id=155353">Procs and Locks: a Portable Multiprocessing Platform for Standard ML of New Jersey</a>.
J. Gregory Morrisett and Andrew Tolmach.
<a href="References#PPoPP">PPoPP</a> 1993.
</p>
</li>
<li>
<p>
<a id="Murphy06"></a>
<a href="http://www.cs.cmu.edu/%7Etom7/papers/grid-ml06.pdf">ML Grid Programming with ConCert</a>.
Tom Murphy VII.
<a href="References#ML">ML</a> 2006.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_nnn_a_n"><a id="NNN"></a>N</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Neumann99"></a>
<a href="http://citeseer.ist.psu.edu/412760.html">fxp - Processing Structured Documents in SML</a>.
Andreas Neumann.
Scottish Functional Programming Workshop, 1999.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes <a href="http://atseidl2.informatik.tu-muenchen.de/%7Eberlea/Fxp/">fxp</a>,
an XML parser implemented in Standard ML.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Neumann99Thesis"></a>
<a href="http://citeseer.ist.psu.edu/neumann99parsing.html">Parsing and Querying XML Documents in SML</a>.
Andreas Neumann.
Doctoral Thesis, 1999.
</p>
</li>
<li>
<p>
<a id="NguyenOhori06"></a>
<a href="http://www.pllab.riec.tohoku.ac.jp/%7Eohori/research/NguyenOhoriPPDP06.pdf">Compiling ML Polymorphism with Explicit Layout Bitmap</a>.
Huu-Duc Nguyen and Atsushi Ohori.
<a href="References#PPDP">PPDP</a> 2006.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_ooo_a_o"><a id="OOO"></a>O</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Okasaki99"></a>
<a href="http://us.cambridge.org/titles/catalogue.asp?isbn=0521663504">Purely Functional Data Structures</a>.
ISBN 0521663504.
Chris Okasaki.
Cambridge University Press, 1999.
</p>
</li>
<li>
<p>
<a id="Ohori89"></a>
<a href="http://www.pllab.riec.tohoku.ac.jp/%7Eohori/research/fpca89.pdf">A Simple Semantics for ML Polymorphism</a>.
Atsushi Ohori.
<a href="References#FPCA">FPCA</a> 1989.
</p>
</li>
<li>
<p>
<a id="Ohori95"></a>
<a href="http://www.pllab.riec.tohoku.ac.jp/%7Eohori/research/toplas95.pdf">A Polymorphic Record Calculus and Its Compilation</a>.
Atsushi Ohori.
<a href="References#TOPLAS">TOPLAS</a> 1995.
</p>
</li>
<li>
<p>
<a id="OhoriTakamizawa97"></a>
<a href="http://www.pllab.riec.tohoku.ac.jp/%7Eohori/research/jlsc97.pdf">An Unboxed Operational Semantics for ML Polymorphism</a>.
Atsushi Ohori and Tomonobu Takamizawa.
<a href="References#LASC">LASC</a> 1997.
</p>
</li>
<li>
<p>
<a id="Ohori99"></a>
<a href="http://www.pllab.riec.tohoku.ac.jp/%7Eohori/research/ic98.pdf">Type-Directed Specialization of Polymorphism</a>.
Atsushi Ohori.
<a href="References#IC">IC</a> 1999.
</p>
</li>
<li>
<p>
<a id="OwensEtAl09"></a>
Regular-expression derivatives reexamined.
Scott Owens, John Reppy, and Aaron Turon.
<a href="References#JFP">JFP</a> 2009.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_ppp_a_p"><a id="PPP"></a>P</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Paulson96"></a>
<a href="http://www.cl.cam.ac.uk/users/lcp/MLbook/">ML For the Working Programmer</a>
(<a href="http://www3.addall.com/New/submitNew.cgi?query=052156543X&type=ISBN">addall</a>)
ISBN 052156543X.
Larry C. Paulson.
Cambridge University Press, 1996.
</p>
</li>
<li>
<p>
<a id="PetterssonEtAl02"></a>
<a href="http://user.it.uu.se/%7Ehappi/publications/flops02.pdf">The HiPE/x86 Erlang Compiler: System Description and Performance Evaluation</a>.
Mikael Pettersson, Konstantinos Sagonas, and Erik Johansson.
<a href="References#FLOPS">FLOPS</a> 2002.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes a native x86 Erlang compiler and a comparison of many
different native x86 compilers (including MLton) and their register
usage and call stack implementations.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Price09"></a>
<a href="http://rogerprice.org/#UG">User’s Guide to ML-Lex and ML-Yacc</a>
Roger Price. 2009.
</p>
</li>
<li>
<p>
<a id="Pucella98"></a>
<a href="http://citeseer.ist.psu.edu/pucella98reactive.html">Reactive Programming in Standard ML</a>.
Riccardo R. Puccella. 1998.
<a href="References#ICCL">ICCL</a> 1998.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_qqq_a_q"><a id="QQQ"></a>Q</h2>
<div class="sectionbody">
<div class="paragraph"><p></p></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_rrr_a_r"><a id="RRR"></a>R</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Ramsey90"></a>
<a href="http://citeseer.ist.psu.edu/ramsey90concurrent.html">Concurrent Programming in ML</a>.
Norman Ramsey.
Princeton University Technical Report CS-TR-262-90, 1990.
</p>
</li>
<li>
<p>
<a id="Ramsey03"></a>
<a href="http://www.eecs.harvard.edu/%7Enr/pubs/embed-abstract.html">Embedding an Interpreted Language Using Higher-Order Functions and Types</a>.
Norman Ramsey.
<a href="References#IVME">IVME</a> 2003.
</p>
</li>
<li>
<p>
<a id="RamseyFisherGovereau05"></a>
<a href="http://www.eecs.harvard.edu/%7Enr/pubs/els-abstract.html">An Expressive Language of Signatures</a>.
Norman Ramsey, Kathleen Fisher, and Paul Govereau.
<a href="References#ICFP">ICFP</a> 2005.
</p>
</li>
<li>
<p>
<a id="RedwineRamsey04"></a>
<a href="http://citeseer.ist.psu.edu/670348.html">Widening Integer Arithmetic</a>.
Kevin Redwine and Norman Ramsey.
<a href="References#CC">CC</a> 2004.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes a method to implement numeric types and operations (like
<span class="monospaced">Int31</span> or <span class="monospaced">Word17</span>) for sizes smaller than that provided by the
processor.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Reppy88"></a>
Synchronous Operations as First-Class Values.
John Reppy.
<a href="References#PLDI">PLDI</a> 1988.
</p>
</li>
<li>
<p>
<a id="Reppy99"></a>
<a href="http://us.cambridge.org/titles/catalogue.asp?isbn=0521480892">Concurrent Programming in ML</a>
(<a href="http://www3.addall.com/New/submitNew.cgi?query=0521480892&type=ISBN">addall</a>).
ISBN 0521480892.
John Reppy.
Cambridge University Press, 1999.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes <a href="ConcurrentML">ConcurrentML</a>.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Reynolds98"></a>
<a href="ftp://ftp.cs.cmu.edu/user/jcr/defintintro.ps.gz">Definitional Interpreters Revisited</a>.
John C. Reynolds.
<a href="References#HOSC">HOSC</a> 1998.
</p>
</li>
<li>
<p>
<a id="Reynolds98_2"></a>
<a href="ftp://ftp.cs.cmu.edu/user/jcr/defint.ps.gz">Definitional Interpreters for Higher-Order Programming Languages</a>
John C. Reynolds.
<a href="References#HOSC">HOSC</a> 1998.
</p>
</li>
<li>
<p>
<a id="Rossberg01"></a>
<a href="http://www.ps.uni-sb.de/hamlet/defects.pdf">Defects in the Revised Definition of Standard ML</a>.
Andreas Rossberg. 2001.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_sss_a_s"><a id="SSS"></a>S</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Sansom91"></a>
<a href="http://citeseer.ist.psu.edu/sansom91dualmode.html">Dual-Mode Garbage Collection</a>.
Patrick M. Sansom.
Workshop on the Parallel Implementation of Functional Languages, 1991.
</p>
</li>
<li>
<p>
<a id="ScottRamsey00"></a>
<a href="http://citeseer.ist.psu.edu/scott00when.html">When Do Match-Compilation Heuristics Matter</a>.
Kevin Scott and Norman Ramsey.
University of Virginia Technical Report CS-2000-13, 2000.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Modified SML/NJ to experimentally compare a number of
match-compilation heuristics and showed that choice of heuristic
usually does not significantly affect code size or run time.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Sestoft96"></a>
<a href="http://citeseer.ist.psu.edu/sestoft96ml.html">ML Pattern Match Compilation and Partial Evaluation</a>.
Peter Sestoft.
Partial Evaluation, 1996.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes the derivation of the match compiler used in
<a href="MoscowML">Moscow ML</a>.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="ShaoAppel94"></a>
<a href="http://flint.cs.yale.edu/flint/publications/closure.html">Space-Efficient Closure Representations</a>.
Zhong Shao and Andrew W. Appel.
<a href="References#LFP">LFP</a> 2006.
</p>
</li>
<li>
<p>
<a id="Shipman02"></a>
<a href="References.attachments/Shipman02.pdf">Unix System Programming with Standard ML</a>.
Anthony L. Shipman.
2002.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Includes a description of the <a href="Swerve">Swerve</a> HTTP server written in SML.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Signoles03"></a>
<a href="http://www.lri.fr/%7Esignoles/publis/jfla2003.ps.gz">Calcul Statique des Applications de Modules Parametres</a>.
Julien Signoles.
<a href="References#JFLA">JFLA</a> 2003.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes a defunctorizer for OCaml, and compares it to existing
defunctorizers, including MLton.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="SittampalamEtAl04"></a>
<a href="http://citeseer.ist.psu.edu/sittampalam04incremental.html">Incremental Execution of Transformation Specifications</a>.
Ganesh Sittampalam, Oege de Moor, and Ken Friis Larsen.
<a href="References#POPL">POPL</a> 2004.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Mentions a port from Moscow ML to MLton of
<a href="http://www.itu.dk/research/muddy/">MuDDY</a>, an SML wrapper around the
<a href="http://sourceforge.net/projects/buddy">BuDDY</a> BDD package.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="SwaseyEtAl06"></a>
<a href="http://www.cs.cmu.edu/%7Etom7/papers/smlsc2-ml06.pdf">A Separate Compilation Extension to Standard ML</a>.
David Swasey, Tom Murphy VII, Karl Crary and Robert Harper.
<a href="References#ML">ML</a> 2006.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_ttt_a_t"><a id="TTT"></a>T</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="TarditiAppel00"></a>
<a href="http://www.smlnj.org/doc/ML-Yacc/index.html">ML-Yacc User’s Manual. Version 2.4</a>
David R. Tarditi and Andrew W. Appel. 2000.
</p>
</li>
<li>
<p>
<a id="TarditiEtAl90"></a>
<a href="http://citeseer.ist.psu.edu/tarditi90no.html">No Assembly Required: Compiling Standard ML to C</a>.
David Tarditi, Peter Lee, and Anurag Acharya. 1990.
</p>
</li>
<li>
<p>
<a id="ThorupTofte94"></a>
<a href="http://citeseer.ist.psu.edu/60712.html">Object-oriented programming and Standard ML</a>.
Lars Thorup and Mads Tofte.
<a href="References#ML">ML</a>, 1994.
</p>
</li>
<li>
<p>
<a id="Tofte90"></a>
Type Inference for Polymorphic References.
Mads Tofte.
<a href="References#IC">IC</a> 1990.
</p>
</li>
<li>
<p>
<a id="TolmachAppel95"></a>
<a href="http://citeseer.ist.psu.edu/tolmach93debugger.html">A Debugger for Standard ML</a>.
Andrew Tolmach and Andrew W. Appel.
<a href="References#JFP">JFP</a> 1995.
</p>
</li>
<li>
<p>
<a id="Tolmach97"></a>
<a href="http://citeseer.ist.psu.edu/tolmach97combining.html">Combining Closure Conversion with Closure Analysis using Algebraic Types</a>.
Andrew Tolmach.
<a href="References#TIC">TIC</a> 1997.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes a closure-conversion algorithm for a monomorphic IL. The
algorithm uses a unification-based flow analysis followed by
defunctionalization and is similar to the approach used in MLton
(<a href="References#CejtinEtAl00">CejtinEtAl00</a>).</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="TolmachOliva98"></a>
<a href="http://web.cecs.pdx.edu/%7Eapt/jfp98.ps">From ML to Ada: Strongly-typed Language Interoperability via Source Translation</a>.
Andrew Tolmach and Dino Oliva.
<a href="References#JFP">JFP</a> 1998.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes a compiler for RML, a core SML-like language. The compiler
is similar in structure to MLton, using monomorphisation,
defunctionalization, and optimization on a first-order IL.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_uuu_a_u"><a id="UUU"></a>U</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Ullman98"></a>
<a href="http://www-db.stanford.edu/%7Eullman/emlp.html">Elements of ML Programming</a>
(<a href="http://www3.addall.com/New/submitNew.cgi?query=0137903871&type=ISBN">addall</a>).
ISBN 0137903871.
Jeffrey D. Ullman.
Prentice-Hall, 1998.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_vvv_a_v"><a id="VVV"></a>V</h2>
<div class="sectionbody">
<div class="paragraph"><p></p></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_www_a_w"><a id="WWW"></a>W</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Wand84"></a>
<a href="http://portal.acm.org/citation.cfm?id=800527">A Types-as-Sets Semantics for Milner-Style Polymorphism</a>.
Mitchell Wand.
<a href="References#POPL">POPL</a> 1984.
</p>
</li>
<li>
<p>
<a id="Wang01"></a>
<a href="http://ncstrl.cs.princeton.edu/expand.php?id=TR-640-01">Managing Memory with Types</a>.
Daniel C. Wang.
PhD Thesis.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Chapter 6 describes an implementation of a type-preserving garbage
collector for MLton.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="WangAppel01"></a>
<a href="http://www.cs.princeton.edu/%7Edanwang/Papers/tpsrvgc/">Type-Preserving Garbage Collectors</a>.
Daniel C. Wang and Andrew W. Appel.
<a href="References#POPL">POPL</a> 2001.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Shows how to modify MLton to generate a strongly-typed garbage
collector as part of a program.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="WangMurphy02"></a>
<a href="http://www-2.cs.cmu.edu/%7Etom7/papers/wang-murphy-recursion.pdf">Programming With Recursion Schemes</a>.
Daniel C. Wang and Tom Murphy VII.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>Describes a programming technique for data abstraction, along with
benchmarks of MLton and other SML compilers.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
<li>
<p>
<a id="Weeks06"></a>
<a href="References.attachments/060916-mlton.pdf">Whole-Program Compilation in MLton</a>.
Stephen Weeks.
<a href="References#ML">ML</a> 2006.
</p>
</li>
<li>
<p>
<a id="Wright95"></a>
<a href="http://citeseer.ist.psu.edu/wright95simple.html">Simple Imperative Polymorphism</a>.
Andrew Wright.
<a href="References#LASC">LASC</a>, 8(4):343-355, 1995.
</p>
<div class="quoteblock">
<div class="content">
<div class="paragraph"><p>The origin of the <a href="ValueRestriction">ValueRestriction</a>.</p></div>
</div>
<div class="attribution">
</div></div>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_xxx_a_x"><a id="XXX"></a>X</h2>
<div class="sectionbody">
<div class="paragraph"><p></p></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_yyy_a_y"><a id="YYY"></a>Y</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="Yang98"></a>
<a href="http://citeseer.ist.psu.edu/53925.html">Encoding Types in ML-like Languages</a>.
Zhe Yang.
<a href="References#ICFP">ICFP</a> 1998.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_a_id_zzz_a_z"><a id="ZZZ"></a>Z</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="ZiarekEtAl06"></a>
<a href="http://www.cs.purdue.edu/homes/suresh/abstracts.html#icfp06">Stabilizers: A Modular Checkpointing Abstraction for Concurrent Functional Programs</a>.
Lukasz Ziarek, Philip Schatz, and Suresh Jagannathan.
<a href="References#ICFP">ICFP</a> 2006.
</p>
</li>
<li>
<p>
<a id="ZiarekEtAl08"></a>
<a href="http://www.springerlink.com/content/ku5036n4xjj40715/?p=70c738f3dc1546b68580ad328afee59f&pi=0">Flattening tuples in an SSA intermediate representation</a>.
Lukasz Ziarek, Stephen Weeks, and Suresh Jagannathan.
<a href="References#HOSC">HOSC</a> 2008.
</p>
</li>
</ul></div>
</div>
</div>
<div class="sect1">
<h2 id="_abbreviations">Abbreviations</h2>
<div class="sectionbody">
<div class="ulist"><ul>
<li>
<p>
<a id="ACSD"></a> ACSD = International Conference on Application of Concurrency to System Design
</p>
</li>
<li>
<p>
<a id="BABEL"></a> BABEL = Workshop on multi-language infrastructure and interoperability
</p>
</li>
<li>
<p>
<a id="CC"></a> CC = International Conference on Compiler Construction
</p>
</li>
<li>
<p>
<a id="DPCOOL"></a> DPCOOL = Workshop on Declarative Programming in the Context of OO Languages
</p>
</li>
<li>
<p>
<a id="ESOP"></a> ESOP = European Symposium on Programming
</p>
</li>
<li>
<p>
<a id="FLOPS"></a> FLOPS = Symposium on Functional and Logic Programming
</p>
</li>
<li>
<p>
<a id="FPCA"></a> FPCA = Conference on Functional Programming Languages and Computer Architecture
</p>
</li>
<li>
<p>
<a id="HOSC"></a> HOSC = Higher-Order and Symbolic Computation
</p>
</li>
<li>
<p>
<a id="IC"></a> IC = Information and Computation
</p>
</li>
<li>
<p>
<a id="ICCL"></a> ICCL = IEEE International Conference on Computer Languages
</p>
</li>
<li>
<p>
<a id="ICFP"></a> ICFP = International Conference on Functional Programming
</p>
</li>
<li>
<p>
<a id="IFL"></a> IFL = International Workshop on Implementation and Application of Functional Languages
</p>
</li>
<li>
<p>
<a id="IVME"></a> IVME = Workshop on Interpreters, Virtual Machines and Emulators
</p>
</li>
<li>
<p>
<a id="JFLA"></a> JFLA = Journees Francophones des Langages Applicatifs
</p>
</li>
<li>
<p>
<a id="JFP"></a> JFP = Journal of Functional Programming
</p>
</li>
<li>
<p>
<a id="LASC"></a> LASC = Lisp and Symbolic Computation
</p>
</li>
<li>
<p>
<a id="LFP"></a> LFP = Lisp and Functional Programming
</p>
</li>
<li>
<p>
<a id="ML"></a> ML = Workshop on ML
</p>
</li>
<li>
<p>
<a id="PLDI"></a> PLDI = Conference on Programming Language Design and Implementation
</p>
</li>
<li>
<p>
<a id="POPL"></a> POPL = Symposium on Principles of Programming Languages
</p>
</li>
<li>
<p>
<a id="PPDP"></a> PPDP = International Conference on Principles and Practice of Declarative Programming
</p>
</li>
<li>
<p>
<a id="PPoPP"></a> PPoPP = Principles and Practice of Parallel Programming
</p>
</li>
<li>
<p>
<a id="TCS"></a> TCS = IFIP International Conference on Theoretical Computer Science
</p>
</li>
<li>
<p>
<a id="TIC"></a> TIC = Types in Compilation
</p>
</li>
<li>
<p>
<a id="TLDI"></a> TLDI = Workshop on Types in Language Design and Implementation
</p>
</li>
<li>
<p>
<a id="TOPLAS"></a> TOPLAS = Transactions on Programming Languages and Systems
</p>
</li>
<li>
<p>
<a id="TPHOLs"></a> TPHOLs = International Conference on Theorem Proving in Higher Order Logics
</p>
</li>
</ul></div>
</div>
</div>
</div>
<div id="footnotes"><hr></div>
<div id="footer">
<div id="footer-text">
</div>
<div id="footer-badges">
</div>
</div>
</body>
</html>
|
