Delphi.science

Computable bijection between recursive computations and closed lambda terms

Source: github.com/Arthur742Ramos/Math-Formalization/tree/adf433d5f…

Arthur Freitas Ramos, David Barros Hulak, Ruy José Guerra Barretto de Queiroz

Palomar Registrypalomar/PALOMAR-2026-11-03-000010Nov 3, 2026math.LOscore 0

Constructs computable inverse maps between recursive-code/input pairs and all closed lambda terms, preserving defined evaluation as Church-zero observation.

RepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-03-000010
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-03-000010/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-03-000010/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'