Search the dblp DataBase
David B. MacQueen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Luca Cardelli, David B. MacQueen
Persistence and Type Abstraction. [Citation Graph (4, 0)][DBLP]
Data Types and Persistence (Appin), 1985, pp:31-41 [Conf] - David B. MacQueen
Modules for Standard ML. [Citation Graph (3, 0)][DBLP]
LISP and Functional Programming, 1984, pp:198-207 [Conf] - David B. MacQueen
Using Dependent Types to Express Modular Structure. [Citation Graph (2, 0)][DBLP]
POPL, 1986, pp:277-286 [Conf] - David B. MacQueen, Gordon D. Plotkin, Ravi Sethi
An Ideal Model for Recursive Polymorphic Types. [Citation Graph (2, 0)][DBLP]
POPL, 1984, pp:165-174 [Conf] - David B. MacQueen, Gordon D. Plotkin, Ravi Sethi
An Ideal Model for Recursive Polymorphic Types [Citation Graph (2, 0)][DBLP]
Information and Control, 1986, v:71, n:1/2, pp:95-130 [Journal] - Andrew W. Appel, David B. MacQueen
Standard ML of New Jersey. [Citation Graph (1, 0)][DBLP]
PLILP, 1991, pp:1-13 [Conf] - David B. MacQueen, Mads Tofte
A Semantics for Higher-Order Functors. [Citation Graph (0, 0)][DBLP]
ESOP, 1994, pp:409-423 [Conf] - Andrew W. Appel, David B. MacQueen
A Standard ML compiler. [Citation Graph (0, 0)][DBLP]
FPCA, 1987, pp:301-324 [Conf] - Gilles Kahn, David B. MacQueen
Coroutines and Networks of Parallel Processes. [Citation Graph (0, 0)][DBLP]
IFIP Congress, 1977, pp:993-998 [Conf] - Rod M. Burstall, David B. MacQueen, Donald Sannella
HOPE: An Experimental Applicative Language. [Citation Graph (0, 0)][DBLP]
LISP Conference, 1980, pp:136-143 [Conf] - David B. MacQueen
An Implementation of Standard ML Modules. [Citation Graph (0, 0)][DBLP]
LISP and Functional Programming, 1988, pp:212-223 [Conf] - David B. MacQueen, Ravi Sethi
A Semantic Model of Types for Applicative Languages. [Citation Graph (0, 0)][DBLP]
Symposium on LISP and Functional Programming, 1982, pp:243-252 [Conf] - David B. MacQueen
Reflections on Standard ML. [Citation Graph (0, 0)][DBLP]
Functional Programming, Concurrency, Simulation and Automated Reasoning, 1993, pp:32-46 [Conf] - Andrew W. Appel, David B. MacQueen
Separate Compilation for Standard ML. [Citation Graph (0, 0)][DBLP]
PLDI, 1994, pp:13-23 [Conf] - Bruce F. Duba, Robert Harper, David B. MacQueen
Typing First-Class Continuations in ML. [Citation Graph (0, 0)][DBLP]
POPL, 1991, pp:163-173 [Conf] - Luca Cardelli, David B. MacQueen
Persistence and Type Abstraction. [Citation Graph (0, 0)][DBLP]
Data Types and Persistence (Appin), Informal Proceedings, 1985, pp:221-230 [Conf] - Carl A. Gunter, Elsa L. Gunter, David B. MacQueen
An Abstract Interpretation for ML Equality Kinds. [Citation Graph (0, 0)][DBLP]
TACS, 1991, pp:112-130 [Conf] - David B. MacQueen
Should ML be Object-Oriented? [Citation Graph (0, 0)][DBLP]
Formal Asp. Comput., 2002, v:13, n:3-5, pp:214-232 [Journal] - Carl A. Gunter, Elsa L. Gunter, David B. MacQueen
Computing ML Equality Kinds Using Abstract Interpretation [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1993, v:107, n:2, pp:303-323 [Journal] - Robert Harper, Bruce F. Duba, David B. MacQueen
Typing First-Class Continuations in ML. [Citation Graph (0, 0)][DBLP]
J. Funct. Program., 1993, v:3, n:4, pp:465-484 [Journal] - Leo Harrington, David B. MacQueen
Selection in Abstract Recursion Theory. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1976, v:41, n:1, pp:153-158 [Journal] - David B. MacQueen, Donald Sannella
Completeness of Proof Systems for Equational Specifications. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Software Eng., 1985, v:11, n:5, pp:454-461 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002