Randomized property-based testing has gained much attention recently, but most frameworks stop short at polymorphic properties. Although Bernardy et al. have developed a theory to reduce a wide range of polymorphic properties to monomorphic ones, it relies upon ad-hoc embedding-projection pairs to massage the types into a particular form. This paper skips the embedding-projection pairs and presents a mechanical monomorphization for a general class of polymorphic functions, a step towards automatic testing for polymorphic properties. The calculation of suitable types for monomorphization turns out to be logarithm.
Thu 20 JanDisplayed time zone: Eastern Time (US & Canada) change
Thu 20 Jan
Displayed time zone: Eastern Time (US & Canada) change
13:30 - 14:45 | Dynamic AnalysisPOPL at Salon III Chair(s): Armando Solar-Lezama Massachusetts Institute of Technology | ||
13:30 25mResearch paper | A Formal Foundation for Symbolic Evaluation with MergingRemote POPL Sorawee Porncharoenwase University of Washington, Luke Nelson University of Washington, Xi Wang University of Washington, Emina Torlak University of Washington DOI Media Attached | ||
13:55 25mResearch paper | Logarithm and Program TestingInPerson POPL DOI Media Attached | ||
14:20 25mResearch paper | Profile Inference RevisitedRemote POPL Wenlei He Facebook, Julián Mestre Facebook; University of Sydney, Sergey Pupyrev , Lei Wang Facebook, Hongtao Yu Facebook DOI Media Attached |