Eberhard Karls Universität Tübingen

Mathematisch-Naturwissenschaftliche FakultätProgramming Languages and Software Technology

Yufei Cai, M. Phil.

Yufei Cai
Universität Tübingen
WSI - Programmiersprachen und Softwaretechnik
Sand 13
72076 Tübingen

+49 - (0) 70 71 - 29 - 70 516
+49 - (0) 70 71 - 29 - 50 82
Office hours
by appointment


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 ...

Finished Thesis Topics

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 ...