Recto is a 2D programming language that uses nested rectangles as its core syntax, encoding structure and recursion directly in space instead of a linear stream of text. Recto explores new ways to write, parse, and reason about code—and even natural language—spatially.
The C++ standard library (also know as the STL) is, without a doubt, an astounding piece of work. Its scope, performance and incredible back...
When explaining Go to new programmers, I've found that it often helps to explain what Go values look like in memory, to build the right intuition about which operations are expensive and which are not. This post is about basic types, structs, arrays, and slices.
This page is a mini-site for my Snobol excursion with links to separate pages for my:
(Previous post in the series was on Jai and can be found here)
Bridge the gap between structured logging and errors in Go
(Image of "Four-Armed Chuck" programming a PDP-11 is from my giant write-up of Forth .)
The materials for the course on compilers: built incrementally and fully in tagless-final style
A short post about a neat little Zig idiom. Consider your average {sum type, variant, tagged union, enum, alt}:
wingolog: article: baffled by generational garbage collection
This post is a case study of writing a Rust application using only minimal, artificially constrained API (eg, no dynamic memory allocation). It assumes a fair bit of familiarity with the language.
This post will describe how I design my programs in Go. I needed this for work, and while I searched for a link, nothing quite fits my coding practices out there. The word “Layered” can pull up some fairly close descriptions, but I want to lay out what I do.
Ben Lindbergh at the Ringer asks “When did jerk stop meaning ‘stupid’?” He starts with the Steve Martin movie The Jerk , saying of its protagonist:
When defining a type in Inko , it's allocated on the heap by default. For example (using the syntax for the upcoming 0.18.0 release):
Karl Seguin's Blog - A mix of coding and creative writing
Exploring Lisp's fine-grained type hierarchy.
The first thing I do every time I need to learn a new codebase is to start drawing the UML diagram of its classes, and usually give up soon after I started. The process of doing it manually is certainly useful, but now with reflections I figure it would be fun to try to generate it instead.
9 months ago, I took a gander at PG’s guide to Bel . If you haven’t read it, here’s the premise:
Karl Seguin's Blog - A mix of coding and creative writing
This story is about concurrent data structures in the context of Ruby. The goal here is to demonstrate how true parallelism can be achieved with global mutable state (which at the time of writing, is not supported by built-in Ruby primitives).
One story every computing enthusiast should hear is the lesson ofhow loops and tail-recursion are equivalent. We like recursivefunctions because they’re amen...
Death (XIII) Symbolizes significant change, transformation, and endings, rather than literal physical death. Have you ever seen a Number grazing in the f
An "impossible" Ruby bug: Hashes becoming Strings at runtime. 2,700 identical crashes. No corruption. Just objects changing what they are. Deep dive.
A discussion of how Sorbet's type syntax came to be, the problems it solves, and how it could improve.
A computer scientist working in open source towards a more hopeful future.
At one level, this question is not very fair, because an answer to it as stated would be that one simply does not use doubly linked lists. They have been popular in introductory computer science lectures because they are a neat way to explain pointers in a data structure that's easy to draw on a whiteboard, but they…
The gophers nested too greedily and too deep.
