M. R. Sleep

Transputers + virtual tree kernel = real speedups

D. McBurney, M. R. Sleep, M. Sleep, 1988, C3P.

DACTL: A computational model and compiler target language based on graph reduction

J. R. Kennaway, M. R. Sleep, John Glauert, 1987 .

The adequacy of term graph rewriting for simulating term rewriting

J. R. Kennaway, Jan Willem Klop, M. R. Sleep, 1993 .

A short note concerning lazy reduction rules for append

M. R. Sleep, S. Holmström, 1982 .

Experiments with a virtual tree machine using transputers

M. R. Sleep, D. L. McBurney, 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume 1: Architecture Track.

Assessing word processing skills by computer

M. R. Sleep, R. D. Dowsing, S. Long, 1998 .

An introduction to term graph rewriting

J. R. Kennaway, Jan Willem Klop, M. R. Sleep, 1993 .

Event structures and orthogonal term graph rewriting

J. R. Kennaway, Jan Willem Klop, M. R. Sleep, 1993 .

Parallel execution of concurrent clean on ZAPP

M. R. Sleep, D. L. McBurney, R. G. Goldsmith, 1993 .

An infinitary Church-Rosser property for non-collapsing orthogonal term rewriting systems

J. R. Kennaway, Jan Willem Klop, M. R. Sleep, 1993 .