Abstract
We adopt for the most part the terminology and notation of [1]. A combinator is a term with no free variables. A set of combinators which is both recursively enumerable and closed under ß conversion is said to be Visseral ([5]). Given combinators F and G, the variety defined by Fx = Gx is the set of all combinators M such that FM = GM. Such a variety is said to be normal if both F and G are normal. In this note we shall be principally concerned with normal varieties.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H.P Barendregt, The Lamba Calculus, North Holland, 1984.
C. Böhlm and M. Dezani-Ciancaglini, Combinatorial problems, combinator equations and normal forms, Automated Languages and Programming, J. Loeckx, ed., Lecture Notes in Computer Science 14, Springer-Verlag, 1974, pp. 185–199.
J.W. Klop, Combinatory Reduction Systems, Math. Centrum Amsterdam, 1980.
R. Statman, On sets of solutuons to combinator equations, T.C.S. 66 (1989), 99–104.
A. Visser, Numerations, λ-calculus and arithmetic, Essays on Combinatory Logic, Lamba Calculus and Formalism, J.P Seldin and J.R Hindley, eds., Academic Press, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag New York, Inc
About this paper
Cite this paper
Statman, R. (1992). Normal Varieties of Combinators. In: Moschovakis, Y.N. (eds) Logic from Computer Science. Mathematical Sciences Research Institute Publications, vol 21. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2822-6_21
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2822-6_21
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7685-2
Online ISBN: 978-1-4612-2822-6
eBook Packages: Springer Book Archive