Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Functional programming, design and analysis of algorithms / 3 / a / Solution

A word can be a string, and the input text a list of those strings. Use names that avoid clashing with the Standard Prelude machine-word type Word:

type TextWord = String
type Text = [TextWord]

Thus $\boxed{\mathrm{TextWord}=\mathrm{String},\mathrm{Text}=[\mathrm{TextWord}]}$. These are type synonyms, so ordinary string and list operations remain available without wrapping or unwrapping constructors. They describe input that has already been tokenized; punctuation and word boundaries do not need a separate treatment here.