[TYPES/announce] Last CFP: International School on Rewriting
Laurent Vigneron
Laurent.Vigneron at loria.fr
Wed Jun 7 11:00:08 EDT 2006
**********************************************************************
** Last Call for Participation **
** **
** International School on Rewriting **
** **
** ISR'2006, July 3-7, 2006 **
** Nancy, France **
** http://isr2006.loria.fr/ **
**********************************************************************
Deadline for *** late registration ***: June 23rd, 2006.
----------------------------------------------------------------------
Overview
----------------------------------------------------------------------
Rewriting is a fundamental concept and tool in computer science, logic
and mathematics. It models the notion of transition or elementary
transformation of abstract entities as well as common data structures
like terms, strings, graphs. Rewriting is central in computation as
well as deduction and is a crucial concept in semantics of programming
languages as well as in proof theory. This results from a long
tradition of cross-fertilization with the lambda-calculus and
automated reasoning research communities.
This first International School on Rewriting is organized for Master
and PhD students, researchers and practitioners interested in the
study of rewriting concepts and applications.
This school is supported by the IFIP Working Group on Term
Rewriting. The lectures will be given by some of the best experts on
rewriting (termination, higher-order systems, strategies, ...) and
applications (security, theorem proving, program analysis and proofs,
...).
----------------------------------------------------------------------
Invited Speakers
----------------------------------------------------------------------
Franz Baader, Dresden University, Germany
Gilles Dowek, Ecole Polytechnique & INRIA, France
Thomas Genet, Universite de Rennes I & IRISA, France
Juergen Giesl, Aachen University, Germany
Denis Lugiez, Universite de Provence, France
Christopher Lynch, Clarkson University, USA
Pierre-Etienne Moreau, INRIA & LORIA, France
Vincent van Oostrom, Utrecht University, Netherlands
Detlef Plump, University of York, UK
Femke van Raamsdonk, Free University Amsterdam, Netherlands
Michael Rusinowitch, INRIA & LORIA, France
----------------------------------------------------------------------
Contents
----------------------------------------------------------------------
- Introduction to term rewriting
- Termination of term rewriting and applications
- Higher order rewrite systems
- Call by need, call by value
- Compilation and implementations
- Applications:
Security
Theorem proving
Rule based languages
Program analysis and proofs
- Advanced topics:
Graph rewriting
Tree Automata
Deduction modulo
----------------------------------------------------------------------
Committees
----------------------------------------------------------------------
Scientific Committee:
* Juergen Giesl (Aachen)
* Claude Kirchner (Nancy), chair
* Pierre Lescanne (Lyon)
* Christopher Lynch (Potsdam)
* Aart Middeldorp (Innsbruck)
* Femke van Raamsdonk (Amsterdam)
* Yoshihito Toyama (Sendai)
Local Organization Committee:
* Anne-Lise Charbonnier
* Pierre-Etienne Moreau
* Anderson Santana de Oliveira
* Laurent Vigneron (chair)
----------------------------------------------------------------------
Further Information
----------------------------------------------------------------------
For up-to-date details on the school organization, visit the official
web page:
http://isr2006.loria.fr/
or contact the organizers by e-mail: isr2006(at)loria(dot)fr
More information about the Types-announce
mailing list