HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
michelp
hillisp
Cuda2024–2025
michelp / hillisp

hillisp

CUDA parallel lisp toy inspired by Connection Machines

2Distinct people
2Mentions
0Explicit recommenders
23GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

CUDA parallel lisp toy inspired by Connection Machines

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, 12:54:37 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 month2 dated mentions

Observed mentions: 2024-06-22 02:22:58 UTC to 2025-05-12 18:14:34 UTC.

012024-06-01 00:00:00 UTC to 2024-07-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJun 20242024-07-01 00:00:00 UTC to 2024-08-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-08-01 00:00:00 UTC to 2024-09-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-09-01 00:00:00 UTC to 2024-10-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-10-01 00:00:00 UTC to 2024-11-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-11-01 00:00:00 UTC to 2024-12-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsNov 20242024-12-01 00:00:00 UTC to 2025-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-01-01 00:00:00 UTC to 2025-02-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-02-01 00:00:00 UTC to 2025-03-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-03-01 00:00:00 UTC to 2025-04-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-04-01 00:00:00 UTC to 2025-05-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2025-05-01 00:00:00 UTC to 2025-06-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsMay 2025

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Jun 20242024-06-01 00:00:00 UTC2024-07-01 00:00:00 UTC101
Jul 20242024-07-01 00:00:00 UTC2024-08-01 00:00:00 UTC000
Aug 20242024-08-01 00:00:00 UTC2024-09-01 00:00:00 UTC000
Sep 20242024-09-01 00:00:00 UTC2024-10-01 00:00:00 UTC000
Oct 20242024-10-01 00:00:00 UTC2024-11-01 00:00:00 UTC000
Nov 20242024-11-01 00:00:00 UTC2024-12-01 00:00:00 UTC000
Dec 20242024-12-01 00:00:00 UTC2025-01-01 00:00:00 UTC000
Jan 20252025-01-01 00:00:00 UTC2025-02-01 00:00:00 UTC000
Feb 20252025-02-01 00:00:00 UTC2025-03-01 00:00:00 UTC000
Mar 20252025-03-01 00:00:00 UTC2025-04-01 00:00:00 UTC000
Apr 20252025-04-01 00:00:00 UTC2025-05-01 00:00:00 UTC000
May 20252025-05-01 00:00:00 UTC2025-06-01 00:00:00 UTC101

What Hacker News says

2 sources
I've blabbered on about this too much, but I decided to see if there's been any progress on multithreading libraries for GPU and found some for lisp: https://repository.lboro.ac.uk/articles/conference_contribut... (has pdf download) https://github.com/michelp/hillisp Unfortunately neither of these seem to do any heavy lifting, they just transpile lisp statements into GPU kernels like WebMonkey does. But it's a start. To get real work done in concurrency with SISD/MIMD to SIMD transpiling, we'd need a small team with a modest budget to work for perhaps 2 years on figuring out how to statically analyze unmodified lisp programs and break them down into independent fragments that can execute in parallel without side effects. Then use libraries like these to run those fragments as kernels and aggregate the results. Conceptually this would work
Read the rest
like a spreadsheet, watching for changes in inputs and calculating the result across as many cores as possible unsupervised. Once that runtime reached MVP, work could begin on transpiling common languages like C and Javascript to lisp. This is also an open problem, but straightforward to solve. The difficulty appears to be that transpiling imperative code to lisp has only been done as a hack with impure or monadic logic that defeats the whole purpose of using functional programming. It also tends to lose human readability by using too much glue code through bindings, rather than naming variables common to both runtimes like how we name registers in C++ that can be used within asm() blocks: https://gcc.gnu.org/onlinedocs/gcc/Local-Register-Variables....
In WebMonkeys: parallel GPU programming in JavaScript (2016)
In Danny Hillis' lecture on the architecture of the CM-5 [1], he talks about some of the historical motivation behind the CM-2 described in his thesis paper turned into a book "The Connection Machine" [2] which goes into some detail on the alpha, beta, and dot operators and the xapping data type (the book calls it a "xector") described in detail in this paper. Years ago I attempted to take a stab at implementing this language on CUDA I called hillisp [3] but at the time Dynamic Parallelism didn't exist yet and my available hardware was pretty weak, but it was fun to learn more about CUDA which was relatively early technology at the time. [1] https://www.youtube.com/watch?v=Ua-swPZTeX4 [2] https://www.amazon.com/Connection-Machine-Press-Artificial-I... [3] https://github.com/michelp/hillisp
In Connection Machine Lisp (1986)

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.