The tutorials are part of the DSL conference. The purpose of these tutorials are not to give a general overview, but to make the attendees aware of one point and to make them master it. For example, the printf function in ML is such a point, and the natural associated exercise is to extend its directives with, eg, pairs or lists. The tutorial will be with exercises for the audience and evaluation for the speaker.
- Jerzy Karczmarczuk. Specific "scientific" data structures, and their processing
- Oleg Kiselyov. Implementing explicit and finding implicit sharing in embedded DSLs
- Keiko Nakata. Resumption-based big-step and small-step interpreters for While with interactive I/O
- Josef Svenningsson. Combining deep and shallow embeddings for EDSLs
- Veronica Gaspes and Walid Taha. Accurate programming: thinking about programs in terms of properties
- William Cook. Build your own partial evaluator in 90 minutes
- Olivier Danvy. Proper tail recursion in an abstract machine
- Oleg Kiselyov and Chung-chieh Shan. Domain-specific natural languages
- Jeremy Gibbons. Maximum segment sum, monadically
- Juliusz Chroboczek. Sequentialising a concurrent program using continuation-passing style
