论文信息 - NVNF-sequentiality of Left-linear Term Rewriting Systems

NVNF-sequentiality of Left-linear Term Rewriting Systems

This paper introduces NVNF-sequentiality which is an extension of NV-sequentiality defined by Oyamaguchi. It is shown that the class of NVNF-sequential systems properly includes the class of -sequential systems, and the indices with respect to NVNFsequentiality are computed for a given term when a term rewriting system is NVNFsequential. NVNF-sequentiality is decidable, and the index reduction is normalizing strategy for NVNF-sequential orthogonal term rewriting systems.

Yoshihito Toyama | Masahiko Sakai | Takashi Nagaya

[1] Yoshihito Toyama. Strong sequentiality of left-linear overlapping term rewriting systems , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[2] Michio Oyamaguchi. NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems , 1993, SIAM J. Comput..

[3] M. Oyamaguchi,et al. The reachability problem for quasi-ground term rewriting systems , 1986 .

[4] Jean-Pierre Jouannaud,et al. Strong Sequentiality of Left-Linear Overlapping Rewrite Systems , 1994, CTRS.

[5] Hubert Comon,et al. Sequentiality, second order monadic logic and tree automata , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[6] Aart Middeldorp,et al. Sequentiality in Orthogonal Term Rewriting Systems , 1991, J. Symb. Comput..

[7] Sophie Tison,et al. Decidability of the Confluence of Finite Ground Term Rewrite Systems and of Other Related Term Rewrite Systems , 1990, Inf. Comput..