DARTS.5.2.12.pdf
- Filesize: 0.57 MB
- 9 pages
5064eb01b5f238cd081fc9c63e604cbf
(Get MD5 Sum)
The first general and practical solution of the fluent API problem is presented. We give an algorithm that given a deterministic context free 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 employed in an actual tool Fling - a fluent API compiler-compiler in the style of YACC, tailored for embedding DSLs in Java.
Feedback for Dagstuhl Publishing