The course provides an introduction into the field of termination and complexity of term rewrite systems. Term rewriting is a conceptually simple, but powerful abstract model of computation with applications in automated theorem proving, compiler optimization, and declarative programming, to name a few.
News
- ESSLLI Evaluation
- ESSLLI on VideoLectures.NET
- ESSLLI Photos
- ESSLLI Closing Ceremony, Friday, 12 August 2011 @ 4 pm, Peterlin Pavillion
- ESSLLI OFFICE CLOSING TIME
- ESSLLI Photos
- Tonight’s Evening Lecture
- Student Session Poster Presentations, Thursday 15:45-16:45
- Evening Lecture tonight
- Last Call for THE Traditional ESSLLI Soccer Match: Lecturers vs. Students
- FoLLI General Meeting: Beth Prize presentation
- Football (rules)
- ESSLLI bags and T-Shirts have arrived
- ESSLLI Excursions (final)
- Formal Grammar, FOLLI meeting, Logical constants
