blog

Monads for effects are familiar to the Haskell programmer; they were introduced by Wadler's "Monads for functional programming" and are the accepted way to work with side effects in a lazy language.

As I wrote elsewhere, garbage collection—manual memory management correspond to intuitionistic logic—linear logic.

Suppose we wish to compute successive differences.

I adapted the xor example here from Python; they used NumPy.

Dimension is a functor.

I ported a Python tutorial to J.

When writing a compiler, one typically annotates the syntax tree in various phases.

One of the virtues of J is its conciseness; I think this is underrated in exploratory programming.

Recently, a preprint by Hall et al. was published: a comparison of keto and plant-based diets.

I have seen "strict data structures, lazy functions" bandied about among Haskellers.

Compared with Rust, ATS provides better type safety at the boundaries; foreign functions and data structures can be used in a first-class way without sacrificing type safety.

ATS is known for its sophisticated type system, but it also has a template system that has been the focus of recent work.

Suppose we want to count the number of lines in a file.

The canonical way to get a perceptual hash is using the pHash library.

Here I'd like to show an example of runtime complexity, arising from a practical problem.

I read a recent Functional Pearl by Hinze and this inspired me to write up an example of projective programming and its motivation in logic/model theory.

This post was inspired by a curious question on Twitter: is curry or uncurry more common in Haskell code?

As a follow-up to my post on computing the Levenshtein distance in ATS, I figured I'd write up some of the actual benchmark results, as well as some of the subtleties involved in benchmarking various ecosystems.

Initially, I had written hackage-fetch to see if there was any use of coelgot anywhere on Hackage.

Inspired by a tweet, I decided to write an Old English name generator in Madlang.

You may have seen my post on co-(Elgot algebras), in which I mentioned I had been using some exotic recursion schemes for my gmpint package.

Suppose we wish to convert a number to its base \( b \) representation.

I've talked about polyglot ATS/Haskell builds previously, but I wanted to show off the results of all this work without so much didactic focus.

I am happy to announce that atspkg now has experimental support for cross-compiling!

Some examples and non-examples of monads.

I've been doing some more work with atspkg and polyglot builds.

Here I present two ways to write Euler's totient function in ATS.

I started work on my ATS math library recently; though I'm not sure it will be a wholehearted success, there were parts that deserve attention.

Three examples of recursion schemes drawn from mathematics, showing the use of linked lists as control structures.

Like my last post on ATS , this is far from a full-fledged tutorial, but I think it will nonetheless be instructive to students of ATS.

I wanted to share a little example I came across while working on one of my Idris libraries.

I've been using Idris for a while, and today I stumbled into an example of a dynamorphism that worked so beautifully I had to share.

As you may have read in one of my past posts or elsewhere, performance across languages can be complicated, and it's not always as obvious as you'd expect.

The modern theory of continued fractions comes from Christiaan Huygens, a Dutch physicist who invented the pendulum clock.