Toot

Written by Patrik Jansson on 2024-08-23 at 07:20

Preparing for my talk at ICFP [1]:

"Level-p-complexity of Boolean functions using thinning, memoization, and polynomials" (joint work with Julia Jansson)

Code and earlier presentations are available on GitHub [2].

For this talk I have to rethink what is important, because the slot is just 15min + 3min questions and I have earlier presented it at a seminar [3] in around an hour (including questions).

[1] https://icfp24.sigplan.org/details/icfp-2024-jfp-first-papers/4/Level-p-complexity-of-Boolean-functions-using-thinning-memoization-and-polynomials

[2] https://github.com/juliajansson/BoFunComplexity

[3] https://youtu.be/Z0cACMp8_hk

[#]Haskell

[#]Agda

=> View attached media

=> More informations about this toot | View the thread | More toots from patrikja@functional.cafe

Mentions

Tags

=> View haskell tag | View agda tag