Thu 18 Jul 2019 10:50 - 11:10 at Track 1 - Domain Specific Languages

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 Jul

ecoop-2019-papers
10:30 - 12:10: ECOOP Research Papers - Domain Specific Languages at Track 1
ecoop-2019-papers10:30 - 10:50
Research paper
Matthias Eichholz, Eric CampbellCornell University, Nate FosterCornell University, Guido SalvaneschiTU Darmstadt, Mira MeziniTU Darmstadt, Germany
ecoop-2019-papers10:50 - 11:10
Research paper
Yossi GilTechnion—Israel Institute of Technology, Ori RothTechnion
ecoop-2019-papers11:10 - 11:30
Research paper
Kang Hong JinSchool of Information Systems, Singapore Management University, Ferdian Thung, Julia LawallInria/LIP6, Gilles MullerLIP6-INRIA/UPMC, Lingxiao JiangSingapore Management University, David LoSingapore Management University
ecoop-2019-papers11:30 - 11:50
Research paper
Amir ShaikhhaUniversity of Oxford, Lionel ParreauxEPFL
ecoop-2019-papers11:50 - 12:10
Research paper
Dhruv MakwanaUnaffiliated, Neelakantan R. KrishnaswamiComputer Laboratory, University of Cambridge
Pre-print