(posted on 9/23/08 on haskell-beginners, no response was received)
I'm unable to compile the GLR examples (in the 'glr' directory) provided with Happy, version 1.16. I'm using ghc version 6.6.1. I've looked at the version of Happy currently in darcs and the part of the examples that seems to be
Thanks. I don't imagine that will help as the flag in the Happy source is (to my knowledge) outdated, indicating that it hasn't been touched in a while.
On Mon Sep 29 19:05 , "Krzysztof Skrzętnicki" <[EMAIL PROTECTED]> sent:
with Happy, version 1.16. I'm using ghc version 6.
Hallo!
I have this code:
q1 :: EName - [ApprenticeInfo]
q1 c = [apprenticeInfo n | n - allApprentices, member ((sq4
c) (firstOf5(n))) == True]
sq4 :: ESurname - [IDB]
sq4 c = (sq3 (sq1 (c)))
firstOf5 :: (a,b,c,d,e) - a
firstOf5 (n,_,_,_,_) = n
member ::
Hallo!
I'd like to build a database model with winHugs that allows
a recursive relation. For example a single instance of
entity components is related with at least another row of
the entity components (1 to many relationship). How can I
do that?
Thank you for your attention!
Hallo!
Let's suppose I have a list [a,b,c,d,c,d]. I'd like to write
a function that returns a new list without duplicates (in
the example [a,b,c,d]). How can I do that? What is the most
general way? I'd like to use the same function for a list of
Int or String or some other user defined data
I typically start with a list of the types I want, then the minimal list
of type signatures. Ideally, it should be possible to write an
arbitrarily large set of programs in the given application domain by
composing this initial list of functions (so the data type can be
specified abstractly,
but more efficient computational model exists. if cpu consists from
huge amount of execution engines which synchronizes their operations
only when one unit uses results produces by another then we got
processor with huge level of natural parallelism and friendlier for FP
programs. it seems that
it seems that now we move right into this direction with GPUs
I was just thinking that GPUs might make a good target for a reduction
language like Haskell. They are hugely parallel, and they have the
commercial momentum to keep them current. It also occurred to me that
the cell processor
Benjamin Franksen wrote:
[EMAIL PROTECTED] wrote:
Here are two surveys (somewhat outdated) on the use of formal methods in
industry:
http://citeseer.ifi.unizh.ch/39426.html
http://citeseer.ifi.unizh.ch/craigen93international.html
Both of these links are dead. Could you post author
Steve Downey wrote:
The primary goal of writing source code isn't to communicate to a
computer, but to communicate to a human being.
That implies that the communication should be at a high enough level
of abstraction to be easily understood by people, while not losing the
precision necessary
What's folks most interesting ways to arrive at FP?
Mine isn't most interesting.
I did some interesting (I think so) research in visualisation and coded
it in C. Then I tried to extend it - speed it up, add more features,
etc, - and found C unsatisfactory. It is error prone and C programs
Paul Johnson пишет:
Joel Reymont [EMAIL PROTECTED] wrote:
I'm after Erlang in Haskell, if you will, for fault-tolerance and
scalability.
I think the way to do Erlang in Haskell is to build a middleware layer
on top of the language, not try to make the language into something
OK, there's the option of replacing working tools with hype.
It worked for C++, and it worked for Java.
Pity I don't have the slightest idea how to work up a hype for Haskell.
Who would want such a hype?
Why not simply start picking up fruits before the mainstream notices?
;-)
From GHC documentation: Once profiling has thrown the spotlight on the
guilty time-consumer(s), it may be better to re-think your program than
to try all the tweaks listed below.
So, how should I rethink my program? Which way to take?
___
Donald Bruce Stewart wrote:
szefirov:
From GHC documentation: Once profiling has thrown the spotlight on the
guilty time-consumer(s), it may be better to re-think your program than
to try all the tweaks listed below.
So, how should I rethink my program? Which way to take?
Do you
Do anyone had any experience with JHC?
I tried to install it second time and again get an error during library
build.
It's a pity, we need a speed in our very lazy code. ;)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Why doesn't reify return function body?
reify (mkName somefunction) for a function defined in the same module
returns constructor VarI (of data type Info) that does not contain
function declaration in (Maybe Dec) part.
What actions should I perform to get a function body with patterns,
Hawk didn't updated from GHC v4.04. It does contain dependencies on
functions that are present in my current (6.04) GHC distribution, but
they are not documented.
Those functions and constructors are (just a error log from ghc):
---
AQ.lhs:17:16: Not in scope: type
18 matches
Mail list logo
