[Haskell-cafe] List spine traversal

[Martin Huschenbett]

Hi Andrew,

you will find it there but it's written in German.

http://opus.kobv.de/tuberlin/volltexte/2008/1755/

Regards,

Martin.

Andrew Hunter schrieb:
> 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?
> 
> AHH
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe