A Critique of Standard ML

A Critique of Standard ML (1992)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Andrew W. Appel

Citations:

89 - 4 self

BibTeX

@MISC{Appel92acritique,
    author = {Andrew W. Appel},
    title = {A Critique of Standard ML},
    year = {1992}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Standard ML is an excellent language for many kinds of programming. It is safe, efficient, suitably abstract, and concise. There are many aspects of the language that work well. However, nothing is perfect: Standard ML has a few shortcomings. In some cases there are obvious solutions, and in other cases further research is required.

Citations

1497	The Definition of Standard ML - Milner, Tofte, et al. - 1997
1128	The C Programming Language - Kernighan, Ritchie - 1988
874	A theory of type polymorphism in programming - Milner - 1978
595	Compiling with Continuations - Appel - 1992
420	Scheduler activations: Effective kernel support for the user-level management of threads - Anderson, Bershad, et al. - 1992
315	How to make ad-hoc polymorphism less ad-hoc - Wadler, Blott - 1989
234	A Real-Time Garbage Collector Based on the Lifetime of Objects - Lieberman, Hewitt - 1983
211	Polymorphic effect systems - Lucassen, Gifford - 1988
192	Standard ML of New Jersey - McQueen, Appel - 1991
180	Modules for Standard ML - MacQueen - 1984
163	Unboxed objects and polymorphic typing - Leroy - 1992
141	Programming in Modula-2 - Wirth - 1982
125	The Design and Evaluation of a High Performance Smalltalk System. ACM distinguished dissertation - Ungar - 1986
114	Polymorphic type, region and effect inference - Talpin, Jouvelot - 1992
107	Algebraic reconstruction of types and effects - Jouvelot, Gifford - 1991
104	Type inference for polymorphic references - Tofte - 1990
92	Type Assignment in Programming Languages - Damas - 1984
89	A Standard ML compiler - Appel, MacQueen - 1987
89	Revised Report on the Algorithmic Language Scheme - Rees, Clinger - 1986
88	Typing first-class continuations in ML - Harper, Duba, et al. - 1993
69	Continuation-based multiprocessing - Wand
61	Runtime tags aren't necessary - Appel - 1989
60	Smartest recompilation - Shao, Appel - 1993
58	Compiling a functional language - Cardelli - 1984
58	Adding threads to standard ML - Cooper, Morrisett - 1990
53	Type inference in the presence of overloading, subtyping and recursive types - Kaes - 1992
53	Dynamics in ML - Leroy, Mauny - 1991
50	The essence of functional programming (invited talk - Wadler - 1992
49	Heap profiling of lazy functional programs - Runciman, Wakelin - 1993
47	Polymorphic type inference and assignment - Leroy, Weis - 1991
29	Manual and Report - PASCAL - 1974
25	Improving garbage collector performance in virtual memory - Shaw - 1987
24	C Traps and Pitfalls - Koenig - 1988
7	The eXene Library Manual - Reppy, Gansner - 1993
6	Concurrent programming with events - Reppy - 1990
4	Hints on programming-language design - Hoare - 1989
1	Is explicit deallocation really faster than garbage collection? unpublished manuscript - Clinger, Hansen - 1992
1	weak-types. Distributed with Standard ML - MacQueen - 1988
1	personal communication from Scott Nettles - Nettles, O'Toole - 1990