The combinator S

DOI10.1006/inco.2000.2874zbMath1005.03017OpenAlexW2033416236MaRDI QIDQ1854346

Johannes Waldmann

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.2874

zbMATH Keywords

normal formterm rewriting systemrational tree language

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (6)

Stathis Zachos at 70! ⋮ The combinator M and the Mockingbird lattice ⋮ Highlights in infinitary rewriting and lambda calculus ⋮ Mockingbird lattices ⋮ Unnamed Item ⋮ Local Termination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The word problem for Smullyan's lark combinator is decidable
• The letter S
• How to decide the lark
• Church-Rosser strategies in the lambda calculus
• Director strings as combinators
• Decidable approximations of term rewriting systems

This page was built for publication: The combinator S