Vidiowiki

All videos in ICFP 2009

ICFP 09 Programming Contest     ICFP 09 Programming Contest

Testing Erlang data types with quviq quickcheck     Testing Erlang data types with quviq quickcheck

Free theorems involving type constructor classes: functional pearl     Free theorems involving type constructor classes: functional pearl

Creating new operating systems for cloud computing using functional programming languages     Creating new operating systems for cloud computing using functional programming languages

seL4: Formal Verification of an OS Kernel     seL4: Formal Verification of an OS Kernel

Data parallelism in a functional setting     Data parallelism in a functional setting

The only implementation of Haskell with views     The only implementation of Haskell with views

Generic Programming with Fixed Points for Mutually Recursive Datatypes     Generic Programming with Fixed Points for Mutually Recursive Datatypes

The worker/wrapper transformation     The worker/wrapper transformation

A DSL for Psychologists     A DSL for Psychologists

QuviQ     QuviQ

Software transaction memory     Software transaction memory

Finding Race Conditions in Erlang with QuickCheck and PULSE     Finding Race Conditions in Erlang with QuickCheck and PULSE

Functional Programming Applications     Functional Programming Applications

Shriram Krishnamurthi on WeScheme     Shriram Krishnamurthi on WeScheme

A universe of binding and computation     A universe of binding and computation

Shinichiro Hamaji on winning ICFP '09 Programming Contest     Shinichiro Hamaji on winning ICFP '09 Programming Contest

Dependent Types for Distributed Arrays     Dependent Types for Distributed Arrays

Unifying objects and functions: treating functions as classes     Unifying objects and functions: treating functions as classes

QuickSpec     QuickSpec

Guy Steele: foldl and foldr considered slightly harmful     Guy Steele: foldl and foldr considered slightly harmful

Complete and decidable type inference for GADTs     Complete and decidable type inference for GADTs

ICFP 09 Introduction     ICFP 09 Introduction

Benjamin Pierce: Using a Proof Assistant to Teach Programming Language Foundations, or, Lambda, the Ultimate TA     Benjamin Pierce: Using a Proof Assistant to Teach Programming Language Foundations, or, Lambda, the Ultimate TA

Program Derivation     Program Derivation

Biorthogonality, Step-Indexing and Compiler Correctness     Biorthogonality, Step-Indexing and Compiler Correctness

Haskell and Erlang: growing up together     Haskell and Erlang: growing up together

Beautiful differentiation     Beautiful differentiation

Partial Memoization of Concurrency and Communication     Partial Memoization of Concurrency and Communication

Safe Functional Reactive Programming through Dependent Types     Safe Functional Reactive Programming through Dependent Types

Glasgow Haskell Compiler: The Early Days     Glasgow Haskell Compiler: The Early Days

Experience report: embedded, parallel computer-vision with a functional DSL     Experience report: embedded, parallel computer-vision with a functional DSL

Scribble: Closing the Book on Ad Hoc Documentation Tools     Scribble: Closing the Book on Ad Hoc Documentation Tools

Glasgow Haskell Compiler: An Extension     Glasgow Haskell Compiler: An Extension

ICFP Keynotes     ICFP Keynotes

Eastwest and Oset     Eastwest and Oset

Using Functional Programming in a Commercial Setting: Erlang and Facebook     Using Functional Programming in a Commercial Setting: Erlang and Facebook

Stochastic Lambda Calculus and Monads of Probability Distributions     Stochastic Lambda Calculus and Monads of Probability Distributions

MLState     MLState

Partial Memoization of Concurrency and Communication     Partial Memoization of Concurrency and Communication

Automatically RESTful web applications: marking modular serializable continuations     Automatically RESTful web applications: marking modular serializable continuations

Data parallel Haskell: a status report     Data parallel Haskell: a status report

Where does the monomorphism restriction come from in Haskell?     Where does the monomorphism restriction come from in Haskell?

Embed this video

Close

Sign in

:
:
Forgot your password?