This product was not featured by Product Hunt yet. It will not be visible on their landing page and won't be ranked (cannot win product of the day regardless of upvotes).
Product upvotes vs the next 3
Waiting for data. Loading
Product comments vs the next 3
Waiting for data. Loading
Product upvote speed vs the next 3
Waiting for data. Loading
Product upvotes and comments
Waiting for data. Loading
Product vs the next 3
Loading
AttaLambda
A small language built on untyped lambda calculus
AttaLambda is a small language built on pure, untyped lambda calculus, with readable syntax, exact rational numbers, and runtime type checks, along with a simple host module for letting the pure lambdas speak to the outside world.
The idea of AttaLambda is this: a usable Lisp-shaped language where all the meaningful computation is done in untyped lambda calculus. Logic, arithmetic, data structures, control flow, even the types — all untyped lambdas. A small, explicit Racket layer sits at the boundary to handle the outside world, plus some macros for syntactic sugar.
Some additional details:
* Rat, its number type, uses binary digit-list encodings instead of Church numerals, so numbers scale with their number of binary digits rather than their value
* errors are lambda-encoded values, not Racket exceptions, and propagate through the language like ordinary data
* the Racket host only performs irreducibly external operations; even things like HTTP parsing, routing, and response construction stay in the pure lambda world
* recursion uses lambda-calculus recursion: no loops or true self-reference, just the Y-combinator underneath
* automated purity checks catch accidental cheating, like native computation leaking into the pure parts
* syntax like multi-argument lambdas, let, cond, and list is just macro sugar that reduces to unary lambdas and application
A couple code examples: (short of print, every single thing here reduces to unary untyped lambdas)
Factorial:
#lang attalambda
(rec factorial n =
(cond
((eq n 0) 1)
(else (mult n (factorial (sub n 1))))))
(print (factorial 10))
Which prints:
3628800
Or an exact harmonic sum:
#lang attalambda
(print
(reduce add 0
(map (lambda (n)
(unwrap-ok (div 1 n)))
(range 1 8))))
Which prints exactly:
363/140
As far as I know, no programming language combines all these features: Michaelson-style type tags built from untyped lambdas, exact rationals backed by binary digit lists, errors as lambda values, and real-world programs where almost all computation stays inside the lambda core. None of those pieces are individually new, but I don't know of another language combining them this way.
About AttaLambda on Product Hunt
“A small language built on untyped lambda calculus”
AttaLambda was submitted on Product Hunt and earned 2 upvotes and 1 comments, placing #152 on the daily leaderboard. AttaLambda is a small language built on pure, untyped lambda calculus, with readable syntax, exact rational numbers, and runtime type checks, along with a simple host module for letting the pure lambdas speak to the outside world.
On the analytics side, AttaLambda competes within Open Source, Education, Languages and GitHub — topics that collectively have 203.9k followers on Product Hunt. The dashboard above tracks how AttaLambda performed against the three products that launched closest to it on the same day.
Who hunted AttaLambda?
AttaLambda was hunted by Kyle Serrecchia. A “hunter” on Product Hunt is the community member who submits a product to the platform — uploading the images, the link, and tagging the makers behind it. Hunters typically write the first comment explaining why a product is worth attention, and their followers are notified the moment they post. Around 79% of featured launches on Product Hunt are self-hunted by their makers, but a well-known hunter still acts as a signal of quality to the rest of the community. See the full all-time top hunters leaderboard to discover who is shaping the Product Hunt ecosystem.
For a complete overview of AttaLambda including community comment highlights and product details, visit the product overview.
Kyle Serrecchia