The TI92+ just became better

After having uLISP in a sort of working state (despite the quite enormous memory leakage problem), I started to port uLISP to the TI92+ calculater (having it become tiLISP in the process). The code is in the TI92+ branch of the uLISP SVN (remember, username and password is: guest).
Below is a screenshot just showing it running (I know, not that spectacular ;-) )
tiLISP screenshot

Be aware that this code is pretty much unstable (I had to reset my TI about 10 times today), but it’s a nice prove of concept anyway.

There shall be recursion

Just a quick note that today I added one my most favored features of LISP to uLISP: the


keyword. It allows you to call a the lambda you’re in at the point recur is written, thereby enabling the use of recursion without having to give the lambda a name.
I also implemented the


function which creates sequences of numbers and uploaded a rudimentary reference documentation.

This thing starts to become neat :-)


As the rising amount of posts per unit of time shows: I got a loot of spare time to waste these days. This is mostly because we’re writting exams these days and constant learning simply doesn’t work out. So I had to get another project.
A short while ago I bought myself a TI92+ for the math exams. Just after it arrived and I had it connected to my computer I thought: “wouldn’t it be cool to have LISP on that thing”. So I started writing:


Roughly two days later there is the first kinda releasable version of this neat little interpreter. It’s pretty much complete when it comes to features, but there are still some more things to do:

  1. Get rid of all the memory leaks
  2. Add the

    keywork to allow anonymous recursion

  3. Port it to the TI92+

So, in case you want to have a look at it: here you go … the code is published under the terms of LGPL, so feel free to do with it whatever you like. But if it becomes SkyNet don’t blame me :-)

Fork me on GitHub