Reflective Programs in Tree Calculus
- Edition: 1
- Language: English
- Publication Date: 2021-05-18
- ISBN-10: B095BPM2MF
- Sales Rank: #0 (See Top 100 Books)
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.
Donate to keep this site alive
1. Disable the AdBlock plugin. Otherwise, you may not get any links.
2. Solve the CAPTCHA.
3. Click download link.
4. Lead to download server to download.