2nd Central-European Functional Programming School
CEFP 2007
Cluj-Napoca, June 23-30, 2007
http://cs.ubbcluj.ro/cefp2007/
Second Call for PhD student presentation - Call for participation
PhD students are invited to submit the a
Ryan Ingram wrote:
[EMAIL PROTECTED] is better for this type of question. Follow-up is set
to it.
Here's a test case for the problem I'm having; I'm using runhaskell from
ghc v6.6.
Problem #1) Without -fallow-undecidable-instances, I get the following
error:
Constraint is no smaller
Bas van Dijk wrote:
Regarding the use of labels, did you consider using "circular
programming with recursive do" to define and reference labels like in:
Russell O'Connor, Assembly: Circular Programming with Recursive do
http://haskell.org/sitewiki/images/1/14/TMR-Issue6.pdf
Yes, we considered
Very nice!
Regarding the use of labels, did you consider using "circular
programming with recursive do" to define and reference labels like in:
Russell O'Connor, Assembly: Circular Programming with Recursive do
http://haskell.org/sitewiki/images/1/14/TMR-Issue6.pdf
The advantage of that techniq
Maybe this is not what you want, but you can also put the 'convl'
function in the 'ConvertToInt' class.
class ConvertToInt a where
conv :: a -> Int
convl :: [a] -> [Int]
With this approach you don't need any language extension.
regards,
Bas van Dijk
On 5/11/07, Ryan Ingram <[EMAIL PROTEC
Add: -fallow-overlapping-instances to your OPTIONS pragma and read
about overlapping instances in the GHC User Guide:
http://www.haskell.org/ghc/docs/latest/html/users_guide/type-extensions.html#instance-overlap
regards,
Bas van Dijk
On 5/11/07, Ryan Ingram <[EMAIL PROTECTED]> wrote:
Here's a
Hi everybody,
we're pleased to announce the first release of Harpy.
Harpy is a library for run-time code generation of x86 machine code.
It provides not only a low level interface to code generation
operations, but also a convenient domain specific language for machine
code fragments, a collecti
