Winter 2016 — Wednesday, 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	Everyone	Paper Selection
Jan 13	Bartosz and Marisa	Comprehending Monads
Jan 20	Ben and John	Access-Path Abstraction: Scaling Field-Sensitive Data-Flow Analysis With Unbounded Access Paths
Jan 27	Doug and Pavel	Dependent Types and Multi-Monadic Effects in F*
Feb 3	Talia and Alex S.	A Unification Algorithm for COQ Featuring Universe Polymorphism and Overloading
Feb 10	Eric and Stuart	Sound Type-Dependent Syntactic Language Extension
Feb 17	Alex P. and Calvin	In Search of Types
Feb 24	Chenglong and Konstantin	Practical Principled FRP
Mar 2	James B. and Bill	The Silently Shifting Semicolon
Mar 9	-	No meeting (visit days)

Paper Suggestions

• Certified Causally Consistent Distributed Key-Value Stores (POPL ‘16)

• Mechanized Verification of Fine-grained Concurrent Programs (PLDI ‘15)

• Conference Reviewing Considered Harmful

• STABILIZER: Statistically Sound Performance Evaluation (ASPLOS ‘13)

• Verification Modulo Versions: Towards Usable Verification (PLDI ‘14)

• Specification Inference Using Context-Free Language Reachability (POPL ‘15)

• KJS: A Complete Formal Semantics of JavaScript (PLDI ‘15)

• Declarative programming over eventually consistent data stores (PLDI ‘15)

• Synthesis of Machine Code from Semantics (PLDI ‘15)

• Compositional Certified Resource Bounds (PLDI ‘15)

• Conditionally Correct Superoptimization (OOPSLA ‘15)

• Synthesis of Memory Fences via Refinement Propagation (SAS ‘14)

• Reasoning about the POSIX File System: Local Update and Global Pathnames (OOPSLA ‘15)

• Approximate Computation with Outlier Detection in Topaz (OOPSLA ‘15)

• Checks and Balances: Constraint Solving without Surprises in Object-Constraint Programming Languages (OOPSLA ‘15) (perhaps get Alan Borning to give a talk on it instead)

• A Co-Contextual Formulation of Type Rules and its Application to Incremental Type Checking (OOPSLA ‘15)

• Disjointness Domains for Fine-Grained Aliasing (OOPSLA ‘15)

• Automating Ad-hoc Data Representation Transformations (OOPSLA ‘15)

• Performance Problems You Can Fix: A Dynamic Analysis of Memoization Opportunities (OOPSLA ‘15)

• Slimming Languages by Reducing Sugar: A Case for Semantics-Altering Transformations (Onward! ‘15)

• The denotational semantics of programming languages (CACM ‘76)

• Recursive programming (PSL ‘60)

• From System F to Typed Assembly Language (TOPLAS ‘99)

• Turing Completeness Totally Free (LNCS 9129, June ‘15) - a McBride paper on how total languages don’t necessarily give up turing completeness.

• Symbolic Abstract Data Type Inference (POPL ‘16) (paper not up yet)

• F-ing Modules (TLDI ‘10)

• A contribution to the development of ALGOL (Communications of the ACM ‘66) - Introduces, among other things, null references

• Brown M, Palsberg J, Breaking through the Normalization Barrier (POPL 2016)

• An executable formal semantics of PHP - How to lose your mind and get a paper out of it