In this talk I'll introduce the concept of a minimal perfect hash and a small implementation in Haskell based on the paper "Fast and scalable minimal perfect hashing for massive key sets"
Brad Neimann - Computing with `eval`: An exploration of Rebol
Many programming languages have an `eval` function which can evaluate arbitrary code. However, very few truly integrate it into the rest of the language. One exception is Rebol: a programming language which uniquely reifies evaluation as its core operation. In this talk I will give an introduction to Rebol, and explain how it harnesses evaluation to unify functions, macros and DSLs.
As usual, doors open at 6pm for the talks to start around 6:45.
We are always on the lookout for new and returning speakers, and want to still fill our speakers' roster for 2024. If you'd like to present something Functional Programming related please get in touch with the organisers or open a PR on http://github.com/fp-syd/meetings.