← Feed

Posts

• View post

• View post

  You can use lazy memo tries to implement efficient multiplication on Dirichlet generating functions. Not sure if this is useful, but some fun Haskell (laziness/infinitude beyond the usual lists that have equivalents like "streams" in e.g. Rust) http://vmchale.com/static/serve/MTrie.pdf https://vmchale.com/static/serve/MTrie.lhs

• View post

  avoid supply chain attacks: no libraries, re-type your code from the book every time.

• View post

  Alan Kay's talk! https://youtu.be/xbHIjVvdcic?si=M3yN1m9uZ-2VHN-Z

• View post

  Extensible cases are underappreciated and make compilers (with phases + variants of the AST) much more fluent https://vmchale.github.io/pizarnik/ast.html (the language is here btw: https://codeberg.org/vmchale/pizarnik)

• View post

• View post

  Lengauer-Tarjan algorithm for working with control-flow graphs, in Haskell: (performant but inelegant) https://codeberg.org/vmchale/apple/src/branch/canon/src/Dom.hs