Implemented quicksort in Trifle lisp! https://github.com/Wilfred/trifle/commit/4e7aa895e88fbb7f936927c4e8e14f25c9a618fd Inspired by the minimalist Haskell implementation, which is pretty but slow.
miniblog.
Related Posts
I'm changing method definition syntax in my language:
// old
fun (this: Int) inc(): Int { this + 1 }
// new
method inc(this: Int): Int { this + 1 }
The original syntax was inspired by Go, but the new syntax is more grep-friendly and perhaps more readable. Not sure about the verbosity though. Thoughts?
The vast majority of 'external brain' systems seem to based on hyperlinked text. This seems to be true for exocortex, memex or zettelcasten inspired designs.
This is great for reading, but you can't do DB queries to answer questions. What would a 'semantic web' design look like?
Excellent article discussing the bytecode used to fit text adventure games on early PCs with tiny RAM: https://mud.co.uk/richard/htflpism.htm
ZIL was lisp-inspired, heavily optimised string storage (5.5 bytes per character!) and had some fun opcodes that were very specific to text games.