Approximate Abstractions

Taking notes that help you figure things out

Or, what happened to TinyAPL 0.13?

A new interesting feature lands in TinyAPL: extra arguments!

TinyAPL gets the most interesting feature to date: dictionaries

I made a big mistake.

At Depth is finally added to TinyAPL and ordering is made sane.

TinyAPL gets base conversion and search functions

TinyAPL gets first-class functions and namespaces.

TinyAPL finally gets trains, plus some extra combinators.

TinyAPL finally gets a better interface and a much-needed conjunction.

TinyAPL gets quad names and a big refactoring.

TinyAPL finally gets tests and documentation.

In this post, I add array notation to TinyAPL, as well as reductions, scans, and a few other primitives.

I finally figured out how to parse APL, so now TinyAPL has a parser and an interpreter.

In this post I implement some of the less intuitive primitives for TinyAPL.

In this post, I will add functions and operators to the Haskell representation of TinyAPL.

We all know `3 7 4[1]` is `3` and `3 7 4[2]` is `7`, but what about `3 7 4[1.5]`?

In this series of articles, I will implement a simple APL dialect named TinyAPL in Haskell.

A while back I was casually perusing the articles on Jo̊t Dọt Ti̽mes and fell in love with almost anything that Brandon Wilson writes up.

Recently, Brandon Wilson posted a nice article discussing a nice article discussing a way in which APL's algebraic properties absolutely shine.