26:30

06 Profiling Actor Utilization and Communication in Akka

20:48

05 Making everybody comfortable with Erlang: a SCADA system for thermal control

21:24

04 Observing the consistency of distributed systems

39:11

01 Solutions to distributed systems problems, 'Akka', actors

22:15

06. Conex -- establishing trust into data repositories

26:33

07 OPAM builder: Continuous Monitoring of OPAM Repositories

25:14

03. Learning Ocaml

22:00

13 Improving the oCamls web stack

27:10

02 The State of the OCaml Platform

17:55

12 Who's got you mail? Mr Mime!

27:17

11 Generic Programming in OCaml

25:23

10 Semantics for the Lambda intermediate language

19:59

09 OCaml inside: a drop in replacement for libtls

21:20

08 SundialsML: interfacing with numerical solvers

28:01

05 Lock free programming for the masses

22:48

04 Statically profiling memory in OCamls

21:58

01 What's new in OCamls 4.03

16:26

12 Typed embedding of a relational language in OCaml

25:09

11 Ambiguous pattern variables

13:17

10 Malfunctional programming

22:10

09 Close encounters of the higher kind emulating constructor classes in Standard ML

26:02

08 Classes for the Masses

21:13

07 Compiling Links Effect Handlers to the OCaml Backend

24:24

04 Compiling with Continuations and LLVM

25:41

06 Eff directly in OCaml

16:07

05 SML# with natural join

59:51

01 Making Reactive Programs Function

26:22

03 Translating from F* to C

25:45

02 WebAssembly: high speed at low cost for everyone

4:52

01. Making Reactive Programs Function (part 2)

22:40

2 09 Lazy Graph Processing in Haskell

24:57

2 08 Non recursive Make considered Harmful

23:04

2 07 Supermonads: One Notion to Bind them All

28:18

2 06 The Key Monad: Type Safe Unconstrained Dynamic Typing

59:01

2 05 PC Chair Report and State of Haskell Discussion

27:18

2 04 Embedding Session Types in Haskell

26:37

2 03 Types for a Relational Algebra Library

25:39

2 02 Autobahn: Using Genetic Algorithms to Infer Strictness

15:45

1 02 QuickFuzz: An Automatic Random Fuzzer for Common File Formats

26:10

1 10 Desugaring Haskell's do Notation into Applicative Operations

26:17

1 09 Pattern Synonyms

23:08

1 08 Developing High Performance HTTP 2 Server in Haskell

19:23

1 07 High Performance Client Side Web Applications through Haskell EDSLs

25:13

1 06 How to Twist Pointers without Breaking Them

26:09

1 05 Free Delivery

27:01

1 04 Functional Reactive Programming, Refactored

27:43

2 01 Revisting Software Transactional Memory in Haskell

26:42

1 03 Casual Commutative Arrows Revisited

28:09

1 01 FitSpec: Refining Property Sets for Functional Testing

21:51

3 08 A Fully Concurrent Garbage Collector for Functional Programs on Multicore Processors

4:37

3 14 Student Research Competition Awards

25:13

3 13 String Diagrams for Free Monads

25:49

3 12 Combining Effects and Coeffects via Grading

26:23

3 11 Context Free Session Types

24:55

3 10 The Best of Both Worlds: Linear Functional Programming without Compromise

23:49

3 09 Talking Bananas: Structurals Recursion for Session Types

25:13

3 07 Allocation Characterizes Polyvariance: A Unified Methodology for Polyvariant Control Flow Anal

25:52

3 06 Hierarchical Memory Managment for Parallel Programs

29:20

3 05 Set Theoretic Types for Polymorphic Variants

23:15

3 04 Disjoint Intersection Types

23:49

3 03 Indexed Codata Types

23:19

3 02 Ghostbuster: A Tool for Simplifying and Converting GADTs

1:00:35

3 01 A Functional Programmer's Guide to Homotopy Type Theory

21:56

2 08 Higher Order Ghost State

20:13

2 07 Automatically Disproving Fair termination of Higher Order Functional Programs

25:59

2 06 Dynamic Witnesses for Static Type Erros or, Ill Typed Programs Usually Go Wrong

24:02

2 04 Think Like a Vertex, Behave Like a Function! A Functional DSL for Vertex Centric Big Graph Pro

24:39

2 05 Datafun: A Functional Datalog

23:04

2 03 Experience Report: Growing and Shrinking Polygons for Random testing of Computational Geometry

26:44

2 02 A Glimpse of Hopjs

1:02:03

2 01 Journey to Find Bugs in JavaScript Web Applications in the Wild

24:09

2 09 Unifiers as Equivalances: Proof Relevant Unification of Dependently Typed Data

24:42

2 10 Elaborator Reflection: Extending Idris in Idris

22:56

2 11 Partial Type Equivalances for Verified Dependent Interoperability

24:36

2 12 constructive Galois Connections: Taming the Galois Connection Framework for Mechanazed Metathe

25:48

2 13 An Abstract Memory Functor for Verified C Static Analysys

35:32

2 15 Programming Contest Presentation

10:38

2 14 Program Chair Report

27:41

1 14 All Sorts of Permutations

25:22

1 13 Queueing and Glueing for Optimal Partitioning

25:32

1 11 A Type Theory for Incremental Computational Complexity with Control Flow Changes

23:39

1 10 Oh Lord, Please Don't Let Contracts Be Misunderstood

26:14

1 09 Fully Abstract Compilation via Universal Embedding

26:03

1 08 Refinement through Restraint: Bringing Down the Cost of Verification

25:20

1 07 Sequent Calculus as a Compiler Intermediate Language

25:22

1 06 A New Verified Compiler Backend for CakeML

24:01

1 05 Deriving a Probability Density Calculator

25:18

1 04 A Lambda Calculus Foundation for Universal Probabilistic Programming

26:56

1 02 Farms, Pipes, Streams, and Reforestation: Reasoning about Structured Parallel Processes using

26:29

1 03 DAG Calculus: A Calculus for Parallel Computation

20:06

12 An Agda formalization of the transitive closure of block matrices

20:55

11 Parametrized Extensible Effects and Session Types

33:08

10 Generic Lookup and Update for Infinitary Inductive Recursive Types

22:33

06 Bidirectional Transformations are Proof relevant Bisimulations

26:49

09 Programming with Monadic CSP Style Processes in Dependent Type Theory

29:38

08 Liberating Effects with Rows and Handlers

27:04

07 Applications of Applicative Proofs Search

31:05

03 Generic diff3 for Algebraic Datatypes

20:38

04 Programming Assistance for Type directed Programming

14:36

05 generic partially static data