AttaLambda - A small language built on untyped lambda calculus
Show HN: AttaLambda: a language where types and data are made of untyped lambdas
AttaLambda is a minimalist programming language where all types and data are constructed from pure, untyped lambda calculus. It provides readable syntax, exact rational numbers, and runtime type checks, making lambda calculus accessible for practical coding. With a simple example like defining a square function and mapping it over a list, you can quickly see results. Ideal for learning functional programming concepts or exploring the foundations of computation. Try it at attalambda.com to write elegant, lambda-based code.
AttaLambda is a small language built on pure, untyped lambda calculus. Its ordinary computation is built from unary functions and application.
- RedRackham
Well done!
I wrote a wee lambda calculus interpreter to test out the book forms. I did cheat a wee bit and added:
def <name> = <exp> ==> substitution of <exp> for <name> before evaluation
if <exp1> then <exp2> else <exp3> fi ==> ((<exp1> <exp2>) <exp3>)
to make things more readable.
I think a few folk have got as far as implementing lists and recursion, but you're the first dynamic type implementer I've come across.
I think lambda calculus is fun. My book is about functional programming, and so isn't much use for theory, for which I recommend Barendregdt's "The Lambda Calculus. Its Syntax and Semantics".
Best wishes
Greg Michaelson
- rsrsrs86
This is uninteresting, because 1) you could just share your prompt: “implement Greg Michaelsons book in racket” 2) you added nothing to it 3) you skipped about everything that is interesting to study when learning the lambda calculus
- ethan-winters
interesting