590P: PL Reading Group
Winter 2017 — Friday, 3:30pm — CSE 203
Subscribe to the calendar: iCal or Google Calendar.We’ll be reading and discussing exciting recent papers from the programming languages community. Participants should subscribe to the 590p mailing list. Note the list also has many current and former department members interested in programming languages.
Some paper links may point into the ACM Digital Library or the Springer online collection. Using a UW IP address, or the UW libraries off-campus access, should provide access.
| Date | Who | What |
|---|---|---|
|
Jan 6
|
PLSE |
Organize! |
|
Jan 13
|
Doug Woos and Ryan Doenges |
Refinement Reflection |
|
Jan 20
|
Nate and Calvin |
Component-Based Synthesis for Complex APIs |
|
Jan 27
|
Talia and Stuart |
Beginner’s Luck: A Language for Property-Based Generators |
|
Feb 3
|
John |
Call Graphs for Languages with Parametric Polymorphism |
|
Feb 10
|
Chenglong |
Polymorphism, Subtyping, and Type Inference in MLsub |
|
Feb 17
|
Martin and Eric |
Into the depths of C: elaborating the de facto standards |
|
Feb 24
|
Steven and Max |
Verified Compilation of CakeML to Multiple Machine-Code Targets |
|
Mar 3
|
Pavel and Mangpo |
Automatic Parallelization of Pure Method Calls via Conditional Future Synthesis |
Paper Suggestions
- Context-free session types (ICFP 16)
- Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms (ICFP 16)
- Verified Compilation of CakeML to Multiple Machine-Code Targets (CPP ‘17)
- Typed self-evaluation via intensional type functions (POPL 2017)
- Type Soundness Proofs with Definitional Interpreters (POPL 2017)
- Polymorphism, Subtyping, and Type Inference in MLsub (POPL 2017)
- Relational Cost Analysis (POPL 2017)
- Component-Based Synthesis for Complex APIs (POPL 2017)
- Into the depths of C: elaborating the de facto standards (PLDI 16)
- Dijkstra Monads for Free (POPL 2017)
- Java generics are Turing complete (POPL 2017)
- Beginner’s Luck: A Language for Property-Based Generators (POPL 2017)
- Modules, Abstraction, and Parametric Polymorphism (POPL 2017)
- Deciding equivalence with sums and the empty type (POPL 2017)
- The exp-log normal form of types: Decomposing extensional equality and representing terms compactly (POPL 2017)
- Automatic Parallelization of Pure Method Calls via Conditional Future Synthesis (OOPSLA 2016)
- Parsing with first-class derivatives (OOPSLA 2016)
- Call Graphs for Languages with Parametric Polymorphism (OOPSLA 2016)
- An Improved Algorithm for Slicing Machine Code (OOPSLA 2016)
- Type Inference for Static Compilation of JavaScript (OOPSLA 2016)
- DeepMath - Deep Sequence Models for Premise Selection (NIPS 2016)
- Deriving Divide-and-Conquer Dynamic Programming Algorithms using Solver-Aided Transformations (OOPSLA 2016)
- Hazelnut: A Bidirectionally Typed Structure Editor Calculus (POPL 2017)
- Cantor Meets Scott: Semantic Foundations for Probabilistic Networks (POPL 2017)
Currently Selected
- TODO
Also see the suggestions from last quarter.