[oopsla23] graph irs for impure higher-order languages: making aggressive optimizations af...
Published 7 months ago • 64 plays • Length 18:25Download video MP4
Download video MP3
Similar videos
-
17:32
[oopsla23] languages with decidable learning: a meta-theorem
-
0:22
oasys giraphe: create multiple graphs
-
19:51
[oopsla23] fluent apis in functional languages
-
18:24
[oopsla23] hardware-aware static optimization of hyperdimensional computations
-
18:14
[oopsla23] rapid: region-based pointer disambiguation
-
16:59
[oopsla23] tastytruffle: just-in-time specialization of parametric polymorphism
-
22:20
[pldi24] hyperblock scheduling for verified high-level synthesis
-
22:13
[oopsla23] user-customizable transpilation of scripting languages
-
17:51
[oopsla23] inference of resource management specifications
-
16:32
[oopsla23] explainable program synthesis by localizing specifications
-
25:16
[oopsla] the road not taken: exploring alias analysis based optimizations missed by the compiler
-
17:09
[oopsla23] an explanation method for models of code
-
18:05
[oopsla23] reference capabilities for flexible memory management
-
15:09
sealing pointer-based optimizations behind pure functions (icfp 2020)
-
18:59
[popl'24] inference of robust reachability constraints
-
18:28
[pldi24] space-efficient polymorphic gradual typing, mostly parametric