Hi there,
This is ghc-4.01
I have not seen an instance of such a message
for non-overlapping patterns for non-string types.
As part of a where clause I have (modulo renaming)
two equations of the following form:
f Pat1 p2 p3 p4 = rhs1
f Pat2 p2 p3 p4 = rhs2
where Pat1 and Pat2
Hello again,
Sorry about my previous ``report'' on
overlapping patterns. I overlooked the
fact that the first ``ground'' instance
appearing in the function definition was,
in fact, a variable.
GHC really works!
Regards,
Marc
Ch. A. Herrmann [EMAIL PROTECTED] writes
I have a problem with the Eval class. Maybe its just that a compiler
flag or import declaration is missing. I compiled with
ghc-4.01/bin/ghc -c -fvia-C -syslib exts
and got the error message:
No instance for `Eval Int'
[...]
It was said
GHC 4.01 is beginning the transition to Haskell 98, so
it doesn't have an Eval class. The mystery (to me) is why
it doesn't complain that Eval is out of scope!
PrelBase.lhs contains the lines
-- Leave this in for now; to make it easier to silently
-- discard Evals from
Hello,
I'm sorry cause I didn't recognized that the "strict" function is
still available:
"Ch" == Ch A Herrmann [EMAIL PROTECTED] writes:
Ch What I like to have is a mechanims to force the evaluation of an
Ch expression before passing it as an argument to a function.
It seems to be
Ah-hah! So I should just be able to write, in rts.c:
#include "Rts.h"
void defaultsHook (void) {
RTSflags.GcFlags.stksSize = 102 / sizeof(W_);
RTSflags.GcFlags.heapSize = 802 / sizeof(W_);
}
Well, sort of. I forgot to mention that we
Hi.
If any of you have already looked into this area, please let me know.
In the last 12 months or so, all the database-related messages in this
list have involved interfacing to SQL engines. By contrast, how about
using Haskell as a non-SQL relational database language?
The basis I'm using
Tom Pledger wrote:
In the last 12 months or so, all the database-related messages in this
list have involved interfacing to SQL engines. By contrast, how about
using Haskell as a non-SQL relational database language?
I've always thought that a functional language such as Haskell would
On 14-Dec-1998, Patrick Logan [EMAIL PROTECTED] wrote:
The open software Erlang system comes with a distributed database
implemented in Erlang where the "query language" is based on list
(table) comprehensions. That may serve as an example for what a
Haskell database may be like.
You
Hi,
On December 15 (01:45 +), Michael Hobbs wrote with possible deletions:
| Tom Pledger wrote:
| In the last 12 months or so, all the database-related messages in this
| list have involved interfacing to SQL engines. By contrast, how about
| using Haskell as a non-SQL relational
| Right associativity allows:
| f = \x-
| g = \y-
| h x
| which with left associativity will be rejected because x is unbound
| (in h x), or even worse: if x is bound at an outer scope, you might get
| completely the wrong value (or if you're lucky a type error).
No worries here: the
*** I was originally posting to ask a question, but I've solved the
*** question through trying to ask it. :-) I've included the mail
*** anyway in case anyone finds it useful.
|The fixity only makes a difference when you consider an expression
|like f = g = h, where, for example, f,g,h are
Just a quickie:
I see that the fixity decl of the monad operation and = changed
from right associative in 1.3 to left associative in 1.4. This strikes
me as a bug in 1.4 which ought to be reversed in 98.
Right associativity allows:
f = \x-
g = \y-
h x
which with left associativity
Simon's latest report changes the relationship between monomorphism
and defaulting. This issue was never discussed at length by the
committee so I think I'll bring the discussion out here.
...
Please take the time look into this issue and voice your opinions.
Let me second John's
--3511000-5972-913754049=:-4033521
Content-ID: [EMAIL PROTECTED]
Content-Type: TEXT/PLAIN; CHARSET="US-ASCII"
This code is part of a larger internal project...
Here is the bit that I can extract quickly.
If you have a suggestions for better structure, please tell me.
For ref., here is what the
Well, Mark was faster, the text below basically says the same thing.
On Tue, 15 Dec 1998, Malcolm Wallace wrote:
Just a quickie:
I see that the fixity decl of the monad operation and = changed
from right associative in 1.3 to left associative in 1.4. This strikes
me as a bug in 1.4 which
I built a codebase w/ Derive (or whatever is is called now) that takes a
haskell data types and generates haskell functions
1. create tables to store the data types
2. take instances of the data type and output corresponding SQL insert
statments
3. generates summaries of these tables
17 matches
Mail list logo
