Some characteristics of strong innermost normalization

DOI10.1016/S0304-3975(99)00215-7MaRDI QIDQ1575274zbMATH OpenFDO

Authors M. R. K. Krishna Rao

Publication date 21 August 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(99)00215-7

zbMATH Keywords

term rewriting system

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• On strong normalities
• Foundations of Software Science and Computation Structures
• Strong normalization from an unusual point of view
• On strong normality
• Computer Science Logic
• Strongly normalizing extensions
• scientific article; zbMATH DE number 4055611
• Short Proofs of Strong Normalization
• scientific article; zbMATH DE number 5932763
• On Strongly Normal Functions

Cites work

• Completeness of combinations of constructor systems
• Counterexamples to termination for the direct sum of term rewriting systems
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 408800 (Why is no real title available?)
• scientific article; zbMATH DE number 1354152 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1479616 (Why is no real title available?)
• scientific article; zbMATH DE number 794237 (Why is no real title available?)
• Modular aspects of term graph rewriting
• On proving termination by innermost termination
• On the modularity of termination of term rewriting systems
• Proving innermost normalisation automatically
• Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems
• The integration of functions into logic programming: From theory to practice

Cited in

(7)

• Induction for termination with local strategies
• Outermost ground termination
• Uncurrying for termination and complexity
• Proving innermost normalisation automatically
• Foundations of Software Science and Computation Structures
• From innermost to full almost-sure termination of probabilistic term rewriting
• From innermost to full probabilistic term rewriting: almost-sure termination, complexity, and modularity

This page was built for publication: Some characteristics of strong innermost normalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575274)