David N. Turner

According to our database, David N. Turner authored at least 10 papers between 1992 and 2000.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2000

Local type inference.

Benjamin C. Pierce, David N. Turner

ACM Trans. Program. Lang. Syst., 2000

Pict: a programming language based on the Pi-Calculus.

Benjamin C. Pierce, David N. Turner

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

Linearity and the pi-calculus.

Naoki Kobayashi, Benjamin C. Pierce, David N. Turner

ACM Trans. Program. Lang. Syst., 1999

Operational Interpretations of Linear Logic.

David N. Turner, Philip Wadler

Theor. Comput. Sci., 1999

1996

The polymorphic Pi-calculus : theory and implementation.

David N. Turner

PhD thesis, 1996

1995

Call-by-name, call-by-value, call-by-need and the linear lambda calculus.

John Maraist, Martin Odersky, David N. Turner, Philip Wadler

Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

Once Upon a Type.

David N. Turner, Philip Wadler, Christian Mossin

Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

1994

Simple Type-Theoretic Foundations for Object-Oriented Programming.

Benjamin C. Pierce, David N. Turner

J. Funct. Program., 1994

1993

Object-Oriented Programming without Recursive Types.

Benjamin C. Pierce, David N. Turner

Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

1992

A Semantics for ML Concurrency Primitives.

Dave Berry, Robin Milner, David N. Turner

Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992