I had a situation where I had some related types that all had toString
functions.
Of course in Haskell, lists all have to be composed of values of
exactly the same type, so instead of passing around lists of values
with these related types, I created a polyvariadic function
polyToString so that I
Does this one give the expected error message for Parsec3.1 -
unfortunately I can't test as I'm still using Parsec 2.1.0.1.
parser = block (many digit ? digit)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Sun, 3 Oct 2010, Ben Franksen wrote:
Christopher Done wrote:
Consider the following program:
main = putStrLn $ show $ length [undefined :: a,undefined :: b]
A concrete type of the element in list doesn't need to be determined
at runtime, or any time. a unifies with b, and that unifies
On 3 October 2010 06:51, Michael Snoyman mich...@snoyman.com wrote:
* Does pass.net still exist anywhere? Same for parallel web.
I couldn't find any references to pass.net.
http://www.haskell.org/haskellwiki/Web/Existing_software
I meant that I remember adding it, but I couldn't find any
On Sun, Oct 3, 2010 at 11:59 AM, Christopher Done
chrisd...@googlemail.com wrote:
On 3 October 2010 06:51, Michael Snoyman mich...@snoyman.com wrote:
* Does pass.net still exist anywhere? Same for parallel web.
I couldn't find any references to pass.net.
On 3 October 2010 12:10, Michael Snoyman mich...@snoyman.com wrote:
I would actually do the opposite: we can put the libraries/frameworks
that we are sure *are* active into the Active section and put
everything else into Inactive. I have a feeling we'll be pretty close
on the mark with our
On Sun, Oct 3, 2010 at 12:20 PM, Christopher Done
chrisd...@googlemail.com wrote:
On 3 October 2010 12:10, Michael Snoyman mich...@snoyman.com wrote:
I would actually do the opposite: we can put the libraries/frameworks
that we are sure *are* active into the Active section and put
everything
On 3 October 2010 12:31, Michael Snoyman mich...@snoyman.com wrote:
I think it's fair to say that turbinado is inactive. But keep in mind
that we should probably look at more than just the frameworks:
servers, templating, etc.
Sure, it should be a general rule across the board.
If you don't want to mention r1 explicitly, but want to refer to
target, sources and such only a monadic approach (e.g. Reader
Monad) might be what you want.
On Oct 3, 6:14 am, C K Kashyap ckkash...@gmail.com wrote:
Thanks Emil ... yeah, that works...I was wondering what I could do to
not
On Sunday 03 October 2010 10:43:24, Henning Thielemann wrote:
On Sun, 3 Oct 2010, Ben Franksen wrote:
Christopher Done wrote:
Consider the following program:
main = putStrLn $ show $ length [undefined :: a,undefined :: b]
A concrete type of the element in list doesn't need to be
Andrew Coppin schrieb:
On 30/09/2010 02:56 PM, Henning Thielemann wrote:
In Cabal you can write one module per line and need no separator or
terminator at all.
Really? As far as I can tell, that doesn't work at all...
See e.g.
I just discovered this:
http://www.haskell.org/haskellwiki/Performance/Strictness
See the Haskell Performance Resource box? That's great! I'm going to
make one for our Web articles.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I checked out the video - nice - but I think, understandably, since
its not open source yet, not much of implementations details were
mentioned.
Yes, it's unfortunate.
So, I have this unanswered question nagging in my head. In the
example below, how can I let the makefile writer refer to
On Sun, Oct 3, 2010 at 14:10, Daniel Fischer daniel.is.fisc...@web.de wrote:
On Sunday 03 October 2010 10:43:24, Henning Thielemann wrote:
On Sun, 3 Oct 2010, Ben Franksen wrote:
Christopher Done wrote:
Consider the following program:
main = putStrLn $ show $ length [undefined ::
On Sun, Oct 3, 2010 at 5:22 PM, steffen steffen.sier...@googlemail.com wrote:
If you don't want to mention r1 explicitly, but want to refer to
target, sources and such only a monadic approach (e.g. Reader
Monad) might be what you want.
Thanks Steffen ... would you be able to give me an
Thanks Neil,
main = do
want [file1]
file1 * \x - do
need [file2]
putStrLn Hello
putStrLn World
What if I want to mention file1 only once?
--
Regards,
Kashyap
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hello C,
Sunday, October 3, 2010, 6:59:25 PM, you wrote:
Thanks Neil,
main = do
want [file1]
file1 * \x - do
need [file2]
putStrLn Hello
putStrLn World
What if I want to mention file1 only once?
mention_only_once file action = do
want [file]
file * action
main =
So I went through the Applications_and_libraries/Web_programming page
and pulled out any remaining goodness from it into pages under the
Web/ umbrella and then set it up as a redirect to Web/
I made an infobox which I put on every Web/ page, which makes it very
nice for navigating between the
On Sun, Oct 3, 2010 at 5:33 PM, Christopher Done
chrisd...@googlemail.com wrote:
So I went through the Applications_and_libraries/Web_programming page
and pulled out any remaining goodness from it into pages under the
Web/ umbrella and then set it up as a redirect to Web/
I made an infobox
On Fri, 01 Oct 2010 13:45:00 +0100, you wrote:
I think that the issue is that making things better on Windows (and
likely OS X as well) requires co-ordinated and agreed action across a
number of areas. This means getting a moderate number of people, most
of whom give up their time and effort for
On Sat, 2 Oct 2010 11:02:21 -0700, you wrote:
I imagine someone looking at a lovely app and saying, Wow -- great
interface! I bet it was programmed in Haskell.
While I can agree with the sentiment...well, good luck with that. ;-)
-Steve Schafer
___
On 3 October 2010 17:41, Michael Snoyman mich...@snoyman.com wrote:
Well done, it all looks *very* nice. Regarding Yesod: yes, use the
cube for now, I may eventually make a better logo, but that's it for
the moment.
Righteo.
The only concern I have is the practical web programming
in
Dear Group,
I am trying to create a (relatively) big array,
but it seems I cannot make anything larger
than 2^30 or so. Here is the code:
import Data.Word
import Data.Array.Unboxed
import Control.Monad.ST
import Data.Array.ST
import Control.Exception
import Prelude hiding (catch)
t1 ::
Hello Henry,
Sunday, October 3, 2010, 7:54:49 PM, you wrote:
It looks like array ranges can only be Ints, and not Int64 or Word64 types.
yes, it's Int internally got efficiency reasons. you can do your own
implementation to override this limit :)
--
Best regards,
Bulat
Stephen Tetley wrote:
Does this one give the expected error message for Parsec3.1 -
unfortunately I can't test as I'm still using Parsec 2.1.0.1.
parser = block (many digit ? digit)
Unfortunately, no.
Cheers
Ben
___
Haskell-Cafe mailing list
Henning Thielemann wrote:
On Sun, 3 Oct 2010, Ben Franksen wrote:
Christopher Done wrote:
Consider the following program:
main = putStrLn $ show $ length [undefined :: a,undefined :: b]
A concrete type of the element in list doesn't need to be determined
at runtime, or any time. a unifies
How can I disable the standard arguments 'help' and 'version'?
Cheers
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
I 'm developing a new language in haskell and I need someone to help me. Anyone
would like to help?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Is the language secret? because I'm sure lots of people would like to help
on this mailing list, but you'd need to tell us what help you need first :)
On Sun, Oct 3, 2010 at 8:38 PM, Eduardo Ribeiro asaferibei...@ymail.comwrote:
Hello,
I 'm developing a new language in haskell and I need
No, it is not secret. I'm having trouble to define functions. Take a look at
my code(please be gentle)
http://haskell.1045720.n5.nabble.com/file/n3100036/hai1.hs hai1.hs
--
View this message in context:
http://haskell.1045720.n5.nabble.com/Haskell-Helper-tp3093854p3100036.html
Sent from the
On Sun, Oct 3, 2010 at 1:24 AM, Kevin Jardine kevinjard...@gmail.com wrote:
I had a situation where I had some related types that all had toString
functions.
Of course in Haskell, lists all have to be composed of values of
exactly the same type, so instead of passing around lists of values
On Sun, Oct 3, 2010 at 1:26 PM, Luke Palmer lrpal...@gmail.com wrote:
On Sun, Oct 3, 2010 at 1:24 AM, Kevin Jardine kevinjard...@gmail.com wrote:
I had a situation where I had some related types that all had toString
functions.
Of course in Haskell, lists all have to be composed of values of
I am reading the book `The Haskell Road to Math, Logic, One of
the exercises in the first chapter asks for a function that maps a
string abcd to abbccc and bang! to baannn!. Since
such a function f fixes the empty word, and maps wa to
f(w)a^(length(w)+1) for any word w and any
On Sun, Oct 3, 2010 at 11:18 AM, Bulat Ziganshin
bulat.zigans...@gmail.com wrote:
Hello Henry,
Sunday, October 3, 2010, 7:54:49 PM, you wrote:
It looks like array ranges can only be Ints, and not Int64 or Word64 types.
yes, it's Int internally got efficiency reasons. you can do your own
Luke, I had no idea polyvariadic functions would be controversial.
Yes, in my original case the function would be trivial:
toMonoid k = [toString k]
I do prefer the less cluttered look. I think that
(poly value1 value2 value3)
is easier to follow when the values are all of related types (in
One question I have is whether I can eliminate points in the above
definition of blowup, and write something like
blowup = (++) . (blowup . allButLast, lastToTheLength)
thinking of (++) as a function String x String - String.
Actually (++) is of type String - String - String. When you
On 10/3/10 1:45 PM, Dominique Devriese wrote:
Additionally, you can't combine the functions (blowup . allButLast)
and lastToTheLength into a function that returns a pair like you seem
to attempt. You need a function like the following for that:
comma :: (a - b) - (a - c) - a - (b,c)
comma
Matthias Kilian k...@outback.escape.de writes:
http://www.vimeo.com/15462768
And is there any way to just *download* the video? For people not
using adobe flash?
+1. I'd like to watch video offline on my phone, so Flash isn't really
a good option. It doesn't work on my computer either,
2010/10/3 Ketil Malde ke...@malde.org:
Matthias Kilian k...@outback.escape.de writes:
http://www.vimeo.com/15462768
And is there any way to just *download* the video? For people not
using adobe flash?
+1. I'd like to watch video offline on my phone, so Flash isn't really
a good
Gregory,
2010/10/3 Gregory Crosswhite gcr...@phys.washington.edu:
On 10/3/10 1:45 PM, Dominique Devriese wrote:
Additionally, you can't combine the functions (blowup . allButLast)
and lastToTheLength into a function that returns a pair like you seem
to attempt. You need a function like the
c8h10n4o2 wrote:
No, it is not secret. I'm having trouble to define functions. Take a look
at my code(please be gentle)
http://haskell.1045720.n5.nabble.com/file/n3100036/hai1.hs hai1.hs
Can you explain in a few words what the Func constructor should represent
why it has three arguments? I ask
The problem is there. A function in Hai would be function-name,
arg1,argn=body.
Func stores function name,arguments and body as Strings(I was thinking to
put Func String String String).
The parser func that I wrote so far try to parse a function definition, not
a function call.
But when I try to
On 10/3/10 2:24 PM, Dominique Devriese wrote:
Or you can write it as (liftA2 (,)) as I noted a few lines further in my mail ;)
Dominique
I know, I just mentioned it to increase awareness of the fact that the
instance methods for all the classes in Control.Arrow can equivalently
be
I suggest to pay more attention to haskell's standard library.
allButLast is called init in Data.List module.
Second, do not use explicit recursion. You can capture recursion using
some high-order function like map, filter, foldr and so on:
lastToTheLength xs = map f xs
where f = const . last
c8h10n4o2 wrote:
The problem is there. A function in Hai would be function-name,
arg1,argn=body.
Func stores function name,arguments and body as Strings(I was thinking to
put Func String String String).
The parser func that I wrote so far try to parse a function definition,
not a function
On Sun, Oct 3, 2010 at 11:55 AM, Ben Franksen ben.frank...@online.de wrote:
Stephen Tetley wrote:
Does this one give the expected error message for Parsec3.1 -
unfortunately I can't test as I'm still using Parsec 2.1.0.1.
parser = block (many digit ? digit)
Unfortunately, no.
Cheers
Ben
I like it!
Are the other sections available as well, e.g.,
(if False then else Cafe) Haskell -- Cafe
- Conal
On Sat, Oct 2, 2010 at 11:23 AM, Max Bolingbroke batterseapo...@hotmail.com
wrote:
Hi Cafe,
I implemented the proposed Haskell' feature lambda-case/lambda-if [1]
during the
Antoine Latter wrote:
On Sun, Oct 3, 2010 at 11:55 AM, Ben Franksen ben.frank...@online.de
wrote:
Stephen Tetley wrote:
Does this one give the expected error message for Parsec3.1 -
unfortunately I can't test as I'm still using Parsec 2.1.0.1.
parser = block (many digit ? digit)
Ben Franksen wrote:
The type checker tells you that you are using the same Map with different
key types: at 52:17-19 the key has type [Hai], whereas at 47:16-18 it has
type Hai.
The latter is in your Func case:
s/latter/former/
___
Haskell-Cafe
On 10/3/10 5:52 PM, Victor Nazarov wrote:
I suggest to pay more attention to haskell's standard library.
allButLast is called init in Data.List module.
Second, do not use explicit recursion. You can capture recursion using
some high-order function like map, filter, foldr and so on:
I'm having a problem with a simple monad transformer stack that has me
stumped. Here's the sample code:
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
import Control.Monad.Error
import Control.Monad.State
import Data.Typeable
data SomeError =
Error1
| Error2
| ErrorFail
deriving (Eq,
On 4 October 2010 03:40, Michael Vanier mvanie...@gmail.com wrote:
newtype MyMonad a =
MyMonad ((StateT (MyData a) (Either SomeError) a))
deriving (Monad,
MonadState (MyData a),
MonadError SomeError,
Typeable)
I think it's the `a'. I think it needs to be a
On Sun, Oct 3, 2010 at 9:40 PM, Michael Vanier mvanie...@gmail.com wrote:
{- This doesn't work: -}
newtype MyMonad a =
MyMonad ((StateT (MyData a) (Either SomeError) a))
deriving (Monad,
MonadState (MyData a),
MonadError SomeError,
Typeable)
This
On Sun, Oct 3, 2010 at 11:54 AM, Henry Laxen nadine.and.he...@pobox.comwrote:
I am trying to create a (relatively) big array,
but it seems I cannot make anything larger
than 2^30 or so. Here is the code:
Use a 64-bit machine, where Int is 64 bits wide. Trying to create a larger
array on a
On 10/3/10 7:06 PM, Bryan O'Sullivan wrote:
On Sun, Oct 3, 2010 at 9:40 PM, Michael Vanier mvanie...@gmail.com
mailto:mvanie...@gmail.com wrote:
{- This doesn't work: -}
newtype MyMonad a =
MyMonad ((StateT (MyData a) (Either SomeError) a))
deriving (Monad,
mention_only_once file action = do
want [file]
file * action
main = mention_only_once file1 $ \x - do need [file2]
putStrLn Hello
putStrLn World
Thanks Bulat
I guess even this should work -
On Sun, Oct 3, 2010 at 19:09, Bryan O'Sullivan b...@serpentine.com wrote:
On Sun, Oct 3, 2010 at 11:54 AM, Henry Laxen nadine.and.he...@pobox.com
wrote:
I am trying to create a (relatively) big array,
but it seems I cannot make anything larger
than 2^30 or so. Here is the code:
Use a
At 2010-10-03T22:45:30+02:00, Dominique Devriese wrote:
Additionally, you can't combine the functions (blowup . allButLast)
and lastToTheLength into a function that returns a pair like you seem
to attempt. You need a function like the following for that:
comma :: (a - b) - (a - c) - a -
58 matches
Mail list logo
