ACM SIGPLAN Courses

Higher-Order Property-Directed Reachability

Explore higher-order extension of PDR for automated verification of complex systems. Learn about HoPDR's formalization, implementation, and effectiveness in program safety verification.

• YouTube
• 28 minutes
• On-Demand
• Free Video

Programming for the Planet - Functional Programming for Climate Analysis

Explore functional programming's role in building resilient systems for climate analysis, emphasizing data handling, access control, and interdisciplinary collaboration for conservation impact.

• YouTube
• 1 hour 11 minutes
• On-Demand
• Free Video

Etna: An Evaluation Platform for Property-Based Testing - Experience Report

Explore Etna, a platform for evaluating property-based testing techniques. Compare popular frameworks in Coq and Haskell to understand best practices and tradeoffs in functional programming.

• YouTube
• 28 minutes
• On-Demand
• Free Video

Graded Modal Dependent Type Theory with Universe and Erasure - Formalized

Explore a graded modal type theory with dependent types, erasure, and formalized meta-theoretic properties. Delve into its universe, extraction function, and soundness proofs for open programs.

• YouTube
• 30 minutes
• On-Demand
• Free Video

Modularity, Code Specialization, and Zero-Cost Abstractions for Program Verification

Explore modular techniques for writing and verifying high-level code while producing efficient, zero-overhead implementations. Learn how these methods scaled HACL library and improved proof engineer productivity.

• YouTube
• 30 minutes
• On-Demand
• Free Video

As Low-Level as Possible, But No Lower - WebAssembly's Evolution and Future

Explore WebAssembly's evolution, adoption across ecosystems, and its foundation in programming language research. Gain insights into its formal specification and upcoming features.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

Student Research Contest Talks - ICFP 2023

Explore cutting-edge research in functional programming through student presentations at ICFP'23, featuring innovative ideas and emerging talent in the field.

• YouTube
• 32 minutes
• On-Demand
• Free Video

Dependently-Typed Programming with Logical Equality Reflection

Explore System DE, a calculus for dependently-typed programming with equality reflection. Learn about termination tracking, inductive proofs, and performance-safety trade-offs in functional languages.

• YouTube
• 31 minutes
• On-Demand
• Free Video

TypeScript: Static Types for JavaScript - Keynote

Explore TypeScript's origins, unique type system, and benefits, even for dynamic language enthusiasts, with Anders Hejlsberg, the project's lead architect.

• YouTube
• 1 hour 11 minutes
• On-Demand
• Free Video

Reflecting on Random Generation in Property-Based Testing

Explore reflective generators as a new foundation for random data generation, unifying and enhancing existing techniques for property-based testing, shrinking, and mutation in programming.

• YouTube
• 27 minutes
• On-Demand
• Free Video

Generic Programming with Extensible Data Types: Making Ad Hoc Extensible Data Types Less Ad Hoc

Explore a novel approach to generic programming over extensible data types using row types, capturing patterns and duality between cases blocks over variants and records of labeled functions.

• YouTube
• 30 minutes
• On-Demand
• Free Video

The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming

Explore the Verse calculus, a new core calculus for deterministic functional logic programming, featuring a small-step rewrite semantics for reasoning about programs similar to lambda calculus.

• YouTube
• 30 minutes
• On-Demand
• Free Video

LURK: Lambda, the Ultimate Recursive Knowledge - A LISP-Based Language for zk-SNARKs

Explore Lurk, a LISP-based language for zk-SNARKs, enabling Turing-complete zero-knowledge proofs. Learn about its design, theory, and innovative content addressing approach for efficient programming.

• YouTube
• 31 minutes
• On-Demand
• Free Video

Timely Computation - A Formal Approach to Digital Circuit Design

Explore a formal definition of digital circuits, emphasizing compositional correctness and timing analysis through simple denotations and homomorphisms in Agda.

• YouTube
• 34 minutes
• On-Demand
• Free Video

Modal FRP for All: Functional Reactive Programming Without Space Leaks in Haskell

Explore Modal FRP in Haskell: Learn to prevent space leaks in functional reactive programming and implement a Pong game using this technique.

• YouTube
• 29 minutes
• On-Demand
• Free Video