Logicality of conditional rewrite systems

DOI10.1016/S0304-3975(99)00210-8zbMath0938.68050MaRDI QIDQ1978646

Yanyan Li

Publication date: 4 June 2000

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

zbMATH Keywords

logicalityconditional rewrite systemsconditional equational logic

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

Some general results about proof normalization ⋮ Strict coherence of conditional rewriting modulo axioms ⋮ Normal forms and normal theories in conditional rewriting ⋮ Shallow confluence of conditional term rewriting systems

Cites Work

• A rationale for conditional equational programming
• Conditional rewrite rules
• Conditional rewrite rules: Confluence and termination
• Completeness results for basic narrowing
• Completeness of calculii for axiomatically defined classes of algebras
• Completion-time optimization of rewrite-time goal solving
• Open problems in rewriting
• Termination proofs of well-moded logic programs via conditional rewrite systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logicality of conditional rewrite systems