That's been brought up, but the link to the slides was helpful. In case others want to look at that, I found the following 2-up version more readable:
http://www.cs.nott.ac.uk/~nad/publications/danielsson-ifl2008-talk.pdf It's worth going to his home page and looking at pubs and talks more broadly. This guy has done a bunch of interesting stuff. I'm struck by the related work slide discussion of the A ^ not b example, and the reference to Aasa's work. Can somebody summarize the major difference(s)? shap On Wed, Sep 1, 2010 at 3:41 PM, wren ng thornton <[email protected]> wrote: > On 9/1/10 12:53 PM, Jonathan S. Shapiro wrote: > > This is a great start, and very useful, but is there an implementation of > a > > richer mixfix strategy somewhere that I should look at? > > For full mixfix parsing, look at Agda instead of Haskell. E.g.: > > http://www.cs.nott.ac.uk/~nad/publications/danielsson-norell-mixfix.pdf<http://www.cs.nott.ac.uk/%7Enad/publications/danielsson-norell-mixfix.pdf> > > http://www.cs.nott.ac.uk/~nad/publications/danielsson-aim8-talk.handout.pdf<http://www.cs.nott.ac.uk/%7Enad/publications/danielsson-aim8-talk.handout.pdf> > > -- > Live well, > ~wren > _______________________________________________ > bitc-dev mailing list > [email protected] > http://www.coyotos.org/mailman/listinfo/bitc-dev > >
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
