Ori Roth, M.Sc. Thesis Seminar
Wednesday, 25.12.2019, 14:30
We present the first general and practical solution of the fluent API problem – an
algorithm, that given a deterministic language (equivalently, LR(k), k≥0 language)
encodes it in an unbounded parametric polymorphism type system employing only a
polynomial number of types. The theoretical result is accompanied by an actual tool
Fling – a fluent API compiler-compiler in the venue of YACC, tailored for embedding
DSLs in Java.