Slides useful to George:

Research:Papers:

91Q2 ECRC Talk:
¥	91Q2 ECRC Slides B
			General Rewriting Introduction
			Background to Dactl
			Rewriting Model without markings
			Rewriting with markings
			Term Graph rewriting
			Combinator rewriting
			Message Passing
			George: Parlog and GHC
o	91Q2 Revised Soton Slides
			General Rewriting Introduction
			Background to Dactl
			Rewriting Model without markings
			Rewriting with markings
			Combinator rewriting
			Message Passing
			George: Parlog and GHC
91Q4 Sema Symposium:
	91Q4 SemaSym Dactl:
¥		91Q4 SemSymDac Slides B
			Background to Dactl
			Rewriting Model without markings
			Rewriting with markings
			Examples: Functional, systems, Process
o	92Q1 Dagstuhl Slides Z
			Start of a Procs talk
			Remains as 91Q4 SemsymDac

Comment on Parlog bits:
The example of Disjoint patterns for Parlog looks bad.
What about  t(X,q,Y) ? This will fail the pattern test, but should lead to evaluation of tree_search on X and Y.