On the word problem for combinators

DOI10.1007/10721975_14MaRDI QIDQ2723901zbMATH OpenFDO

Authors Richard Statman

Publication date 8 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10721975_14

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Word problems, etc. in computability and recursion theory (03D40)

Recommendations

• The word problem for Smullyan's lark combinator is decidable
• How to decide the lark
• On combinatory complete sets of proper combinators
• The combinator S
• scientific article; zbMATH DE number 1216018

Cited in

(5)

• The word problem for Smullyan's lark combinator is decidable
• The combinator S
• On the existence of n but not n + 1 easy combinators
• The combinator M and the Mockingbird lattice
• Mockingbird lattices

This page was built for publication: On the word problem for combinators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723901)