Pure lambda‑based language with exact rationals and error values
问题概述
Developers want a usable language that keeps all computation inside untyped lambda calculus, supports exact rational arithmetic via binary digit‑list encodings, treats errors as first‑class lambda values, and provides real‑world I/O through a Racket host, but no existing language combines these features.
痛点标签
- Need for a language that keeps all computation within untyped lambda calculus
- Desire for exact rational arithmetic without floating‑point errors
- Interest in error handling represented as lambda values
- Wish for automated purity checks to prevent accidental native code leakage
待验证问题
- 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?
证据
原话 · @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.
原话 · @Anonymous
interesting
免责声明：本卡片由 AI 从社区讨论中提炼，属于「痛点证据」，是需求分析与验证的起点，不等同于「已验证的市场需求」。AI 存在分析局限，关键决策前请打开上方原始讨论人工复核。