Want to catch up with SE and PL researchers across the Pacific Northwest? Have a cool project to share? The PNW PLSE 2025 is happening on May 7th, at the Uber Engineering Office in Seattle downtown, and you can sign up at pnwplse.org!

I learned a fascinating result today! Consider the class of decider functions `Str->Bool` expressible in STLC, the set of languages it decides is exactly REG, the set of regular languages! cstheory.stackexchange.com/questions/27...

Can typed lambda calculi express *all* algorithms below a given complexity?

I know that the complexity of most varieties of typed lambda calculi without the Y combinator primitive is bounded, i.e. only functions of bounded complexity can be expressed, with the bound becoming

cstheory.stackexchange.com

This talk from Jonathan Ragan Kelley highlights the basic pressure around parallelism and hardware, and the coevolution of hardware (particularly GPUs) and parallel programming paradigms, as well as some directions for us to go next. Great talk. youtu.be/vU3ryvZYlkk?...

[PLDI24] The Future of Fast Code: Giving Hardware What It Wants

YouTube video by ACM SIGPLAN

youtu.be

Yaron Minsky@yminsky.bsky.social · 2y ago

A fundamental puzzle of programming is how to lessen the enormous cost of good programming abstractions. I didn't mean things like functional vs imperative languages. I mean more fundamental things, like the choice between a CPU with an instruction set, vs circuit level hardware design.