| 2002 |
|---|
| 23 | EE | David B. MacQueen:
Should ML be Object-Oriented?
Formal Asp. Comput. 13(3-5): 214-232 (2002) |
| 1994 |
|---|
| 22 | | David B. MacQueen,
Mads Tofte:
A Semantics for Higher-Order Functors.
ESOP 1994: 409-423 |
| 21 | | Andrew W. Appel,
David B. MacQueen:
Separate Compilation for Standard ML.
PLDI 1994: 13-23 |
| 1993 |
|---|
| 20 | | David B. MacQueen:
Reflections on Standard ML.
Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 32-46 |
| 19 | | Carl A. Gunter,
Elsa L. Gunter,
David B. MacQueen:
Computing ML Equality Kinds Using Abstract Interpretation
Inf. Comput. 107(2): 303-323 (1993) |
| 18 | | Robert Harper,
Bruce F. Duba,
David B. MacQueen:
Typing First-Class Continuations in ML.
J. Funct. Program. 3(4): 465-484 (1993) |
| 1991 |
|---|
| 17 | | Andrew W. Appel,
David B. MacQueen:
Standard ML of New Jersey.
PLILP 1991: 1-13 |
| 16 | | Bruce F. Duba,
Robert Harper,
David B. MacQueen:
Typing First-Class Continuations in ML.
POPL 1991: 163-173 |
| 15 | | Carl A. Gunter,
Elsa L. Gunter,
David B. MacQueen:
An Abstract Interpretation for ML Equality Kinds.
TACS 1991: 112-130 |
| 1988 |
|---|
| 14 | EE | David B. MacQueen:
An Implementation of Standard ML Modules.
LISP and Functional Programming 1988: 212-223 |
| 1987 |
|---|
| 13 | | Andrew W. Appel,
David B. MacQueen:
A Standard ML compiler.
FPCA 1987: 301-324 |
| 1986 |
|---|
| 12 | | David B. MacQueen:
Using Dependent Types to Express Modular Structure.
POPL 1986: 277-286 |
| 11 | | David B. MacQueen,
Gordon D. Plotkin,
Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types
Information and Control 71(1/2): 95-130 (1986) |
| 1985 |
|---|
| 10 | EE | Luca Cardelli,
David B. MacQueen:
Persistence and Type Abstraction.
Data Types and Persistence (Appin) 1985: 31-41 |
| 9 | EE | Luca Cardelli,
David B. MacQueen:
Persistence and Type Abstraction.
Data Types and Persistence (Appin), Informal Proceedings 1985: 221-230 |
| 8 | | David B. MacQueen,
Donald Sannella:
Completeness of Proof Systems for Equational Specifications.
IEEE Trans. Software Eng. 11(5): 454-461 (1985) |
| 1984 |
|---|
| 7 | | Gilles Kahn,
David B. MacQueen,
Gordon D. Plotkin:
Semantics of Data Types, International Symposium, Sophia-Antipolis, France, June 27-29, 1984, Proceedings
Springer 1984 |
| 6 | | David B. MacQueen:
Modules for Standard ML.
LISP and Functional Programming 1984: 198-207 |
| 5 | | David B. MacQueen,
Gordon D. Plotkin,
Ravi Sethi:
An Ideal Model for Recursive Polymorphic Types.
POPL 1984: 165-174 |
| 1982 |
|---|
| 4 | | David B. MacQueen,
Ravi Sethi:
A Semantic Model of Types for Applicative Languages.
Symposium on LISP and Functional Programming 1982: 243-252 |
| 1980 |
|---|
| 3 | | Rod M. Burstall,
David B. MacQueen,
Donald Sannella:
HOPE: An Experimental Applicative Language.
LISP Conference 1980: 136-143 |
| 1977 |
|---|
| 2 | | Gilles Kahn,
David B. MacQueen:
Coroutines and Networks of Parallel Processes.
IFIP Congress 1977: 993-998 |
| 1976 |
|---|
| 1 | | Leo Harrington,
David B. MacQueen:
Selection in Abstract Recursion Theory.
J. Symb. Log. 41(1): 153-158 (1976) |
