Abstract is missing.
- Confluent Term Rewriting SystemsYoshihito Toyama. 1 [doi]
- Generalized Innermost RewritingJaco van de Pol, Hans Zantema. 2-16 [doi]
- Orderings for Innermost TerminationMirtha-Lina Fernández, Guillem Godoy, Albert Rubio. 17-31 [doi]
- Leanest Quasi-orderingsNachum Dershowitz, E. Castedo Ellerman. 32-45 [doi]
- Abstract ModularityMichael Abbott, Neil Ghani, Christoph Lüth. 46-60 [doi]
- Union of Equational Theories: An Algebraic ApproachPiotr Hoffman. 61-73 [doi]
- Equivariant UnificationJames Cheney. 74-89 [doi]
- Faster ::::Basic Syntactic Mutation:::: with Sorts for Some Separable Equational TheoriesChristopher Lynch, Barbara Morawska. 90-104 [doi]
- Unification in a Class of Permutative TheoriesThierry Boy de la Tour, Mnacho Echenim. 105-119 [doi]
- Dependency Pairs for Simply Typed Term RewritingTakahito Aoto, Toshiyuki Yamada. 120-134 [doi]
- Universal Algebra for Termination of Higher-Order RewritingMakoto Hamana. 135-149 [doi]
- Quasi-interpretations and Small Space BoundsGuillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. 150-164 [doi]
- A Sufficient Completeness Reasoning Tool for Partial SpecificationsJoe Hendrix, Manuel Clavel, José Meseguer. 165-174 [doi]
- Tyrolean Termination ToolNao Hirokawa, Aart Middeldorp. 175-184 [doi]
- Call-by-Value Is Dual to Call-by-Name - ReloadedPhilip Wadler. 185-203 [doi]
- lambda-µ-Calculus and Duality: Call-by-Name and Call-by-ValueJérôme Rocheteau. 204-218 [doi]
- Reduction in a Linear Lambda-Calculus with Applications to Operational SemanticsAlex K. Simpson. 219-234 [doi]
- Higher-Order Matching in the Linear Lambda Calculus in the Absence of Constants Is NP-CompleteRyo Yoshinaka. 235-249 [doi]
- Localized Fairness: A Rewriting SemanticsJosé Meseguer. 250-263 [doi]
- Partial Inversion of Constructor Term Rewriting SystemsNaoki Nishida, Masahiko Sakai, Toshiki Sakabe. 264-278 [doi]
- Natural Narrowing for General Term Rewriting SystemsSantiago Escobar, José Meseguer, Prasanna Thati. 279-293 [doi]
- The Finite Variant Property: How to Get Rid of Some Algebraic PropertiesHubert Comon-Lundh, Stéphanie Delaune. 294-307 [doi]
- Intruder Deduction for ::::AC::::-Like Equational Theories with HomomorphismsPascal Lafourcade, Denis Lugiez, Ralf Treinen. 308-322 [doi]
- Proving Positive Almost-Sure TerminationOlivier Bournez, Florent Garnier. 323-337 [doi]
- Termination of Single-Threaded One-Rule Semi-Thue SystemsWojciech Moczydlowski, Alfons Geser. 338-352 [doi]
- On Tree Automata that Certify Termination of Left-Linear Term Rewriting SystemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. 353-367 [doi]
- Twenty Years LaterJean-Pierre Jouannaud. 368-375 [doi]
- Open. Closed. OpenNachum Dershowitz. 376-393 [doi]
- A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying CodeAmy P. Felty. 394-406 [doi]
- Extending the Explicit Substitution ParadigmDelia Kesner, Stéphane Lengrand. 407-422 [doi]
- Arithmetic as a Theory ModuloGilles Dowek, Benjamin Werner. 423-437 [doi]
- Infinitary Combinatory Reduction SystemsJeroen Ketema, Jakob Grue Simonsen. 438-452 [doi]
- Proof-Producing Congruence ClosureRobert Nieuwenhuis, Albert Oliveras. 453-468 [doi]
- The Algebra of Equality ProofsAaron Stump, Li-Yang Tan. 469-483 [doi]
- On Computing Reachability Sets of Process Rewrite SystemsAhmed Bouajjani, Tayssir Touili. 484-499 [doi]
- Automata and Logics for Unranked and Unordered TreesIovka Boneva, Jean-Marc Talbot. 500-515 [doi]