The pros and cons of doctests have been discussed elsewhere so I won’t enter that debate here.
I was told it was trivial to roll your own doctest suite in Common Lisp. I have done that and it is easy indeed but I have included the code in incf-cl for those who would like to use it right away.
Continue Reading…
List comprehensions are a programming language construct that closely mimics the way you declare a set in mathematics and sometimes are more succinct and readable than using a composition of mapcar, delete-if or an ad hoc imperative loop.
Having list comprehensions in Lisp was something I was missing from Python and Haskell. So I tried to find something similar and discovered that Continue Reading…
I’ve just released the first version of cl-buchberger, a Common Lisp
implementation of Buchberger’s algorithm for the computation of
Gröbner bases.
There are many improvements waiting in the pipeline but the basic
functionality is there.
You can read more about cl-buchberger here.