[pldi'23] extensible metatheory mechanization via family polymorphism
Published 6 months ago • 38 plays • Length 19:18Download video MP4
Download video MP3
Similar videos
-
![[pldi'23] verified density compilation for a probabilistic programming language](https://i.ytimg.com/vi/FjZx1-fSADE/mqdefault.jpg)
20:07
[pldi'23] verified density compilation for a probabilistic programming language
-
![[plmw@pldi24] a tour of program optimization](https://i.ytimg.com/vi/SivQplf4OkE/mqdefault.jpg)
36:49
[plmw@pldi24] a tour of program optimization
-
![[pldi'24] norway/finland/sweden - pldi keynotes](https://i.ytimg.com/vi/66oKqvwoIv0/mqdefault.jpg)
1:24:16
[pldi'24] norway/finland/sweden - pldi keynotes
-
![[pldi24] the future of fast code: giving hardware what it wants](https://i.ytimg.com/vi/vU3ryvZYlkk/mqdefault.jpg)
1:03:39
[pldi24] the future of fast code: giving hardware what it wants
-
![[oopsla23] structural subtyping as parametric polymorphism](https://i.ytimg.com/vi/zkUupBdVKuA/mqdefault.jpg)
17:28
[oopsla23] structural subtyping as parametric polymorphism
-
![[pldi'23] modular control plane verification via temporal invariants](https://i.ytimg.com/vi/LbfljnUcY0k/mqdefault.jpg)
20:50
[pldi'23] modular control plane verification via temporal invariants
-
![[pldi'23] mostly automated proof repair for verified libraries](https://i.ytimg.com/vi/iylsgioe0tY/mqdefault.jpg)
18:30
[pldi'23] mostly automated proof repair for verified libraries
-
![[pldi'23] taype: a policy-agnostic language for oblivious computation](https://i.ytimg.com/vi/GYbHZ9dk9Po/mqdefault.jpg)
19:40
[pldi'23] taype: a policy-agnostic language for oblivious computation
-
![[pldi'23] compound memory models](https://i.ytimg.com/vi/vhy2EIzE3-0/mqdefault.jpg)
15:52
[pldi'23] compound memory models
-
![[pldi'23] architecture-preserving provable repair of deep neural networks](https://i.ytimg.com/vi/CO6MpAle-HU/mqdefault.jpg)
20:41
[pldi'23] architecture-preserving provable repair of deep neural networks