Next: About this document ...
Up: Autowrite: User's Guide (Still
Previous: Snapshots of a session
 1

I. Durand.
Bounded, strongly sequential and forwardbranching term rewriting
systems.
Journal of Symbolic Computation, 18:319352, 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 418, 1997.
 4

I. Durand and A. Middeldorp.
On the complexity of deciding callbyneed.
Technical Report 119498, LaBRI, Université de Bordeaux I, 1998.
 5

I. Durand and A. Middeldorp.
On the modularity of deciding callbyneed.
In Proceedings of the Internation Conference on Foundations of
Software Science and Computation Structures, volume 2030 of Lecture
Notes in Computer Science, pages 199213, 2001.
 6

I. Durand and Aart Middeldorp.
Decidable callbyneed computations in term rewriting.
Information and Computation, 196:95126, 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 362376, 1996.
 8

T. Nagaya and Y. Toyama.
Decidability for leftlinear growing term rewriting systems.
Information and Computation, 178(2):499514, 2002.
 9

B. Salinier and R. Strandh.
Efficient simulation of forwardbranching systems.
Journal of Symbolic Computation, 1996.
Irene DURAND
20050201