Lab-Wide Review of POPL

Preview

The lab will present their thoughts on POPL 2018.

Discussion

These are the papers we found interesting, unique, or even just a little befuddling (the lab member who found the paper noteworthy is listed in parentheses):

• Gradual Program Verification by Bader (Lawton)
• Abstract Code Injection by Buro, Mastroeni (Mehmet)
• Message-Passing Concurrency and Substructural Logics by Pfenning (Lawton)
• Introduction to Algebraic Program Analysis by Kincaid (Mehmet)
• Computational Higher Type Theory by Harper (Lawton)
• One Weird Trick: Relational Interpreters for Program Synthesis by Byrd (Nemanja)
• Milner Award Lecture: The Type Soundness Theorem That You Really Want to Prove (and Now You Can) by Dreyer (Lawton)
• Mechanising and Verifying the WebAssembly Specification by Watt (Michael)
• Automatic Verification of Intermittent Systems by Dahiya (Michael)
• Linear Haskell: practical linearity in a higher-order polymorphic language by Bernardy (Mehmet)
• Liquid Haskell: Refinement Types for Haskell by Vazou (Nemanja)
• Migrating Gradual Types by Campora (Nemanja)
• Recursive Programs in Normal Form by Jay (Nemanja)
• Optimal Dyck Reachability for Data-dependence and Alias Analysis by Chatterjee (Lawton)
• Simplicitly: Foundations and Applications of Implicit Function Types by Odersky (Mehmet)
• Inference of Static Semantics for Incomplete C Programs by Melo (Michael)