Lambdasort: Quicksort written in Python only using lambdas

A couple of months ago I was playing around with a similar technique, Mogensen-Scott encoding, in typescript. I was mainly interested in it as a way to express sum types without a bunch of if statements (instead a "value" of a type takes functions for each possible case branch and calls the appropriate one).

I ended up writing a little dependent type checker:

https://gist.github.com/dunhamsteve/1be0cbb346d75ee1be8f67d1...

So cool to see the types and operations being built up from lambdas! A nice brain teaser.

You can also program in Python just in list comprehensions: https://maximullaris.com/abusing_python.html

Looks like the Java (balls to the walls DSL) I write when I’m just writing Java to have fun.

It misses the point though that it takes a handful of lines to write Quicksort in a functional programming language as opposed to 50 or so lines in BASIC or FORTRAN 77. Of course most of us these days aren’t old enough to remember writing a Quicksort in languages like that and might not appreciate the difference but you might as well code it in assembly language as in an old language that doesn’t support recursion.

Now that's what I call a one-liner.