(I've previously sent this mail to haskell-cafe, but I guess this list is more
appropriate)
Hi all,
for my Master's thesis, I'm looking into functional hardware
descriptions, and in particular to translate haskell code into VHDL that
can be programmed into an FPGA.
For this, I'm using the GHC AP
Hi Brian,
thanks for the swift response!
> Making all GHC's datatypes Showable would probably be a nightmare. Not
I guessed as much. Thanks for confirming my suspicions :-)
> pretty printed output and using that. When you need to pull some more
> details out of a datatype just sticking random pp
Hi all,
I've been doing some work with the GHC API, and I'm kind of confused as to how
Uniques are supposed to work. I've found that each Name has a Unique that is
its primary identification (at least for internal names). That means that two
identifiers are different iff their Uniques are differen
Hi Simon,
> The thing to read is Section 4 of:
>
> http://research.microsoft.com/en-us/um/people/simonpj/papers/inlining/index.htm
> That tells you all about the InScopeSet etc.
From a first glance, it looks like you mean section 5 :-) I haven't read the
paper fully yet, it's in the printer
Hi Simon,
> >Something strange that doesn't deserve its own category, but isn't
> >"unknown"
>
> such as?
I guess the distinction is between "I don't know in which of these categories
the bug falls" and "I know that it does not fall in any of the above
categories". e.g., "Unknown" vs "Other" ?
Hi All,
I was wondering if there are any formal semantics defined for GHC's core
language? I'm working with some core to core rewriting passes for which I'd
like to verify the soundness, but that would require some formal definition of
the Core semantics of sorts...
Gr.
Matthijs
signature.asc
Hi Simon,
> The paper on System FC [1] has an operational semantics. Would that do?
It seems like a start. It doesn't matter much, since I don't have any time
left to actually work on this, but I wanted to verify my claim in my report
that no directly usable semantics are available :-)
Gr.
Ma
