did you have a look at the pupeno blog link? He suggests using fakeroot
apt-get source build.
Not sure why the fakeroot, but perhaps it makes a difference.
thomas.
Anatoly Yakovenko [EMAIL PROTECTED]
08/31/2007 01:56 PM
To
Thomas Hartman/ext/[EMAIL PROTECTED]
cc
haskell-cafe@haskell.org
that makes no difference, it just builds the package without actually
switching to root, otherwise you are doing unnecessary work with extra
privileges.
On 8/31/07, Thomas Hartman [EMAIL PROTECTED] wrote:
did you have a look at the pupeno blog link? He suggests using fakeroot
apt-get source
[EMAIL PROTECTED] wrote:
Anyway, I believe strongly that ALL people who have problems with the
Haskell protocole, and they are numerous, I teach a good sample of them,
should be encouraged to learn Prolog. IN DEPTH, and I mean it, Andrew
Coppin and Peter Hercek !
In Prolog A=B is the
Paul Hudak wrote:
ok wrote:
What is so bad about
f x = g x''
where x'' = x' + transform
x' = x * scale
(if you really hate inventing temporary names, that is).
There's nothing at all wrong with this, assuming it's what you meant
to type :-), and it might even
On Aug 31, 2007, at 16:01 , Sterling Clover wrote:
In particular for a function -- n, m, etc or x, y, etc? What about
for f' defined in a let block of f? If I use x y at the top level I
need to use another set below -- is that where x' y' are more
appropriate, or x1, y1?
Usual style is
On Fri, Aug 31, 2007 at 11:31:38AM +0200, Andrea Rossato wrote:
Thanks for your kind attention, but I don't think it's a matter of
buffering (I indeed tried playing with hSetBuffering with no results).
That is because you need to change output buffering on both ends. I
don't know about
In the latest happs (darcs pulled, updated head is 0.9.1 iirc), I am
experimenting with the example file in src/HAppS/Examples/HTTP1.hs.
I would like to combine state with io. Eventually io will mean stuff like
reading from a database, but for now I'm just reading a file.
The example file
Dear Ed,
GHC 6.6.1 is available for the upcoming Ubuntu release (Gutsy).
http://packages.ubuntu.com/gutsy/devel/ghc6
I personally like to set up a chroot environment for these things, so
here's what I have:
$ ghc --version
The Glorious Glasgow Haskell Compilation System, version 6.6.1
Paulo
Thanks!
On 8/31/07, Thomas Hartman [EMAIL PROTECTED] wrote:
you may find this helpful. (with link)
http://www.haskell.org/pipermail/haskell-cafe/2007-April/024137.html
*Sukit Tretriluxana [EMAIL PROTECTED]*
Sent by: [EMAIL PROTECTED]
08/31/2007 12:19 PM
To
Hi, I was looking over the libraries for bits of GHC (no doubt a standard form
of
relaxation for readers of this list), and noticed the following statement
(in Data.Unique):
-- | Creates a new object of type 'Unique'. The value returned will
-- not compare equal to any other value of type
Let me answer this myself - brain burnt...
Of course it is OK, that is precisely the semantics of MVars - the are
empty or full, thus assuring the mutual exclusion between threads.
Been a hard week.
Neil
... so the deeper question - why don't you realise these mistakes till
five minutes
Brent Yorgey wrote:
On 8/29/07, Alexteslin [EMAIL PROTECTED] wrote:
Hello,
I just came across with this question on the exam and can not think of
implementing it.
Wait, is this an exam for a class you're taking? Or just a problem from
an
exam that you're trying to solve for
On 9/1/07, Alexteslin [EMAIL PROTECTED] wrote:
Hi,
It is the former, but I sat an exam and trying to discuss my exam answers
which will make no difference to what so ever to an exam, as an exam
duration was 1.5 hours. Which means that no matter how much i would like
to
try to amend my
On Tuesday 31 July 2007 19:39, Duncan Coutts wrote:
[...]
The docs for those packages would be available for packages installed
via cabal (assuming the user did the optional haddock step) and would
link to each other.
Well, on a normal Linux distro a user should *never* have to call cabal (or
As a enthusiast Perl user over the years, I note that the CPAN and the
associated toolkit (the CPAN module, its shell, ExtUtils::MakeMaker
and Module::Build) is pretty good at this. It has it's share of cruft
(in fact a whole lot of it) but it's certainly better than most
solutions in this field
Are there alternative sites for HAppS API docs?
There are two links on http://happs.org/#documentation but both give
File not found! messages.
Thanks,
James
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 9/1/07, James Britt [EMAIL PROTECTED] wrote:
Are there alternative sites for HAppS API docs?
I'm currently using the one from the tarball (runghc Setup.hs haddock).
--
Felipe.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Yes, I know, this is Haskell list. So, I apologize, but not too much...
Johan Grönqvist cites me:
Anyway, I believe strongly that ALL people who have problems...
should be encouraged to learn Prolog. IN DEPTH,
Do you have a recommendation on how to do this?
(e.g., books, web-pages,
Sven Panne wrote:
On Tuesday 31 July 2007 19:39, Duncan Coutts wrote:
[...]
The docs for those packages would be available for packages installed
via cabal (assuming the user did the optional haddock step) and would
link to each other.
Well, on a normal Linux distro a user should *never*
Hi!
I did once try to learn Prolog. And failed. Miserably.
You should backtrack at this point and try again differently. :-)
Mitar
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
James Britt james at neurogami.com writes:
Are there alternative sites for HAppS API docs?
There are two links on http://happs.org/#documentation but both give
File not found! messages.
Thanks,
James
Just compile your one version from the HAppS source. Use runghc Setup.hs
Thomas Hartman thomas.hartman at db.com writes:
In the latest happs (darcs pulled, updated
head is 0.9.1 iirc), I am experimenting with the example file in
src/HAppS/Examples/HTTP1.hs.
I would like to combine state with io.
Eventually io will mean stuff like reading from a database, but
On Sat, 2007-09-01 at 18:47 +0200, Sven Panne wrote:
On Tuesday 31 July 2007 19:39, Duncan Coutts wrote:
[...]
The docs for those packages would be available for packages installed
via cabal (assuming the user did the optional haddock step) and would
link to each other.
Well, on a
Andrea Rossato wrote:
loop s = do
putStrLn s
Most likely, the content of s sits in a local buffer and never leaves
this process, following most OS conventions and as others point out.
Another process waiting for it will deadlock.
Most similar process deadlock problems are not
Mitar wrote:
I did once try to learn Prolog. And failed. Miserably.
You should backtrack at this point and try again differently. :-)
There is likely a problem if he has inadvently walked past a cut. XD
___
Haskell-Cafe mailing list
Cool I had prolog for my Spectrum, many years ago (83?), but I
stopped using it when I realized it didnt have any input/output
capabilities beyond print, and no way to escape from the prolog
bubble, eg FFI (not sure what FFI stands for, but I think it is a
way for Haskell to escape into other
A really simple way to track the quality of a package is to display
the number of downloads.
A posteriorae, this works great in other download sites.
We can easily hypothesize about why a download count gives a decent
indication of some measure of quality:
- more people downloading it means more
Peter Verswyvelen wrote:
Thanks, this is very useful information!
Prolog is indeed on my list as languages I want to learn. I understand
the basic principles, but haven't digged deep yet. But first I want to
do Haskell, which I'm now totally addicted to!
But after reading
I like the fact that Haskel treats numbers in a generic way, so you can
lift them to any other datatype by instantiating Num.
Can the same be done on other builtin constructs? For example, if I have
[a], can this list be lifted to other types? I guess not, because no
type class exists for the
Martin Lütke wrote:
James Britt james at neurogami.com writes:
Are there alternative sites for HAppS API docs?
There are two links on http://happs.org/#documentation but both give
File not found! messages.
Thanks,
James
Just compile your one version from the HAppS source. Use runghc
I played around with this for a while based on the same sort of
algorithm and ended up with a similar solution too. It turns out the
operations saved by keeping track of already visited nodes are more
than outweighed by the cost of doing so. (As you can see, I still
have the hook in my
On Sat, Sep 01, 2007 at 09:12:30PM -0400, Albert Y. C. Lai wrote:
Andrea Rossato wrote:
loop s = do
putStrLn s
Most likely, the content of s sits in a local buffer and never leaves this
process, following most OS conventions and as others point out. Another
process
On Sunday 02 September 2007 03:29, Hugh Perkins wrote:
A really simple way to track the quality of a package is to display
the number of downloads.
A posteriorae, this works great in other download sites.
We can easily hypothesize about why a download count gives a decent
indication of some
On 9/2/07, Sven Panne [EMAIL PROTECTED] wrote:
High-qualitiy standard libraries which are packaged with GHC/Hugs/... will
probably almost never be downloaded separately.
Good point. Note however that if someone is hunting for a library,
it's generally because it's not already bundled with
Right, your program is 2 times faster than mine on my machine... I
wonder if there is a better structure to do this bookkeeping than
IntSet (maybe Sequence slightly remanied ?), anyway it goes to show
how sometimes the bookkeeping can be more expensive than the
operations it's meant to prevent !
Chaddaï Fouché wrote:
You can indeed already do that, except it won't be a single instance
since list have a bucketful of interesting properties. A good starting
is looking at what list is an instance of and trying to identify the
set of instance which interest us in this case, Foldable and
Just compile your one version from the HAppS source. Use runghc
Setup.hs
haddock.
OK, I can give that a shot.
I'm still curious about my original question, though. Are there
alternative online API docs for Happs?
I am sorry I dont answer your question directly, but the last online api
On Sep 2, 2007, at 2:08 , Peter Verswyvelen wrote:
But after reading http://en.wikipedia.org/wiki/
Fifth_generation_computer, it seemed to me that Prolog was a dead
language, having only pure theoretical purposes. Is this true?
Tell that to the order pricing system I wrote in Prolog for a
On 9/2/07, Brandon S. Allbery KF8NH [EMAIL PROTECTED] wrote:
in the early 90s
I think I found the flaw in your argument ;-)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sven Panne wrote:
... and even more easily hypothesize why this is not always a good indication:
High-qualitiy standard libraries which are packaged with GHC/Hugs/... will
probably almost never be downloaded separately.
Solution: change GHC/Hugs so it submits usage counters of which
One of standard exercices in Prolog is the construction of the
meta-interpreter of Prolog in Prolog. While this is cheating, I recommend
it to you. It opens eyes.
Ever tried implementing Haskell in Haskell? ;-)
Prolog strategies are straightforward, and I simply cannot understand the
Sven Panne wrote:
... and even more easily hypothesize why this is not always a good
indication:
High-qualitiy standard libraries which are packaged with GHC/Hugs/...
will probably almost never be downloaded separately.
Solution: change GHC/Hugs so it submits (via a webservice, stored in a
Cut is a means of preventing backtracking beyond that point - it
prunes the potential search space saying the answer must be built on
the current set of bindings. (Lots of work went into how automatically
get cut's into programs to make them efficient but without the
programmer having to worry
Andrew Coppin writes:
Ever tried implementing Haskell in Haskell? ;-)
Seriously:
Haskell is a *complicated* language, needing a parser, which by itself is
a non-trivial exercice. Moreover, it has a type-inference engine, which
may be simulated, sure, but Haskell in Haskell is a tough job.
Data.Array.Diff don't have an instance for DiffUArray Bool, which is
strange by itself since IOUArray Bool exists and it's the only
IOUArray that is not mirrored in Diff.
But ok, why not, I guess it might be a small oversight, so I go on to
create the missing instance IArray (IOToDiffArray
As to whether Prolog is dead or not, it depends on your definition of
dead. Three years ago (not ten!) I made my living maintaining and
developing a large application written in Prolog. That was actually an
interesting experience, since one of the performance drivers was speed.
As a result code
Andrea Rossato wrote:
Most likely, the content of s sits in a local buffer and never leaves this
process, following most OS conventions and as others point out. Another
process waiting for it will deadlock.
Yes, I knew it was something related to the underneath OS. I'll have
to study
[EMAIL PROTECTED] wrote:
Andrew Coppin writes:
Ever tried implementing Haskell in Haskell? ;-)
Seriously:
Haskell is a *complicated* language, needing a parser, which by itself is
a non-trivial exercice.
It looks so simple on the surface...
[Actually, so does cold fusion.]
Read my whole
Hi,
I'm trying to acquire some confidence with the GHC-API and I'm having
some problems, related to error handling, I seem not be able to solve.
Basically there are 3 functions to (interactively) compile/run
Haskell expressions: compileExpr, dyCompileExpr and runStmt.
The first 2 will return
Sooo.. what is the modern equivalent of Prolog?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hugh Perkins writes:
Sooo.. what is the modern equivalent of Prolog?
Well, first, I wouldn't agree entirely that Prolog is not modern.
Anyway...
If you want something wih more bells and whistles, modularity, coroutining,
more security (less power, e.g. no program auto-modification), etc.,
You're right. The list syntax is only for lists in Haskell. It would be
nice if the list syntax was overloaded too.
You can overload numeric literals (by defining fromInteger) and string
literals (by defining fromString, in 6.7).
BTW, the [1..10] syntax is overloaded, you need an Enum instance.
On Saturday 25 August 2007 20:49, Andrew Coppin wrote:
[...] Would be nice if I could build something in Haskell that overcomes
these. OTOH, does Haskell have any way to talk to the audio hardware?
Depending on what you are exactly trying to do, the OpenAL/ALUT packages might
be of interest.
Bryan O'Sullivan wrote:
Your problem may be buffering-related (I haven't read your code to
check), but if so, there's a fair likelihood that it has nothing to do
with the OS. GHC's runtime does its own buffer management on Handles.
It's quite possible that your deadlock lies at that level,
Albert Y. C. Lai wrote:
It is similar to saying, if you use Haskell, you don't have to learn
dependent typing. Ah, but knowing dependent typing informs you of
certain typing issues and how to use the Haskell type system more
successfully. This is despite tutorials on dependent typing talk
On Wed, Aug 29, 2007 at 01:03:56PM -0700, Stefan O'Rear wrote:
So it is not clear if GHC does really need this PROT_EXEC. Can someone
familiar with GHC internals answer why PROT_EXEC is used in getMBlocks?
It's not possible to correctly implement 'foreign import ccall
wrapper' without
Hugh Perkins wrote:
A really simple way to track the quality of a package is to display
the number of downloads.
A posteriorae, this works great in other download sites.
We can easily hypothesize about why a download count gives a decent
indication of some measure of quality:
- more people
Snif, this is sad... :-( Oh well, maybe this gets improved in Haskell
Prime ;-)
Lennart Augustsson wrote:
You're right. The list syntax is only for lists in Haskell. It would
be nice if the list syntax was overloaded too.
You can overload numeric literals (by defining fromInteger) and
Jerzy Karczmarczuk wrote
Perhaps somebody can say more about constraint languages which replaced
Yes please! Of example, how correct is
http://en.wikipedia.org/wiki/Constraint_programming?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
2007/9/2, Adrian Hey [EMAIL PROTECTED]:
Other meaningless measures that have been suggested are the rate of
patch submissions of the number of developers involved. I seem to
remember someone recently suggesting that libraries that score highly
in on this regard should be elevated to blessed
Hugh Perkins wrote:
Sooo.. what is the modern equivalent of Prolog?
I once learned about LIFE (Logic, Inheritance, Functions, and Equations) and
was deeply fascinated. However, it died the quick death of most research
languages.
Cheers
Ben
___
Off-topic, so stop reading now if you want ;-) , but reminds me of my
experience using Python and C++. Python and C++ are both great
languages, with their own strengths, and one might think that
combining thing gets the best of both.
However, using Swig etc to join Python to C++ takes a
On Sun, 2007-09-02 at 22:52 +0800, Hugh Perkins wrote:
Sooo.. what is the modern equivalent of Prolog?
Because no one has said it quite this way:
The modern equivalent of Prolog is Prolog.
Most of the advancement in logic programming has either been folded back
into Prolog or has been advanced
On 9/3/07, Adrian Hey [EMAIL PROTECTED] wrote:
The popularity of MS
Winders or Office Suite are the obvious examples. We all know why these
are used on 95% or whatever of the worlds PCs, and it has nothing
whatever to do with quality.
Oh come on. You've been reading waaayyy too much
On 9/3/07, Derek Elkins [EMAIL PROTECTED] wrote:
Because no one has said it quite this way:
The modern equivalent of Prolog is Prolog.
Ok, thanks. Just wanted to check that.
(btw, just thought, when I was talking about FFI, probably meant
Forth, not Prolog. FFI for Prolog probably isnt that
On Mon, 2007-09-03 at 07:43 +0800, Hugh Perkins wrote:
On 9/3/07, Derek Elkins [EMAIL PROTECTED] wrote:
Because no one has said it quite this way:
The modern equivalent of Prolog is Prolog.
I was just about to say the same thing :-); thanks, Derek.
. . .
(btw, just thought, when I was
(BTW I thought the FFI for Forth was the Forth assembler; have things
changed since FIG/F83?)
I didnt have a real PC, just a ZX Spectrum. It wasnt real Forth, just
Spectrum Forth. It was kindof fun, but a little disappointing not to
be able to do anything useful with it. Well, I wanted to
Alexander Vodomerov wrote:
On Wed, Aug 29, 2007 at 01:03:56PM -0700, Stefan O'Rear wrote:
[snip]
What is so special about wrapper and dynamic functions?
Can you please give some ideas how self-modifying code can be used in
FFI implementation?
It's not self-modifying code really, it's
Just noticed, erlang has the second kind of bimap (a bijection?)
built into each process:
From http://www.erlang.org/doc/reference_manual/processes.html :
10.9 Process Dictionary
Each process has its own process dictionary, accessed by calling the
following BIFs:
put(Key, Value)
get(Key)
get()
Call for Participation
The Fifth Asian Symposium on Programming Languages and Systems
November 29 - December 1, 2007
Singapore
http://www.comp.nus.edu.sg/~aplas07/
In article [EMAIL PROTECTED],
Hugh Perkins [EMAIL PROTECTED] wrote:
However, using Swig etc to join Python to C++ takes a significant
amount of time, and one needs project members now to learn two
languages.
That's a non-issue in my context. The first real problem is wasting time
generating
It's fairly correct and up-to-date although I note that the constraint
example 'send more money' given is stated as 'Prolog' when it really
uses ECLiPSe Prolog constraint syntax (alldifferent/1, labelling/1 and
'#' integer constraints):
If you're really interested in constraint based
G'day all.
Quoting Bill Wood [EMAIL PROTECTED]:
As to whether Prolog is dead or not, it depends on your definition of
dead. Three years ago (not ten!) I made my living maintaining and
developing a large application written in Prolog.
Back when I was doing logic programming, 10 or so years
G'day all.
Quoting Hugh Perkins [EMAIL PROTECTED]:
However, using Swig etc to join Python to C++ takes a significant
amount of time, [...]
Supposedly, Boost.Python is pretty good.
Then I discovered a different language (not Haskell) that combined the
ease of Python with the speed of C++.
On Mon, 2007-09-03 at 07:46 +0100, Andrew Cheadle wrote:
. . .
Incidentally, we've often seen a lot of traffic on here about Sudoku
solvers and I've always wanted to post the ECLiPSe solution
(neat when you consider the length of the sudoku/2 predicate ;-) :
Reasonably quick, too -- 50
Hugh Perkins writes:
...
I didnt have a real PC, just a ZX Spectrum. It wasnt real Forth, just
Spectrum Forth. It was kindof fun, but a little disappointing not to
be able to do anything useful with it.
...
Oh, Forth on Sinclair was as decent Forth as any Forth. Indirect threaded
language,
On Mon, Sep 03, 2007 at 02:56:52AM +0200, Bertram Felgenhauer wrote:
Here is a small complete example for illustration:
Thank you for detailed explanation! It is very helpful!
Note that this function receives no additional context in its arguments.
This is convenient but it means that each
Off off off topic: The Z80 DID make it! It was used in many many game
consoles (the best selling Nintendo Gameboy!) and arcade machines,
mostly as a secondary sound synthesiser or IO controller. See
http://en.wikipedia.org/wiki/Zilog_Z80. Even when only counting the
Nintendo Gameboy, the CPU
Hello Alexander,
Monday, September 3, 2007, 11:46:56 AM, you wrote:
In Ocaml and Python a special function is used that takes
a function and an arguments. For example:
value caml_callback(value closure, value arg);
PyObject* PyObject_CallObject(PyObject *func, PyObject *args)
both uses
Hi,
Am Freitag, den 31.08.2007, 16:43 +0100 schrieb Duncan Coutts:
You may also like to pester some ubuntu maintainer person to get the
ubuntu package up to at least the latest debian version.
(I'm also hoping debian will get the Gtk2Hs 0.9.12 package that's been
out for a little while now)
Hugh Perkins wrote:
On 9/3/07, Adrian Hey [EMAIL PROTECTED] wrote:
The popularity of MS
Winders or Office Suite are the obvious examples. We all know why these
are used on 95% or whatever of the worlds PCs, and it has nothing
whatever to do with quality.
Oh come on. You've been reading
On 9/3/07, Adrian Hey [EMAIL PROTECTED] wrote:
FYI, I am old enough to actually remember life before MS and I can
also remember what's happened to the industry at large and to various
the organisations I've worked in and had dealings with over the last
25 years or so.
Fair enough.
On Mon, 2007-09-03 at 02:49 -0400, [EMAIL PROTECTED] wrote:
. . .
I'm sure this isn't the case for you, but a typical Prolog programmer's
idea of large is very different from a typical COBOL programmer's.
Ever the diplomat? :-). Actually that is a fair observation. I don't
think I ever
On Mon, Sep 03, 2007 at 07:46:17AM +0100, Andrew Cheadle wrote:
% ECLiPSe sample code - Sudoku problem
%
%This is a puzzle, originating from Japan
I'm not sure about it. See the History section on
http://en.wikipedia.org/wiki/Sudoku
Apparently Japan was the place where Sudoku started
Well, then you should take a look at Boo... http://boo.codehaus.org
I wrote half a million lines of C# code the last years, and I've looked
at many languages, and currently Haskell is the most beautiful one I
could find. But since I'm still a Haskell newbie, I can't really judge,
but it is my
On Fri, 31 Aug 2007, Brandon S. Allbery KF8NH wrote:
On Aug 31, 2007, at 16:01 , Sterling Clover wrote:
In particular for a function -- n, m, etc or x, y, etc? What about
for f' defined in a let block of f? If I use x y at the top level I
need to use another set below -- is that where x'
In the current Haskell Wiki (haskell.org/haskellwiki) I found references
to articles of the old Hawiki (haskell.org/hawiki), like OnceAndOnlyOnce
and SeparationOfConcerns. Are the files still available somewhere?
___
Haskell-Cafe mailing list
Peter Hercek wrote:
f = g . transform displacement . scale factor
or pointfully
f x = g (transform displacement (scale factor x))
with the appropriate combinators.
Essentially the same idea as the one from Brent Yorgey.
Works fine till the operations can fill easily on one line. Then it does
On Mon, 2007-09-03 at 14:57 +0200, Henning Thielemann wrote:
In the current Haskell Wiki (haskell.org/haskellwiki) I found references
to articles of the old Hawiki (haskell.org/hawiki), like OnceAndOnlyOnce
and SeparationOfConcerns. Are the files still available somewhere?
Ditto for links to
Jules Bean wrote:
I have no idea what you're talking about. It works fine on multiple lines:
f x = g
. transform displacement
. scale factor
$ x
is perfectly valid.
Yes, it is. It is not an issue if you prefer to indent based on previous line
instead of always by the same
On Sat, 2007-09-01 at 23:53 +0200, Benjamin Franksen wrote:
Sven Panne wrote:
Well, on a normal Linux distro a user should *never* have to call cabal (or
any of its cousins) directly, the distro's package manager should be the
used
instead.
This is very theoretical.
Perfect is
On 9/3/07, Peter Verswyvelen [EMAIL PROTECTED] wrote:
Well, then you should take a look at Boo... http://boo.codehaus.org
Yes, I've looked at Boo a little. It looks cool. It made me think
that a lot of language wars boils down not just to the syntactic sugar
that hits one in the face at the
On Mon, 2007-09-03 at 14:57 +0200, Henning Thielemann wrote:
In the current Haskell Wiki (haskell.org/haskellwiki) I found references
to articles of the old Hawiki (haskell.org/hawiki), like OnceAndOnlyOnce
and SeparationOfConcerns. Are the files still available somewhere?
Bring back HaWiki!
Hi
Bring back HaWiki!
I couldn't agree more! We built up an incredible array of articles, by
fantastic authors with stunning content - which we then deleted... I
learnt much from the old wiki, and it would be a shame if others
didn't get that opportunity.
Of course it should be static only,
Peter Hercek wrote:
Jules Bean wrote:
I have no idea what you're talking about. It works fine on multiple
lines:
f x = g
. transform displacement
. scale factor
$ x
is perfectly valid.
Yes, it is. It is not an issue if you prefer to indent based on previous
line
On Mon, Sep 03, 2007 at 11:42:56AM +0200, Joachim Breitner wrote:
Maybe someone here is interesting in being the debian package
maintainer? I’d be able to sponsor the uploads.
I'm interested, but I'm also terribly busy.
If someone else wants it, I won't bother, but if not, I'll do it.
I'm a
Okay. Now the following might not make sense at all, but... isn't the
abstract concept of a list just a sequence of elements (okay, with a
whole lot of extra properties)? So couldn't we write: do { 1;2;3;4 }
instead of [1,2,3,4] somehow for some special list builder monad? And
then do
Dear all,
In the Haskell Wiki at http://www.haskell.org/haskellwiki/Closure
there is an example for a function returning a closure given as
f x = (\y - x + y)
Another way to achieve the same effect would be to write
f' x = (+) x
which to me as a beginner looks somewhat like pointfree style.
On Mon, 2007-09-03 at 19:47 +0200, Lars Oppermann wrote:
Dear all,
In the Haskell Wiki at http://www.haskell.org/haskellwiki/Closure
there is an example for a function returning a closure given as
f x = (\y - x + y)
Another way to achieve the same effect would be to write
f' x = (+)
If I'm not mistaken, in set theory, a closure of R with respect to some
property P is the smallest superset R* that has the property P.
To me, intuitively, a closure C in programming languages is a function
that has bindings to variables declared in parent functions; so the
inner function can
701 - 800 of 102226 matches
Mail list logo
