DEAL-a language for depicting algorithms
Martin Erwig · 2002
We describe a visual language for the specification of algorithms that mimics illustrations of data structures and algorithms widely used. By combining illustration "folklore" with elements of modern functional languages we achieve highly compact specifications, e.g. Quicksort can be defined by a single rule. The formal definition of the language is given by mapping geometric relationships directly to semantic concepts.>