Skip to content
<awesome-gh-repos>
vic

mpickering/icfp2015-papers

Accepted papers for ICFP 2015
Source code at GitHub https://github.com/mpickering/icfp2015-papers
mpickering/icfp2015-papers.json
{
  "createdAt": "2015-05-09T09:52:51Z",
  "defaultBranch": "master",
  "description": "Accepted papers for ICFP 2015",
  "fullName": "mpickering/icfp2015-papers",
  "homepage": "",
  "language": "Python",
  "name": "icfp2015-papers",
  "pushedAt": "2016-03-04T17:07:36Z",
  "stargazersCount": 45,
  "topics": [],
  "updatedAt": "2024-02-01T10:14:05Z",
  "url": "https://github.com/mpickering/icfp2015-papers"
}

Links to [accepted papers][icfp15-accepted] for the [20th ACM SIGPLAN International Conference on Functional Programming][icfp15] (ICFP 2015).

[icfp15] !: http://icfpconference.org/icfp2015/ [icfp15-accepted] !: http://icfpconference.org/icfp2015/accepted.html

(Similar pages are available for [ICFP 2012][icfp12], [ICFP 2013][icfp13] and [ICFP 2014][icfp14]. You may also be interested in [Haskell 2014 accepted papers][haskell2014-accepted] and [PLDI 2014 accepted papers][pldi2014-accepted].)

Status of links at last commit: Build Status

[icfp12] !: https://github.com/technogeeky/icfp12-paper-links [icfp13] !: https://github.com/gasche/icfp2013-papers [icfp14] !: https://github.com/yallop/icfp2014-papers [haskell2014-accepted] !: https://github.com/yallop/haskell2014-papers [pldi2014-accepted] !: https://github.com/yallop/pldi2014-papers

ICFP

Section titled “ICFP”

  • Foundational Extensible Corecursion: A Proof Assistant Perspective
    (paper)
    Jasmin Christian Blanchette (Inria & LORIA, Nancy), Andrei Popescu (Middlesex University), and Dmitriy Traytel (TU München)

  • Noninterference for Free
    (paper)
    William J. Bowman (Northeastern University CCIS) and Amal Ahmed (Northeastern University CCIS)

  • Adaptive Lock-Free Data: Purely-Functional to Scalable
    ([paper])(http://www.cs.indiana.edu/~rrnewton/papers/icfp15_adaptive_data.pdf) Peter Fogg (Indiana University), Ali Varamesh (Indiana University), and Ryan R. Newton (Indiana University)

  • Efficient Communication and Collection with Compact Normal Forms
    (paper)
    Abhishek Kulkarni (Indiana University), Ahmed El-Hassany (Indiana University), Edward Z. Yang (Stanford University), Giovanni Campagna (Stanford University), Ryan Newton (Indiana University), and Ömer S. Ağacan (Indiana University)

  • Partial Aborts for Transactions via First-Class Continuations
    (paper) Matthew Le (Rochester Institute of Technology) and Matthew Fluet (Rochester Institute of Technology)

  • Blame Assignment for Higher-Order Contracts with Intersection and Union
    (paper) Matthias Keil (University of Freiburg) and Peter Thiemann (University of Freiburg)

  • 1ML - Core and modules united (F-ing first-class modules)
    (paper)
    Andreas Rossberg (Google)

  • RRB Vector: A Practical General Purpose Immutable Sequence
    (paper)
    Nicolas Stucki (EPFL, Switzerland), Tiark Rompf (Purdue University), and Vlad Ureche (EPFL, Switzerland)

  • Pycket: A Tracing JIT For a Functional Language
    (paper)
    Spenser Bauman (Indiana University), Carl Friedrich Bolz (Kings College, London), Robert Hirschfeld (Hassno-Plattner-Institut, Potsdam), Vasily Krilichev (Hassno-Plattner-Institut, Potsdam), Tobias Pape (Hassno-Plattner-Institut, Potsdam), Jeremy G. Siek (Indiana University), and Sam Tobin-Hochstadt (Indiana University)

  • An Optimizing Compiler for a Purely Functional Web-Application Language
    (paper) Adam Chlipala (MIT CSAIL)

  • Expressing Contract Monitors as Patterns of Communication
    (paper)
    Cameron Swords (Indiana University), Amr Sabry (Indiana University), and Sam Tobin-Hochstadt (Indiana University)

  • Functional Pearl: A Smart View on Datatypes
    (paper)
    Mauro Jaskelioff (CIFASIS - CONICET) and Exequiel Rivas (CIFASIS - CONICET)

  • Elaborating Evaluation-Order Polymorphism
    (paper)
    Joshua Dunfield (University of British Columbia)

  • Bounded Refinement Types
    (paper)
    Niki Vazou (UC San Diego), Alexander Bakst (UC San Diego), and Ranjit Jhala (UC San Diego)

  • XQuery and Static Typing: Tackling the Problem of Backward Axes
    (paper)
    Pierre Genevès (CNRS) and Nils Gesbert (Université Grenoble Alpes)

  • Certified Symbolic Management of Financial Multi-Party Contracts
    (paper)
    Patrick Bahr (University of Copenhagen), Jost Berthold (University of Copenhagen), and Martin Elsman (University of Copenhagen)

  • GADTs meet their match
    (paper)
    Georgios Karachalias (Ghent University), Tom Schrijvers (KU Leuven), Dimitrios Vytiniotis (Microsoft Research Cambridge), and Simon Peyton Jones (Microsoft Research Cambridge)

  • Denotational cost semantics for functional languages with inductive types
    (paper)
    Norman Danner (Wesleyan University), Daniel R. Licata (Wesleyan University), and Ramyaa (Wesleyan University)

  • Bidirectional Programming in a More Applicative Style
    (paper)
    Kazutaka Matsuda (The University of Tokyo) and Meng Wang (University of Kent)

  • A Predictable Unification Algorithm for Coq Featuring Universe Polymorphism and Overloading
    (paper)
    Beta Ziliani (MPI-SWS) and Matthieu Sozeau (Inria & PPS, Université Paris Diderot)

  • Practical Principled FRP: Forget the past, change the future, FRPNow!
    (paper)
    Atze van der Ploeg (Chalmers University of Technology) and Koen Claessen (Chalmers University of Technology)

  • Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order
    (paper) Martin Avanzini (University of Bologna, Italy & Inria, France), Ugo Dal Lago (University of Bologna, Italy & Inria, France), and Georg Moser (University of Innsbruck)

  • Generating Performance Portable Code using Rewrite Rules: From High-level Functional Expressions to High-Performance OpenCL Code
    (paper)
    Michel Steuwer (The University of Edinburgh, UK), Christian Fensch (Heriot-Watt University, UK), Sam Lindley (The University of Edinburgh, UK), and Christophe Dubach (The University of Edinburgh, UK)

  • Hygienic Resugaring of Compositional Desugaring
    (paper) Justin Pombrio (Brown University) and Shriram Krishnamurthi (Brown University)

  • Functional Pearl: Two can keep a secret, if one of them uses Haskell
    (paper) Alejandro Russo (Chalmers University of Technology)

  • Which simple types have a unique inhabitant?
    (paper)
    Gabriel Scherer (INRIA) and Didier Rémy (INRIA)

  • HLIO: Mixing Static and Dynamic Typing for Information-Flow Control in Haskell
    (paper)
    Pablo Buiras (Chalmers University of Technology), Dimitrios Vytiniotis (Microsoft Research), and Alejandro Russo (Chalmers University of Technology)

  • Algebras and Coalgebras in the Light Affine Lambda Calculus
    ([paper])(https://hal.inria.fr/hal-01112165/file/main.pdf) Marco Gaboardi (University of Dundee and Harvard University) and Romain Péchoux (Universitè de Lorraine)

  • Functional Pearl: A SQL to C Compiler in 500 Lines of Code
    (paper)
    Tiark Rompf (Purdue University) and Nada Amin (EPFL)

  • A Fast Compiler for NetKAT
    (paper)
    Steffen Smolka (Cornell University), Spiridon Eliopoulos (Inhabited Type), Nate Foster (Cornell University), and Arjun Guha (University of Massachusetts Amherst)

  • Structures for structural recursion
    (paper)
    Paul Downen (University of Oregon), Philip Johnson-Freyd (University of Oregon), and Zena M. Ariola (University of Oregon)

  • Automatic Refunctionalization to a Language with Copattern Matching: With Applications to the Expression Problem
    (paper) Tillmann Rendel (University of Tübingen), Julia Trieflinger (University of Tübingen), and Klaus Ostermann (University of Tübingen)

  • Pilsner: A Compositionally Verified Compiler for a Higher-Order Imperative Language
    (paper)
    Georg Neis (MPI-SWS, Germany), Chung-Kil Hur (Seoul National University), Jan-Oliver Kaiser (MPI-SWS, Germany), Craig McLaughlin (University of Glasgow), Derek Dreyer (MPI-SWS, Germany), and Viktor Vafeiadis (MPI-SWS, Germany)

  • Practical SMT-Based Type Error Localization
    (paper)
    Zvonimir Pavlinovic (New York University), Tim King (Verimag), and Thomas Wies (New York University)

  • Learning Refinement Types
    (paper) He Zhu (Purdue University), Aditya V. Nori (Microsoft Research), and Suresh Jagannathan (Purdue University)