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.
Thu 18 JulDisplayed time zone: Belfast change
Thu 18 Jul
Displayed time zone: Belfast change
10:30 - 12:10 | |||
10:30 20mResearch paper | How to Avoid Making a Billion-Dollar Mistake: Type-Safe Data Plane Programming with SafeP4 Research Papers Matthias Eichholz , Eric Campbell Cornell University, Nate Foster Cornell University, Guido Salvaneschi TU Darmstadt, Mira Mezini TU Darmstadt, Germany DOI Media Attached | ||
10:50 20mResearch paper | Fling—A Fluent API Generator Research Papers DOI | ||
11:10 20mResearch paper | Semantic Patches for Java Program Transformation Research Papers Hong Jin Kang School of Information Systems, Singapore Management University, Ferdian Thung , Julia Lawall Inria/LIP6, Gilles Muller LIP6-INRIA/UPMC, Lingxiao Jiang Singapore Management University, David Lo Singapore Management University DOI Media Attached | ||
11:30 20mResearch paper | Finally, a Polymorphic Linear Algebra Language Research Papers DOI | ||
11:50 20mResearch paper | NumLin: Linear Types for Linear Algebra Research Papers DOI Pre-print Media Attached File Attached |