ICFP 2021
Sun 22 - Sat 28 August 2021
Mon 23 Aug 2021 19:03 - 19:10 at Student Research Competition - SRC Poster Session

Sparse linear algebra is a great framework to tackle a wide variety of problems but in practice, its implementations suffer from being memory-bound. Thus a number of optimizations have been proposed towards the reduction of the number of memory accesses to increase the arithmetics-to-memory-accesses ratio with fusion optimization being the major one. This work proposes an approach to employ distillation to support fusion. It provides some benchmarks and describes the directions of future work on how to achieve even better performance.

Mon 23 Aug

Displayed time zone: Seoul change

18:30 - 19:30
18:30
6m
Poster
A Linear Temporal Logic with Heartbeat
Student Research Competition
18:36
6m
Poster
An Interactive Stepper for Expression with Holes
Student Research Competition
Yanjun Chen University of Michigan
18:43
6m
Poster
Automatic concurrency with free applicatives/monads, side effects supported
Student Research Competition
18:50
6m
Poster
Compilation of a functional shading language to a SPIR-V intermediate representation
Student Research Competition
Andrzej Swatowski University of Warsaw
18:56
6m
Poster
Composable, Modular Probabilistic Models
Student Research Competition
Minh Nguyen University of Bristol
19:03
6m
Poster
Distilling Sparse Linear Algebra
Student Research Competition
19:10
6m
Poster
Formally verified derivation of an executable and terminating CEK machine from call-by-value λp̂-calculus
Student Research Competition
Wojciech Różowski University of Southampton
19:16
6m
Poster
Mechanizing an elaboration algorithm for the Hindley-Damas-Milner system
Student Research Competition
19:23
6m
Poster
Ungenerators
Student Research Competition
Harrison Goldstein University of Pennsylvania