Главная
Study mode:
on
1
Intro
2
Martin-Löf type theory
3
coproduct injection is parity
4
Computation
5
Canonicity theorem
6
Univalence Axiom
7
Progress
8
Constructive Cubical Models
9
Main Ideas
10
Recommender System
11
Z in type theory (1)
12
addition (1)
13
Equivalence of (1) and (3)
14
Using univalence
15
Group structure
16
Without univalence
17
Circle
18
Universal Cover
19
Torus
20
Synth homotopy theory
21
Brunerie's number
22
CS Applications
23
Questions
Description:
Explore univalence from a computer science perspective in this 56-minute conference talk by Dan Licata from Wesleyan University, presented at the Vladimir Voevodsky Memorial Conference hosted by the Institute for Advanced Study. Delve into topics such as Martin-Löf type theory, coproduct injection, computation, canonicity theorem, and the Univalence Axiom. Examine constructive cubical models, main ideas in recommender systems, and the application of Z in type theory. Investigate the equivalence of different concepts, group structures, and geometric constructs like circles, universal covers, and tori. Gain insights into synthetic homotopy theory, Brunerie's number, and various computer science applications before concluding with a Q&A session.

Univalence from a Computer Science Point-of-View - Dan Licata

Institute for Advanced Study
Add to list