Confluent Term Rewriting Systems / Yoshihito Toyama |
Generalized Innermost Rewriting / Jaco van de Pol ; Hans Zantema |
Orderings for Innermost Termination / Mirtha-Lina Fernández ; Guillem Godoy ; Albert Rubio |
Leanest Quasi-orderings / Nachum Dershowitz ; E. Castedo Ellerman |
Abstract Modularity / Michael Abbott ; Neil Ghani ; Christoph Lüth |
Union of Equational Theories: An Algebraic Approach / Piotr Hoffman |
Equivariant Unification / James Cheney |
Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories / Christopher Lynch ; Barbara Morawska |
Unification in a Class of Permutative Theories / Thierry Boy de la Tour ; Mnacho Echenim |
Dependency Pairs for Simply Typed Term Rewriting / Takahito Aoto ; Toshiyuki Yamada |
Universal Algebra for Termination of Higher-Order Rewriting / Makoto Hamana |
Quasi-interpretations and Small Space Bounds / Guillaume Bonfante ; Jean-Yves Marion ; Jean-Yves Moyen |
A Sufficient Completeness Reasoning Tool for Partial Specifications / Joe Hendrix ; Manuel Clavel ; José Meseguer |
Tyrolean Termination Tool / Nao Hirokawa ; Aart Middeldorp |
Call-by-Value Is Dual to Call-by-Name - Reloaded / Philip Wadler |
λμ-Calculus and Duality: Call-by-Name and Call-by-Value / Jérôme Rocheteau |
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics / Alex Simpson |
Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-Complete / Ryo Yoshinaka |
Localized Fairness: A Rewriting Semantics |
Partial Inversion of Constructor Term Rewriting Systems / Naoki Nishida ; Masahiko Sakai ; Toshiki Sakabe |
Natural Narrowing for General Term Rewriting Systems / Santiago Escobar ; Prasanna Thati |
The Finite Variant Property: How to Get Rid of Some Algebraic Properties / Hubert Comon-Lundh ; Stéphanie Delaune |
Intruder Deduction for AC-Like Equational Theories with Homomorphisms / Pascal Lafourcade ; Denis Lugiez ; Ralf Treinen |
Proving Positive Almost-Sure Termination / Olivier Bournez ; Florent Garnier |
Termination of Single-Threaded One-Rule Semi-Thue Systems / Wojciech Moczyd&lstroke;owski ; Alfons Geser |
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems / Dieter Hofbauer ; Johannes Waldmann |
Twenty Years Later / Jean-Pierre Jouannaud |
Open. Closed. Open |
A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code / Amy P. Felty |
Extending the Explicit Substitution Paradigm / Delia Kesner ; Stéphane Lengrand |
Arithmetic as a Theory Modulo / Gilles Dowek ; Benjamin Werner |
Infinitary Combinatory Reduction Systems / Jeroen Ketema ; Jakob Grue Simonsen |
Proof-Producing Congruence Closure / Robert Nieuwenhuis ; Albert Oliveras |
The Algebra of Equality Proofs / Aaron Stump ; Li-Yang Tan |
On Computing Reachability Sets of Process Rewrite Systems / Ahmed Bouajjani ; Tayssir Touili |
Automata and Logics for Unranked and Unordered Trees / Iovka Boneva ; Jean-Marc Talbot |
Author Index |
Confluent Term Rewriting Systems / Yoshihito Toyama |
Generalized Innermost Rewriting / Jaco van de Pol ; Hans Zantema |
Orderings for Innermost Termination / Mirtha-Lina Fernández ; Guillem Godoy ; Albert Rubio |
Leanest Quasi-orderings / Nachum Dershowitz ; E. Castedo Ellerman |
Abstract Modularity / Michael Abbott ; Neil Ghani ; Christoph Lüth |
Union of Equational Theories: An Algebraic Approach / Piotr Hoffman |