25:57

01 Welcome to ICFP

36:09

02 PL research in industry

31:17

06 Introduction to Dependent Types

31:41

07 Program Transformations for Developing Efficient and Correct Programs with Ease

38:20

08 How to write papers so that people can read them

30:03

09 Principle and Practice of OCaml Type Debugger

38:37

10 Unaccustomed as I am to public speaking

46:37

03 Basic Mechanics of Operational Semantics

50:03

04 Some Types of Types

28:41

05 Analyzing JavaScript Web Applications in the Wild Mostly Statically

30:19

07 Type Directed Compilation of Row typed Algebraic Effects

54:30

01 Effective Programming: bringin algebraic effects and handlers to OCaml

26:10

02 Effects as Capabilities

26:58

08 Administrative normal form, continued: Sharing control in direct style

15:42

04 Simple Dependent Polymorphic IO Effects

24:49

06 Growing a Proof Assistant

31:25

03 A Logical Account of Type and Effect Systems

30:30

09 Functional models of full ground, and general, reference cells

20:19

1 10 Getting a Quick Fix on Comonads

17:43

03 A SQL to C Compiler in 500 Lines of Code

22:24

2 04 Imprving Implicit Parallelism

22:57

2 03 Deja fu: a concurrency testing library for Haskell

25:41

14 Ketrew and Biokepi

22:38

13 Persistent Networking with Irmin and MirageOS

24:13

12 A review of the growth of the OCaml community

27:50

11 Effective Concurrency through Algebraic Effects

20:23

10 Global Semantic Analysis on OCaml programs

28:06

09 Typeful PPX and Value Implicits

32:15

07 The State of the OCaml Platform: September 2015

25:31

06The State of OCaml

24:05

05 Inline Assembly in OCaml

20:50

04 Specialization of Generic Array Accesses After Inlining

24:16

03 Core Time stamp counter: A fast high resolution time source

27:07

02 Operf: Benchmarking the OCaml Compiler

22:38

01 Towards A Debugger for Native Code OCaml

5:17

Lightning: Type Level Records with Type Functions

5:01

Lightning: Programmable Type Errors

3:45

Lightning: Pipes

4:39

Lightning: New Typeable

5:03

Lightning: Haskell Roots of Trust

4:27

Lightning: Haskell Ray Tracer

4:11

Lightning: GHCJS

4:05

Lightning: Fast Queries

3:39

Lightning: Dot Products

4:14

Lightning: Propellor

3:54

Lightning: A Nanopass Framework for Haskell

27:43

02 Generate and Offshore: Type safe and Modular Code Generation for Low Level Optimization

37:42

07 Skeletons for Distributed Topological Computation

59:51

01 Regularizing the irregular: analyses and transformations for recursive, irregular applications

28:43

05 Functional Array Streams

19:47

03 Meta Programming and Auto Tuning in the Search for High Performance GPU Code

55:13

06 Scalan: A Framework for Domain Specific Hotspot Optimization

24:38

04 Converting Data Parallelism to Task Parallelism by Rewrites: Purely Functional Programs Across Mu

29:53

07 The Shepard Tone and Higher Order Multi rate Synchronous Data Flow Programming in Sig

25:24

03 Real Time Interactive Music in Haskell

17:14

04 An Efficient Implementation of Tiled Polymorphic Temporal Media

21:14

08 Moodler: A digital modular synthesiser with an analogue user interface

30:43

05 Diagrams: a Functional EDSL for Vector Graphics

14:56

06 MineCraft Demo

49:52

02 Mathematics, Textiles and Programming: Scripted Scarves

14:13

Future of Haskell: Dependent types

5:49

Future of Haskell: Refinment types

18:21

Future of Haskell: Cabal hell and its denizens

51:22

06 Fighting spam with haskell at Facebook

22:29

05 Recognizing patterns in noisy data using trainable 'Functional' state machines

23:18

02 Coping with Change: data schema migration in Haskell

24:43

03 Haskell in production, a survey

27:04

08 Futures for C++11 at Facebook

22:44

07 Modeling state transitions with specification based random testing

54:59

09 The Unreasonable Effectiveness of Lenses for Business Applications

24:44

04 Building binary protocol drivers in Elixir

59:51

01 The History of Standard ML: Ideas, Principles, Culture

24:13

02 Generating Code with Polymorphic 'let'

25:06

03 Polymorphism, subtyping, and ytpe inference in MLsub

24:28

04 Arduiono programming of ML style in ATS

25:27

05 resource monitoring for Poly ML Procoesses

27:36

06 Dependent Types and Effects in F*

23:53

07 Dependent Types for Real time Constraints

20:19

08 Manifest Contracts for OCaml

27:36

09 Lost in Extraction, Recovered

25:31

10 GADTs and Exhaustivness: Looking for the Impossible

5:30

New Site for ML

22:09

2 01 Freer Monad, More Extensible Effects

26:27

1 03 Reasoning with the HERMIT

21:22

1 08 Modular Reifiable Matching

22:43

2 07 Guilt Free Ivory

24:16

1 07 Variations on Variants

23:51

2 06 Embedding a Full Linear Lambda Calculus in Haskell

20:20

1 04 Formally Proving a Compiler Transformation Safe

28:02

1 02 A Typechecker Plugin for Units of Measure

26:51

1 01 Improving Haskell Types with SMT

20:40

2 02 Type Families with Class

21:48

1 06 The Remote Monad Design Pattern

25:19

2 05 Practical Probabilistic Programming with Monads

26:05

1 05 Bridging the GUI Gap with Reactive Values and Relations

22:02

1 09 Injective Type Families for Haskell

22:39

2 08 Type Safe Runtime Code Generation: Accelerate to LLVM

5:02

3 16 ICFP 2016 Announcement

4:26

3 15 Student Competition Results

17:30

3 14 GADTs Meet Their Match