Many recursive functions are naturally defined using the append operator ++ on lists, but this operator carries a considerable efficiency cost when used recursively. This lecture shows how induction can be used to eliminate such uses of append, and hence make functions more efficient.
Course playlist: http://tinyurl.com/haskell-notts2
Download
0 formats
No download links available.
AFP 13 - Making Append Vanish: Fast Reverse | NatokHD