llelf / icfp2019-papers

ICFP 2019 preprints/papers

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

ICFP 2019

https://icfp19.sigplan.org/track/icfp-2019-papers#event-overview


Similar pages for older ICFP (2012, 2013, 2014, 2015, 2016, 2017), POPL (2013, 2014, 2015, 2016), and PLDI 2014.

ICFP 2018 (open access): https://icfp18.sigplan.org/track/icfp-2018-papers#event-overview


A Mechanical Formalization of Higher-Ranked Polymorphic Type Inference
Jinxu Zhao, Bruno C. d. S. Oliveira, Tom Schrijvers
(paper)

A Reasonably Exceptional Type Theory
Pierre-Marie Pédrot, Nicolas Tabareau, Hans Fehrmann, Éric Tanter
(draft)

A Role for Dependent Types in Haskell
Stephanie Weirich, Pritam Choudhury, Antoine Voizard, Richard A. Eisenberg
(paper)

A predicate transformer semantics for effects (Functional Pearl)
Wouter Swierstra, Tim Baanen
(paper)

An Efficient Algorithm for Type-Safe Structural Diffing
Victor Cacciari Miraldo, Wouter Swierstra
(paper)

Approximate Normalization for Gradual Dependent Types
Joseph Eremondi, Éric Tanter, Ronald Garcia
(preprint)

Call-By-Need is Clairvoyant Call-By-Value
Jennifer Hackett, Graham Hutton
(preprint)

Closure Conversion is Safe for Space
Zoe Paraskevopoulou, Andrew Appel
(paper)

Coherence of Type Class Resolution
Gert-Jan Bottu, Ningning Xie, Klara Mardirosian, Tom Schrijvers
(paper)

Compiling with Continuations, or without? Whatever.
Youyou Cong, Leo Osvald, Gregory Essertel, Tiark Rompf
(preprint)

Cubical Agda: A Dependently Typed Programming Language with Univalence and Higher Inductive Types
Andrea Vezzosi, Anders Mörtberg, Andreas Abel
(preprint code)

Demystifying Differentiable Programming: Shift/Reset the Penultimate Backpropagator
Fei Wang, Daniel Zheng, James Decker, Xilun Wu, Gregory Essertel, Tiark Rompf
https://arxiv.org/abs/1803.10228

Dependently Typed Haskell in Industry (Experience Report)
David Thrane Christiansen, Iavor Diatchki, Robert Dockins, Joe Hendrix, Tristan Ravitch
(paper)

Dijkstra Monads for All
Kenji Maillard, Danel Ahman, Robert Atkey, Guido Martínez, Cătălin Hriţcu, Exequiel Rivas, Éric Tanter
(paper)

Efficient Differentiable Programming in a Functional Array-Processing Language
Amir Shaikhha, Andrew Fitzgibbon, Dimitrios Vytiniotis, Simon Peyton Jones
(2018 paper)

Equations Reloaded
Matthieu Sozeau, Cyprien Mangin
https://hal.inria.fr/hal-01671777v2/

Fairness in Responsive Parallelism
Stefan K. Muller, Sam Westrick, Umut Acar

From high-level inference algorithms to efficient code
Rajan Walia, Praveen Narayanan, Jacques Carette, Sam Tobin-Hochstadt, Chung-chieh Shan
(paper)

Fuzzi: A Three-Level Logic for Differential Privacy
Hengchu Zhang, Edo Roth, Andreas Haeberlen, Benjamin C. Pierce, Aaron Roth
https://arxiv.org/pdf/1905.12594.pdf

Higher-order Type-level Programming in Haskell
Csongor Kiss, Tony Field, Susan Eisenbach, Simon Peyton Jones
https://www.microsoft.com/en-us/research/uploads/prod/2019/03/ho-haskell-5c8bb4918a4de.pdf

Implementing a Modal Dependent Type Theory
Daniel Gratzer, Jonathan Sterling, Lars Birkedal
https://cs.au.dk/~birke/papers/implementing-modal-dependent-type-theory-conf.pdf

Lambda Calculus with Algebraic Simplification for Reduction Parallelization by Equational Reasoning
Akimasa Morihata

Lambda: the Ultimate Sublanguage (Experience Report)
Jeremy Yallop, Leo White
https://www.cl.cam.ac.uk/~jdy22/papers/lambda-the-ultimate-sublanguage.pdf

Linear capabilities for fully abstract compilation of separation-logic-verified code
Thomas Van Strydonck, Frank Piessens, Dominique Devriese

Mechanized Relational Verification of Concurrent Programs with Continuations
Amin Timany, Lars Birkedal
(2018 paper)

Mixed Linear and Non-linear Recursive Types
Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev
(preprint)

Narcissus: Correct-By-Construction Derivation of Decoders and Encoders from Binary Formats
Benjamin Delaware, Sorawit Suriyakarn, Clément Pit-Claudel, Qianchuan Ye, Adam Chlipala
(preprint) (code)

Quantitative program reasoning with graded modal types
Dominic Orchard, Vilem-Benjamin Liepelt, Harley D. Eades III
(draft)

Rebuilding Racket on Chez Scheme (Experience Report)
Matthew Flatt, Caner Derici, R. Kent Dybvig, Andy Keep, Gustavo E. Massaccesi, Sarah Spall, Sam Tobin-Hochstadt, Jon Zeppieri
(2018(?) paper)

Relational Cost Analysis for Functional-Imperative Programs
Weihao Qu, Marco Gaboardi, Deepak Garg
(paper)

Robust and sound solid modeling via exact real arithmetic and continuity
Benjamin Sherman, Jesse Michel, Michael Carbin
(paper)

Selective Applicative Functors
Andrey Mokhov, Georgy Lukyanov, Simon Marlow, Jeremie Dimino
(paper) (slides)

Sequential Programming for Replicated Data Stores
Nicholas V. Lewchenko, Arjun Radhakrishna, Akash Gaonkar, Pavol Cerny
https://s.octalsrc.org/ipfs/QmasAG3JSja6mpTEVooN9ZgYRdMZy5ABr9MDZxoxXiCqx3/item/carol-lang-2018-12-14.pdf

Simple Noninterference from Parametricity
Maximilian Algehed, Jean-Philippe Bernardy
(paper)

Simply RaTT: A Fitch-style Modal Calculus for Reactive Programming Without Space Leaks
Patrick Bahr, Christian Uldal Graulund, Rasmus Ejlers Møgelberg
https://arxiv.org/pdf/1903.05879v2.pdf

Synthesizing Differentially Private Programs
Calvin Smith, Aws Albarghouthi
(paper)

Synthesizing Symmetric Lenses
Anders Miltner, Solomon Maina, Kathleen Fisher, Benjamin C. Pierce, David Walker, Steve Zdancewic
(2018 paper)

Teaching the Art of Functional Programming Using Automated Grading (Experience Report)
Aliya Hameer, Brigitte Pientka
(paper)

The Next 700 Compiler Correctness Theorems (Functional Pearl)
Daniel Patterson, Amal Ahmed
(paper)

About

ICFP 2019 preprints/papers