default search action
12th Haskell 2019: Berlin, Germany
- Richard A. Eisenberg:
Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, Haskell@ICFP 2019, Berlin, Germany, August 18-23, 2019. ACM 2019, ISBN 978-1-4503-6813-1 - Dominique Devriese:
Modular effects in Haskell through effect polymorphism and explicit dictionary applications: a new approach and the μVeriFast verifier as a case study. 1-14 - Ryan G. Scott, Ryan R. Newton:
Generic and flexible defaults for verified, law-abiding type-class instances. 15-29 - Koen Pauwels, Georgios Karachalias, Michiel Derhaeg, Tom Schrijvers:
Bidirectional type class instances. 30-43 - William T. Hallahan, Anton Xue, Ruzica Piskac:
G2Q: Haskell constraint solving. 44-57 - Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones:
Making a faster Curry with extensional types. 58-70 - Matthew Pickering, Nicolas Wu, Csongor Kiss:
Multi-stage programs in context. 71-84 - Matthew Pickering, Nicolas Wu, Boldizsár Németh:
Working with source plugins. 85-97 - Tom Schrijvers, Maciej Piróg, Nicolas Wu, Mauro Jaskelioff:
Monad transformers and modular algebraic effects: what binds them together. 98-113 - Anton Ekblad:
Scoping monadic relational database queries. 114-124 - Jan Christiansen, Sandra Dylus, Niels Bunkenburg:
Verifying effectful Haskell programs in Coq. 125-138 - Andrey Mokhov, Georgy Lukyanov, Jakob Lechner:
Formal verification of spacecraft control programs (experience report). 139-145 - Sebastian Ertel, Justus Adam, Norman A. Rink, Andrés Goens, Jerónimo Castrillón:
STCLang: state thread composition as a foundation for monadic dataflow parallelism. 146-161 - Bernd Finkbeiner, Felix Klein, Ruzica Piskac, Mark Santolucito:
Synthesizing functional reactive programs. 162-175
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.