| 2000 |
|---|
| 13 | | Benjamin C. Pierce,
David N. Turner:
Pict: a programming language based on the Pi-Calculus.
Proof, Language, and Interaction 2000: 455-494 |
| 12 | EE | Benjamin C. Pierce,
David N. Turner:
Local type inference.
ACM Trans. Program. Lang. Syst. 22(1): 1-44 (2000) |
| 1999 |
|---|
| 11 | EE | Naoki Kobayashi,
Benjamin C. Pierce,
David N. Turner:
Linearity and the pi-calculus.
ACM Trans. Program. Lang. Syst. 21(5): 914-947 (1999) |
| 10 | EE | David N. Turner,
Philip Wadler:
Operational Interpretations of Linear Logic.
Theor. Comput. Sci. 227(1-2): 231-248 (1999) |
| 9 | EE | John Maraist,
Martin Odersky,
David N. Turner,
Philip Wadler:
Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus.
Theor. Comput. Sci. 228(1-2): 175-210 (1999) |
| 1998 |
|---|
| 8 | EE | Benjamin C. Pierce,
David N. Turner:
Local Type Inference.
POPL 1998: 252-265 |
| 1996 |
|---|
| 7 | | David N. Turner:
Functional Programming, Glasgow 1995
Springer 1996 |
| 6 | EE | Naoki Kobayashi,
Benjamin C. Pierce,
David N. Turner:
Linearity and the Pi-Calculus.
POPL 1996: 358-371 |
| 1995 |
|---|
| 5 | | David N. Turner,
Philip Wadler,
Christian Mossin:
Once Upon a Type.
FPCA 1995: 1-11 |
| 4 | EE | John Maraist,
Martin Odersky,
David N. Turner,
Philip Wadler:
Call-by-name, call-by-value, call-by-need and the linear lambda calculus.
Electr. Notes Theor. Comput. Sci. 1: (1995) |
| 1994 |
|---|
| 3 | | Benjamin C. Pierce,
David N. Turner:
Simple Type-Theoretic Foundations for Object-Oriented Programming.
J. Funct. Program. 4(2): 207-247 (1994) |
| 1993 |
|---|
| 2 | | Benjamin C. Pierce,
David N. Turner:
Object-Oriented Programming without Recursive Types.
POPL 1993: 299-312 |
| 1992 |
|---|
| 1 | | Dave Berry,
Robin Milner,
David N. Turner:
A Semantics for ML Concurrency Primitives.
POPL 1992: 119-129 |
