1:01:09

ICFP 2018 Keynote Address: The Role of Functional Programming and DSLs in Hardware

21:45

The Simple Essence of Automatic Differentiation

25:57

Tight Typings and Split Bounds

24:10

What's the Difference? A Functional Pearl on Subtracting Bijections

22:10

What You Needa Know about Yoneda - Profunctor Optics and the Yoneda Lemma

22:14

Casts and Costs - Harmonizing Safety and Performance in Gradual Typing

19:58

Capturing the Future by Replaying the Past

17:51

Build Systems à la Carte

22:13

A Type and Scope Safe Universe of Syntaxes with Binding - Their Semantics and Proofs

23:12

A Spectrum of Type Soundness and Performance

22:55

Competitive Parallelism - Getting Your Priorities Right

17:59

Compositional Soundness Proofs of Abstract Interpreters

21:39

Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion

1:00:30

ICFP 2018 Keynote Address: Conveying the Power of Abstraction

22:05

Elaborating Dependent (Co)pattern Matching

22:19

Fault Tolerant Functional Reactive Programming

23:33

Finitary Polymorphism for Optimizing Type-Directed Compilation

24:23

Functional Programming for Compiling and Decompiling Computer-Aided Design

21:42

Functional Programming for Modular Bayesian Inference

22:09

Generic Deriving of Generic Traversals

25:38

Generic Zero-Cost Reuse for Dependent Types

25:43

Hardware Software Co-Design in Haskell

28:31

The Linearity Monad

27:47

Improving STM Performance with Transactional Structs

23:51

Packrats Parse in Packs

28:51

Algebraic Graphs with Class (Functional Pearl)

31:43

Composable Network Stacks and Remote Monads

27:15

Ode on a Random Urn (Functional Pearl)

27:24

A Tale of Two Provers: Verifying Monoidal String Matching in Liquid Haskell and Coq

23:29

Streaming Irregular Arrays

25:16

Quantified Class Constraints

31:45

Speculate: Discovering Conditional Equations and Inequalities about Black-Box Functions

26:02

A Meta-EDSL for Distributed Web Applications

16:55

Adaptive Lock-Free Data Structures in Haskell: A General Method for Conc. Implementation Swapping

24:39

QuickSpec: A Lightweight Theory Exploration Tool for Programmers (System Demonstration)

25:21

Back to the Future: Time Travel in FRP

26:10

Tracking GHC Performance

10:24

Lightning Talk: retrie: Equational Rewriting for Haskell

15:10

Demo — Octopus: A High-Level Fast 3D Animation Language

1:06:28

FAUST Tutorial for Functional Programmers

31:57

Unified Media Programming: An Algebraic Approach

19:20

Demo — Ait: A Concatenative Language for Creative Programming

25:48

Demo — The Arpeggigon: A Functional Reactive Musical Automaton

34:41

Modelling the Way Mathematics Is Actually Done

17:07

Demo — Vivid: Sound Synthesis with Haskell and SuperCollider

20:18

Demo — African Polyphony and Polyrhythm

24:29

Demo — Representation of Musical Notation in Haskell

36:45

A Categorical Grammar for Music and its use in automatic melody generation

18:23

VisPar: Visualising dataflow graphs from the Par monad

30:10

In Search of a Map: using Program Slicing to Discover Potential Parallelism in Recursive Functions

27:02

Strategies for Regular Segmented Reductions on GPU

26:42

Furthark Demo

33:44

ParaFormance Demo: Democratizing Parallel Software Development

22:50

Ziria Demo: Wringing performance from high-level code

31:06

From High-level Radio Protocol Specifications to Efficient Low-level Implementations

26:23

Destination-Passing Style for Efficient Memory Management

21:17

GHC Infrastructure update

23:14

Why GHC Core and Linear Logic Should be Best Friends

25:02

Native Support for Explicit Stacks in LLVM

26:11

IDE Support in GHC

25:11

An Experiment in Fragment-Based Code Distribution

27:15

HIW: Opening and Progress on GHC

25:29

Fixing Data-flow problems in syntax trees

8:53

Getting Ready for Hadrian

12:11

Lightning Talk: Extrapolate

27:04

On Unsatisfiability

29:44

Towards Abductive Functional Programming

25:00

Efficient representation of Large Dynamic Sequences in ML

19:43

Effectively Tackling the Awkward Squad

25:52

Effects without monads: non-determinism

21:18

Mergeable Types

1:00:04

State machines all the way down

14:21

Relational conversion for OCaml

25:26

Making SML# a general-purpose high-performance language

24:06

Typer: An infix statically typed LISP

24:54

VOCAL - A Verified OCaml Library

31:38

Type-directed diffing of structured data

34:07

Structured asynchrony with algebraic effects

30:27

Type safe Redis queries -- a case study of type-level programming in Haskell

31:42

Generic packet descriptions: verified parsing and pretty printing of low-level data

24:52

Cogent⇑: giving systems engineers a stepping stone

24:43

Affine killing

23:05

Type-directed reasoning for probabilistic, non-compositional resources

30:38

On ringads and foldables

25:24

Type oriented programming for task based parallelism

1:08:36

How to write a paper and give talks that people follow

29:10

Not how to do a PhD

32:40

A Few Frank Remarks

24:32

Keynote: Anti-disciplinary: Doing a PhD when you like too many things

39:01

Gradual Typing

23:47

Scala: Types in Theory & Practice

36:34

Compositional Compiler Correctness

12:01

Invited Talk: David Allsopp

12:19

Invited Talk: Florian Angeletti

15:50

Invited Talk: Sébastien Hinderer

31:13

State of the OCaml Platform

22:12

Owl: A General-Purpose Numerical Library in OCaml

20:24

Genspio: Generating Shell Phrases in OCaml

16:00

Extending OCaml's `open`

36:10

Report: Status of the ongoing R7RS standardization process