Abstract
The combinator S has the reduction rule S x y z → x z (y z). We investigate properties of ground terms built from S alone. We show that it is decidable whether such an S-term has a normal form. The decision procedure makes use of rational tree languages. We also exemplify and summarize other properties of S-terms and hint at open questions.
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 Lambda Calculus, Its Syntax and Sematics. Elsevier Science Publishers, 1984.
Jan Bergstra and Jan Willem Klop. Church-Rosser strategies in the Lambda calculus. Theoretical Computer Science, 9:27–38, 1979.
F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
Jan Willem Klop. Reduction Cycles in Combinatory Logic, pages 193–214. In Seldin and Hindley [SH80], 1980.
Richard Kennaway and Ronan Sleep. Director strings as combinators. ACM Transactions on Programming Languages and Systems, 10(4):602–626, October 1988.
J. P. Seldin and J. R. Hindley, editors. To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism. Academic Press, 1980.
Raymond Smullyan. To Mock a Mockingbird: and other logic puzzles including an amazing adventure in combinatory logic. Knopf, New York, 1985.
Richard Statmann. The word problem for Smullyan's lark combinator is decidable. J. Symbolic Comput., 7:103–112, 1989.
J. Waldmann. Nimm Zwei. Internal Report IR-432, Vrije Universiteit Amsterdam, Research Group Theoretical Computer Science, September 1997.
Efstathios Zachos. Kombinatorische Logik und S-Terme. Berichte des Instituts für Informatik 26, Eidgenössische Technische Hochschule Zürich, 1978.
H. Zantema and A. Geser. Non-looping rewriting. Technical Report UU-CS-1996-03, Utrecht University, January 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Waldmann, J. (1998). Normalization of S-terms is decidable. In: Nipkow, T. (eds) Rewriting Techniques and Applications. RTA 1998. Lecture Notes in Computer Science, vol 1379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052367
Download citation
DOI: https://doi.org/10.1007/BFb0052367
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64301-2
Online ISBN: 978-3-540-69721-3
eBook Packages: Springer Book Archive