Plus d’un million de livres, à portée de main !
Bookbot

Hubert Comon-Lundh

    Rewriting techniques and applications
    Constraints in computational logics
    Rewriting, computation and proof
    Collection N. Dimathème: Mathématiques
    • Rewriting, computation and proof

      • 272pages
      • 10 heures de lecture

      Jean-Pierre Jouannaud has significantly impacted research in Informatics through his numerous contributions and the scholars he has mentored. He has been instrumental in advancing the fields of rewriting and its technology, focusing on unification, rewriting and completion modulo, conditional rewriting, termination proofs, modular properties, and automated induction proofs in rewrite theories. His strong interest in algebraic specification languages and their efficient implementation led to his contributions to the design, semantics, and implementation of OBJ2, as well as the enhancement of the Maude rewriting logic system with membership equational logic. Jouannaud has served on the CNU (National University Council) and the CNRS national committee, and he currently leads the computer science laboratory at the Ecole Polytechnique, demonstrating his exceptional management and mentorship abilities. This Festschrift volume celebrates his 60th Birthday on May 12, 2007, featuring 13 refereed papers from prominent researchers and colleagues who gathered for a symposium in Cachan, France, on June 21-22, 2007. The papers are organized into thematic sections on Rewriting Foundations, Proof and Computation, and a concluding section on Towards Safety and Security.

      Rewriting, computation and proof
    • Constraints in computational logics

      • 309pages
      • 11 heures de lecture

      Constraints provide a declarative way of representing infinite sets of data. They are well suited for combining different logical or programming paradigms as has been known for constraint logic programming since the 1980s and more recently for functional programming. The use of constraints in automated deduction is more recent and has proved to be very successful, moving the control from the meta-level to the constraints, which are now first-class objects. This monograph-like book presents six thoroughly reviewed and revised lectures given by leading researchers at the summer school organized by the ESPRIT CCL Working Group in Gif-sur-Yvette, France, in September 1999. The book offers coherently written chapters on constraints and constraint solving, constraint solving on terms, combining constraint solving, constraints and theorem proving, functional and constraint logic programming, and building industrial applications.

      Constraints in computational logics
    • Rewriting techniques and applications

      • 339pages
      • 12 heures de lecture

      This book constitutes the refereed proceedings of the 8th International Conference on Rewriting Techniques and Applications, RTA-97, held in Sitges, Spain, in June 1997. The 24 revised full papers presented were selected from a total of 54 submissions. Also included are abstracts of two invited talks and four system descriptions. Besides classical topics like termination, confluence, or applications to theorem proving, several new approaches to rewriting are presented. All in all, this volume presents the state of the art in the area of rewriting techniques and applications.

      Rewriting techniques and applications