We demonstrate how the concept of strategies originating from term rewriting can be introduced in a typed, functional setting. We provide a model of strategies based on a further generalisation of updatable, monadic, generalised fold algebras. We show how strategies can be used as a structuring device for functional programming.
@inproceedings{LV00,
author = "R.~L{\"a}mmel and J.~Visser",
title = "{Type-safe Functional Strategies}",
booktitle = "Draft proceedings of SFP'00, St Andrews",
month = jul,
year = 2000,
}