论文信息 - On the Relation Between Primitive Recursion, Schematization and Divergence

On the Relation Between Primitive Recursion, Schematization and Divergence

The paper presents a new schematization of infinite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is presented by a generating term and a canonical rewrite system. It is proved that the class of primal grammars covers completely the class of crossed rewrite systems. This proof contains a construction of a primal grammar from a crossed rewrite system.

Miki Hermann | M. Hermann

[1] L. Bachmair. Canonical Equational Proofs , 1991, Progress in Theoretical Computer Science.

[2] Deepak Kapur,et al. On Proving Uniform Termination and Restricted Termination of Rewriting Systems , 1983, SIAM J. Comput..

[3] Jean-Pierre Jouannaud,et al. Notations for Rewting , 1991, Bull. EATCS.

[4] Hong Chen,et al. On Finite Representations of Infinite Sequences of Terms , 1990, CTRS.

[5] Hubert Comon. Completion of Rewrite Systems with Membership Constraints , 1992 .

[6] Hélène Kirchner,et al. Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes , 1989, Theor. Comput. Sci..

[7] Hubert Comon-Lundh,et al. Completion of Rewrite Systems with Membership Constraints , 1992, ICALP.

[8] Hélène Kirchner,et al. Meta-rule Synthesis from Crossed Rewrite Systems , 1990, CTRS.

[9] Miki Hermann,et al. Vademecum of Divergent Term Rewriting Systems , 1988 .

[10] Hong Chen,et al. Logic Programming with Recurrence Domains , 1991, ICALP.

[11] Andrea Sattler-Klein,et al. Divergence Phenomena during Completion , 1991, RTA.

[12] François Fages,et al. Complete Sets of Unifiers and Matchers in Equational Theories , 1983, CAAP.

[13] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.