Rewriting, Computation and Proof Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday

Rewriting, Computation and Proof Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / edited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner.

Jean-Pierre Jouannaud has deeply influenced, and is still influencing, research in Informatics, through the many important results he has produced in various research fields and through the generations of scholars he has educated. He has played a leading role in field of rewriting and its technology...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Comon-Lundh, Hubert (Editor), Kirchner, Claude (Editor), Kirchner, Hélène (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edition:1st ed. 2007.
Series:Theoretical Computer Science and General Issues ; 4600
Springer eBook Collection.
Subjects:
Mathematical logic.
Computer logic.
Programming languages (Electronic computers).
Computer programming.
Software engineering.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Rewriting Foundations
  • The Hydra Battle Revisited
  • Orderings and Constraints: Theory and Practice of Proving Termination
  • Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
  • Computability Closure: Ten Years Later
  • Reduction Strategies and Acyclicity
  • Proof and Computation
  • Towards Rewriting in Coq
  • Superdeduction at Work
  • Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic ?-Calculus
  • Linear Recursive Functions
  • Towards Safety and Security
  • Deducibility Constraints, Equational Theory and Electronic Money
  • Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms
  • Towards Modular Algebraic Specifications for Pointer Programs: A Case Study
  • Modeling Permutations in Coq for Coccinelle.

Similar Items