Switching to Haskell Cafe; I hope you read that list, John, since it
seems more suitable to this kind of question.
John Meacham wrote:
Hi, this is to announce the release of jhc 0.6.1. The jhc homepage with
distribution information is at http://repetae.net/computer/jhc/
The main new feature
OK, I suspect this is a real newbie error, but please have mercy. I have
downloaded and installed cabal (at least it responds to the --help command
from the command line). Yet when I do, say (to give a real example):
cabal configure parameterized_ data
(having done he fetch) I get this
The trustworthy articles on Wikipedia have references that can be checked,
and read. The ones without references are not to be trusted..
Dave Barton
- Original Message -
From: Philippa Cowderoy [EMAIL PROTECTED]
To: PR Stanley [EMAIL PROTECTED]
Cc: haskell-cafe@haskell.org
Sent:
Philippa Cowderoy and Mads Lindstrom wrote:
- Original Message -
From: Philippa Cowderoy [EMAIL PROTECTED]
To: Mads Lindstrøm [EMAIL PROTECTED]
Cc: haskell@haskell.org
Sent: Thursday, January 19, 2006 8:16 AM
Subject: Re: [Haskell] Modelling languages for FP (like UML for OO)
On Thu,
Wolfgang Jeltsch writes:
- Original Message -
Am Mittwoch, 21. Dezember 2005 13:15 schrieb Creighton Hogg:
[...]
Monads, I believe, can be just thought of as containers for state.
I would say that you are talking especially about the I/O monad here. A
monad
as such is a rather
John Goerzen writes:
There was a brief discussion on #haskell today about the Haskell
standard. I'd like to get opinions from more people, and ask if there
is any effort being done in this direction presently.
snip
I know that some people would like to hold off on such a process until
Benjamin Fransen writes:
There *is no* difference between the two if one views them as pure
mathematical values. Questions of run time speed or memory usage, i.e.
efficiency (which your original question was about) are clearly outside
the
realm of pure values, and thus we may perceive them as
John Meacham writes:
I am looking for the book The implementation of Functional
Programming languages by S. L. Peyton Jones.
This book is out of print and currently there is no electronic version
of it. The Haskell bookstore folk are working on reconstructing it and
making it available
I love religious wars.
Having been around awhile, I make a prediction. This will thrash a while,
those who like graphical environments will make their points, those who like
textual environments will make their points, no one will convince anyone
else, and eventually it will die down.
In fact
Tom Pledger writes:
In both of those cases, the apparent non-integer dimension is
accompanied by a particular unit (km, V). So, could they equally
well be handled by stripping away the units and exponentiating a
dimensionless number? For example:
(x / 1V) ^ y
I think not.
Simon Marlow writes:
That should be http:\\www.cs.uu.nl\groups\ST\Software\Parse, I
think.
Hey, I just grabbed the link reference from his file :-).
"blazingly fast" isn't very useful. Show me the NUMBERS :-)
Well, my Rosetta grammer wouldn't be very useful. Grab them yourself,
or
George Russell writes:
Parser combinators don't actually seem to analyse the grammar at
compile time at all, and instead just try all possibilities. This
looks like stone-age technology to me. The first version of MLj
was written with parser combinators. As a result the parsing
Has anyone written the poor guy, perchance to offer him a small clue?
Dave Barton *
[EMAIL PROTECTED] )0(
http://www.averstar.com/~dlb
Jerzy Karczmarczuk writes:
I am afraid that Sergey is dreaming of transforming Haskell into a
universal Computer Algebra system. We know for more than 30 years
that the general problem of algebraic simplification is a mess. OK,
some polynomial transformations can be done, but I
Sigbjorn writes:
Weird - are you sure it was capitalised as Haskell now prescribes?
Well, *that* makes me feel dumb. That was the problem, indeed. I ask
pardon for my blindness.
Dave Barton *
[EMAIL PROTECTED]
While running the new 4.02 on a Linux box, I got a "could not find
isAlphaNum" error. I looked at the .hi file, and it seemed OK;
however, switching to the definition of the expressions using
"isAlpha" and "isDigit" solved the problem. Don't know what's wrong,
but
Michael Hobbs writes:
Has anyone else read this paper? I'm interested in hearing
comments, if only to point out some things that I may have
missed. I'll admit, I haven't read the entire paper. I gave up
after the 16th page, because it was so conceptually unwieldy. It's
not that I
Peter M|ller Neergaard writes:
1) The implementation of list concatenation ++. In the Haskell
report it is stated that ++ in general is an operator on monads.
In the case of lists, ++ works as list concatenation. However,
I cannot find any place describing whether the
Nah, not as long as I know about it. Thanks a million; I'll change
things as necessary.
Perhaps a line in the user's manual might help --- it wasn't clear to
me from reading it that modules that inherit non-standard modules must
also use the appropriate flags.
Come to think of it, this is the
Got a strange one. I am compiling two files using GHC, one of which
depends on the other. The first compiles just fine, but the second
compile gives an error on the *hi* file of the first. Specifically:
dlb@hudson temp]$ ghc -c -fallow-undecidable-instances -fglasgow-exts
Simon, thanks a lot. You write:
I don't think you can avoid this. You have two type constructors:
class SortedList s a where ...
class FiniteMap m k a where ...
s has kind *-*
m has kind *-*-*
You want to say
instance SortedList s
One more quick comment, and then I think I (at least) am done (to the
extent that the difference in opinion is clearly defined).
Fergus Henderson writes:
And, again IMHO, it is the task of the language to *define* the
encapsuation (or to allow that encapsulation to be defined), and
Fergus Henderson writes:
No, different uids don't work fine in the multiprogrammer case.
The programmer that is compiling the source code needs read access
to all of it (for using tools like `grep', if nothing else). Once
he has that read access, nothing prevents him from violating
S. Alexander Jacobson writes:
I am not sure what you mean by adding a library name. My objection to the
current model is that, for example with hugs, each new library requires
you to add a path to your hugs path and hope that two different libraries
both don't share the same module
S. Alexander Jacobson writes:
And, as long as we are supporting more ADA-like import declarations,
I would like to renew my campaign for more ADA or Java like
module namespace (packages) (yes I know, this won't be in H98)
The existing module system is:
* too shallow for larger
Simon Peyton-Jones writes:
Another approach is to compete not head-to-head on speed, but on
cunning. Get a good library of numeric procedures (e.g. Mathlab),
interface them to Haskell, and use Haskell as the glue code to make
it really fast to write complex numerical algorithms. 99% of the
Done; that did it.
Many, *many* thanks.
Once more, guided through the maze
Dave Barton *
[EMAIL PROTECTED] )0(
http://www.intermetrics.com/~dlb
Will do. I assume this does not require a recompile, just a reinstall?
Dave Barton *
[EMAIL PROTECTED] )0(
http://www.intermetrics.com/~dlb
OK, done. I have applied the patch, run gmake all, then gmake
install. I now get the following error from the final (ld) step:
/usr/src/ghc/lib/lib/libHSrts.a(Printer.o): In function `DEBUG_LoadSymbols':
/usr/src/ghc/fptools/ghc/rts/Printer.c:623: undefined reference to `bfd_init'
OK, I have compiled and installed ghc-4.00 on Linux Redhat 5.0. When
linking, inlcuding -syslip posix, I got the following ld error:
ld: cannot open -lnot-installed: No such file or directory
Obviously, not-installed is not mentioned in any of my command lines.
Any assistance would be
Working on a Linux Redhat 5.0 machine, running version 3.02 patchlevel
0, I have run across two problems:
1) A program that seems correct (at least, it compiles and runs under
Hugs) dies with a segmentation fault and dumps core.
2) Somehow, programs cannot find the Posix library. I am not
Sigbjorn writes:
Looks bad, could you tarzip the program up so that we can have a look
at it?
On the way to you, under separate cover (why burden the list?).
I don't know what might be causing this, could you provide the output
of compiling one such module with -v?
Found it (why
We have been assimilated!!!
Dave Barton *
[EMAIL PROTECTED] )0(
http://www.intermetrics.com/~dlb
Consider the following (literate) program:
module Main where
import IO
main:: IO()
main = hSetBuffering stdin NoBuffering
interact trns
trns:: String - String
trns [] = []
trns (c:cs) =
let str c = case c of
'1' - "one\n"
'2' - "two\n"
Consider the following (literate) program:
module Main where
import IO
main:: IO()
main = hSetBuffering stdin NoBuffering
interact trns
trns:: String - String
trns [] = []
trns (c:cs) =
let str c = case c of
'1' - "one\n"
'2' - "two\n"
S. Alexander Jacobson writes:
The difficulty is that we typically develop on Windows and Linux
and deploy on linux or solaris. The system I am working on
involves using CGI/servlets to update a directory server and then a
Java based produciton system (Jess, a CLIPS clone), to
JOB OFFERING
Intermetrics, Inc. in Vienna, Virginia is looking for a Masters level
or equivalent software engineer with experience in functional
programming and functional languages, particularly lazy functional
languages. Experience in and familiarity with Domain
Well, after keeping on going and getting a few more errors of the same
type, which I corrected without further guidance, I have gained two
things:
1) A much greater appreciation for the complexity of configuration
files and the messiness of Unix compatibility.
2) Gratitude to the Haskell
Having added the caddr_t definition to the two files, things chugged
along famously for a bit. However, down around absCSyn way, another
glitch occurred:
ghc -DOMIT_NATIVE_CODEGEN -cpp -fglasgow-exts -Rghc-timing -I. -IcodeGen -InativeGen
-Iparser
Well, let me try to reply to both of these at once, just to keep
everyone up to date. Sven Panne writes:
Looks like an old friend of mine (problems on HP-UX some releases ago).
The problem is fptools/ghc/lib/cbits/timezone.h. It tries to be
clever about handling time info on different
Sigbjorn writes:
That is probably the simplest thing to do until we get a grasp on
changes made in the version of GNU libc2 that RH5.0 ships with. If
you're willing to experiment, doing
foo% cd ghc/lib
foo% make libHS.a required/Time_HC_OPTS=-optc-D__USE_BSD
may (or may
Oh, dear. This one I don't even know how to *start* with.
When compiling the library, the compile crashes with the following:
rm -f required/Time.o ; if [ ! -d required/Time ]; then mkdir required/Time; else
find required/Time -name '*.o' -print | xargs rm -f __rm_food ; fi ;
Simon Marlow writes:
1) The new library seems to use __USE_BSD rather than __FreeBSD__; I
had to change one "ifndef" to get it through "gmake boot".
Huh? Which library?
Just about all of them; hopping into /usr/include and doing a "grep
USE_BSD" gives a whole mess of files:
Sigh. I upgraded to Redhat 5.0 between GHC 2.10 and GHC 3.00.
Catastrophe!! Ah, well, I knew things had been going too well.
I fixed a couple of errors:
1) The new library seems to use __USE_BSD rather than __FreeBSD__; I
had to change one "ifndef" to get it through "gmake boot".
2) The
Simon:
Thanks a million; that's just what I needed.
Yes, I know the context on the type doesn't do anything. I just got
in the habit of putting them in when I thought they did, and I haven't
trained myself out of it yet. It seems useful documentation, if
nothing else; however, if Standard
I have enclosed below a test file that causes an error that puzzles
me. Both GHC and Hugs kick it out, so at least they agree; however, I
must admit that I don't understand it.
GHC gives the following error:
test.hs:1: Ambiguous context `{Physical taZ0}'
`Physical taZ0' arising
Something of little interest to most: rebuilding the Haskell 2.09 for
Linux worked fairly well. The only slow-up was the fairly frequent
necessity to allocate more heap for specific modules. A list of the
modules that failed, and the heap I had to allocate for them, is:
Thomas Johnsson writes:
Q: does anyone know if there's a port of this stuff to Haskell?
Note that I'm not after a nondeterministic SLR parser (Ratatosk),
or some such For pedagogical reasons I'd lite the tools
to be as similar as possible to Yacc/Bison/ML-Yacc, etc.
I am using
This isn't a bug; quite the opposite. But I've been so common here in
my comments and reports that I really must report success.
With the last release, GHC 2.07 fully self-compiles on a Linux box. I
first compiled it with 0.29 (as I have had to before), and then
compiled itself. Where it
I *strongly* agree with John.
Let's not even *talk* about "official" standardization until we get
Haskell 1.5 (nominally, "Standard" Haskell) done.
Then, and only then, will the question of "official" standardization
become (perhaps!) relevant.
Dave
Hans Aberg writes:
At 07:10 97/08/22, David Barton wrote:
Let's not even *talk* about "official" standardization until we get
Haskell 1.5 (nominally, "Standard" Haskell) done.
I believe we should keep the First Amendment. :-)
First Amendment? Heck, if yo
Fergus Henderson writes:
ISO is the same. But standards don't get updated every five years.
Rather, each standard must be _reconsidered_ every five years. One of
the possible results is for the standard to be reapproved unchanged.
If the standards committee does decide that the
Hans Aberg writes:
I do not think that the Pascal standardizing model is being used
anymore; instead one schedules a new revision, say every five years
(this is used for C++). There is already an application put in for
ISO/ANSI standardizing of Java, and I think Java is younger than
Third in a series on the same set of files.
Thanks to Sigbjorn Finne's patch, the entire program now
compiles. However, the produced program now dies with a segmentation
fault. The text (which will probably help not one whit) occurs as
follows:
Segmentation fault caught, address = 38209318
IOT
I haven't had time to download his binary distribution and try to
recompile 2.04 yet. When I do, I'll let you know how it went.
Sometimes I just don't get the time to do the things I *want* to do.
Dave Barton *
After having posted on records, I decided to give them a try with a
real example. So I constructed a balanced binary tree (given the
recent questions). I decided to extend a bit into the "unionized"
record territory by at least marking the null tree with a constructor,
and see how things went.
I have been thinking about records in Gofer, Haskell, and MHDL (Yet
Another Haskell Related Language) for a little while. I know this is
a little late in the game for Haskell 1.3 (and so on), but this is the
first moment I have had to explore this a little, and I did want to
post my thoughts.
Greg Michaelson writes:
Incidentally, my point about not bothering to evaluate functional
programs whose final values are functions was serious. Presumably,
people don't generally write programs that return functions as
final values?
I suppose it depends on what you call a
John Peterson writes:
OK - let's get operational!
My man! You know, I *like* formal methods and equational reasoning; I
just can't get my mind to "do the right thing" in all cases. When
reasoning about correctness, I do OK; however, type checking and the
like inevitably find me
Puzzled, once again. I think I reason too operationally about these
things. It's a curse brought on by being brain-damaged by Basic
programming at an early age.
John Peterson writes:
The issue is at what point is the overloading of trouble, which would
be typed as
trouble ::
Has anyone done any research on automatic insertion of type coercions
into Haskell? This is a requirement for our MHDL language, and I am
trying to find a regular way to do it. I think I have found one, but
would be VERY grateful if there was an existing reference.
Ken Sailor writes:
On the other hand, general functions and arrays are typically mixed in
a program. If the distinction between the two is limited to type
declarations, then from my perspective it becomes difficult to read
and understand programs. The difference between functions as rules
and
62 matches
Mail list logo
