── POPULAR TAGS ──
#python (663)
#typescript (611)
#cli (559)
#hacktoberfest (494)
#cli-tool (491)
#react (482)
#javascript (449)
#rust (419)
#cross-platform (390)
#go (372)
#devops (316)
#ai (306)
#nodejs (299)
#llm (296)
#golang (289)
#android (271)
#open-source (255)
#docker (249)
#machine-learning (221)
#java (217)
#plugin-system (215)
#security (213)
#monorepo (213)
#self-hosted (210)
#linux (207)
#mcp (205)
#awesome-list (197)
#plugin-architecture (196)
#ai-agents (188)
#deep-learning (187)
This repository implements λ-RLM (Lambda Recursive Language Model), a framework for long-context reasoning that replaces free-form recursive code generation with a typed functional runtime grounded in λ-calculus. The system provides deterministic recursive decomposition, typed symbolic control flow, and bounded model calls at leaf subproblems. It features a modular architecture with pluggable LLM clients, sandboxed execution environments, and a benchmarking suite for comparison against standard RLM approaches. The core innovation is executing a pre-verified combinator chain (Φ) instead of open-ended LLM-driven while loops, guaranteeing termination and bounded cost.
RATING:
MAINT: active
DRIFT: low
▸ 4 reusable components found
── end of results ──