David M. R. Park

According to our database, David M. R. Park authored at least 9 papers between 1963 and 1983.

Collaborative distances:

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

1983

Reasoning with Fairness Constraints.

David Michael Ritchie Park

Proceedings of the Fundamentals of Computation Theory, 1983

1981

Concurrency and Automata on Infinite Sequences.

David Michael Ritchie Park

Proceedings of the Theoretical Computer Science, 1981

1979

When are two Effectively given Domains Identical?.

Akira Kanda, David Michael Ritchie Park

Proceedings of the Theoretical Computer Science, 1979

On the Semantics of Fair Parallelism.

David Michael Ritchie Park

Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, January 22, 1979

1976

Finiteness is Mu-Ineffable.

David Michael Ritchie Park

Theor. Comput. Sci., 1976

1975

On the Termination of Program Schemas

A. J. Kfoury, David Michael Ritchie Park

Inf. Control., November, 1975

1972

Induction Rules and Termination Proofs.

Peter Hitchcock, David Michael Ritchie Park

Proceedings of the Automata, 1972

1970

On Formalised Computer Programs.

David C. Luckham, David Michael Ritchie Park, Mike Paterson

J. Comput. Syst. Sci., 1970

1963

CYCLOPS-1: a second-generation recognition system.

T. Marrill, A. K. Hartley, Thomas G. Evans, Burton H. Bloom, David Michael Ritchie Park, Timothy P. Hart, D. Lucille Darley

Proceedings of the 1963 fall joint computer conference, 1963