at 4:07 PM, Jason Dagit wrote:
> On Wed, Feb 1, 2012 at 12:42 PM, Yin Wang wrote:
>> I have written a C++ parser in Scheme, with a Parsec-style parser
>> combinator library. It can parse a large portion of C++ and I use it
>> to do structural comparison between ASTs. I made so
I have written a C++ parser in Scheme, with a Parsec-style parser
combinator library. It can parse a large portion of C++ and I use it
to do structural comparison between ASTs. I made some macros so that
the parser combinators look like the grammar itself.
It's code is at:
http://github.com/yinwa
>>> The typical example would be
>>>
>>> instance Eq a => Eq [a] where
>>> [] == [] = True
>>> (a : as) == (b : bs) = a == b && as == bs
>>> _ == _ = False
>>
>> It can handle this case, although it doesn't handle it as a parametric
>> instance. I suspect that we don't need the concept of "param
On Sat, Jan 14, 2012 at 2:38 PM, Dominique Devriese
wrote:
>> I may or may not have thought about it. Maybe you can give an example
>> of parametric instances where there could be problems, so that I can
>> figure out whether my system works on the example or not.
>
> The typical example would be
> Also, you don't seem to have thought about the question of parametric
> instances: do you allow them or not, if you do, what computational
> power do they get etc.?
I may or may not have thought about it. Maybe you can give an example
of parametric instances where there could be problems, so tha
Hi all,
I have an idea about type classes that I have been experimenting. It
appears to be a generalization to Haskell’s type classes and seems to
be doable. It seems to related the three ideas: type classes, implicit
parameters, and (typed) dynamic scoping. But I don't know whether it
is good or
_closure'
World.o: In function `r2JT_info':
(.text+0xb8): undefined reference to
`gtkzm0zi9zi12zi1_GraphicsziUIziGtkziTypes_zdf550_closure'
...
collect2: ld returned 1 exit status
The first command worked well with the ghc 6.6.1 came with ubuntu. I
tried to uninstall my
