License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.06051.4
URN: urn:nbn:de:0030-drops-6289
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/628/
Go to the corresponding Portal

Tromp, John

Binary Lambda Calculus and Combinatory Logic

pdf-format:
06051.TrompJohn.Paper.628.pdf (0.2 MB)

Abstract

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.
We demonstrate their application to Algorithmic Information Theory
with several concrete upper bounds on program-size complexity,
including an elegant self-delimiting code for binary strings.

BibTeX - Entry

@InProceedings{tromp:DagSemProc.06051.4,
  author =	{Tromp, John},
  title =	{{Binary Lambda Calculus and Combinatory Logic}},
  booktitle =	{Kolmogorov Complexity and Applications},
  pages =	{1--20},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6051},
  editor =	{Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/628},
  URN =		{urn:nbn:de:0030-drops-6289},
  doi =		{10.4230/DagSemProc.06051.4},
  annote =	{Keywords: Concrete, program size complexity, ambda calculus, combinatory logic, encoding, self-delimiting, binary strings}
}

Keywords: Concrete, program size complexity, ambda calculus, combinatory logic, encoding, self-delimiting, binary strings
Collection: 06051 - Kolmogorov Complexity and Applications
Issue Date: 2006
Date of publication: 31.07.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI