Rewriting is a branch of computer science whose origins go back to the origins of computer science itself (with Thue, Church, Post, and many other prominent researchers). It has strong links with mathematics, algebra, logic, and theorem proving, and it is the basis of well-known programming paradigms like functional and equational programming. In these programming paradigms and corresponding languages, the notions of reduction, pattern matching, confluence, termination, strategy, etc., are essential. Rewriting provides a solid framework for understanding, using, and teaching all these notions. Rewriting techniques are also used in many other areas of software engineering (scripting, prototyping, automated transformation of legacy systems, refactoring, web services, etc.) Rewriting techniques play a relevant role in computing research, education, and industry.
The school ISR 2017 is aimed at master students and PhD students, researchers, and practitioners interested in the study of rewriting concepts and their applications.
Earlier ISRs were organized in Nancy (2006), Nancy (2007), Obergurgl (2008), Brasilia (2009), Utrecht (2010), Valencia (2012), Valparaiso (2014), Leipzig (2015). ISR has been initiated and is promoted by the IFIP Working Group 1.6 on Term Rewriting.
There is also general information on ISR, including the Bylaws. The rewriting home page provides some general information on rewriting.
Just like earlier instances of ISR, the 9th International School on Rewriting (ISR 2017) will consist of two tracks: a basic track an an advanced track.
Teachers of the Basic Track: Aart Middeldorp and Sarah Winkler.
|Monday, July 3||Lecture 1||Lecture 2||Lecture 3||Exercises 1|
|Tuesday, July 4||Lecture 4||Lecture 5||Exercises 2||Lecture 6|
|Wednesday, July 5||Lecture 7||Exercises 3||Poster Presentations||Excursion to Philips Museum, followed by dinner|
|Thursday, July 6||Lecture 8||Lecture 9||Lecture 10||Exercises 4|
|Friday, July 7||Lecture 11||Lecture 12||Exercises 5||Exam|
|Monday, July 3||Fuhs: Proving Program Termination via Term Rewriting 1/2||Sternagel and Thiemann: Formalizing Rewriting in Isabelle 1/4||Accatoli: The Complexity of Beta-Reduction 1/2||Kutsia: Solving Equational Problems: Matching and Unification 1/2|
|Tuesday, July 4||Accatoli: The Complexity of Beta-Reduction 2/2||Genet: Tree Automata for Reachability in Rewriting 1/2||Kutsia: Solving Equational Problems: Matching and Unification 2/2||Fuhs: Proving Program Termination via Term Rewriting 2/2|
|Wednesday, July 5||Genet: Tree Automata for Reachability in Rewriting 2/2||Sternagel and Thiemann: Formalizing Rewriting in Isabelle 2/4||Poster Presentations||Excursion to Philips Museum, followed by dinner|
|Thursday, July 6||Waldmann: Weighted Automata and Rewriting 1/2||Sternagel and Thiemann: Formalizing Rewriting in Isabelle 3/4||Nagele and van Oostrom: Commutation 1/2||Mimram and Malbos: Two-Dimensional Rewriting and Applications 1/2|
|Friday, July 7||Nagele and van Oostrom: Commutation 2/2||Waldmann: Weighted Automata and Rewriting 2/2||Mimram and Malbos: Two-Dimensional Rewriting and Applications 2/2||Sternagel and Thiemann: Formalizing Rewriting in Isabelle 4/4|