David M. Harland

According to our database, David M. Harland authored at least 15 papers between 1980 and 1987.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of six.

1987

OBJEKT: A Persistent Object Store With An Integrated Garbage Collector.

David M. Harland, Bruno Beloff

ACM SIGPLAN Notices, 1987

1986

Microcoding an object-oriented instruction set.

David M. Harland, Bruno Beloff

SIGARCH Comput. Archit. News, 1986

A recursively microcodable tagged architecture.

David M. Harland

SIGARCH Comput. Archit. News, 1986

1985

Towards a Language for Concurrent Processes.

David M. Harland

Softw. Pract. Exp., 1985

An alternative view of polymorphism.

David M. Harland, Martyn W. Szyplewski, John B. Wainwright

ACM SIGPLAN Notices, 1985

1984

Polymorphic Programming I. Another Language Designed on Semantic Principles.

David M. Harland, Hamish I. E. Gunn

Softw. Pract. Exp., 1984

Polymorphic Programming II. An Orthogonal Tagged High Level Architecture Abstract Machine.

Hamish I. E. Gunn, David M. Harland

Softw. Pract. Exp., 1984

User-Defined Types in a Polymorphic Language.

David M. Harland

Comput. J., 1984

1982

Another look at enumerated types.

David M. Harland, Hamish I. E. Gunn

ACM SIGPLAN Notices, 1982

Subtypes versus Cell Constancy With Subrange Constraints.

David M. Harland

ACM SIGPLAN Notices, 1982

1981

The application of message passing to concurrent programming.

David M. Harland

PhD thesis, 1981

On Facilities for Interprocess Communication.

David M. Harland

Inf. Process. Lett., 1981

Concurrency in a Language Employing Messages.

David M. Harland

Inf. Process. Lett., 1981

Degrees of Constancy in Programming Languages.

Hamish I. E. Gunn, David M. Harland

Inf. Process. Lett., 1981

1980

High Speed Data Acquisition: Running a Realtime Process and a Time-shared System (UNIX) Concurrently.

David M. Harland

Softw. Pract. Exp., 1980