Powered by

8th ACM SIGPLAN Haskell Symposium 2015, September 3-4, 2015, Vancouver, BC, Canada

Haskell 2015 – Proceedings

Contents - Abstracts - Authors

Frontmatter

Title Page

Foreword

Type Checking

Improving Haskell Types with SMT
Iavor S. Diatchki
(Galois, USA)

A Typechecker Plugin for Units of Measure: Domain-Specific Constraint Solving in GHC Haskell
Adam Gundry
(Well-Typed, UK)

Info

Verification

Reasoning with the HERMIT: Tool Support for Equational Reasoning on GHC Core Programs
Andrew Farmer, Neil Sculthorpe, and Andy Gill
(University of Kansas, USA; Swansea University, UK)

Info

Formally Proving a Compiler Transformation Safe
Joachim Breitner
(KIT, Germany)

Graphics and Distribution

Bridging the GUI Gap with Reactive Values and Relations
Ivan Perez and Henrik Nilsson
(University of Nottingham, UK)

The Remote Monad Design Pattern
Andy Gill, Neil Sculthorpe, and James Stanton
(University of Kansas, USA; Swansea University, UK)

Generics

Variations on Variants
J. Garrett Morris
(University of Edinburgh, UK)

Modular Reifiable Matching: A List-of-Functors Approach to Two-Level Types
Bruno C. d. S. Oliveira, Shin-Cheng Mu, and Shu-Hung You
(University of Hong Kong, China; Academia Sinica, Taiwan; National Taiwan University, Taiwan)

Monads and Comonads

Freer Monads, More Extensible Effects
Oleg Kiselyov and Hiromi Ishii
(Tohoku University, Japan; University of Tsukuba, Japan)

Info

Functional Pearl: Getting a Quick Fix on Comonads
Kenneth Foner
(University of Pennsylvania, USA)

Info

Type Classes

Injective Type Families for Haskell
Jan Stolarek, Simon Peyton Jones, and Richard A. Eisenberg
(Politechnika Łódzka, Poland; Microsoft Research, UK; University of Pennsylvania, USA)

Type Families with Class, Type Classes with Family
Alejandro Serrano, Jurriaan Hage, and Patrick Bahr
(Utrecht University, Netherlands; University of Copenhagen, Denmark)

Concurrency and Parallelism

Déjà Fu: A Concurrency Testing Library for Haskell
Michael Walker and Colin Runciman
(University of York, UK)

Improving Implicit Parallelism
José Manuel Calderón Trilla and Colin Runciman
(University of York, UK)

Probabilistic and Linear Programming

Practical Probabilistic Programming with Monads
Adam Ścibior, Zoubin Ghahramani, and Andrew D. Gordon
(University of Cambridge, UK; Microsoft Research, UK; University of Edinburgh, UK)

Embedding a Full Linear Lambda Calculus in Haskell
Jeff Polakow
(Awake Networks, USA)

Code Generation

Guilt Free Ivory
Trevor Elliott, Lee Pike, Simon Winwood, Pat Hickey, James Bielman, Jamey Sharp, Eric Seidel, and John Launchbury
(Galois, USA; University of California at San Diego, USA; Willamette University, USA)

Type-safe Runtime Code Generation: Accelerate to LLVM
Trevor L. McDonell, Manuel M. T. Chakravarty, Vinod Grover, and Ryan R. Newton
(Indiana University, USA; UNSW, Australia; NVIDIA, USA)

proc time: 0.65