[Haskell-cafe] List spine traversal

Andrew Hunter andrewhhunter at gmail.com
Wed Jul 1 12:32:43 EDT 2009

2009/7/1 Matthias Görgens <matthias.goergens at googlemail.com>:
>> As a side note, (allowing seq and unsafePerformIO if necessary) is it
>> possible to implement a map that preserves cycles (instead of
>> transparently replacing them with infinite copies?  Not horribly
>> useful, but would be quite cute.
> Baltasar Trancon y Widemann gave a talk on a generalized version of
> this problem at HaL4.  Short answer: The problem is tractable in
> theory, but you need heavy math.

Pretty cool--any paper/slides/transcript/video?


More information about the Haskell-Cafe mailing list