Does it also let you apply a suggestion automatically?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Gour,
Alex Module is available from
Alex http://xtalk.msk.su/~ott/common/emacs/hs-lint.el
Module is not under some dvcs?
I put it in the main HLint repo last night:
http://www.cs.york.ac.uk/fp/darcs/hlint/data/hs-lint.el
Please send all patches for this particular file via Alex.
Thanks
Wadler's examples are way better than the ones in the documentation. But
without his explanations of what he is doing, the examples alone are pretty
worthless.
I agree that all_about_monads could be a better source for the
documentation, at least for completeness. But even there I would consider
Galchin, Vasili ha scritto:
Hi Manlio,
Are you now talking about code in Code from HsUnix.h and execvpe.h?
Yes.
Manlio
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sjoerd Visscher sjo...@w3future.com writes:
JSON is a UNICODE format, like any modern format is today. ByteStrings
are not going to work.
Well, neither is String as used in the code I responded to. I'm not
intimately familiar with JSON, but I believe ByteStrings would work on
UTF-8 input, and
On Wed, 2009-01-14 at 10:19 +0800, Xie Hanjian wrote:
* John Goerzen jgoer...@complete.org [2009-01-13 12:37:45 -0600]:
To anyone annoyed with Haskell's library install process: you have no
idea how good you have it unless you've tried Ruby and rails.
Disagree. Rubygems is fairly easy
I have written a reference manual for the basic Haskell monad functions, A
Tour of the Haskell Monad functions. It contains a lot of examples. You can
find it at:
http://members.chello.nl/hjgtuyl/tourdemonad.html
Wow! I like these examples. I'm a pragmatist, and although Haskell gave me
Hi,
Here:
http://www.haskell.org/onlinereport/modules.html
I read:
Modules may reference other modules via
explicit import declarations, each giving
the name of a module to be imported and
specifying its entities to be imported.
Modules may be mutually recursive.
However, I get
By popular demand, GHC 6.10.2 will support finalizers that are actually
guaranteed to run, and run promptly. There aren't any API changes: this
happens for finalizers created using newForeignPtr as normal.
However, there's a catch. Previously it was possible to call back into
Haskell from a
Mauricio No. Only sqlite3_exec with INSERT, SELECT stuff,
Mauricio and saving everything that needs structure in pseudo-xml
Mauricio strings. Not that efficient, but easy to change to blobs when
Mauricio everything is ready and tested.
I see...I'm thinking to maybe store only paths for bigger
Hello,
On Wednesday 14 January 2009 12:59, Mauricio wrote:
Hi,
Here:
http://www.haskell.org/onlinereport/modules.html
I read:
Modules may reference other modules via
explicit import declarations, each giving
the name of a module to be imported and
specifying its
Erik de Castro Lopo wrote:
Don Stewart wrote:
Well, the number one thing is to use Cabal and the cabal-install tool.
That is the simplest way to avoid headaches.
I'm sure cabal works very well for many people, but for anyone who
has used Debian based distributions for some time, cabal
AV == Andrea Vezzosi writes:
AV Does it also let you apply a suggestion automatically?
Not, i'll look for this suggestion, but i'm not sure, that this is possible
--
With best wishes, Alex Ott, MBA
http://alexott.blogspot.com/ http://xtalk.msk.su/~ott/
Hi.
This is of course a personal opinion, but I think the interface of:
fileAccess :: FilePath - Bool - Bool - Bool - IO Bool
http://haskell.org/ghc/docs/latest/html/libraries/unix/System-Posix-Files.html#v:fileAccess
is not very good.
Is it possible to design (in theory) a better interface?
On Tue, 13 Jan 2009, Jan Christiansen wrote:
I would be very interested in functions that can be improved with respect to
non-strictness as test cases for my work.
See the List functions in
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/utility-ht
Version 0.0.1 was before
Don Stewart ha scritto:
manlio_perillo:
Hi.
During a tentative (quite unsuccessfull) to convert a simple Python
script that prints on stdout a directory and all its subdirectory [1] in
a good Haskell (mostly to start to do real practice with the language),
I came across this blog post:
Hi.
There are two features found in Python language, that I would like to
see in Haskell.
1) In a Python string it is available the \U{name} escape, where name is
a character name in the Unicode database.
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
2) In Python it is
On Wed, Jan 14, 2009 at 1:14 PM, Simon Marlow marlo...@gmail.com wrote:
By popular demand, GHC 6.10.2 will support finalizers that are actually
guaranteed to run, and run promptly. There aren't any API changes: this
happens for finalizers created using newForeignPtr as normal.
Does this
Hi
1) In a Python string it is available the \U{name} escape, where name is
a character name in the Unicode database.
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Hmm, looks nice, and sensible. But as soon as you've got \N{} syntax I want:
foo\E{show i}bar
i.e.
2009/1/14 Neil Mitchell ndmitch...@gmail.com:
Hi
1) In a Python string it is available the \U{name} escape, where name is
a character name in the Unicode database.
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Hmm, looks nice, and sensible. But as soon as you've got
Thanks Simon,
great stuff; I like the introduction of these 'native code finalizers',
they've
been sorely missed at times.
You don't say, but will there be a dynamic check to catch such re-entries?
--sigbjorn
On 1/14/2009 04:14, Simon Marlow wrote:
By popular demand, GHC 6.10.2 will
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Hmm, looks nice, and sensible. But as soon as you've got \N{} syntax I
want:
foo\E{show i}bar
i.e. embed expressions in strings. I think this would be fantastic.
why not simpy foo\E{i}bar ?
What if i is a string? You'd
On Wed, Jan 14, 2009 at 3:12 PM, Neil Mitchell ndmitch...@gmail.com wrote:
2) In Python it is possible to import modules inside a function.
In Haskell something like:
joinPath' root name =
joinPath [root, name]
importing System.FilePath (joinPath)
Looks a bit ugly, but
Johan Tibell wrote:
On Wed, Jan 14, 2009 at 1:14 PM, Simon Marlow marlo...@gmail.com wrote:
By popular demand, GHC 6.10.2 will support finalizers that are actually
guaranteed to run, and run promptly. There aren't any API changes: this
happens for finalizers created using newForeignPtr as
Sigbjorn Finne wrote:
Thanks Simon,
great stuff; I like the introduction of these 'native code finalizers',
they've
been sorely missed at times.
You don't say, but will there be a dynamic check to catch such re-entries?
There is (now) a dynamic check, yes.
Cheers,
Simon
Neil Mitchell ha scritto:
Hi
1) In a Python string it is available the \U{name} escape, where name is
a character name in the Unicode database.
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Hmm, looks nice, and sensible. But as soon as you've got \N{} syntax I want:
When Haskell was designed there was a bried discussion (if my memory
serves me) to have import be a decl, so it could occur anywhere a
normal declaration can occur.
I kinda like the idea, but some people didn't and it never happened.
-- Lennart
On Wed, Jan 14, 2009 at 3:12 PM, Neil Mitchell
Neil Mitchell ndmitch...@gmail.com writes:
1) In a Python string it is available the \U{name} escape, where name is
a character name in the Unicode database.
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Why not:
import Unicode.Entities as U
foo =
On Tue, Jan 13, 2009 at 9:27 PM, Peter Hercek pher...@gmail.com wrote:
Hi,
Any idea why ghc 6.10.1 is still in Testing repository on archlinux?
I have some idea :P
The obvious reason: we wanted to minimize the amount of breakage the
upgrade would cause. My guess was that the most common usage
Hi all,
I get a stack overflow when I want to insert a huge, lazy list into a Map.
I have changed the insertion algo to use foldl to make it tail-recursive
but still get a stack overflow as the insert remains lazy.
Could CPS be a solution in these cases?
Günther
The question of imperative versus pure declarative coding has brought to my
mind some may be off-topic speculations. (so please don´t read it if you
have no time to waste): I´m interested in the misterious relation bentween
mathematics, algoritms and reality (see
Hi Eugene,
tried that, but since the action to be evaluated is the insertion into a
structure that won't work.
The strictness here doesn't go deep enough, it stopps short.
Günther
Am 14.01.2009, 18:27 Uhr, schrieb Eugene Kirpichov ekirpic...@gmail.com:
Use foldl' ?
2009/1/14 Günther
Hi
I have changed the insertion algo to use foldl to make it tail-recursive but
still get a stack overflow as the insert remains lazy.
Try foldl' and insertWith' - that should work.
Thanks
Neil
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
What I would really like to see is locally scoped imports but with
parameterized modules. (so modules could take types and values as
parameters)
The places where I most want a feature like this is when I have a group of
helper functions that need a value that is outside the modules scope, but
that
Having an import/module feature like this would replace almost all cases
where someone might wish for a macro system for Haskell.
Don't say that until you've tried Lisp macros... read some of Paul Graham's
essays or try some Common Lisp for yourself... macros can be an incredibly
powerful tool,
joinPath' root name = import.System.FilePath.joinPath [root,name]
How is this different from
joinPath' root name = System.FilePath.joinPath [root,name]
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Wed, Jan 14, 2009 at 10:13 AM, David Leimbach leim...@gmail.com wrote:
joinPath' root name = import.System.FilePath.joinPath [root,name]
How is this different from
joinPath' root name = System.FilePath.joinPath [root,name]
I'm sorry I didn't mean different, I meant better than? I
Hello Neil,
thanks, that did indeed work.
I guess I shot myself in the foot a bit here ...
Cause my real problem isn't actually with Map but with IxSet (from HAppS)
which to my knowledge does not have some sort of strict insert function.
Me trying to be really clever just used Map as a
On Wed, Jan 14, 2009 at 12:48 PM, Tim Wawrzynczak
inforichl...@gmail.com wrote:
Having an import/module feature like this would replace almost all cases
where someone might wish for a macro system for Haskell.
Don't say that until you've tried Lisp macros... read some of Paul Graham's
On Wed, 2009-01-14 at 19:19 +0100, Günther Schmidt wrote:
Hello Neil,
thanks, that did indeed work.
I guess I shot myself in the foot a bit here ...
Cause my real problem isn't actually with Map but with IxSet (from HAppS)
which to my knowledge does not have some sort of strict insert
You're probably right.
I've played around with LISP macros a little, but it seems that most
of the cases where you would use a macro in LISP you don't need one in
haskell due to lazy evaluation. Although I haven't played around with
them enough to say much one way or another.
Do you know
Well, like many good programming tools, Lisp macros are another
abstraction, but instead of dealing with data, they deal with code.
I didn't know Lisp puts such an emphasis on the difference between
code and data.
___
Haskell-Cafe mailing list
Jonathan Cast wrote:
Haskell already has a couple of abstraction tools for dealing with code.
One is called `first-class functions'; another is called `lazy
evaluation'.
And for all the rest there is TH?
M.
___
Haskell-Cafe mailing list
On Wed, Jan 14, 2009 at 12:56 PM, Martijn van Steenbergen
mart...@van.steenbergen.nl wrote:
Jonathan Cast wrote:
Haskell already has a couple of abstraction tools for dealing with code.
One is called `first-class functions'; another is called `lazy
evaluation'.
And for all the rest there
Tim Wawrzynczak wrote:
Woah fellas, I wasn't trying to start a flame war, I was merely
commenting that those who have not used Lisp don't really understand the
power that macros can have in a language (such as Lisp) that supports
them, and where code and data can be used interchangeably. And
On Wed, Jan 14, 2009 at 10:48 AM, Jonathan Cast
jonathancc...@fastmail.fm wrote:
Do you have an example of
a macro that can't be replaced by higher-order functions and laziness?
I believe I do: one macro I found useful when writing a web app in
Lisp was something I called hash-bind, which binds
Hallo,
On Wed, Jan 14, 2009 at 5:06 PM, Max Rabkin max.rab...@gmail.com wrote:
On Wed, Jan 14, 2009 at 10:48 AM, Jonathan Cast
jonathancc...@fastmail.fm wrote:
Do you have an example of
a macro that can't be replaced by higher-order functions and laziness?
I believe I do: one macro I found
On Wed, 2009-01-14 at 11:06 -0800, Max Rabkin wrote:
On Wed, Jan 14, 2009 at 10:48 AM, Jonathan Cast
jonathancc...@fastmail.fm wrote:
Do you have an example of
a macro that can't be replaced by higher-order functions and laziness?
I believe I do: one macro I found useful when writing a
On Wed, Jan 14, 2009 at 11:11 AM, Alex Queiroz asand...@gmail.com wrote:
I have one for binding GET/POST variables to regular variables
transparently and with error checking, just inside the body of the
macro.
N! You reinvented PHP. What happens if a request variable shadows
the name
Hallo,
On Wed, Jan 14, 2009 at 5:16 PM, Max Rabkin max.rab...@gmail.com wrote:
On Wed, Jan 14, 2009 at 11:11 AM, Alex Queiroz asand...@gmail.com wrote:
I have one for binding GET/POST variables to regular variables
transparently and with error checking, just inside the body of the
macro.
On Wed, Jan 14, 2009 at 1:14 PM, Jonathan Cast jonathancc...@fastmail.fmwrote:
On Wed, 2009-01-14 at 11:06 -0800, Max Rabkin wrote:
On Wed, Jan 14, 2009 at 10:48 AM, Jonathan Cast
jonathancc...@fastmail.fm wrote:
Do you have an example of
a macro that can't be replaced by higher-order
2009/1/14 Tim Wawrzynczak inforichl...@gmail.com:
The reason the macro is better is that the length of the list is known at
compile time, so you don't need to traverse the list to calculate the length
of the list.
Or you could use a real compiler (perhaps even a glorious one) that
does
Simon Marlow wrote:
Sounds like the Debian folks could use some help with automatically
packaging Cabal packages, though.
Well I've joined the debian-haskell mailing list and I'll do what
I can to help.
Erik
--
-
Erik de Castro
Hi all,
I was looking around Stroustrup's website and found a simple program that he
showed how standard library can be used to make the program succinct and
safe. See http://www.research.att.com/~bs/bs_faq2.html#simple-program. I
wondered how a Haskell program equivalent to it looks like and I
Colin Adams wrote:
2009/1/13 Andrew Coppin andrewcop...@btinternet.com:
One of the wonderful things about Haskell is that almost any time anybody
posts code, at least one person will think up an alternative but equivilent
way of achieving the same goal - sometimes by radically different
Krzysztof Skrzętnicki wrote:
My experience from using GHC under Windows XP is very similar. Many
packages (especially those involving bindings to C packages) are at
least painful to build.
+1
Also have to love packages that use Unix-specific features as part of
their build process. (I
Neil Mitchell wrote:
I can't really be blamed for making mistakes before HLint ;-)
Don't worry - self-programming computers are just around the corner... ;-)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
manlio_perillo:
Hi.
This is of course a personal opinion, but I think the interface of:
fileAccess :: FilePath - Bool - Bool - Bool - IO Bool
http://haskell.org/ghc/docs/latest/html/libraries/unix/System-Posix-Files.html#v:fileAccess
is not very good.
Is it possible to design (in
Thank you for the hint. Please try this patch:
http://git.complete.org/hdbc-odbc?a=commitdiff_plain;h=55af38aac8df9f94498680bc54af173851c32d6c
and let me know if it fixes the issue for you.
-- John
kyra wrote:
John Goerzen wrote:
GЭnther Schmidt wrote:
Kyra I've tried any sort of values to
On Wed, 2009-01-14 at 12:45 -0800, Sukit Tretriluxana wrote:
Hi all,
I was looking around Stroustrup's website and found a simple program
that he showed how standard library can be used to make the program
succinct and safe. See
http://www.research.att.com/~bs/bs_faq2.html#simple-program. I
PS Stroustrup's comments about vectors are at best half right; push_back
may extend the vector's length correctly, but operator[] on a vector
certainly does not do bounds checking.
Sure it does, depending on how you configured the STL library. But this is
off topic :)
(defun avg (rest args)
(/ (apply #'+ args) (length args)))
Or as a macro like this:
(defmacro avg (rest args)
`(/ (+ ,@args) ,(length args)))
The reason the macro is better is that the length of the list is known at
compile time, so you don't need to traverse the list to calculate
On Tue, 2009-01-13 at 19:20 +, Andrew Coppin wrote:
I vividle remember Dons repeatedly telling me that I should try out
[some package who's name escapes me], and then discovering that it
doesn't actually work on Windows at all. (Couldn't this critical
information be included somewhere
On 2009 Jan 14, at 9:02, Manlio Perillo wrote:
This is of course a personal opinion, but I think the interface of:
fileAccess :: FilePath - Bool - Bool - Bool - IO Bool
http://haskell.org/ghc/docs/latest/html/libraries/unix/System-Posix-Files.html#v
:fileAccess
is not very good.
The
Hello Jonathan,
Thursday, January 15, 2009, 1:41:23 AM, you wrote:
reverseDouble =
unlines
. intro
. map show
. reverse
. map (read :: String - Double)
. takeWhile (/= end)
. words
using arrows, this may be reversed:
reverseDouble =
Hallo,
On Wed, Jan 14, 2009 at 8:47 PM, Dougal Stanton ith...@gmail.com wrote:
(defun avg (rest args)
(/ (apply #'+ args) (length args)))
Or as a macro like this:
(defmacro avg (rest args)
`(/ (+ ,@args) ,(length args)))
The reason the macro is better is that the length of the list
Duncan Coutts ha scritto:
On Tue, 2009-01-13 at 19:20 +, Andrew Coppin wrote:
I vividle remember Dons repeatedly telling me that I should try out
[some package who's name escapes me], and then discovering that it
doesn't actually work on Windows at all. (Couldn't this critical
With macros you can define new variable binding constructs.
That's something I occasionally miss in Haskell.
-- Lennart
On Wed, Jan 14, 2009 at 6:48 PM, Jonathan Cast
jonathancc...@fastmail.fm wrote:
On Wed, 2009-01-14 at 12:39 -0600, Tim Wawrzynczak wrote:
You're probably right.
On 2009 Jan 14, at 10:26, Neil Mitchell wrote:
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Hmm, looks nice, and sensible. But as soon as you've got \N{}
syntax I want:
foo\E{show i}bar
i.e. embed expressions in strings. I think this would be fantastic.
why not simpy
On 2009 Jan 14, at 10:39, Manlio Perillo wrote:
Neil Mitchell ha scritto:
Hi
1) In a Python string it is available the \U{name} escape, where
name is
a character name in the Unicode database.
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Hmm, looks nice, and sensible. But as
On Wed, 2009-01-14 at 18:59 -0500, Brandon S. Allbery KF8NH wrote:
On 2009 Jan 14, at 10:26, Neil Mitchell wrote:
As an example:
foo = uabc\N{VULGAR FRACTION ONE HALF}
Hmm, looks nice, and sensible. But as soon as you've got \N{}
syntax I want:
foo\E{show i}bar
i.e.
Hi Manlio
Manlio Perillo wrote:
By the way, I have managed to have a working program:
http://hpaste.org/13919
I've made some some minor refinements according
to my own tastes :-)
http://hpaste.org/13919/diff?old=0new=2
Please note that in both cases IO exceptions are not handled.
I would
On Thu, 2009-01-15 at 00:22 +0100, Manlio Perillo wrote:
Duncan Coutts ha scritto:
On Tue, 2009-01-13 at 19:20 +, Andrew Coppin wrote:
I vividle remember Dons repeatedly telling me that I should try out
[some package who's name escapes me], and then discovering that it
doesn't
On Wed, Jan 14, 2009 at 5:04 PM, Paolo Losi pa...@hypersonic.it wrote:
2) I have written some support functions: mapM' and filterM'
Are they well written and generic?
mapM' is generic and already implemented: fmap
(Note that a Monad is also a Functor)
Except for when it isn't, which is
http://www.businessweek.com/the_thread/techbeat/archives/2009/01/nsa_dhs_industr.html?link_position=link3
...
I think that http://www.galois.com is already doing as stated in the
article/ .. I sincerely think there is a segway for Haskell here with
strong and static type
checking..
??
Hi Manlio,
ok .. yeh ... I will have to remove the code in HsUnix.h and/or remove
references. Currently I am trying to finish another Haskell project. I don't
think these include files shouldcause correctness problems, yes? If so, I
will get to this problem later. ???
Regards, Vasili
On Wed,
Would be nice if after a failed build cabal asked whether or not to
upload its log immediately, and (on the hackage side) this led to an
email being sent to the maintainer.
2009/1/15 Duncan Coutts duncan.cou...@worc.ox.ac.uk:
On Thu, 2009-01-15 at 00:22 +0100, Manlio Perillo wrote:
Duncan
Mauricio == Mauricio briqueabra...@yahoo.com writes:
Mauricio You can always uuencode the pictures. Package 'dataenc' seems
Mauricio nice, although I have not used it.
Thanks.
It looks like a nice 'workaround' with base64 encoding.
Sincerely,
Gour
--
Gour | Zagreb, Croatia | GPG key:
Hi,
the first public release of hs-dotnet is now available - a pragmatic
take on interoperating between Haskell (via GHC) and .NET. For
downloads and (some) info, see:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hs-dotnet
http://haskell.forkIO.com/dotnet
Feedback most welcome,
This is terrific, thank you!
btw, this will allow to write Visual Haskell in Haskell :)
2009/1/15 Sigbjorn Finne sigbjorn.fi...@gmail.com:
Hi,
the first public release of hs-dotnet is now available - a pragmatic
take on interoperating between Haskell (via GHC) and .NET. For
downloads and
80 matches
Mail list logo
