G'day all.
I asked:
But more to the point: Can it send email?
Quoting John Dorsey [EMAIL PROTECTED]:
Can you give an example of a use case?
I don't need one. It's not maximally flexible until it can send email.
Cheers,
Andrew Bromage
___
G'day all.
Quoting Lennart Augustsson [EMAIL PROTECTED]:
But I called it One.
That's a _terrible_ name. One, surely is (), just as Zero is Void.
While I'm at it, I really don't like the lexical syntax of comments.
Someone should fix that.
Cheers,
Andrew Bromage
On Thu, 2 Oct 2008 14:46:32 -0700, Jason Dusek
[EMAIL PROTECTED] wrote:
John Dorsey [EMAIL PROTECTED] wrote:
Now you can:
* Solve any of the software problems that cannot be solved without
the singleton tuple !
What would those be? I'm still trying to figure out how a
singelton tuple
On Thu, Oct 2, 2008 at 7:51 AM, jean-christophe mincke
[EMAIL PROTECTED] wrote:
Hello,
Thank you for your comments.
Would not it be feasible to add constraints at type definition, something
like, in a somewhat free style syntax
data String2 = String2 (s::String) with length s = 5
and
Hello,
One of my interests based on my education is grand challenge science.
Ok .. let's take the CERN Hadrian Accelerator.
Where do you think Haskell can fit into the CERN Hadrian effort
currently?
Where do you think think Haskell currently is lacking and will have to
be improved
Jason Dagit [EMAIL PROTECTED] wrote:
Jason Dusek [EMAIL PROTECTED] wrote:
John Dorsey [EMAIL PROTECTED] wrote:
Now you can:
* Solve any of the software problems that cannot be
solved without the singleton tuple !
What would those be? I'm still trying to figure out how a
Hi
You mean shared libraries without the opportunity to
inline library code?
This would result in a huge performance loss, I think.
Usually _mild_ performance loss, in exchange for major code-size
savings, I would think. C obviously has worked quite fine under
exactly this
About two hours ago, I sent two follow-ups to the Announcing
OneTuple-0.1.0 thread on the Haskell-Cafe mailing list, neither of
which has appeared in either my newsreader or my Inbox, even though
they have both appeared on the Web archive; viz.:
[Haskell-cafe] Re: Announcing OneTuple-0.1.0
Quoting Lennart Augustsson [EMAIL PROTECTED]:
But I called it One.
I did a similar one for Yhc, and I think I called it Box. My guess was
that boxing/unboxing wasn't an overloaded enough term :-)
Thanks
Neil
==
On Wed, Oct 1, 2008 at 7:38 PM, Don Stewart [EMAIL PROTECTED] wrote:
Awesome, native packages now available,
http://aur.archlinux.org/packages.php?ID=20422
Thanks Don!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
I'm trying to encode a well-known, informally-specified type system in
Haskell. What causes problems for me is that type classes force types
to be of a specific kind. The system I'm targeting however assumes that
its equivalent of type classes are kind-agnositic.
For instance, I've got
class
2008/10/3 Galchin, Vasili [EMAIL PROTECTED]:
Hello,
One of my interests based on my education is grand challenge science.
Ok .. let's take the CERN Hadrian Accelerator.
Where do you think Haskell can fit into the CERN Hadrian effort
currently?
Where do you think think Haskell
John,
Thank you for your reply. I benchmarked HDBC.ODBC with MySQL and it is
indeed working well. So whatever slow results I used to get were due
to that particular setup. It looks that HDBC will suit my needs as
well.
Thanks,
--A
What's more, HDBC has a stronger and more versatile API than
Let me pick one example. Let's make a class that can convert between
tuples and lists.
Of course there are restriction when this works, but it can still be useful.
class TupleList t l | t - l where
tupleToList :: t - l
listToTuple :: l - t
instance TupleList () [a] where
tupleToList
2008/10/3 Benjamin L. Russell [EMAIL PROTECTED]:
About two hours ago, I sent two follow-ups to the Announcing
OneTuple-0.1.0 thread on the Haskell-Cafe mailing list, neither of
which has appeared in either my newsreader or my Inbox, even though
they have both appeared on the Web archive; viz.:
2008/10/3 Mitchell, Neil [EMAIL PROTECTED]:
Hi
You mean shared libraries without the opportunity to
inline library code?
This would result in a huge performance loss, I think.
Usually _mild_ performance loss, in exchange for major code-size
savings, I would think. C obviously has
Magnus Therning wrote:
On Wed, Oct 1, 2008 at 6:03 PM, Simon Marlow [EMAIL PROTECTED] wrote:
[..]
Dynamic linking doesn't solve all the problems, we still have the problem
that GHC does a lot of cross-module inlining, regardless of whether dynamic
linking is used. However, I really would like
On Fri, 2008-10-03 at 12:22 +0200, Florian Weimer wrote:
I'm trying to encode a well-known, informally-specified type system in
Haskell. What causes problems for me is that type classes force types
to be of a specific kind. The system I'm targeting however assumes that
its equivalent of type
On Fri, Oct 3, 2008 at 4:22 AM, Florian Weimer [EMAIL PROTECTED] wrote:
I'm trying to encode a well-known, informally-specified type system in
Haskell. What causes problems for me is that type classes force types
to be of a specific kind. The system I'm targeting however assumes that
its
* Derek Elkins:
On Fri, 2008-10-03 at 12:22 +0200, Florian Weimer wrote:
I'm trying to encode a well-known, informally-specified type system in
Haskell. What causes problems for me is that type classes force types
to be of a specific kind. The system I'm targeting however assumes that
its
...gigabytes of data per second that they end up keeping, out of the
petabytes that are produced in the first place...
Sounds like a good application for lazy evaluation! (Actually, they may have
to read over it all to make sure they can throw it away...)
On Fri, Oct 3, 2008 at 6:47 AM, Dougal
On Fri, Oct 3, 2008 at 07:47, Dougal Stanton [EMAIL PROTECTED]wrote:
2008/10/3 Galchin, Vasili [EMAIL PROTECTED]:
Hello,
One of my interests based on my education is grand challenge
science.
Ok .. let's take the CERN Hadrian Accelerator.
Where do you think Haskell can
Dougal Stanton wrote:
2008/10/3 Galchin, Vasili [EMAIL PROTECTED]:
Hello,
One of my interests based on my education is grand challenge science.
Ok .. let's take the CERN Hadrian Accelerator.
Where do you think Haskell can fit into the CERN Hadrian effort
currently?
Where do you
On Fri, Oct 3, 2008 at 12:59 PM, Simon Marlow [EMAIL PROTECTED] wrote:
Magnus Therning wrote:
On Wed, Oct 1, 2008 at 6:03 PM, Simon Marlow [EMAIL PROTECTED]
wrote:
[..]
Dynamic linking doesn't solve all the problems, we still have the problem
that GHC does a lot of cross-module inlining,
Magnus Therning wrote:
On Fri, Oct 3, 2008 at 12:59 PM, Simon Marlow [EMAIL PROTECTED] wrote:
Magnus Therning wrote:
On Wed, Oct 1, 2008 at 6:03 PM, Simon Marlow [EMAIL PROTECTED]
wrote:
[..]
Dynamic linking doesn't solve all the problems, we still have the problem
that GHC does a lot of
On Oct 3, 2008, at 09:24 , Manlio Perillo wrote:
Manlio Perillo ha scritto:
However I have noted that there are some difference in the syntax
between Alex and Flex?
What is the rationale?
By the way, here is the list of differences between Alex and Flex I
have found, for people
* Luke Palmer:
For instance, I've got
class Assignable a where
assign :: a - a - IO ()
class Swappable a where
swap :: a - a - IO ()
class CopyConstructible a where
copy :: a - IO a
class (Assignable a, CopyConstructible a) = ContainerType a
class (Swappable c, Assignable
Am Freitag, 3. Oktober 2008 13:36 schrieben Sie:
[…]
What happens in the C++ world where good chunk of functionnalities are
in header files (templates or inline methods);
is there the same LGPL problem that the one discussed here w.r.t.
static/shared linking ?
I've never heard about
Lennart Augustsson [EMAIL PROTECTED] wrote:
Let me pick one example. Let's make a class that can convert
between tuples and lists.
-- XXX This doesn't work, and is just wrong.
-- instance TupleList (a) [a] where
--tupleToList (a) = [a]
--listToTuple [a] = (a)
It's not clear to me
On Fri, Oct 3, 2008 at 4:36 AM, minh thu [EMAIL PROTECTED] wrote:
2008/10/3 Mitchell, Neil [EMAIL PROTECTED]:
Hi
You mean shared libraries without the opportunity to
inline library code?
This would result in a huge performance loss, I think.
Usually _mild_ performance
On Fri, 2008-10-03 at 10:08 -0700, David Leimbach wrote:
On Fri, Oct 3, 2008 at 4:36 AM, minh thu [EMAIL PROTECTED] wrote:
2008/10/3 Mitchell, Neil [EMAIL PROTECTED]:
Hi
You mean shared libraries without the opportunity to
Tillmann Rendel wrote:
Seriously, what are you talking about? The haddock page for
Control.Applicative hoogle links to begins with
This module describes a structure intermediate between a functor and
a monad: it provides pure expressions and sequencing, but no binding.
(Technically, a strong
On Fri, Oct 3, 2008 at 9:49 AM, Luke Palmer [EMAIL PROTECTED] wrote:
On Fri, Oct 3, 2008 at 4:22 AM, Florian Weimer [EMAIL PROTECTED] wrote:
I'm trying to encode a well-known, informally-specified type system in
Haskell. What causes problems for me is that type classes force types
to be of a
Manlio Perillo ha scritto:
Manlio Perillo ha scritto:
Hi.
I'm starting to write a CSS parser with Alex and Happy.
The grammar is defined here:
http://www.w3.org/TR/CSS21/grammar.html
However I have noted that there are some difference in the syntax
between Alex and Flex?
What is the
David Menendez wrote:
On Thu, Oct 2, 2008 at 3:40 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
David Menendez wrote:
You could try using an exception monad transformer here
I thought I already was?
No, a monad transformer is a type constructor that takes a monad as an
Andrew Coppin wrote:
But on the other hand, that would seem to imply that every monad is
trivially applicative, yet studying the libraries this is not the
case. Indeed several of the libraries seem to go out of their way to
implement duplicate functionallity for monad and applicative. (Hence
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Wolfgang Jeltsch wrote:
Am Donnerstag, 2. Oktober 2008 20:33 schrieben Sie:
Wolfgang Jeltsch wrote:
You mean shared libraries without the opportunity to inline library code?
This would result in a huge performance loss, I think.
Usually _mild_
Manlio Perillo ha scritto:
[...]
Another problem.
In this rule:
@comment= \/\*[^\*]*\*+([^\/\*][^\*]*\*+)*\/
[^\*] means all characters except '*', but Alex seems to not include
the new line character.
Again sorry.
The problem was not here.
There was a missing rule for '.', to
Andrew Coppin wrote:
After much searching (Hoogle rather failed me here), I discover that...
I could probably elaborate on that point further.
Try doing a Hoogle search for c1 (c2 x) - c2 (c1 x). Hoogle correctly
states that Data.Traversable.sequence will do it for you.
Now try doing c1 k
Andrew Coppin wrote:
(As an aside, Control.Monad.ap is not a function I've ever heard of.
It seems simple enough, but what an unfortunate name...!)
I think it makes sense. It stands for apply, or at least that is what
I think of when I see it. If we have a function f :: A - B - C - D
and
Hi
Gour wrote:
Don == Don Stewart [EMAIL PROTECTED] writes:
Don * Only a small percent of Haskell libarires are LGPL, and
Don nothing for which we don't have workarounds (e.g. HDBC vs
Don galois-sqlite3 vs takusen).
Hmm, Gtk2Hs wxhaskell - major GUI libs...
wxHaskell uses a
Jake McArthur wrote:
Andrew Coppin wrote:
(As an aside, Control.Monad.ap is not a function I've ever heard of.
It seems simple enough, but what an unfortunate name...!)
I think it makes sense. It stands for apply, or at least that is
what I think of when I see it.
There can be little doubt
On Fri, Oct 3, 2008 at 1:39 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
David Menendez wrote:
Applicative is a class of functors that are between Functor and Monad
in terms of capabilities. Instead of (=), they have an operation
(*) :: f (a - b) - f a - f b, which generalizes Control.Monad.ap.
On Fri, Oct 3, 2008 at 3:10 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
Jake McArthur wrote:
Andrew Coppin wrote:
But on the other hand, that would seem to imply that every monad is
trivially applicative, yet studying the libraries this is not the case.
Actually, it is the case. It is
Jake McArthur wrote:
Andrew Coppin wrote:
But on the other hand, that would seem to imply that every monad is
trivially applicative, yet studying the libraries this is not the case.
Actually, it is the case. It is technically possible to write:
instance Monad m = Applicative m where
wchogg:
On Fri, Oct 3, 2008 at 5:47 AM, Dougal Stanton [EMAIL PROTECTED] wrote:
2008/10/3 Galchin, Vasili [EMAIL PROTECTED]:
Hello,
One of my interests based on my education is grand challenge science.
Ok .. let's take the CERN Hadrian Accelerator.
Where do you think
On Fri, Oct 3, 2008 at 3:17 AM, Jason Dusek [EMAIL PROTECTED] wrote:
Perhaps I am lacking in imagination, but I still can't see the
value of one tuples.
You can use them to defeat seq.
undefined `seq` x == undefined
OneTuple undefined `seq` x == x
That might be useful if a polymorphic
Andrew Coppin wrote:
Oh, no. The entire bar is 2 Kg, I wasn't actually planning to eat the
whole thing! o_O My god, my pancreas would explode or something...
My Dad once ate two bars of dark cooking chocolate. He said he got some
odd visual distortions; flickering auras around things, and
On Fri, Oct 3, 2008 at 12:10 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
Again, it looks like MonadPlus == Monad + Monoid, except all the method
names are different. Why do we have this confusing duplication?
MonadPlus is a class for type constructors, generic over the type of
the elements:
David Menendez wrote:
On Fri, Oct 3, 2008 at 1:39 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
(As an aside, Control.Monad.ap is not a function I've ever heard of. It
seems simple enough, but what an unfortunate name...!)
I believe it's short for apply.
Yeah, but shame about the
David Menendez wrote:
For some monads, there are implementations of * which are more
efficient than the one provided by ap. Similarly, there are ways to
implement fmap which are more efficient than using liftM.
Of course, the *real* reason we don't define the instance given above
is that there
On Fri, Oct 3, 2008 at 12:43 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
factorise n = do
x - [1..]
y - [1..]
if x*y == n then return (x,y) else fail not factors
This is a very stupid way to factorise an integer. (But it's also very
general...) As you may already be aware, this fails
Paul Johnson wrote:
Andrew Coppin wrote:
Oh, no. The entire bar is 2 Kg, I wasn't actually planning to eat the
whole thing! o_O My god, my pancreas would explode or something...
My Dad once ate two bars of dark cooking chocolate. He said he got
some odd visual distortions; flickering auras
Hallo,
Andrew Coppin wrote:
In other news... apparently chocolate is leathaly toxic to dogs. Random.
Chicolate is extremely toxic to cats.
Cheers,
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Andrew Coppin wrote:
run_or s0 x y =
let
either_rset1 = sequence $ run s0 x
either_rset2 = sequence $ run s0 y
either_rset3 = do rset1 - either_rset1; rset2 - either_rset2;
return (merge rset1 rset2)
in case either_rset3 of
Left e- throwError e
Right rset - lift
On Fri, 2008-10-03 at 20:43 +0100, Andrew Coppin wrote:
David Menendez wrote:
It wasn't until fairly recently that people realized
that you could do useful things if you had return and ap, but not
(=), which why we have some unfortunate limitations in the Haskell
prelude, like Applicative
Ryan Ingram wrote:
Newtypes is the general ( sadly unsatisfactory) answer:
Oh dear. Well that _is_ pretty unsatisfactory...
Given the constraints of the Haskell type system, could we do better in
principle?
___
Haskell-Cafe mailing list
On Oct 3, 2008, at 15:10 , Andrew Coppin wrote:
The reason for the separation of the two for many functions is so
that types which are instances of only one of the two can still
take advantage of the functionality.
Well, that makes sense once you assume two seperate, unconnected
classes.
Jonathan Cast wrote:
On Fri, 2008-10-03 at 20:43 +0100, Andrew Coppin wrote:
OK. So it's broken for compatibility then? (Presumably any time you
change something from the Prelude, mass breakage ensues!)
I'm not a big fan of backward-compatibility myself, but changing Monad
to be a
On Fri, 2008-10-03 at 21:02 +0100, Andrew Coppin wrote:
Jonathan Cast wrote:
On Fri, 2008-10-03 at 20:43 +0100, Andrew Coppin wrote:
OK. So it's broken for compatibility then? (Presumably any time you
change something from the Prelude, mass breakage ensues!)
I'm not a big
Hey folks,
I know it seems an obtuse OS to build on, but trust me, it's pretty
nice despite the hassles.
I'm getting these three errors (repeated a few times) while building
gtkhs-0.9.13 on ghc 6.8.3, and was hoping for any suggestions on where
to go from here:
But (a) is not a lifted version of a, whereas (a,b) is a lifted
version of the a b product.
So it's not consistent, and thereby wrong.
-- Lennart
On Fri, Oct 3, 2008 at 6:07 PM, Jason Dusek [EMAIL PROTECTED] wrote:
Lennart Augustsson [EMAIL PROTECTED] wrote:
Let me pick one example. Let's
Brandon S. Allbery KF8NH wrote:
On Oct 3, 2008, at 15:10 , Andrew Coppin wrote:
Again, it looks like MonadPlus == Monad + Monoid, except all the
method names are different. Why do we have this confusing duplication?
Because typeclasses aren't like OO classes. Specifically: while you
can
On Fri, 2008-10-03 at 12:59 -0700, Jonathan Cast wrote:
On Fri, 2008-10-03 at 21:02 +0100, Andrew Coppin wrote:
Jonathan Cast wrote:
On Fri, 2008-10-03 at 20:43 +0100, Andrew Coppin wrote:
OK. So it's broken for compatibility then? (Presumably any time you
change something from
On Oct 3, 2008, at 15:38 , Paul Johnson wrote:
Andrew Coppin wrote:
Oh, no. The entire bar is 2 Kg, I wasn't actually planning to eat
the whole thing! o_O My god, my pancreas would explode or
something...
My Dad once ate two bars of dark cooking chocolate. He said he got
some odd visual
Andrew Coppin wrote:
I was thinking more, why not just delete MonadPlus completely, and
have any function that needs a monad that's also a monoid say so in
its context? (Obviously one of the answers to that is because it
would break vast amounts of existing code.)
Because they are not the
Brandon S. Allbery KF8NH ha scritto:
On Oct 3, 2008, at 09:24 , Manlio Perillo wrote:
Manlio Perillo ha scritto:
However I have noted that there are some difference in the syntax
between Alex and Flex?
What is the rationale?
By the way, here is the list of differences between Alex and Flex
On Fri, 2008-10-03 at 21:12 +0100, Andrew Coppin wrote:
Brandon S. Allbery KF8NH wrote:
On Oct 3, 2008, at 15:10 , Andrew Coppin wrote:
Again, it looks like MonadPlus == Monad + Monoid, except all the
method names are different. Why do we have this confusing duplication?
Because
Jake McArthur wrote:
Andrew Coppin wrote:
I was thinking more, why not just delete MonadPlus completely, and
have any function that needs a monad that's also a monoid say so in
its context? (Obviously one of the answers to that is because it
would break vast amounts of existing code.)
On Fri, Oct 3, 2008 at 3:43 PM, Andrew Coppin
[EMAIL PROTECTED] wrote:
David Menendez wrote:
It wasn't until fairly recently that people realized
that you could do useful things if you had return and ap, but not
(=), which why we have some unfortunate limitations in the Haskell
prelude, like
On Fri, 2008-10-03 at 15:38 -0400, David Menendez wrote:
On Fri, Oct 3, 2008 at 3:17 AM, Jason Dusek [EMAIL PROTECTED] wrote:
Perhaps I am lacking in imagination, but I still can't see the
value of one tuples.
You can use them to defeat seq.
undefined `seq` x == undefined
OneTuple
derek.a.elkins:
On Fri, 2008-10-03 at 15:38 -0400, David Menendez wrote:
On Fri, Oct 3, 2008 at 3:17 AM, Jason Dusek [EMAIL PROTECTED] wrote:
Perhaps I am lacking in imagination, but I still can't see the
value of one tuples.
You can use them to defeat seq.
undefined `seq` x
Lennart Augustsson [EMAIL PROTECTED] wrote:
But (a) is not a lifted version of a, whereas (a,b) is a lifted
version of the a b product.
So it's not consistent, and thereby wrong.
Well, we can't represent the unlifted product in Haskell,
right? You have to use some constructor. So if we
On 3 Oct 2008, at 23:50, Andrew Coppin wrote:
For what it's worth, 80% of my diet is cheese, and 10% is chocolate.
Remind me not to take food out of your hands, OK?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 2008 Oct 3, at 16:08, Lally Singh wrote:
I know it seems an obtuse OS to build on, but trust me, it's pretty
nice despite the hassles.
I'm getting these three errors (repeated a few times) while building
gtkhs-0.9.13 on ghc 6.8.3, and was hoping for any suggestions on where
to go from
On Fri, Oct 3, 2008 at 2:38 PM, Don Stewart [EMAIL PROTECTED] wrote:
wchogg:
On Fri, Oct 3, 2008 at 5:47 AM, Dougal Stanton [EMAIL PROTECTED]
wrote:
2008/10/3 Galchin, Vasili [EMAIL PROTECTED]:
Hello,
One of my interests based on my education is grand challenge
science.
Ok
On Tue, Sep 30, 2008 at 6:25 PM, Anatoly Yakovenko
[EMAIL PROTECTED] wrote:
has the with syntax described in
http://www.haskell.org/pipermail/haskell/2005-May/015815.html
been replaced with the where syntax?
so
data Foo a where
FooInt :: FooInt
the same thing as
data Foo A = FooInt
I have to write in C++ everyday. I just worked at D*ll .. a total train
wreck . software very unstable .. written in C++ Maybe a lot of blame
can be put at the door of very lazy people; however, in my opinion, the
strong/static type checking seriously corral lazy developers. I have
found
On 2008 Oct 3, at 15:50, Andrew Coppin wrote:
Paul Johnson wrote:
Andrew Coppin wrote:
Oh, no. The entire bar is 2 Kg, I wasn't actually planning to eat
the whole thing! o_O My god, my pancreas would explode or
something...
My Dad once ate two bars of dark cooking chocolate. He said he
So the issue is one writer, many readers across processes? Creating
an actual mini-db-server might be the proper way to do this. Expose a
simple socket by which other processes can query the DB state. If you
need persistence between runs of your main server you can always
snapshot on
What /is/ it with haskell-cafe lately?
Do we need a haskell-blah mailing list? I would subscribe to that. Hell,
I would post to it probably more than I post to haskell-cafe. But I'd
also divert it to a separate mailbox for when I have too much free time.
Maybe call it haskell-cafe-cafe?
On Fri, Oct 3, 2008 at 8:01 PM, Christopher Lane Hinson
[EMAIL PROTECTED] wrote:
What /is/ it with haskell-cafe lately?
Do we need a haskell-blah mailing list?
Thanks for saying it. +1.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Andrew Coppin wrote:
ap generalizes the liftM* functions, so
liftM2 f a b = return f `ap` a `ap` b
liftM3 f a b c = return f `ap` a `ap` b `ap` c
and so forth.
Now that at least makes sense. (It's non-obvious that you can use it for
this. If it weren't for curried functions, this wouldn't
Andrew Coppin wrote:
run_or s0 x y =
let
either_rset1 = sequence $ run s0 x
either_rset2 = sequence $ run s0 y
either_rset3 = do rset1 - either_rset1; rset2 - either_rset2;
return (merge rset1 rset2)
in case either_rset3 of
Left e- throwError e
Right rset - lift
On Fri, Oct 3, 2008 at 2:29 PM, Jason Dusek [EMAIL PROTECTED] wrote:
Lennart Augustsson [EMAIL PROTECTED] wrote:
But (a) is not a lifted version of a, whereas (a,b) is a lifted
version of the a b product.
So it's not consistent, and thereby wrong.
Well, we can't represent the unlifted
Hello,
Here is a site I discovered a while back for another language ... I
guess in the back of my mind this more where
I was going vis-a-vis scientific computing http://www.enthought.com/
Kind regards, Vasili
___
Haskell-Cafe mailing list
On 2008 Oct 3, at 21:01, Christopher Lane Hinson wrote:
What /is/ it with haskell-cafe lately?
Do we need a haskell-blah mailing list? I would subscribe to that.
Hell, I would post to it probably more than I post to haskell-cafe.
But I'd also divert it to a separate mailbox for when I
G'day all.
Quoting Don Stewart [EMAIL PROTECTED]:
How about EDSLs for producing high assurance controllers, and other
robust devices they might need. I imagine the LHC has a good need for
verified software components...
On a related topic, I'm curious if anyone apart from me has been
On Oct 3, 2008, at 8:26 PM, Galchin, Vasili wrote:
Here is a site I discovered a while back for another
language ... I guess in the back of my mind this more where
I was going vis-a-vis scientific computing http://www.enthought.com/
I interned at Enthought over this last summer;
Something that has irked me in the past about System.Process is the inability
to obtain an OS system handle from the haskell Process handle. Such a facility
would greatly enhance the interoperabity of c and haskell libraries.
Provision is made (although not standardised) to obtain OS specific
I recently had a need to use the IsFunction typeclass described by Oleg here:
http://okmij.org/ftp/Haskell/isFunction.lhs
and am wondering if the use of the TypeCast class can be correctly
replaced by a type equality constraint.
The IsFunction and TypeCast classes were defined as:
data HTrue
On Fri, Oct 3, 2008 at 7:26 PM, Tim Chevalier [EMAIL PROTECTED] wrote:
On Fri, Oct 3, 2008 at 2:29 PM, Jason Dusek [EMAIL PROTECTED] wrote:
Lennart Augustsson [EMAIL PROTECTED] wrote:
But (a) is not a lifted version of a, whereas (a,b) is a lifted
version of the a b product.
So it's not
On Fri, Oct 3, 2008 at 7:24 PM, Luke Palmer [EMAIL PROTECTED] wrote:
Well, unboxed tuples are not really lifted nor unlifed, since you
can't even pass one to a function.
It's true that unboxed tuples are not first-class. But what I mean by
unlifted is that the type (# Int, Int #), when
On Fri, Oct 3, 2008 at 8:32 PM, Tim Chevalier [EMAIL PROTECTED] wrote:
On Fri, Oct 3, 2008 at 7:24 PM, Luke Palmer [EMAIL PROTECTED] wrote:
Well, unboxed tuples are not really lifted nor unlifed, since you
can't even pass one to a function.
It's true that unboxed tuples are not first-class.
Let me recuse myself What is the nature of the open source license?
Vasili
On Fri, Oct 3, 2008 at 8:39 PM, Jeff Wheeler [EMAIL PROTECTED] wrote:
On Oct 3, 2008, at 8:26 PM, Galchin, Vasili wrote:
Here is a site I discovered a while back for another language ... I
guess in the
95 matches
Mail list logo
