Tags
Language
Tags
April 2024
Su Mo Tu We Th Fr Sa
31 1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 1 2 3 4

Reflective Programs in Tree Calculus

Posted By: yoyoloit
Reflective Programs in Tree Calculus

Reflective Programs in Tree Calculus
by Barry Jay

English | 2021 | ASIN: B095BPM2MF | 176 pages | PDF | 5.35 MB

Tree calculus is seeded by a single operator, whose self-application gives rise to pow- erful reflective programs including a size program that can compute its own size, an equality program that can decide its own equality, and a self-evaluator that can evaluate itself. This is achieved without any of the usual outside machinery, such as the Gödel numbering of Turing machines, the quotation of lambda-abstractions or serialisation of programs. The resulting theory of computation is both simple and powerful: simple because it is based on three equations only; powerful because one program can query the internal structure of another, using a mix of extensional and intensional techniques.