Abstract Heresies

              Unorthodox opinions on computer science and programming.

Showing posts with label fold. Show all posts
Showing posts with label fold. Show all posts
Tuesday, August 25, 2026

The Functional Refactoring Pass

›
This is an anecdote, not a data point, yet. I'm a firm believer in functional programming and I consider myself a `mostly functional...
Monday, February 16, 2026

binary-compose-left and binary-compose-right

›
If you have a unary function F, you can compose it with function G, H = F ∘ G, which means H(x) = F(G(x)). Instead of running x through ...
1 comment:
Sunday, February 1, 2026

Some Libraries

›
Zach Beane has released the latest Quicklisp beta (January 2026), and I am pleased to have contributed to this release. Here are the high...
Wednesday, February 19, 2025

FOLD and NAMED-LET implementations

›
An anonymous reader requested an implementation of FOLD-LEFT , FOLD-RIGHT and NAMED-LET. Here they are: https://github.com/jrm-code-proj...
Saturday, January 4, 2025

fold-… and monoids

›
Suppose you satisfy these axioms: you have a binary function • and a set that • is closed over ( i.e. for all x , y in the set, x • y ...
›
Home
View web version
Powered by Blogger.