For linguists, the parsing-as-deduction paradigm provides an elegant way to analyse the syntax and semantics of a sentence in natural language. Roughly, it means that words get a type assignment, after which a type-checking algorithm can ensure that a sequence of words is type-correct, or grammatical. If so, the corresponding formal sentence meanings are obtained as by-products. Parade is a web application in which users can declare the types of words in their lexicon along with the rules to combine them, after which sentence derivations are constructed automatically. For the class of type-logical grammars, it uses the grail software by Richard Moot; for minimalist grammars, Willemijn Vermaat’s mgcky.