Simon Wegendt

April 13, 2015

Bidirectional Grammar Transformation

These are grammar transformations useful in compiler construction (Compilerbau): conversion to Chomsky normal form, left factoring, left recursion elimination. Standard textbooks describe how these transformations work on the production rules of grammars. However, a real compiler works on syntax trees. For each of these transformations between grammars, there exist forward and backward transformations between syntax trees of the grammars. To use grammar transformations in practice, we need the syntax tree transformations.

Read more …

January 20, 2016

Presentation at POPL symposium

Yufei Cai
Yufei Cai presents the paper System F_ω with Equirecursive Types for Datatype-generic Programming at the Symposium on Principles of Programming Languages in St. Petersburg, Florida. The paper is joint work with Paolo Giarrusso
Paolo Giarrusso and Klaus Ostermann
ProfessorKlaus Ostermann.

Read more …

November 13, 2015

Preprint for POPL paper online

The preprint for our paper on equirecursive types in System Fω, with title “System Fω with Equirecursive Types for Datatype-generic Programming”, is now available online.

Read more …

October 5, 2015

Paper accepted at POPL

Our paper on equirecursive types in System Fω, with title “System Fω with Equirecursive Types for Datatype-generic Programming”, has been accepted for presentation at the annual Symposium on Principles of Programming Languages.

Read more …

January 22, 2015

Talk at Paris Diderot about functors

Yufei Cai
Yufei Cai gives an informal talk about the ongoing first-class functors project at PPS Lab, University Paris Diderot.

Read more …

October 1, 2014

Move to Tübingen

Prof. Klaus Ostermann
ProfessorKlaus Ostermann and part of his group move to Tübingen University, where Prof. Ostermann now holds the chair of programming languages and software technology.

Read more …