I apologize to anyone who wrote me last week and did not get any response. For a
reason unknown to me I can no longer access the email account which I used when
subscribing to this list. I hope this address will remain stable enough.
Jan
___
Haskell
Hi All,
You might be interested in Konka documentation, which is available either in HTML
format:
http://www.lun.pl/konka/doc/konka-doc.html
or as a raw source -- from which either HTML or a View format
can be generated in two seconds:
http://www.lun.pl/konka/files/konka-doc.zip
is just too slow for this. But you are still welcome to
peruse.
Hoping to talk to you again,
Jan Skibinski
Numeric Quest Inc.
Huntsville, Ontario, Canada
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http
On Tue, 19 Jun 2001, Nicole Gabler wrote:
O.k. thank you Wolfgang!!
Then I will tell you my problem exactly. Perhaps anybody can help me:
My haskell programm is in the root directory. I want to parse from several
files in different directories. How can I do this??
That depends
I've been working with one pecular algebraic data structure,
named Register, which is described in currently upgraded
http://www.numeric-quest.com/haskell/QuantumComputer.html.
or in gzipped version of the same document
On Tue, 15 May 2001, Matt Harden wrote:
[..]
I would like _any_ pair of Ints to be an acceptable boundary for the
honeycomb, not just the ones that represent valid indexes. For example,
(Hx (0,0), Hx (15,12)) should be a valid set of bounds. The current
definition of rangeSize makes
On Wed, 2 May 2001, Jerzy Karczmarczuk wrote:
I am relatively new to Haskell.
Somebody told me that it is a very good language, because all the
people on its mailing list are so nice that they solve all
homeworks, even quite silly, of all students around, provided they
ask for a
I need some help with some optimization of certain trees:
data Tree
= Leaf Item
| Product Tree Tree
| Sum (Double, Tree) (Double, Tree)
with this additional collating property:
Sum (Double, Leaf Item) (Double, Leaf Item) == Leaf Item
I have certain control over the
On Mon, 2 Apr 2001, Jason J. Libsch wrote:
The reason that this paper so peaked my interest is that i have been
working on a system that is tremendously similar to the one described in
this paper- it's as if Dr. Reekie Van Eck phreaked my head or notebooks
(unfortunatly, my designs have
Well, at least interesting for me ... Thinking a bit
about modelling of a standard interpretation of a measurement
in Quantum Mechanics I came up with this tiny addendum
to module QuantumVector:
http://www.numeric-quest.com/haskell/Observation.hs
On Fri, 16 Feb 2001, Jerzy Karczmarczuk wrote:
My inquiry proved beyond any doubt that my students are so
conditioned by "C", that despite the fact that we worked with
monads for several weeks, they *cannot imagine* that
"return z"
may mean something different than the value of "z".
If this idea is also being considered for Haskell
I suggest to examine NICE pages to see how it works
in practice.
NICE = Non-profit International Consortium for Eiffel.
http://www.eiffel-nice.org
Jan
Classes available from the description page at
http://www.numeric-quest.com/haskell/explorer/browser.html
Works in Squeak. Supports Hugs and NHC. Support for other
environments is planned. Hugs Module Browser is good only for
Linux/Unix users due to current lack of a support for pipes
and
On 12 Jan 2001, Steinitz, Dominic J wrote:
I was thinking of using MD5 or SHA-1 for an application.
Is there a Haskell library that contains these or other hash algorithms
that have a very low probability of giving clashes?
Dominic.
On Tue, 2 Jan 2001, George Russell wrote:
Paul Hudak wrote:
Unforunately, the "Gentle Introduction To Haskell" that
haskell.org links to is not a very useful introduction.
John and I should probably rename this document, since it really isn't a
very gentle intro at all. We
On Thu, 28 Dec 2000, Benjamin L. Russell wrote:
On Thu, 28 Dec 2000 16:48:57 +0100
Frank Atanassow [EMAIL PROTECTED] wrote:
i r thomas wrote (on 28-12-00 12:50 +1000):
"Furuike ya! Kawazu tobikomu mizu no oto." --Matsuo Basho
"(It's) An old pond! The sound of water steadily
On Wed, 22 Nov 2000, Koen Claessen wrote:
[cut]
http://www.cs.chalmers.se/~koen/ParserComboC/parser-combo-c.html
I thought it could be fun for Haskell programmers to see
this. (One of the problems with this webpage is that I do
not really know for who I am writing it...)
So if you have
Check
http://www.numeric-quest.com/haskell/explorer/explorer.html
and tell me what you think about it.
The tool uses :browse command of Hugs. There is always
a choice for this kind of work:
+ Parse the source modules.
Pro: Tools are
On Fri, 10 Nov 2000, Paul Hudak wrote:
Good work Jan. I have two comments/questions:
Thank you, Paul (and all the others that responded privately).
1) Why can't we do this sort of thing in a Haskell GUI tool such as
FranTk? What is missing that would make it as easy as
Since I have noticed some moderate interest in this subject:
several hundred visitors to the main page - some recurring,
several dozens peeks at the module Hugs.st (some recurring
again) and several encouraging private messages - including
some from the
Described in:
http://www.numeric-quest.com/haskell/smartest.html
Jan
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
No. A definitive test is to submit the page to the validator at the World
Wide Web Consortium's web site (http://validator.w3.com/), which (not
surprisingly) finds 455 HTML errors, beginning with the absence of a document
type declaration.
I bet you that 99% web pages on
On Thu, 10 Aug 2000, Sebastian Schulz wrote:
Hi!
How can I use Doubles which are more exact than six digits?
For example HUGS gives me :
1,23456789
1.23457
1. What you see printed and what is used in internal
computations are two different things.
2. But
Aha . And how many digits will GHC offer me?
I would think that you will get the same number of digits
as is available for C - unless some bits are reserved
for something special, which I am not aware of.
For example, in some implementations of Smalltalk the
On Fri, 28 Jul 2000, S.D.Mechveliani wrote:
And there arises a question.
To make the implementation accessible, the paper file has to be
included there as the necessary part of documentation. Maybe, not
literally the paper, but something that 90% coincides with it.
On the other hand, I
On Mon, 24 Jul 2000, Claus Reinke wrote:
Jan Skibinski:
On Wed, 19 Jul 2000, Claus Reinke wrote:
[List of some examples of library status information..]
Someone asks about GUIs on comp.lang.functional, on the
Haskell list, or elsewhere, and we just point them towards
On Wed, 19 Jul 2000, Claus Reinke wrote:
[List of some examples of library status information..]
They are all fine and useful. But I do not see any clear
incentives for authors for doing so, apart from their
desire to make libraries perfect .. in their spare time,
On Wed, 5 Jul 2000, Anton Moscal wrote:
IMHO, the closest analog of Haskell among OO languages is Cecil:
Cecil contains closures, object initialization in Cecil is lazy and
objects are immutable by default etc.
And the main: Cecil multimethods in conjunction with the Cecil static type
On 4 Jul 2000, Marcin 'Qrczak' Kowalczyk wrote:
Tue, 4 Jul 2000 00:40:18 -0700 (PDT), Ronald J. Legere [EMAIL PROTECTED]
pisze:
I think this is driven by the recent addition of closure like
'agents' (http://www.eiffel.com/doc/manuals/language/agent/).
They are poor substitutes of
On Mon, 26 Jun 2000, Michael Marte wrote:
I always thought that the Int argument to showsPrec is the precision.
So what is it good for? The library report does not explain it.
I sometimes use it to distinguish between the top
and the lower levels of nested data structures,
Sorry for the repeated message. It appears that
our "qmail" mail server re-sends e-mails from
its queue any time I have to reboot the network.
Jan
Yet another testing module for QuantumVector module:
www.numeric-quest.com/haskell/QuantumOscillator.html
There is a lot of pretty theory and very little code
because the theory solves it all; well, almost, since
one can always find some mundane tasks for
In a second round I have made several improvements
to the formalism of QuantumVector module. Module
Momenta is also adjusted to match the changes.
The most notable improvement is related to tensor
products of vector spaces. Previous definition was
On Mon, 5 Jun 2000, Frank Atanassow wrote:
Jerzy Karczmarczuk writes:
...although apparently there are exactly two readers/writers
of this thread on this list. Oh, well, it is as boring as any
other subject.
I'm reading it. I think this field of application could be very
So far I was able to stick with standard Haskell 98
features in the module QuantumVector I am working on.
But now it seems to me that I do not have any other choice
but to use Mark's extension of multiple parameter
classes.
The problem I have is
On Fri, 2 Jun 2000, Jerzy Karczmarczuk wrote:
I hope that this work will progress.
So it does. I started working on linear operators.
New version of the module is available for downloading.
Much still needs to be done, but the closure
formula is already
After two days of polishing the stuff I am pleased
to announce availability of the module Momenta:
www.numeric-quest.com/haskell/Momenta.html
Those who already downloaded the unofficial version
are adviced to get the new one. It is cleaner and
On Thu, 1 Jun 2000, S.D.Mechveliani wrote:
About the type constructor for mode, I half-agree.
But about a single function - no.
If you require the single functions
sort_merge, sort_insert, sort_quick,
do you also require
tar_x, tar_xv, tar_v
On Thu, 1 Jun 2000, Jeffrey R. Lewis wrote:
No so, of course. (- x) means `negate x'. Bummer. What an unpleasant bit of
asymmetry!
How about ((-) x) ?
Jan
On 1 Jun 2000, Ketil Malde wrote:
Jan Skibinski [EMAIL PROTECTED] writes:
For tar_x, tar_xv, tar_v kind of things people
invented objects, recognizing that "tar -x"
approach is not a user friendly technology.
Oh? You realize there are Unix weenies on this l
I watch in amusement how my name is glued to someone
else's prose. I mildly protest :-)
Jan
Here is our first attempt to model the abstract Dirac's
formalism of Quantum Mechanics in Haskell.
www.numeric-quest.com/haskell/QuantumVector.html
The exerpt from the summary follows.
Jan Skibinski
On Fri, 12 May 2000, Wilhelm B. Kloke wrote:
Hi,
I am trying to reproduce the fuzzy oscillator example by Jan Skibinski.
( http://www.numeric-quest.com/haskell/Fuzzy_oscillator.html )
I am having problems to compile the module Fuzzy.hs. As I am
just in an early learning stage, I need
On Fri, 12 May 2000, Malcolm Wallace wrote:
nhc98 and ghc4.06 show a different message:
Fuzzy.hs:188: Variable not in scope: `fromInt'
The function "fromInt" is not part of Haskell'98. Replace its sole use
with "fromIntegral", and the module compiles just fine with nhc98.
On Tue, 2 May 2000, Keith Wansbrough wrote:
Off-topic, I know, but even if this worked as I think you intend,
it would hardly be random and would certainly be unsuitable for use as a
nonce. Applying `mkStdGen' to the current time doesn't make it any more
random! You might as well use
On Tue, 9 May 2000, Frank Atanassow wrote:
Jan Skibinski writes:
Any good idea? First prize: a bottle of something good. :-)
There is a thing known as an Entropy Gathering Demon (EGD).
From http://www.lothar.com/tech/crypto/ :
You have been nominated for the first prize
On Wed, 3 May 2000, S.D.Mechveliani wrote:
But this is not good enough to attract general attention
and to make it easy to discuss about. The onus is still
on you, to be frank.
It is large enough. If I expand it with more comments, people will
be frightened by its
Sergey:
I will only make a short observation here - skipping
other unnecessary details which do not move this
discussion in right direction.
You misread me, I wanted to help. Specifically, I sensed
a tone of resignation in your letter dated Wed,
It appears to me that we have reached some impasse
in a design of basic mathematical structure for
Haskell 2. Sergey's proposal "Basic Algebra Proposal"
is there, but for variety of reasons (a language
barrier being probably one of them) it does not seem
Erik:
You have discovered the essence of monads, ie the difference between the bad
and ugly world of side-effecting computations and the nice and clean world
of pure functions. And even using my favourite example (*)!
Let's put it in other words: I knew the difference,
On Fri, 28 Apr 2000, Fergus Henderson wrote:
This is all fine and dandy if `currentSecond' is within `where'
clause, because it will be always evaluated afresh.
It might happen to work with current Haskell implementations,
but I don't think there's any guarantee of that.
Facing a risk of being stomped all over again
without reason, I nevertheless post this question
to get to the bottom of things:
When can I safely cheat haskell compiler/interpreter
by pretending that I perform pure computations,
when in fact they
On Sat, 29 Apr 2000, Fergus Henderson wrote:
On 28-Apr-2000, Jan Skibinski [EMAIL PROTECTED] wrote:
When can I safely cheat haskell compiler/interpreter
by pretending that I perform pure computations,
when in fact they are not?
That depends on what degree of safety
eadFile "yyy" =
process =
writeFile "xxx"
?
Jan Skibinski
Ralf and Sven:
Thank you both for your answers. I knew that strictness
was needed here, but I was seeking some elegant solution.
I prefer your answer, Sven, a bit more. Could you elaborate
on your `hack' a bit more? It seems to be a good topic for
On 27 Apr 2000, Marcin 'Qrczak' Kowalczyk wrote:
Unless we are talking about unsafe extensions, which OTOH are very
useful too. Sometimes eliminating unsafePerformIO would require
huge rewrite of the whole program, making it less readable and less
efficient. But they should be clearly
Angus is right on the track. I would only modify
it slightly:
content_xxx :: String
content_xxx = (unsafePerformIO . readFile) "xxx"
From Hugs perspective content_xxx is a constant.
Your may easily demonstrate it this way:
:!echo blah
Sources of the latest snapshot of Hugs serving
some simple example application via Fast-CGI framework
are available here:
http://www.numeric-quest.com/haskell/bridge/index.html
[I may consider giving access to my Hugs server
for testing to
On Fri, 7 Apr 2000, Erik Meijer wrote:
Probably you missed the announcement of mod_Haskell some time ago.
Anyway, mod_Haskell gives you a Haskell98 update of my CGI-library
integrated into Apache (yes, yes, that Linux-based webserver :-)
No I did not. What I missed is that
On Fri, 31 Mar 2000, S.J.Thompson wrote:
To help students I have compiled a list of messages and examples of code that
provoke them. In many cases a little effort would, I guess, lead to vastly
more informative error messages. I'd be interested to hear what you (and the
Hugs group)
I would not take your time here if it were not for
the fact that my log file shows some traffic to
GD module in the last few days -- while I was still
making changes to it. Since I have finished with it
for now I might as well announce it here.
GD
On Thu, 23 Mar 2000, Volker Wysk wrote:
(Message didn't get through the first time. Reposting.)
Hi
What you suggest sounds like a solution that's easy to learn, useful, and
can be implemented with modest effort. It might be the a good solution
for the problem at hand, documenting
In ideal world, programmers will be editing their programs
with fancy pretty-printing and editing tools. All kinds of
massive annotations would be then possible but they will be
invisible to a programmer's eye and not obscuring
his/her code. Compilers
On Wed, 22 Mar 2000, Keith Wansbrough wrote:
Jan... could you write up a proposal for such a system for Haskell,
with
1. The exact requirements (the comment conventions the programmer
must observe), and
2. A list of what could be automatically generated by a system
On Wed, 22 Mar 2000, Frank Atanassow wrote:
Could you give us a link to a description of this mechanism? I looked through
www.eiffel.com but could only find more general descriptions of the
language/compiler.
Strange as it may seem, Bertrand Meyer decided not to
include any
I was up all night and I need few hours of sleep,
so I will not be ready with any proposal till
tomorrow. In meantime you may take a look at
www.numeric-quest.com/news/NQ-comments.html.
This is a document I wrote many years ago, but
it seems
Here is "How to convert Hugs into an Orbit server and supply it
with a GUI client"
www.numeric-quest.com/haskell/morehugs/index.html
Jan
On Fri, 18 Feb 2000, Avril Hardy wrote:
I am very new to the Haskell environment and to this list. I have
just started studying Haskell at University and have had problems
downloading Haskell or Hugs to my PC; I wondered whether it had
anything to do with the options set in the ini
On Sun, 6 Feb 2000, Joe English wrote:
This turns out not to be the case; testing with Hugs
invariably fails with a "Garbage collection fails to
reclaim sufficient space" on even moderately sized
documents (5000 nodes or so).
If I remember correctly, one of the past postings
[Prompted by Sergey's message about the strange dates:
The mess in my headers is entirely my fault.
I have not had a chance to properly finish the
upgrades to this machines: internationalization and
the rest. Please forgive me for this mess]
On Tue,
All the proposals break this law as well, so I this argument is weak (if
not insane :-))
-Alex-
IMHO, a consistency is the most important rule here.
I do not have any problems with any of those proposals,
providing that I can apply similar reasoning to other
On Fri, 14 Jan 2000, Michael T. Richter wrote:
At 06:48 AM 1/13/00 , Jerzy wrote:
Modifying source codes of your development tools is clearly a
pathology if not a perversion. It diverts you from your principal
task which should *exploit* those tools.
I'm glad to finally find someone
On Tue, 30 Nov 1999, Eduardo Costa wrote:
[About the scientific skepticism, pointers to literature
re. mechanical arm an other goodies].
Thanks, Eduardo, for your pointers - this is much better :-).
To clarify my previous message: I did not question scientific
I spoke about the dataflow-style languages, the "circuit builders":
Simulink, Scilab/SciCos, WiT, Khoros, IBM Data Explorer (Now Open
Source) a diagrammatic layer in MathCad, LabView, etc., (+ the defunct
Java Studio).
And, of course, the notorious Visio used by some Haskell gurus
On Sun, 28 Nov 1999, Eduardo Costa wrote:
[About several promissing signs of usage of FP
for scientific applications].
Far from pouring cold water on anybody's enthusiasm
regarding the usage of FP to scientific problems
(I would really like to see
I have posted a sketchy design of module Tensor:
http://www.numeric-quest.com/haskell/Tensor.html
It has some limitations, which are clearly listed, but
it works well for 3D space. I would appreciate your
comments for improvements.
Jan
Erik Meijer, in his paper "Server Side Scripting in Haskell", FFP, Jan 98
(www.cs.uu.nl/~erik/) claims that his Haskell/CGI library is a part of the
standard Hugs distribution. He also thanks the teams from Yale and
Nottingham for including it as one of the demos in the standard
distribution (of
On Tue, 21 Sep 1999, D. Tweed wrote:
Sometimes the problem that you're working on requires such
a lot of computation (e.g., typical image processing stuff) that no
savings from reduced writing time can by a machine fast enough to
compensate for the slow-down.
I agree. The
[Most common concepts and definitions of functional
language Haskell]
The new official URL of the above overrides the previous
unofficial experimental pointer, which is no longer
useful. I think I found some sort of a stable working mode,
so now
On Sat, 11 Sep 1999, Heribert Schuetz wrote:
Most of this is probably well-known stuff and written down in papers.
Which ones? The Haskell report concentrates on the static semantics of
classes and instances. It looks like the dynamic semantics is expected
to be already understood by the
Since I have received several similar suggestion, mainly
related to formatting of the above document, I decided
to post my reponse publicly. Sorry for the noise.
Firstly, about the robots and the strange URL I posted.
I am not paranoic, just experienced.
Here is my first attempt in putting together a set
of common Haskell concepts and definitions - organized
in tutorial fashion. This is just a subset of what I
think is badly needed. So far it deals with types
(existential including) only.
Several respondents pointed out to me my unfortunate choice
of words, which implied that H/Direct is either related to
MS-specific tools or MS-specific applicability. I apologize
for this.
But H/Direct focuses _also_ on COM, and for this a specific
On Mon, 23 Aug 1999, Manuel M. T. Chakravarty wrote:
That's interesting, indeed. I am also close to finishing
the first version of a tool that simplifies Haskell access
to C libraries by extracting interface information from C
headers. Actually, I have just completed the draft of a
On Fri, 20 Aug 1999, Claus Reinke wrote:
There is a Free On-Line Dictionary Of Computing (FOLDOC) at
http://foldoc.doc.ic.ac.uk/foldoc/index.html
You might consider updating the entries there if you suceed.
As a matter of fact, I am using that and few other sources
-
On Thu, 19 Aug 1999, S. Alexander Jacobson wrote:
Mark,
Out of curiosity, how big is the user community? How many downloads of
the software? How many are on this list? If you figure that 1 user in
1000 is actually going to contribute a useful change each month (that is
probably
Sure, cat in itself isn't very interesting. But cat is just a simple
case of a more interesting problem, that of writing what Unix calls
"filters": programs that take some input from a file or pipe or other
similar source and transform it into some output.
.. and if standard Unix
On Fri, 11 Jun 1999, Craig Dickson wrote:
I don't see that underscores serve readability in the same way as Hungarian
notation purports to (unless the Eiffel people claim that underscores
somehow convey type information?), so I don't see a conflict here. One could
easily use both, e.g.
I think this kind of thing is valuable... Hungarian notation [1]
serves the same purpose in Windows C / C++ programming. It *is*
valuable having canonical variable names for most situations; it reduces
the
intellectual load on the (human) reader of the code... you don't have to
check
On Thu, 10 Jun 1999, Jerzy Karczmarczuk wrote:
There is a law obeyed by newsgroups, which seems to be
respected here: the most trivial problem, when presented in
a provocative sauce focuses the attention of so many people,
that the issue becomes disturbing.
Several problems seem
haskell.org is the obvious place. I'm sure John Peterson would be happy
to add stuff to the site.
Community-generated FAQ pages sound great, but
- Some (standard? readily-available?) technology is needed to allow
people to add stuff without intervention from the site organiser.
On Tue, 1 Jun 1999, Sven Panne wrote:
Friedrich Dominicus wrote:
[...] How can I combine the output with a line-number can I put that
into the filter? Or do I have to found another solution?
Don't fear! Mr. One-Liner comes to the rescue:;-)
How about initiating Haskell
Alex:
I support your idea of making the thing happened, although
I do not know yet when I could contribute to it since I have
massive committments to other projects now. But I'll try.
If further discussion of these matters goes underground
please
On Mon, 3 May 1999, Mark P Jones wrote:
I've seen a couple of messages now about Simon's proposal for
a RULES mechanism in Haskell, but it's clear that I've missed
several of the messages, including the original proposal. I
suspect this is a result of recent changes in the way that the
On Sat, 1 May 1999, S. Alexander Jacobson wrote:
The third problem is also an implementation issue
You don't want to have to start a hugs process that makes a
connection to a database everytime a user makes a request. You want
something like mod_perl or jserv which keeps the
Module http://www.numeric-quest.com/haskell/Orthogonals.html
has been recently upgraded to handle eigenvectors as well.
With this addition, this is more or less all what I wanted to
have in this module: orthogonalization, linear equations,
eigenvalues and
On Fri, 4 Dec 1998, Fergus Henderson wrote:
...
I think your understanding is gravely mistaken.
The intent, I believe, is that Haskell Arrays should be
implemented as contiguous memory, at least for optimizing compilers.
Implementations using association lists would IMHO only be
The real answer, as others have pointed out, is to use a profiler,
which performs timings on the actual code output by the compiler you
have chosen to use. In the end, the only benchmark that makes any sense
is running your real application under real conditions.
Thank you and all
If neither the reduction count nor the timing are appriopriate
measures of efficiency in Hugs, then what is? Is there any
profiling tool available for the interpreter?
Since modern CPU's are developed as to make more commonly used assembler
instructions faster, the only way to find out
Hi Mark,
To paraphrase George Orwell, "All reductions are equal, but some are
more equal than others."
:-)
So are assembly language instructions. Yet, I could think about
some average instruction size for similarly written programs.
Naive as my question might have been, I asked it anyway
in
1 - 100 of 119 matches
Mail list logo
