MAmaxtilford·Feb 18, 2010
I think tail call elimination is handled in the Apply method for closures - http://github.com/bobappleyard/golisp/blob/master/lisp/lisp.... . Looks like a trampoline to me.
In Writing a Lisp Interpreter in Gobobappleyard
golisp
Go2010–2010
bobappleyard / golisp
golisp
A dialect of Lisp implemented in Go
2Distinct people
2Mentions
0Explicit recommenders
105GitHub stars
What to know before exploring
What it is
A dialect of Lisp implemented in Go
GitHub
Where it is used
No documented product use has been verified yet.
What people are saying
No recommendation phrase was found in the indexed comments.
No classified warning is attached to this page. Read the discussions before treating silence as approval.
Also in these discussions
No other repository is repeatedly linked in the same discussions.
This week on Hacker News
Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.
No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.
Mentions over time
HN mentions by hour2 dated mentions
Observed mentions: 2010-02-18 13:52:25 UTC to 2010-02-18 16:07:05 UTC.
Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.
View mention counts and date ranges
| Period | Start (UTC) | End (exclusive, UTC) | Mentions | Submissions | Comments |
|---|---|---|---|---|---|
| Feb 18, 13:00 | 2010-02-18 13:00:00 UTC | 2010-02-18 14:00:00 UTC | 1 | 0 | 1 |
| Feb 18, 14:00 | 2010-02-18 14:00:00 UTC | 2010-02-18 15:00:00 UTC | 0 | 0 | 0 |
| Feb 18, 15:00 | 2010-02-18 15:00:00 UTC | 2010-02-18 16:00:00 UTC | 0 | 0 | 0 |
| Feb 18, 16:00 | 2010-02-18 16:00:00 UTC | 2010-02-18 17:00:00 UTC | 1 | 0 | 1 |
What Hacker News says
2 sourcesCurious. It implies tail call elimination (the description of exhausting the stack explicitly says it wasn't a tail recursive call), but the description sounds like it's so direct that I can't see how it works.
Looking at evalExpr - http://github.com/bobappleyard/golisp/blob/master/lisp/lisp.... - the only way I can see for this to have tail call elimination is if Go itself does (and I don't think it does, does it? It does have coroutines, which you could use to implement trampolining, but I don't see that here...)
In Writing a Lisp Interpreter in Go