[Haskell-cafe] lecture notes for Finally Tagless - benefit of explicit fix combinator

Hi all, I'm working my way through the lecture notes to the Finally Tagless course, available from: http://okmij.org/ftp/tagless-final/course/index.html As usual at every round of doing so, I think it's my 4th, I discover something new, something that hadn't occurred to me

Re: [Haskell-cafe] lecture notes for Finally Tagless - benefit of explicit fix combinator

Hi Günther The code in the two serialize modules looks very close to Konstantin Laufer's functional variation of the visitor pattern: http://webpages.math.luc.edu/~laufer/papers/mixins03.pdf This open recursion style - is used to get inheritance / extensibility - there is a more recent paper by

Re: [Haskell-cafe] lecture notes for Finally Tagless - benefit of explicit fix combinator

Hi Stephen, I'm glad I asked. This sure sounds more interesting than I had anticipated. Is this an old hat for your off-the-shelf haskeller or something only found in the more seasoned haskellers tool box? I think it's pretty much the first time I encounter it. Günther Am 19.06.10 17:01,

Re: [Haskell-cafe] lecture notes for Finally Tagless - benefit of explicit fix combinator

Hi Günther I haven't seen open recursion used in any libraries I'm familiar with, though as its not a technique I've used myself I'm not really trained to spot it. There's another paper by William Cook (and Daniel Brown) were the use is explicit (at least initially - Sections 2.2 2.3):

Re: [Haskell-cafe] lecture notes for Finally Tagless - benefit of explicit fix combinator

Günther Schmidt wrote: Hi Stephen, I'm glad I asked. This sure sounds more interesting than I had anticipated. Is this an old hat for your off-the-shelf haskeller or something only found in the more seasoned haskellers tool box? I think it's pretty much the first time I encounter it. It