Recursion Schemes in OCaml
August 23, 2021Recursion schemes are functions that automate the traversal of nested data structures. With them, recursive code can be written in a way that is much simpler and easier to understand.
Written by Andre Popovitch who works on Tezos protocol development and likes functional programming. You should follow them on Twitter
Efficiently Implementing the Lambda Calculus With Zinc
July 28, 2021Implementing the lambda calculus with naive term-substitution is inefficient - instead, modern compilers for functional languages convert the code to a form that can be more efficiently executed.