Bibliography

1

I. Durand.
Bounded, strongly sequential and forward-branching term rewriting systems.
Journal of Symbolic Computation, 18:319-352, 1994.

2

I. Durand.
Autowrite: A tool for term rewrite systems and tree automata.
In Workshop on Rewriting Strategies, Electronics Notes in Theorical Computer Science, Aachen, June 2004.
To appear in ENTCS.

3

I. Durand and A. Middeldorp.
Decidable call by need computations in term rewriting (extended abstract).
In Proceedings of the 14th International Conference on Automated Deduction, volume 1249 of Lecture Notes in Artificial Intelligence, pages 4-18, 1997.

4

I. Durand and A. Middeldorp.
On the complexity of deciding call-by-need.
Technical Report 1194-98, LaBRI, Université de Bordeaux I, 1998.

5

I. Durand and A. Middeldorp.
On the modularity of deciding call-by-need.
In Proceedings of the Internation Conference on Foundations of Software Science and Computation Structures, volume 2030 of Lecture Notes in Computer Science, pages 199-213, 2001.

6

I. Durand and Aart Middeldorp.
Decidable call-by-need computations in term rewriting.
Information and Computation, 196:95-126, 2005.

7

F. Jacquemard.
Decidable approximations of term rewriting systems.
In Proceedings of the 7th International Conference on Rewriting Techniques and Applications, volume 1103 of Lecture Notes in Computer Science, pages 362-376, 1996.

8

T. Nagaya and Y. Toyama.
Decidability for left-linear growing term rewriting systems.
Information and Computation, 178(2):499-514, 2002.

9

B. Salinier and R. Strandh.
Efficient simulation of forward-branching systems.
Journal of Symbolic Computation, 1996.