In the absence of anaphora and composite binary predicates, conversion algorithms exist between FunQL and λ-DCS.
the non-terminal is popped as well, after which a composite term representing the entire subtree, e.g., border(texas), is pushed back to the stack.