Haskell 2017
20 papers
- A meta-EDSL for distributed web applications
- A tale of two provers: verifying monoidal string matching in liquid Haskell and Coq
- Adaptive lock-free data structures in Haskell: a general method for concurrent implementation swapping
- Algebraic graphs with class (functional pearl)
- Algorithmic music in Haskell (invited talk)
- Back to the future: time travel in FRP
- Composable network stacks and remote monads
- Elaboration on functional dependencies: functional dependencies are dead, long live functional dependencies!
- Hardware software co-design in Haskell
- Improving STM performance with transactional structs
- Ode on a random urn (functional pearl)
- Ornaments: exploiting parametricity for safer, more automated code refactorization and code reuse (invited talk)
- Packrats parse in packs
- Quantified class constraints
- QuickSpec: a lightweight theory exploration tool for programmers (system demonstration)
- Speculate: discovering conditional equations and inequalities about black-box functions by reasoning from test results
- Streaming irregular arrays
- The linearity Monad
- Using Coq to write fast and correct Haskell
- Well-typed music does not sound wrong (experience report)