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 m
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
http://w
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
http://www.numeric-quest.com/haskell
Judging from my logs, some libraries, such as University
of Chicago library, do their own indexing of WWW.
Jan
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
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
> Hoping to get some early feedback I am posting this
> very preliminary version:
> http://www.numeric-quest.com/haskell/QuantumComputer.html
>
> Jan
The bug mentioned in the write-up has been fixed and QFT
behaves well now. New versions of both files (mo
Hoping to get some early feedback I am posting this
very preliminary version:
http://www.numeric-quest.com/haskell/QuantumComputer.html
Jan
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/li
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 s
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 s
Experimenting recently with some quantum problems I've
decided that it's time to add some long overdue
algorithmic support for module QuantumVector.
So here are two new modules added to our collection:
http://www.numeric-quest.com/haskell/LinearAlgorithms.
Directly from the oven :-):
http://www.numeric-quest.com/haskell/QuantumSearch.hs
Excerpt from a short module description is given below.
Jan
Grover's algorithm assumes that one is given a quantum function, also called
an oracle, that indicates, when confronted
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
wh
Wrong namespace! Could you please, move your further discussion
on this subject to [EMAIL PROTECTED]? You pauperize the
other archive while polluting this one.
Jan
___
Haskell mailing list
[EMAIL P
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 proces
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.
http://www.numeric-quest.com/haskell/brid
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
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 wat
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 yo
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
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 por
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 pil
Described in:
http://www.numeric-quest.com/haskell/smartest.html
Jan
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
> As Ralf mentioned you can compute the area of the triangle without
> using square roots:
Just for the record guys: you cannot cheat and skip
'sqrt' computation if the triangle has any arbitrary
orientation in 3D - unless you know its plane normal. :-)
Jan
On 22 Aug 2000, Friedrich Dominicus wrote:
> Dear Haskell Fans, I'm afraid that I'm a bit dumb but I'm somewhat
> stuck.
>
> Can someone give me a hand on this problem
>
> I wrote this code to solve SOE, exc 5.1.
>
> import Shape
>
> triangleArea :: [Vertex] -> Float
> triangleArea (v1:v2
> 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
>
> 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 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
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
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 elsewher
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 typ
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 substit
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
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 de
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
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 ther
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
I watch in amusement how my name is glued to someone
else's prose. I mildly protest :-)
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.
>
> O
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 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
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 Skib
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 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
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 hav
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 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
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,
On Tue, 2 May 2000, Jerzy Karczmarczuk wrote:
> Well, all this is ambiguous. A "big picture" and
> "something moderate" contradict themselves IMHO.
Not necessary. How about moderately big picture? :-)
Seriously, I really worry that Sergey's initiative
does not receive
On Mon, 1 May 2000, Tom Pledger wrote:
>
> Here's an example of something which could be done, without major
> language extensions: insert a partial ordering class between Eq and
> Ord. (It's something I've advocated before, so I won't dwell on it
> this time.)
That's why some sort o
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 to
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?
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 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 t
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 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 m
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
readFile "yyy" >>=
process >>=
writeFile "xxx"
?
Jan Skibinski
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 > x
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 those
Correction: After closer examination of CGI
directory in mod_haskell I found that the
library is strictly bound to a single concept
of using it as Apache loadable module.
Another words, one cannot use it as is in
other modes of operations, for exam
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 mod_Ha
Die Meisterstu:cke of software engineering,
or "The crazy men in their magnificent flying
machines".
-
Once again I needed to quickly write few CGI programs.
Once again I did it in C. Once again I wished
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 gro
Modules Solid, Solid_XML, Solid_tests and Solid_XML_tests
are available at www.numeric-quest.com/haskell/solid/
Some blurb follows.
Enjoy.
Jan
...
What we need from a solid modeler is its ability to help us
with mundane computatio
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, documen
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 reason
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 a
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
>
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 will
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
> The strongest objection I observed so far was that it agrees badly
> with writing programs to link to the object libraries given without
> sources. With overlaps, the interface module export types may start
> to depend on the single `import A' declaration.
> It will be harder to satisfy the l
Here is a tutorial on Hawk, which I prepared in December 1999
as a demo presentation for V3 Semiconductor in Toronto.
It consists of four tutorial units, with 10 literate Haskell
modules and a lot of introductory material about Haskell
proper. Among other
[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,
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
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
> 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
> 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 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
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 Haske
Our module Collection is now available at
http://www.numeric-quest.com/haskell/Collection.html
It is based on Chris Okazaki's "BinaryRandomAccessList",
but with a twist and plenty of changes and additions.
An excerpt from the summary is appended below.
inner product with one bound ("sqeezed" multiplication)
(<<*>>) - inner product with two bounds
Jan
On Sat, 9 Oct 1999, Jan Skibinski wrote:
>
> I have posted a sketchy design of module Tensor:
> http://www.numeric-quest.com/haske
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
Here are some comments about the prevailing view that the
concept of the World or the Universe is safe to use in
any kind of arguments related to referential transparency.
I would be quite cautious here. I am not an expert on
these issues in relation to FP,
If a good pre-processor is still a valid option, would not
something similar to Camlp4 be better than the plain CPP?
Camlp4 ===> http://pauillac.inria.fr/camlp4/
"Camlp4 is a Pre-Processor-Pretty-Printer for Objective Caml.
It offers syntactic tools (par
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 29 Sep 1999, Marcin 'Qrczak' Kowalczyk wrote:
> Wed, 29 Sep 1999 11:43:06 +0200, George Russell <[EMAIL PROTECTED]> pisze:
>
> > When that happens in my code it counts as a bug! Therefore error
> > is appropriate. If you are in some larger Haskell universe calling
> > component Haskell co
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 argum
[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 I
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
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. O
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.
Motivatio
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
1 - 100 of 151 matches
Mail list logo
