[popl'24] polyregular functions on unordered trees of bounded height
Published 8 months ago • 33 plays • Length 19:41Download video MP4
Download video MP3
Similar videos
-
![[popl'24] on model-checking higher-order effectful programs](https://i.ytimg.com/vi/8g2PqP7Q2uo/mqdefault.jpg)
21:05
[popl'24] on model-checking higher-order effectful programs
-
![[popl'24] nominal recursors as epi-recursors](https://i.ytimg.com/vi/IqSubNUOWWg/mqdefault.jpg)
20:58
[popl'24] nominal recursors as epi-recursors
-
![[popl'24] efficient chad](https://i.ytimg.com/vi/HUoUap7nO2U/mqdefault.jpg)
18:58
[popl'24] efficient chad
-
![[popl'24] pipelines and beyond: graph types for adts with futures](https://i.ytimg.com/vi/YqCyyaBiwqg/mqdefault.jpg)
20:04
[popl'24] pipelines and beyond: graph types for adts with futures
-
![[popl'24] relu hull approximation](https://i.ytimg.com/vi/Dn4y4PqhvgI/mqdefault.jpg)
18:03
[popl'24] relu hull approximation
-
1:03:04
large language model: a programmer's perspective
-
8:26
episode 1: deep dive into attention heads of large language models
-
![[plmw@popl'24] the evolution of effects](https://i.ytimg.com/vi/3CcAxhMw0-c/mqdefault.jpg)
55:08
[plmw@popl'24] the evolution of effects
-
![[popl'24] monotonicity and the precision of program analysis](https://i.ytimg.com/vi/m06wlLISzx0/mqdefault.jpg)
21:12
[popl'24] monotonicity and the precision of program analysis
-
![[popl'24] implementation and synthesis of math library functions](https://i.ytimg.com/vi/sFtnd9eWt8g/mqdefault.jpg)
20:21
[popl'24] implementation and synthesis of math library functions
-
![[popl'24] mechanizing refinement types](https://i.ytimg.com/vi/UXA7SRArBj8/mqdefault.jpg)
20:26
[popl'24] mechanizing refinement types
-
![[popl'24] a universal, sound, and complete forward reasoning technique for machine-verifie...](https://i.ytimg.com/vi/rOGmRSPHQsU/mqdefault.jpg)
20:58
[popl'24] a universal, sound, and complete forward reasoning technique for machine-verifie...
-
![[popl'24] internal parametricity, without an interval](https://i.ytimg.com/vi/bcazvJr8bjc/mqdefault.jpg)
19:22
[popl'24] internal parametricity, without an interval
-
![[popl'24] guided equality saturation](https://i.ytimg.com/vi/ZLkHl7YmpIY/mqdefault.jpg)
21:21
[popl'24] guided equality saturation
-
![[popl'24] internalizing indistinguishability with dependent types](https://i.ytimg.com/vi/cgTrzJ1yVSA/mqdefault.jpg)
20:10
[popl'24] internalizing indistinguishability with dependent types
-
![[popl'24] predictive monitoring against pattern regular languages](https://i.ytimg.com/vi/apf5afr0eEc/mqdefault.jpg)
18:55
[popl'24] predictive monitoring against pattern regular languages
-
![[popl'24] strong invariants are hard: on the hardness of strongest polynomial invariants f...](https://i.ytimg.com/vi/XkuegDpPn4A/mqdefault.jpg)
22:21
[popl'24] strong invariants are hard: on the hardness of strongest polynomial invariants f...
-
![[popl'24] solvable polynomial ideals: the ideal reflection for program analysis](https://i.ytimg.com/vi/J2biQREB-Eg/mqdefault.jpg)
20:23
[popl'24] solvable polynomial ideals: the ideal reflection for program analysis
-
![[popl'24] polymorphic type inference for dynamic languages](https://i.ytimg.com/vi/dYJ9DB5ySwU/mqdefault.jpg)
21:04
[popl'24] polymorphic type inference for dynamic languages