YoVDO

Efficient Evaluation with Controlled Definition Unfolding - WITS'24

Offered By: ACM SIGPLAN via YouTube

Tags

Dependent Types Courses Type Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a conference talk from ACM SIGPLAN's WITS'24 that delves into efficient evaluation techniques with controlled definition unfolding in polymorphic and dependently typed languages. Examine the tension between efficient conversion checking and preserving definition unfoldings, crucial for user interaction and unification processes. Learn about a design for efficient open evaluation that maintains unfoldings, with a focus on distinguishing between top-level and local definitions. Discover how this approach can benefit conversion checking, scope checking, and metavariable solutions in unification. Consider the potential for preserving arbitrary unfoldings with moderate complexity increases, as presented by András Kovács in this 29-minute presentation.

Syllabus

[WITS'24] Efficient Evaluation with Controlled Definition Unfolding


Taught by

ACM SIGPLAN

Related Courses

Radical and Type Theories in Organic Chemistry (1832-1850) - Lecture 22
Yale University via YouTube
Introduction to programming with dependent types in Scala
Stepik
Uncovering the Unknown - Principles of Type Inference in Programming Languages
ChariotSolutions via YouTube
Univalence from a Computer Science Point-of-View - Dan Licata
Institute for Advanced Study via YouTube
Univalent Foundations and the Equivalence Principle - Benedikt Ahrens
Institute for Advanced Study via YouTube