Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| The history of Standard ML | 0 | 0.34 | 2020 |
| Engineering higher-order modules in SML/NJ | 2 | 0.37 | 2009 |
| A rewriting semantics for type inference | 11 | 0.70 | 2007 |
| Should ML be Object-Oriented? | 2 | 0.45 | 2002 |
| A Semantics for Higher-Order Functors | 27 | 2.44 | 1994 |
| Typing First-Class Continuations in ML | 57 | 6.35 | 1993 |
| Reflections on Standard ML | 2 | 0.42 | 1993 |
| Computing ML equality kinds using abstract interpretation | 3 | 0.63 | 1993 |
| Typing first-class continuations in ML | 40 | 6.38 | 1991 |
| An Abstract Interpretation for ML Equality Kinds | 2 | 1.54 | 1991 |
| Standard ML of New Jersey. | 125 | 21.25 | 1991 |
| An implementation of standard ML modules | 16 | 2.61 | 1988 |
| A standard ML compiler | 67 | 24.80 | 1987 |
| An ideal model for recursive polymorphic types | 142 | 40.03 | 1986 |
| Using dependent types to express modular structure | 91 | 23.44 | 1986 |
| Coroutines and Networks of Parallel Processes | 261 | 96.48 | 1977 |
| Selection In Abstract Recursion Theory | 2 | 1.14 | 1976 |