Coordinated language expressions can be notoriously ambiguous, by having multiple meanings due to occurrences of verb-phase (VP) ellipses, in combinations with multiple reflexive and non-reflexive pronouns. I use the algorithmic semantics of the type theory of recursion (TTR) to provide computationally efficient handling of the syntax-semantics phenomena. I use the TTR facilities for algorithmic semantics, which incorporate the semantic distinctions between reflexives and non-reflexives, semantic underspecification of non-reflexives and elliptic VP, and suitable instantiations to specific interpretations.