Richard Statman. The Word Problem for Smullyan s Lark Combinator is Decidable. Journal of Symbolic Computation, 7(2):103-112, 1989.
@article{Statman89,
title = {The Word Problem for Smullyan s Lark Combinator is Decidable},
author = {Richard Statman},
year = {1989},
researchr = {https://researchr.org/publication/Statman89},
cites = {0},
citedby = {0},
journal = {Journal of Symbolic Computation},
volume = {7},
number = {2},
pages = {103-112},
}