Collapsing Partial Combinatory Algebras (1996)
| Venue: | Higher-Order Algebra, Logic, and Term Rewriting |
| Citations: | 12 - 2 self |
BibTeX
@INPROCEEDINGS{Bethke96collapsingpartial,
author = {Inge Bethke and Jan Willem Klop},
title = {Collapsing Partial Combinatory Algebras},
booktitle = {Higher-Order Algebra, Logic, and Term Rewriting},
year = {1996},
pages = {57--73},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Partial combinatory algebras occur regularly in the literature as a framework for an abstract formulation of computation theory or recursion theory. In this paper we develop some general theory concerning homomorphic images (or collapses) of pca's, obtained by identification of elements in a pca. We establish several facts concerning final collapses (maximal identification of elements). `En passant' we find another example of a pca that cannot be extended to a total one. 1
