Richard Statman The Word Problem for Smullyan's Lark Combinator is Decidable. 103-112 1989 7 J. Symb. Comput. 2 db/journals/jsc/jsc7.html#Statman89