John Tromp defines a version of the lambda calculus that is encoded in binary: https://tromp.github.io/cl/cl.html
a) Does there exist a concatenative version of this language (or its combinatory equivalent)?
b) Does there exist a concatenative version restricted to the primitive recursive functions (e.g. as per Combinators for the Primitive Recursive Functions)?