{"id":"palomar/PALOMAR-2026-11-02-000001","url":"https://github.com/Arthur742Ramos/Math-Formalization/tree/9751493be3434d199e334f6283b2bbb2d1855f7f/lambda-refinement","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-02-000001-v1.json","repo":"https://github.com/Arthur742Ramos/Math-Formalization","tags":["math.LO","cs.LO"],"score":0,"title":"Numerical refinement and equivalence of closed lambda programs","trust":"high","domain":"math.LO","source":"palomar","authors":["Arthur Freitas Ramos","David Barros Hulak","Ruy José Guerra Barretto de Queiroz"],"reviews":0,"subject":"math.LO","summary":"Classifies full-beta numerical graph inclusion and extensional equivalence for closed untyped lambda programs, including fixed-zero restricted hardness and computable many-one completeness for universal-existential normal forms.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-02","reactions":{},"formalized":true,"formalizes":[{"title":"Computability theory","identifier":"https://math.berkeley.edu/~marks/notes/computability_notes_v1.pdf","relationship":"adapts"}]}