Logicality of conditional rewrite systems
From MaRDI portal
Publication:1978646
DOI10.1016/S0304-3975(99)00210-8zbMATH Open0938.68050MaRDI QIDQ1978646FDOQ1978646
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional rewrite rules
- Conditional rewrite rules: Confluence and termination
- A rationale for conditional equational programming
- Title not available (Why is that?)
- Completeness results for basic narrowing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completeness of calculii for axiomatically defined classes of algebras
- Termination proofs of well-moded logic programs via conditional rewrite systems
- Completion-time optimization of rewrite-time goal solving
- Title not available (Why is that?)
- Open problems in rewriting
- Title not available (Why is that?)
Cited In (15)
- Strict coherence of conditional rewriting modulo axioms
- Conditional rewrite rule systems with built-in arithmetic and induction
- Negation with logical variables in conditional rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some general results about proof normalization
- Logic based structure rewriting systems
- Shallow confluence of conditional term rewriting systems
- A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
- Normal forms and normal theories in conditional rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional rewriting logic: Deduction, models and concurrency
This page was built for publication: Logicality of conditional rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978646)
