Delphi.science

A value-preserving unary recursive-code and lambda isomorphism

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

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

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

Constructs computable inverse maps between recursive codes and closed untyped lambda terms that preserve every unary partial numerical function.

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-000011
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-03-000011/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-000011/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'