tokens: In Haskell , this kind of ordering dependency tends to be expressed through function composition — e.g . f ( g x ) means that g must run first — and the compiler can check the return type of g against the argument type of f to make sure you have n't composed them the wrong way .
ner_tags: O B-Language O O O O O O O O O O O O O O O O B-Function I-Function I-Function I-Function I-Function O O B-Function O O O O O O B-Application O O O O O O B-Function O O O O O B-Function O O O O O O O O O O O O