silky / icfp2014-papers

Accepted papers for ICFP 2014

Links to accepted papers for the 19th ACM SIGPLAN International Conference on Functional Programming (ICFP 2014)

(Similar pages are available for ICFP 2012 and ICFP 2013.)

ICFP

• On Teaching How to Design Programs: Observations from a Newcomer
  (paper)
  by Norman Ramsey

• Folding Domain-Specific Languages: Deep and Shallow Embeddings
  (paper)
  by Jeremy Gibbons and Nicolas Wu

• Pattern matching without K
  (paper)
  by Jesper Cockx, Dominique Devriese and Frank Piessens

• Settable and Non-Interfering Signal Functions for FRP
  by Daniel Winograd-Cort and Paul Hudak

• Safe Zero-cost Coercions for Haskell
  (paper)
  by Joachim Breitner, Richard A. Eisenberg, Simon Peyton Jones and Stephanie Weirich

• Worker/Wrapper/Makes It/Faster
  (paper)
  by Jennifer Hackett and Graham Hutton

• Lem: reusable engineering of real-world semantics
  (paper)
  by Dominic P. Mulligan, Scott Owens, Kathryn E. Gray, Tom Ridge and Peter Sewell

• There is no Fork: an Abstraction for Efficient, Concurrent, and Concise Data Access
  (paper) (source)
  by Simon Marlow, Louis Brandy, Jonathan Coens and Jon Purdy

• Hindley-Milner elaboration in applicative style
  (paper)
  by Francois Pottier

• Building Embedded Systems with Embedded DSLs
  (paper)
  by Patrick Hickey, Lee Pike, Trevor Elliott, James Bielman and John Launchbury

• Compositional Semantics for Composable Continuations: From Abortive to Delimited Control
  by Paul Downen and Zena Ariola

• Maximal Sharing in the Lambda Calculus with letrec
  (paper)
  by Clemens Grabmayer and Jan Rochel

• A Theory of Gradual Effect Systems
  by Felipe Bañados Schwerter, Ronald Garcia and Éric Tanter

• Functional Programming for Dynamic and Large Data with Self-Adjusting Computation
  by Yan Chen, Umut A. Acar and Kanat Tangwongsan

• SeLINQ: Tracking Information Across Application-Database Boundaries
  by Daniel Schoepe, Andrei Sabelfeld and Daniel Hedin

• Krivine Nets
  by Olle Fredriksson and Dan R. Ghica

• Practical and Effective Higher-Order Optimizations
  (paper)
  by Lars Bergstrom, Matthew Fluet, John Reppy, Nora Sandler and Matthew Le

• Distilling Abstract Machines
  (paper)
  by Beniamino Accattoli, Pablo Barenbaum and Damiano Mazza

• Type-Based Parametric Analysis of Program Families
  by Sheng Chen and Martin Erwig

• Soft Contract Verification
  (paper)
  by Phuc Nguyen, Sam Tobin-Hochstadt and David Van Horn

• Concurrent NetCore: From Policies to Pipelines
  (paper)
  by Cole Schlesinger, Michael Greenberg and David Walker

• Homotopical Patch Theory
  (paper)
  by Carlo Angiuli, Ed Morehouse, Daniel Licata and Robert Harper

• A Relational Framework for Higher-Order Shape Analysis
  (tech report)
  by Gowtham Kaki and Suresh Jagannathan

• Coeffects: A calculus of context-dependent computation
  by Tomas Petricek, Dominic Orchard and Alan Mycroft

• Refinement Types For Haskell
  (paper)
  by Niki Vazou, Eric L. Seidel, Ranjit Jhala, Dimitrios Vytiniotis and Simon Peyton-Jones

• Romeo: a system for more flexible binding-safe programming
  by Paul Stansifer and Mitchell Wand

• How to Keep Your Neighbours in Order
  (paper)
  by Conor McBride

• SML# in Industry: A Practical ERP System Development
  by Atsushi Ohori, Katsuhiro Ueno, Kazunori Hoshi, Shinji Nozaki, Takashi Sato, Tasuku Makabe and Yuki Ito