by Chris Pressey, Cat's Eye Technologies

This is an implementation of the programming language Aubergine. It is an interpreter, written in Haskell. It is in the Public Domain. Its source file can be found here:


To run this implementation, you need:


I implemented Aubergine because the reference interpreter is buggy and I wanted a version that actually implemented the unbounded integers that the language description suggests. After implementing it, I was familiar enough with it to write a sketch of a proof of its Turing-completeness.