Pure Lambda‑Based Language with Exact Rationals and Error Values
Problem
Developers seek a usable language that confines all computation to untyped lambda calculus, supports exact rational arithmetic via binary digit‑list encodings, treats errors as first‑class lambda values, and integrates real‑world I/O through a Racket host, yet no existing language offers all these capabilities.
Pain points
- Need for a language that keeps all computation within untyped lambda calculus
- Desire for exact rational arithmetic without floating‑point errors
- Interest in representing errors as lambda values
- Wish for automated purity checks to prevent accidental native code leakage
Questions to verify
- Would you adopt a language that executes all user‑level code purely in untyped lambda calculus?
- Are exact rational numbers (backed by binary digit lists) a critical requirement for your work?
- Do you need automated purity checking to ensure no native computation leaks into the core?
Evidence
quote · @kserrec
I don't know of another language combining 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.
quote · @Anonymous
interesting
Disclaimer: this card is distilled by AI from community discussions as “pain point evidence”. It is a starting point for need analysis and validation, not a “validated market need”. AI has analytical limits; please open the original discussion above to manually verify before key decisions.