ICFP Workshops 2017
22nd ACM SIGPLAN International Conference on Functional Programming (ICFP 2017)
Powered by
Conference Publishing Consulting

10th ACM SIGPLAN International Haskell Symposium (Haskell 2017), September 7-8, 2017, Oxford, UK

Haskell 2017 – Proceedings

Contents - Abstracts - Authors

10th ACM SIGPLAN International Haskell Symposium (Haskell 2017)

Frontmatter

Title Page
Message from the Chair

Session 1

Ornaments: Exploiting Parametricity for Safer, More Automated Code Refactorization and Code Reuse (Invited Talk)
Didier Rémy
(Inria, France)
Publisher's Version Article Search
Algebraic Graphs with Class (Functional Pearl)
Andrey Mokhov
(Newcastle University, UK)
Publisher's Version Article Search
Packrats Parse in Packs
Mario Blažević and Jacques Légaré
(Stilo International, Canada)
Publisher's Version Article Search Info
Ode on a Random Urn (Functional Pearl)
Leonidas Lampropoulos, Antal Spector-Zabusky, and Kenneth Foner
(University of Pennsylvania, USA)
Publisher's Version Article Search

Session 2

QuickSpec: A Lightweight Theory Exploration Tool for Programmers (System Demonstration)
Maximilian Algehed, Koen Claessen, Moa Johansson, and Nick Smallbone
(Chalmers University of Technology, Sweden)
Publisher's Version Article Search
Speculate: Discovering Conditional Equations and Inequalities about Black-Box Functions by Reasoning from Test Results
Rudy Braquehais and Colin Runciman
(University of York, UK)
Publisher's Version Article Search
Using Coq to Write Fast and Correct Haskell
John Wiegley and Benjamin Delaware
(BAE Systems, USA; Purdue University, USA)
Publisher's Version Article Search Artifacts Available
A Tale of Two Provers: Verifying Monoidal String Matching in Liquid Haskell and Coq
Niki Vazou, Leonidas Lampropoulos, and Jeff Polakow
(University of Maryland, USA; University of Pennsylvania, USA; Awake Networks, USA)
Publisher's Version Article Search Info
A Meta-EDSL for Distributed Web Applications
Anton Ekblad
(Chalmers University of Technology, Sweden)
Publisher's Version Article Search
Composable Network Stacks and Remote Monads
Justin Dawson, Mark Grebe, and Andy Gill
(University of Kansas, USA)
Publisher's Version Article Search

Session 3

Algorithmic Music in Haskell (Invited Talk)
Donya Quick
(Stevens Institute of Technology, USA)
Publisher's Version Article Search
Well-Typed Music Does Not Sound Wrong (Experience Report)
Dmitrij Szamozvancev and Michael B. Gale
(University of Cambridge, UK)
Publisher's Version Article Search
Back to the Future: Time Travel in FRP
Ivan Perez
(University of Nottingham, UK)
Publisher's Version Article Search
The Linearity Monad
Jennifer Paykin and Steve Zdancewic
(University of Pennsylvania, USA)
Publisher's Version Article Search Info

Session 4

Elaboration on Functional Dependencies: Functional Dependencies Are Dead, Long Live Functional Dependencies!
Georgios Karachalias and Tom Schrijvers
(KU Leuven, Belgium)
Publisher's Version Article Search
Quantified Class Constraints
Gert-Jan Bottu, Georgios Karachalias, Tom Schrijvers, Bruno C. d. S. Oliveira, and Philip Wadler
(KU Leuven, Belgium; University of Hong Kong, China; University of Edinburgh, UK)
Publisher's Version Article Search
Hardware Software Co-design in Haskell
Markus Aronsson and Mary Sheeran
(Chalmers University of Technology, Sweden)
Publisher's Version Article Search
Streaming Irregular Arrays
Robert Clifton-Everest, Trevor L. McDonell, Manuel M. T. Chakravarty, and Gabriele Keller
(UNSW, Australia)
Publisher's Version Article Search
Improving STM Performance with Transactional Structs
Ryan Yates and Michael L. Scott
(University of Rochester, USA)
Publisher's Version Article Search
Adaptive Lock-Free Data Structures in Haskell: A General Method for Concurrent Implementation Swapping
Chao-Hong Chen, Vikraman Choudhury, and Ryan R. Newton
(Indiana University, USA)
Publisher's Version Article Search

proc time: 3.15