Glynn Clements proposes to:
Zabiyaka, Yuliya
who wants
...
2) display result of the analysis (pie charts, histograms, plots)
If you don't need to interact with the display, the simplest solution
is to generate graphics files. Personally, I would use PostScript, as
I'm reasonably familiar with
Stephan Zaubzer writes:
Here my attempts:
data Entry a = EmptyEntry | MakeEntry a a
showEntry :: (Show a) = Entry a - String
showEntry EmptyEntry = Empty
showEntry MakeEntry a b = show a ++ : ++ show b
what am I doing wrong? I have seen this way on some tutorials.
I believe that if you
Georg Martius answers the request of:
Jose Manuel Hernando Cobea
I need generate random numbers by create polygons with wxHaskell,
I am searching in the web, but all I only find IO functions like
test :: Integer - IO Integer
...
I need this but with types :: Integer - Integer
you need to
Thomas Davie writes:
This method unfortunately depends on having a seed first though.
Which this method? Please, quote the text you are referring to *before*
your answer.
One must
use a different value every time the program is started, commonly time or
the first few bytes from
Thomas Davie writes, commenting my statement that one does need any
'stateful' (monadic, etc.) RN generator initializer within the program,
since you can always pass a parameter during its launching.
While I agree that it is often useful to start your program with different
parameters each time
Ben Rudiak-Gould writes:
Axel Jantsch wrote:
gibs = 1 : 1 : (zipWith f gibs (tail gibs))
where f x y = min (x + y) 10
[...] how can I force the garbage collector to reclaim the
memory of the head of the list after I have processed it, since I will
never ever reference it again?
Wolfgang Jeltsch writes:
can anybody tell me what the German translation of the word kind as used in
type theory and especially in Haskell is?
To prevent misunderstanding: I speak German as a typical Spanish cow
speaks French. Vielleicht a little better when I drink too much coffee...
Einar Karttunen writes:
Tomasz Zielonka [EMAIL PROTECTED] writes:
For example, some darcs users complain ...
Perhaps making -keep-hc-files a bit more documented ...
This could be faster and easier to implement than creating a version of
the RTS running under the JVM.
==
More
This topic should be posed to a more general forum than GHusers...
Jens Fisseler answers:
Is it possible to generate random numbers that are unique in O(1) in
Haskell?
Of course, I could create unique numbers by incrementing a global value,
but for security reasons I need random
John Meacham writes:
I wonder if it would be feasable to implement arbitrary precision
integers in pure haskell. unboxed values would probably want to be used
in some places for speed and it would be very motivating to improve
ghc's optimizer. There should be no reason manually unboxed haskell
A comment of a long text...
Henning Thielemann writes:
... some examples of transparency of notation based on 2+2=4 ...
I like to have this behaviour for derivation, too. So of what type must
be the parameter of 'derive'? A scalar expression with a free variable or
a function expression?
Henning Thielemann writes:
Is it widely accepted that the precedence of infix operators is defined by
numbers? The numbers look arbitrary to me and it is not possible to
introduce infix operators with interim precedences.
What about defining relations such as (*) has precedence over (+)? The
Bryce Bockman writes:
If it is syntactical simplicity that you like you might want to learn
Scheme as an introduction to FP. I'm no expert on either Scheme or
Haskell, but we all have to agree it is an elegant language. I'm
currently teaching myself the two in parallel, and I find that
Jacques Carette writes:
Jerzy Karczmarczuk wrote:
Syntax for 3D arrays?
Give me one single language where this is natural and immediate.
I can think of 3: Mathematica, Maple and APL.
Well, you are the village specialist on Maple here,so I won't argue too
long, but kill me, I can't see how Maple
Tim Rowe writes:
On 5/11/05, Jerzy Karczmarczuk [EMAIL PROTECTED] wrote:
Give me one single language where [3-d arrays are] natural and immediate.
I don't know how Matlab does it, but I find the C++ standard library
vectorvectorvectorfloat
entirely intuitive (apart, perhaps, for the need for
Jacques Carette answer to Lennart Augustsson's comment of:
Such people have the nasty habit of also thinking that ALL
functions are continuous! You might think they were constructivists
or something.
Why would a constructivist think that all functions are continuous?
That would be a theorem
Andrew Harris writes:
Brace yourself... I work in an environment where FORTH is still used.
I've been thinking about writing a G-machine interpreter in FORTH
so that one could write Haskell like programs that would compile down
and run graph-reduction style on the FORTH machine.
let
Jacques Carette writes:
Henning Thielemann wrote:
I don't see the problem. There are three very different kinds of
multiplication, they should also have their own signs: Scalar product,
matrix-vector multiplication, matrix-matrix multiplication.
You see 3 concepts, I see one:
Kimberley Burchett writes:
I'm interested in using haskell to do static analysis of java bytecode. To
my surprise, I wasn't able to find any existing haskell libraries for
parsing java .class files.
Now I am surprised.
Why for goodness' sake, people interested in Haskell *should* worry
Kimberley Burchett writes:
Jerzy Karczmarczuk asked:
Why for goodness' sake, people interested in Haskell *should* worry
about parsing of Java bytecode chunks?
Are you asking why I'm interested in bytecode instead of source code, or
are you asking why I'm interested in Java at all?
One
Jonathan Cast writes:
[EMAIL PROTECTED] wrote:
... Why for goodness' sake, people interested in
Haskell *should* worry about parsing of Java bytecode chunks?
It depends on your reason for interest. A better question: why should
people interested in Java be interested in using
Sam Mason writes:
Jon Cast wrote:
The intermediate type /is/ needed---it's a (hidden) parameter to your
`encode' and `decode' functions. Why do you think it shouldn't be?
Because I couldn't see the woods for the trees. I think I had
almost figured out what I was asking (the impossible) before
John Goerzen writes:
One of the things I do when I learn a new language is to try to probe
where its weaknesses are.
Please, when meeting new women in your life, don't do so.
Otherwise you won't live long enough in order to appreciate
your new knowledge...
Jerzy Karczmarczuk
Marcin 'Qrczak' Kowalczyk writes:
Peter Achten [EMAIL PROTECTED] writes:
It is of course not the language that uses strictness annotations.
But the language encourages to use them much more often than in
Haskell. They can be declared in types, there is a short syntax for
strict let, and various
Fergus Henderson comments the comment of Andre Pang concerning my
nasty comment addressed to Marcin Kowalczyk.
On 08-Oct-2004, Andre Pang [EMAIL PROTECTED] wrote:
I believe that Marcin wishes to prove the same point that I want to:
namely, Clean encourages use of strictness by making it easier
Serguey Zefirov writes:
Right now I explore the possibilities of building the prototype
for game physics library in Haskell.
One of intermediate steps is to build linear algebra library for
further utilisation. But, here I face some difficulties.
...
In Haskell I should define different
Scott Turner reacts:
7. There's a lot of discussion w.r.t state, at least on this list. Is
threading state through many functions respectivley polluting many
functions with monads the solution?
If a function is pure, there's never any need to involve it with a monad.
Monads don't cause
I am afraid that something is wrong with my understanding of multi-
param classes with dependencies. I tried to generalize one of my old
packages for quantum *abstract* computations, where state vectors are
defined as functional objects, whose codomain has some arithmetic.
It is easy to see that
Ashley Yakeley writes:
GHCi is correct to complain:
class Vspace a v | v - a
OK, the first parameter (a) depends on the second (v).
This is what I want. For a given set of vectors, the associated
scalars are unique, otherwise I would have problems with norm.
But I have problems anyway...
Maurcio comments the remark of Ketil Malde
Note that Haskell doesn't automatically convert arguments for you --
this is a feature.
When I type this:
*
import Complex;
a = 3 :+ 4;
*
and load it into ghci, a + 4 gives me 7.0 :+ 4.0, although a +
(4::Float) gives me that error
A random newbie called (randomly probably) Benjamin Pierce writes:
* I wrote a little program for generating Sierpinkski Carpets, and was
astonished to find that it runs out of heap under Hugs (with standard
settings -- raising the heap size with -h leads to a happier result).
...
import
31 matches
Mail list logo
