Added directional, combinatorial term representation

Sentences may be represented in DTm, which has left and right function
application and composition; DTm does not require any notion of contexts, since
there is no lambda abstraction. These may be translated to lambda calculus
terms, which may then be normalized to get a tree where all logical relations
are local.