ICFP 2018

40 papers

1. A spectrum of type soundness and performance · Ben Greenman, Matthias Felleisen
2. A type and scope safe universe of syntaxes with binding: their semantics and proofs · Guillaume Allais, Robert Atkey, James Chapman, Conor McBride, James McKinna
3. Build systems à la carte · Andrey Mokhov, Neil Mitchell, Simon Peyton Jones
4. Capturing the future by replaying the past (functional pearl) · James Koppel, Gabriel Scherer, Armando Solar-Lezama
5. Casts and costs: harmonizing safety and performance in gradual typing · John Peter Campora III, Sheng Chen, Eric Walkingshaw
6. Competitive parallelism: getting your priorities right · Stefan K. Muller, Umut A. Acar, Robert Harper
7. Compositional soundness proofs of abstract interpreters · Sven Keidel, Casper Bach Poulsen, Sebastian Erdweg
8. Contextual equivalence for a probabilistic language with continuous random variables and recursion · Mitchell Wand, Ryan Culpepper, Theophilos Giannakopoulos, Andrew Cobb
9. Elaborating dependent (co)pattern matching · Jesper Cockx, Andreas Abel
10. Equivalences for free: univalent parametricity for effective transport · Nicolas Tabareau, Éric Tanter, Matthieu Sozeau
11. Fault tolerant functional reactive programming (functional pearl) · Ivan Perez
12. Finitary polymorphism for optimizing type-directed compilation · Atsushi Ohori, Katsuhiro Ueno, Hisayuki Mima
13. Functional programming for compiling and decompiling computer-aided design · Chandrakana Nandi, James R. Wilcox, Pavel Panchekha, Taylor Blau, Dan Grossman, Zachary Tatlock
14. Functional programming for modular Bayesian inference · Adam Scibior, Ohad Kammar, Zoubin Ghahramani
15. Generic deriving of generic traversals · Csongor Kiss, Matthew Pickering, Nicolas Wu
16. Generic zero-cost reuse for dependent types · Larry Diehl, Denis Firsov, Aaron Stump
17. Graduality from embedding-projection pairs · Max S. New, Amal Ahmed
18. Handling delimited continuations with dependent types · Youyou Cong, Kenichi Asai
19. Incremental relational lenses · Rudi Horn, Roly Perera, James Cheney
20. Keep your laziness in check · Kenneth Foner, Hengchu Zhang, Leonidas Lampropoulos
21. Merlin: a language server for OCaml (experience report) · Frédéric Bour, Thomas Refis, Gabriel Scherer
22. MoSeL: a general, extensible modal framework for interactive proofs in separation logic · Robbert Krebbers, Jacques-Henri Jourdan, Ralf Jung, Joseph Tassarotti, Jan-Oliver Kaiser, Amin Timany + 2 more
23. Mtac2: typed tactics for backward reasoning in Coq · Jan-Oliver Kaiser, Beta Ziliani, Robbert Krebbers, Yann Régis-Gianas, Derek Dreyer
24. Parallel complexity analysis with temporal session types · Ankush Das, Jan Hoffmann, Frank Pfenning
25. Parametric polymorphism and operational improvement · Jennifer Hackett, Graham Hutton
26. Partially-static data as free extension of algebras · Jeremy Yallop, Tamara von Glehn, Ohad Kammar
27. Prototyping a functional language using higher-order logic programming: a functional pearl on learning the ways of λProlog/Makam · Antonis Stampoulis, Adam Chlipala
28. Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report) · Joachim Breitner, Antal Spector-Zabusky, Yao Li, Christine Rizkallah, John Wiegley, Stephanie Weirich
29. Reasonably programmable literal notation · Cyrus Omar, Jonathan Aldrich
30. Refunctionalization of abstract abstract machines: bridging the gap between abstract abstract machines and abstract definitional interpreters (functional pearl) · Guannan Wei, James M. Decker, Tiark Rompf
31. Relational algebra by way of adjunctions · Jeremy Gibbons, Fritz Henglein, Ralf Hinze, Nicolas Wu
32. Static interpretation of higher-order modules in Futhark: functional GPU programming in the large · Martin Elsman, Troels Henriksen, Danil Annenkov, Cosmin E. Oancea
33. Strict and lazy semantics for effects: layering monads and comonads · Andrew K. Hirsch, Ross Tate
34. Synthesizing quotient lenses · Solomon Maina, Anders Miltner, Kathleen Fisher, Benjamin C. Pierce, David Walker, Steve Zdancewic
35. Teaching how to program using automated assessment and functional glossy games (experience report) · José Bacelar Almeida, Alcino Cunha, Nuno Macedo, Hugo Pacheco, José Proença
36. The simple essence of automatic differentiation · Conal Elliott
37. Tight typings and split bounds · Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner
38. Versatile event correlation with algebraic effects · Oliver Bracevac, Nada Amin, Guido Salvaneschi, Sebastian Erdweg, Patrick Eugster, Mira Mezini
39. What you needa know about Yoneda: profunctor optics and the Yoneda lemma (functional pearl) · Guillaume Boisseau, Jeremy Gibbons
40. What's the difference? a functional pearl on subtracting bijections · Brent A. Yorgey, Kenneth Foner