Completing Partial Combinatory Algebras with Unique Head-Normal Forms

Authors:
I. Bethke;J. W. Klop;R. de Vrijer
Affiliations:
-;-;-
Venue:
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Year:
1996

Citing 6
Cited 2

Rewrite systems

Handbook of theoretical computer science (vol. B)
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Normed uniformly reflexive structures

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Collapsing Partial Combinatory Algebras

HOA '95 Selected Papers from the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting
Effective Applicative Structures

Effective Applicative Structures
Algebraically generalized recursive function theory

IBM Journal of Research and Development

Extending partial combinatory algebras

Mathematical Structures in Computer Science
Unitary Theories, Unitary Categories

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application, we show that the pca of strongly normalizing CL-terms as well as the pca of natural numbers with partial recursive function application can be extended to total combinatory algebras.