David N. Turner

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2000
Local type inference.
ACM Trans. Program. Lang. Syst., 2000

Pict: a programming language based on the Pi-Calculus.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
Linearity and the pi-calculus.
ACM Trans. Program. Lang. Syst., 1999

Operational Interpretations of Linear Logic.
Theor. Comput. Sci., 1999

Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus.
Theor. Comput. Sci., 1999

1998
Local Type Inference.
Proceedings of the POPL '98, 1998

1996
The polymorphic Pi-calculus : theory and implementation.
PhD thesis, 1996

Linearity and the Pi-Calculus.
Proceedings of the Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1996

1995
Call-by-name, call-by-value, call-by-need and the linear lambda calculus.
Electr. Notes Theor. Comput. Sci., 1995

Once Upon a Type.
Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

1994
Simple Type-Theoretic Foundations for Object-Oriented Programming.
J. Funct. Program., 1994

1993
Object-Oriented Programming without Recursive Types.
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.
Proceedings of the Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1992


  Loading...