IWC 2014 WORKSHOP PROCEEDINGS: KEYWORD INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index Additional files

Shortcuts: C H L N P R T W

C
certification	Certification of Confluence Proofs using CeTA (PDF, talk)
conditional rewriting	On Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation (PDF, talk)
confluence	Normalization Equivalence of Rewrite Systems (PDF, talk) Certification of Confluence Proofs using CeTA (PDF, talk) On Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation (PDF, talk) Confluence and Critical-Pair-Closing Systems (PDF, talk) Non-E-overlapping and weakly shallow TRSs are confluent (Extended abstract) (PDF, talk)
confluence in algebra	Confluence of linear rewriting and homology of algebras (PDF, talk)
conversion equivalence	Normalization Equivalence of Rewrite Systems (PDF, talk)
critical pair	Critical Pairs in Network Rewriting (PDF, talk)
critical pairs	Confluence and Critical-Pair-Closing Systems (PDF, talk)
H
higher-dimensional rewriting	Confluence of linear rewriting and homology of algebras (PDF, talk)
L
linear rewriting and generalized gröbner basis	Confluence of linear rewriting and homology of algebras (PDF, talk)
N
network rewriting	Critical Pairs in Network Rewriting (PDF, talk)
Non-Linear	Non-E-overlapping and weakly shallow TRSs are confluent (Extended abstract) (PDF, talk)
nonconvex subexpression	Critical Pairs in Network Rewriting (PDF, talk)
normalization equivalence	Normalization Equivalence of Rewrite Systems (PDF, talk)
P
Parallel Closedness Theorem	Confluence and Critical-Pair-Closing Systems (PDF, talk)
program transformation	On Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation (PDF, talk)
R
relative termination	Confluence and Critical-Pair-Closing Systems (PDF, talk)
T
term rewriting	Normalization Equivalence of Rewrite Systems (PDF, talk) Certification of Confluence Proofs using CeTA (PDF, talk)
Term rewriting systems	Non-E-overlapping and weakly shallow TRSs are confluent (Extended abstract) (PDF, talk)
theorem proving	Certification of Confluence Proofs using CeTA (PDF, talk)
W
weakly shallow	Non-E-overlapping and weakly shallow TRSs are confluent (Extended abstract) (PDF, talk)
wrap ambiguity	Critical Pairs in Network Rewriting (PDF, talk)