Tag Archives: Lisp

Error and Restarts in Common Lisp

Posted on 2012-06-06 by jcs

Robert Smith over at Symbo1ics Ideas has a very nice introduction to restarts in Common Lisp. Restarts are a part of the CL error system (more accurately, part of the CL condition system) and provide a way to recover from … Continue reading →

Posted in Programming | Tagged | Leave a comment

The Social Network of a Word

Posted on 2012-06-03 by jcs

I ran across an interesting interview question the other day: Given a base word and a list of other words, use the Levenshtein distance to find the social network of the base word in the list of other words. More … Continue reading →

Posted in Programming | Tagged | 3 Comments

Using Quickproject

Posted on 2012-05-10 by jcs

Earlier this week I wrote about Using Quicklisp and mentioned another Xach project, Quickproject (the link takes you to Github, but the best way to get it is with Quicklisp). What quickproject does is to initialize a project.asd, package.lisp, project.lisp, … Continue reading →

Posted in Programming | Tagged | Leave a comment

cl-test-grid

Posted on 2012-05-08 by jcs

Vladimir Sedach has a post up that describes the cl-test-grid project. The idea is that Quicklisp users download the cl-test-grid, tell it what CL implementations are available, and run the test. It runs tests against many of the libraries in … Continue reading →

Posted in Programming | Tagged | Leave a comment

Scheme and Common Lisp

Posted on 2012-05-07 by jcs

I’ve been using Scheme and Common Lisp almost exclusively for over 10 years. During that time, I tended to favor Scheme because I liked its clean design and simplicity, the named let, continuations, and the simplicity that being a Lisp-1 … Continue reading →

Posted in Programming | Tagged , | 4 Comments

Playing with Common Lisp’s Compiler Macros

Posted on 2012-05-03 by jcs

Back in April, Robert Smith of Symbo1ics Ideas wrote an excellent post on solving the m-of-n Boolean Circuit problem. The problem is nominally about building a boolean circuit having n inputs that returns TRUE if at least m of the … Continue reading →

Posted in Programming | Tagged | Leave a comment

DOCUMENTATION-TEMPLATE

Posted on 2012-05-01 by jcs

I’m just starting a Lisp project that, among other things, involves fiddling with dates. Working with dates isn’t particularly hard but it’s also not very rewarding. Oddly, Common Lisp doesn’t have any functions to format and manipulate dates. I certainly … Continue reading →

Posted in Programming | Tagged | Leave a comment

Checking The Easy Cases First

Posted on 2012-04-30 by jcs

Over the weekend, I was amusing myself with this problem from the always entertaining Programming Praxis. The problem is to partition the set {1, 2, …, 16} into two equally sized subsets such that The sums of the integers in … Continue reading →

Posted in Programming | Tagged | 1 Comment

TPK In Common Lisp

Posted on 2012-04-28 by jcs

Yesterday I wrote about the Trabb Pardo Knuth algorithm and gave an implementation in Emacs Lisp. Elisp allows an nice implementation but was a bit frustrating because the Elisp interpreter handles overflows internally and never signals an overflow condition. Therefore, … Continue reading →

Posted in Programming | Tagged , , | 2 Comments

Let Over Lambda

Posted on 2012-04-19 by jcs

Last year, I reported that most of the book Let Over Lambda was posted on the Internet. I recommended that anyone interested in Lisp take a look at it. I still make that recommendation but be warned: you will end … Continue reading →

Posted in General | Tagged | Leave a comment