Binary Lambda Calculus and Combinatory Logic.” Sep 14, 2004. http://homepages. cwi.nl/ ∼ tromp/cl/LC.pdf [64] Tadaki, K. “Upper bound by Kolmogorov complexity for the probability (2003)
| Venue: | in computable POVM measurement.” Proceedings of the 5th Conference on Real Numbers and Computers, RNC5 |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Tromp03binarylambda,
author = {John Tromp},
title = {Binary Lambda Calculus and Combinatory Logic.” Sep 14, 2004. http://homepages. cwi.nl/ ∼ tromp/cl/LC.pdf [64] Tadaki, K. “Upper bound by Kolmogorov complexity for the probability},
booktitle = {in computable POVM measurement.” Proceedings of the 5th Conference on Real Numbers and Computers, RNC5},
year = {2003},
pages = {214}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-interpreters for these binary languages. Along the way we also present new results on list representations, bracket abstraction, and fixpoint combinators. In the second part we review Algorithmic Information Theory, for which these interpreters provide a convenient vehicle. We demonstrate this with several concrete upper bounds on program-size complexity, including an elegant self-delimiting code for binary strings. 1
