Denotational Semantics Courses and Certifications

CppNow

The Mathematical Underpinnings of Promises in C++

Explore the mathematical foundations of promises in C++ and their practical implementation, covering functional design principles, algebraic concepts, and real-world applications in library development.

• YouTube
• 1 hour 17 minutes
• On-Demand
• Conference Talk

CppNow

The Intellectual Ascent to Agda

Explore denotative design and its application in C++ programming, using Agda's syntax to derive powerful, composable libraries from domain-specific mathematical entities.

• YouTube
• 1 hour 23 minutes
• On-Demand
• Conference Talk

GOTO Conferences

Developing Smart Contracts

Explore smart contracts' potential, misconceptions, and best practices. Learn about their relationship with legal contracts and blockchain technology for practical implementation.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Conference Talk

ACM SIGPLAN

Formal Specification and Testing for Reinforcement Learning

Explore a 29-minute video presentation from ICFP 2023 that introduces a formal specification and testing framework for reinforcement learning applications. Delve into the systematic approach proposed by researchers from IT University of Copenhagen and Un…

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

ACM SIGPLAN

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 in this 30-minute conference talk from ICFP 2023. Delve into how row types capture the structure of records and variants, expressing record and variant subtyping, record extension…

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

ACM SIGPLAN

Explicit Refinement Types - A Type Theory with Embedded Proofs

Explore a groundbreaking presentation from the ICFP 2023 conference on Explicit Refinement Types. Delve into the innovative λert type theory, which introduces refinement types with explicit proofs. Learn how this system empowers programmers to embed prop…

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

ACM SIGPLAN

An Algebraic Language for Specifying Quantum Networks

Explore a groundbreaking 17-minute video presentation from PLDI 2024 introducing BellKAT, an innovative specification language for quantum networks. Delve into the challenges of quantum network protocols and discover how BellKAT, based on Kleene algebra,…

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

ACM SIGPLAN

Compiling Probabilistic Programs for Variable Elimination with Information Flow

Explore a 19-minute video presentation from PLDI 2024 that delves into compiling probabilistic programs for variable elimination using information flow. Learn about a novel approach to variable elimination and marginal inference in probabilistic programm…

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

ACM SIGPLAN

Scaling Decision-Theoretic Probabilistic Programming Through Factorization

Explore a groundbreaking probabilistic programming language called dappl in this 18-minute conference talk from ACM SIGPLAN. Discover how dappl models decision-making and solves maximum expected utility problems with exact precision. Learn about the lang…

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

ACM SIGPLAN

Modular Denotational Semantics for Effects with Guarded Interaction Trees

Explore a 21-minute conference talk from POPL 2024 that introduces guarded interaction trees, a framework for representing higher-order computations with higher-order effects in Coq. Delve into the presentation of a structure inspired by domain theory an…

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

ACM SIGPLAN

A Denotational Approach to Release/Acquire Concurrency - GALOP'24

Explore a conference talk on the denotational semantics of Release/Acquire (RA) concurrency presented at GALOP'24. Delve into the recent work by Yotam Dvir, Ohad Kammar, and Ori Lahav, who reimagine Brookes-style trace semantics for shared-state concurre…

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

ACM SIGPLAN

Focusing on Refinement Typing - A Logically Principled Foundation

Explore a logically principled foundation for systematizing SMT constraint generation in refinement type systems for functional programming languages. Delve into a 19-minute conference talk that presents a novel approach combining a focalized variant of…

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