Proof of termination of the rewriting system subst on CCL-Reference-Cited by-同舟云学术

Proof of termination of the rewriting system subst on CCL

Published:1986 Issue: Volume:46 Page:305-312
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Hardin Thérèse,Laville Alain

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference12 articles.

1. Utilisation des systèmes de réécriture d'expressions fonctionnelles comme outils de transformation de programmes itératifs;Bellegarde,1985

2. F. Bellegarde and P. Lescanne, Termination proofs based on transformation techniques, Centre de Recherche en Informatique de Nancy, Rapport CRIN 86-R-034.

3. An actual implementation of a procedure that mechamically proves termination of rewriting systems based on inequalities between polynomial interpretations;Cherifa,1986

4. Categorical Combinators, Sequential Algorithms and Functional Programming;Curien,1985

5. Orderings for term-rewriting systems;Dershowitz;Theoret. Comput. Sci.,1980

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems;Automated Reasoning;2006

2. TPA: Termination Proved Automatically;Lecture Notes in Computer Science;2006

3. Explicit Substitutions à la de Bruijn;Electronic Notes in Theoretical Computer Science;2003-09

4. Formalizing strong normalization proofs of explicit substitution calculi in ALF;Journal of Automated Reasoning;2003

5. Confluence of extensional and non-extensional λ-calculi with explicit substitutions;Theoretical Computer Science;2000-05