14:23

Extending the LISP model

41:06

Scalar and Tensor Parameters for Importing Tensor Index Notation

21:27

Lightning Talk: Gerbil on Gambit, as they say Racket on Chez

1:00:35

Invited Talk: Precision Medicine

1:05:34

Keynote: From Scheme to Typed Racket

22:31

Lambda Way Project

39:51

Towards Parallel CFA

16:21

Constrained Type Families

17:30

Inferring Scope through Syntactic Sugar

17:32

Gradual Types with Union and Intersection Types

18:51

Automating Sized-Type Inference for Complexity Analysis

16:27

Program Chair's Report + ICFP 2018 Announcment

4:14

ICFP 2017 Student Research Competition Awards

18:05

On Polymorphic Gradual Typing

20:22

Normalization by Evaluation for Sized Dependent Types

18:52

A Specification for Dependent Types in Haskell

18:27

Chaperone Contracts for Higher-Order Sessions

21:09

Manifest Sharing with Session Types

20:09

Herbarium Racketensis: A Stroll through the Woods (Functional Pearl)

16:36

A MetaProgramming Framework for Formal Verification

20:38

Gradual Session Types

14:56

Parametric Quantifiers for Dependent Type Theory

20:39

Theorems for Free for Free: Parametricity With and Without Types

18:18

Whip: Higher-Order Contracts for Modern Services

18:00

Visitors Unchained

18:41

Compiling to Categories

14:18

Local Refinement Typing

18:15

SpaceSearch: A Library for Building and Verifying Solver-Aided Tools

19:31

Kami: A Platform for High-Level Parametric Hardware Specification and Its Modular Verification

14:21

No-Brainer CPS Conversion

19:00

Foundations of Strong Call by Need

17:29

A Relational Logic for Higher-Order Programs

16:56

How to Prove Your Calculus Is Decidable

18:26

Better Living through Operational Semantics: An Optimizing Compiler for Radio Protocols

19:54

Verifying Efficient Function Calls in CakeML

18:13

Verified Low-Level Programming Embedded in F*

18:39

Persistence for the Masses: RRB-Vectors in a Systems Language

53:22

Keynote: Assuring AI

18:20

Effect-Driven QuickChecking of Compilers

19:07

Abstracting Definitional Interpreters

17:14

Symbolic Conditioning of Arrays in Probabilistic Programs

18:25

A Framework for Adaptive Differential Privacy

19:20

Prototyping a Query Compiler using Coq (Experience Report)

20:04

A Unified Approach to Solving Seven Programming Problems (Functional Pearl)

19:02

Generic Functional Parallel Algorithms: Scan and FFT

14:15

A Pretty But Not Greedy Printer (Functional Pearl)

19:20

Scaling up Functional Programming Education: Under the Hood of the OCaml MOOC

16:25

Lock-Step Simulation Is Child's Play (Experience Report)

17:43

Testing and Debugging Functional Reactive Programming

54:18

Compositional creativity: some principles for talking to computers

17:30

Super 8 Languages for Making Movies (Functional Pearl)

17:45

Imperative Functional Programs That Explain Their Work

18:20

On the Expressive Power of User-Defined Effects

24:46

06 Automatically escaping Monads

26:39

05 A Dependent Haskell Triptych

28:45

12 Demo: Epimorphism

32:45

11 A Livecoding Semantics for Functional Reactive Programming

24:06

10 Demo: Alda: A text based music composition language

33:38

09 Call for Collaboration: Computational Musicology, ????, Profit

25:04

08 Demo: VoxelCAD, a collaborative voxel based CAD tool

23:22

07 o OM: Structured Functional Communication between Computer Music Systems using OSC and Odot

30:18

06 Demo: Klangmeister

30:04

05 Arrp: A Functional Language with Multi dimensional Signals and Recurrence Equations

31:53

03 Juniper: A Functional Reactive Programming Language for the Arduino

35:44

02 Structured reactive programming with polymorphic temporal tiles

40:39

01 Bithoven: Gödel Encoding of Chamber Music and Functional 8 Bit Audio Synthesis

5:39

11 9 FitSpec Live!

4:47

11 8 GHCVM update

5:45

11 7 Nifty experiments in Haskell syntax

4:55

11 6 Administrative normal form continued

5:17

11 5 Taming the deriving zoo

4:48

11 4 Deriving instances top down

4:31

11 3 LLVM Bitcode

10:13

11 2 Functional Lattice Cryptography

10:01

11 1: Inductive Tuples

1:04:04

1 01TensorFlow: Learning Functions at Scale

49:42

11 Hope is a Monad

26:46

10 Baby steps to unikernels in production

28:09

09 Guix: Scheme as a uniform OS admin and deployment interface

24:29

08 Composable Caching in Swift

25:11

07 The Highs and Lows of Opimising DSLs

20:44

06 Creating an Approachable Haskell like DSL

20:21

05 Building a web application with continuation monads

25:06

04 Chaos testing with F# and Azure

28:17

03 Developing a fast and durable pub sub message bus

21:46

02 Immutable Infrastructure Deployment with Haskell

1:01:46

01 Observations of a Functional Programmer

24:43

10 Trees that grow

24:58

09 Remote GHCi

22:38

08 GHC Determinism

19:40

07 Pita: Tools for making GHC fast again

16:36

04 More Powerful GHC Plugins

26:58

03 Backpack to Work: Towrads Backpack in Practice

23:27

02 Contributing to GHC

40:06

01 The State of GHC

30:35

02 A Scalable Reliable Instant Messenger using the SD Erlang Libraries

33:16

10 Towards Reliable and Scalable Robot Communication

38:54

09 Towards Semi Automatic Data Type Translation for parallelism in Erlang

21:28

08 Automatic generation of UML sequence diagrams from test counterexamples

34:44

07 The Nifty Way to Call Hell from Heaven