Recommendations
Cites work
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 1189064 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- Church-Rosser strategies in the lambda calculus
- Decidable approximations of term rewriting systems
- Director strings as combinators
- How to decide the lark
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The letter S
- The word problem for Smullyan's lark combinator is decidable
Cited in
(12)- scientific article; zbMATH DE number 1615239 (Why is no real title available?)
- Mockingbird lattices
- Stathis Zachos at 70!
- scientific article; zbMATH DE number 4085616 (Why is no real title available?)
- The kernel strategy and its use for the study of combinatory logic
- scientific article; zbMATH DE number 7215287 (Why is no real title available?)
- Local Termination
- Highlights in infinitary rewriting and lambda calculus
- On repetitive right application of \(B\)-terms
- The combinator M and the Mockingbird lattice
- Disproving termination of non-erasing sole combinatory calculus with tree automata
- How to normalize the Jay
This page was built for publication: The combinator S
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854346)