X
The Y-Combinator for LLMs
@HuggingPapersthreadx
TL;DR. λ-RLM swaps freeform recursive code for typed λ-calculus combinators, letting an 8B model outperform a 405B on long-context tasks with 4.1x lower latency.
Takeaways
- Typed combinators guarantee termination — no runaway recursion, no infinite loops at inference time.
- 8B beating 405B on long-context is the headline; the combinator constraint is doing the heavy lifting, not scale.
- Up to 4.1x latency reduction makes this practically interesting, not just a benchmark win.