60. Birthday: Jean-Pierre Jouannaud, 2007

Rewriting Foundations

• Nachum Dershowitz, Georg Moser:
  The Hydra Battle Revisited. 1-27
  Electronic Edition (link) BibTeX
• Cristina Borralleras, Albert Rubio:
  Orderings and Constraints: Theory and Practice of Proving Termination. 28-43
  Electronic Edition (link) BibTeX
• Isabelle Gnaedig, Hélène Kirchner:
  Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations. 44-67
  Electronic Edition (link) BibTeX
• Frédéric Blanqui:
  Computability Closure: Ten Years Later. 68-88
  Electronic Edition (link) BibTeX
• Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk:
  Reduction Strategies and Acyclicity. 89-112
  Electronic Edition (link) BibTeX

Proof and Computation

• Jacek Chrzaszcz, Daria Walukiewicz-Chrzaszcz:
  Towards Rewriting in Coq. 113-131
  Electronic Edition (link) BibTeX
• Paul Brauner, Clément Houtmann, Claude Kirchner:
  Superdeduction at Work. 132-166
  Electronic Edition (link) BibTeX
• Mitsuhiro Okada, Ryo Takemura:
  Remarks on Semantic Completeness for Proof-Terms with Laird's Dual Affine/Intuitionistic lambda -Calculus. 167-181
  Electronic Edition (link) BibTeX
• Sandra Alves, Maribel Fernández, Mário Florido, Ian Mackie:
  Linear Recursive Functions. 182-195
  Electronic Edition (link) BibTeX

Towards Safety and Security

• Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
  Deducibility Constraints, Equational Theory and Electronic Money. 196-212
  Electronic Edition (link) BibTeX
• Abdessamad Imine, Michaël Rusinowitch:
  Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms. 213-234
  Electronic Edition (link) BibTeX
• Claude Marché:
  Towards Modular Algebraic Specifications for Pointer Programs: A Case Study. 235-258
  Electronic Edition (link) BibTeX
• Evelyne Contejean:
  Modeling Permutations in Coqfor Coccinelle. 259-269
  Electronic Edition (link) BibTeX