Partial combinatory algebra and generalized numberings
Logic
2020-04-30 v3 Logic in Computer Science
Abstract
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the numbering to properties of the pca. As in the lambda calculus, extensionality is a key notion here.
Cite
@article{arxiv.1910.07750,
title = {Partial combinatory algebra and generalized numberings},
author = {H. P. Barendregt and S. A. Terwijn},
journal= {arXiv preprint arXiv:1910.07750},
year = {2020}
}