Tome 18 (1984) no. 1

Sommaire

Data types as algorithms
p. 3-22
Hiérarchies de concaténation
p. 23-46
On expressing commutativity by finite Church-Rosser presentations : a note on commutative monoids
p. 47-52
Systolic tree acceptors
p. 53-69
A fast method of deadlock avoidance
p. 71-80