I'm looking at a project which involves a GUI where you can insert
components and wire up connections between them. Obviously the
details of what the components are and what code gets executed for
them is domain-specific, however the general idea of graphically
wiring things together is
Lennart Augustsson wrote:
So what would you consider a proof that there are no total Haskell
functions of that type?
Or, using Curry-Howard, a proof that the corresponding logical formula
is unprovable in intuitionistic logic?
It depends on what kind of proof I'm looking for. If I'm looking
Ivan Miljenovic wrote:
On 28 May 2010 15:18, wren ng thornton w...@freegeek.org wrote:
Stefan Monnier wrote:
churchedBool :: t - t - t
Important detail: the precise type is ∀t. t → t → t.
encodeBool x = \t e - if x then t else e
So the type of encodeBool should be:
Bool → ∀t. t → t → t
Hi all,
Is there a GHC flag to turn off all of the Loading package... messages
from Template Haskell?
Thanks,
Michael
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
On 28 May 2010 01:22, Pierre-Etienne Meunier
pierreetienne.meun...@gmail.com wrote:
Then, examining the core (with of course -O3 on)
FYI, -O3 is the same as -O2.
revealed things like :
(GHC.Prim.*##
(GHC.Prim.-## 1.0 (GHC.Prim.**## 2.0 -53.0))
On behalf of the many, many contributors, I am pleased to announce
that the
Haskell Communities and Activities Report
(18th edition, May 2010)
is now available in PDF and HTML formats:
http://haskell.org/communities/05-2010/report.pdf
Yes, of course you have to trust Djinn to believe its proof.
That's no different from having to trust me if I had done the proof by hand.
Our you would have to trust yourself if you did the proof.
BTW, Djinn does not do an exhaustive search, since there are
infinitely many proofs.
(Even if you
On 28 May 2010, at 08:47, Lennart Augustsson wrote:
Yes, of course you have to trust Djinn to believe its proof.
That's no different from having to trust me if I had done the proof
by hand.
Our you would have to trust yourself if you did the proof.
BTW, Djinn does not do an exhaustive
Thank you all for the answers. It seems that a recurring reason is that
being defined as a general type, Either can be used not only to handle
errors, but choice in general. This, however, seems to make Either to
overloaded in my opinion. If I decide that I want to use Either as a way
to
It's interesting to see what will happen to Unity3D. This great casual
game development tool offers support for exporting to iPhone. They are
hit by Apple's new developer license - because they generate code -
but apparently, apps generated by Unity3D do end up in the Apple
store...
Now.. Unity
Nhe most important reference in literature might be Okasaki's Purely functional
data structures:
@book{okasaki1999purely,
title={{Purely functional data structures}},
author={Okasaki, C.},
year={1999},
publisher={Cambridge Univ Pr}
}
-chris
On 28 mei 2010, at 05:23, Casey Hawthorne
Ionut G. Stan ionut.g.s...@gmail.com writes:
Thank you all for the answers. It seems that a recurring reason is
that being defined as a general type, Either can be used not only to
handle errors, but choice in general. This, however, seems to make
Either to overloaded in my opinion. If I
Richard O'Keefe wrote:
If one is giving a *serious* answer, it has to be an answer a
beginner (who has almost certainly never heard of Traversable)
can make sense of, and if it uses functions that are pretty
much certain not to be in said beginner's text book, said
beginner has to be told
Yitzchak Gale g...@sefer.org writes:
My for function was indeed flip map. Perhaps it's not
in any library, but it's often seen on the #haskell IRC
channel. :)
Hmmm, I had never heard of this but going back through my logs I do
indeed find nornagon, jethr0 and jmcarthur all either stating this
Ionut G. Stan wrote:
Thank you all for the answers. It seems that a recurring reason is that
being defined as a general type, Either can be used not only to handle
errors, but choice in general. This, however, seems to make Either to
overloaded in my opinion. If I decide that I want to use
On Fri, May 28, 2010 at 4:45 AM, Chris Eidhof ch...@eidhof.nl wrote:
Nhe most important reference in literature might be Okasaki's Purely
functional data structures:
@book{okasaki1999purely,
title={{Purely functional data structures}},
author={Okasaki, C.},
year={1999},
I have both books.
The challenge is to get something linked from the The Stony Brook
Algorithm Repository (http://www.cs.sunysb.edu/~algorith/) to a
Haskell algorithms/data structures page to promote Haskell.
For those who would not pick up a book (nor web page) with Haskell or
functional in the
Quoth Ivan Lazar Miljenovic ivan.miljeno...@gmail.com,
Whilst the Either type isn't officially used for
errors, that is how it is usually treated in Haskell with the consensus
that Left = failure and Right = success (note that due to how its
defined it also has to be this way for Either's
2010/5/28 Donn Cave d...@avvanta.com:
Quoth Ivan Lazar Miljenovic ivan.miljeno...@gmail.com,
Whilst the Either type isn't officially used for
errors, that is how it is usually treated in Haskell with the consensus
that Left = failure and Right = success (note that due to how its
defined it
*
sure I did enjoy the discussion here Yitzchak Gale. I have already
submitted several questions ,and you guys were very helpful. However , I am
not sure how I will use Haskell other than my Haskell course that has just
finished.
*
On 28 May 2010 14:52, Ivan Lazar Miljenovic
On Thu, May 27, 2010 at 2:44 PM, Pierre-Etienne Meunier
pierreetienne.meun...@gmail.com wrote:
** Advertisement **
Have you tried the library I have written, Data.Rope ?
** End of advertisement **
The algorithmic complexity of most operations on ropes is way better than on
bytestrings : log n
Quoth Vo Minh Thu not...@gmail.com,
...
Control.Monad.Error provides an instance for Either.
... in the mtl transformer library, in case anyone else besides
myself didn't know that. And I see it has to be there because
it depends on the Error typeclass.
(So the documentation for
About as much different as a Data.ByteString from an Array Int Char : there are
several optimizations over a Data.Sequence.Seq that are specific to characters,
for instance file IO using mmap, and the use of blocks (which would have been
possible with about any constant size Storable type, of
Hi there,
I'm trying to use any version of couchdb with Haskell and
Database.CouchDB and I'm not having a ton of luck. I've talked to
others in the past that have used it without a problem so I'm
wondering what it is that I'm doing wrong.
I can connect, and create new databases without a
On Wed, May 26, 2010 at 7:12 PM, Max Bolingbroke batterseapo...@hotmail.com
wrote:
I broadly agree, but pragmatically the notion of orphans is useful for
designing robust libraries, even if the notion is a bit horrible. ...
I guess that a MPTC instance (C t1 .. tn) for class C in module M1 is
On Friday 28 May 2010 20:44:20, Donn Cave wrote:
Quoth Vo Minh Thu not...@gmail.com,
...
Control.Monad.Error provides an instance for Either.
... in the mtl transformer library, in case anyone else besides
myself didn't know that. And I see it has to be there because
it depends on the
On Tue, 2010-05-25 at 22:47 +0100, Mujtaba Boori wrote:
Hello
I am try to solve this equation
Define a higher order function that tests whether two functions ,
both defined on integers , coincide for all integers between 1 and 100
how can I solve this ?
is there any thing in
http://openquark.org/Open_Quark/Download.html
has links to both binary and source downloads.
In general, most things related to CAL and GemCutter,
including papers and videos, seem to have moved
to the Open Quark site:
http://openquark.org/Open_Quark/
Greg
On 2010-May-28, Jens Petersen wrote:
OK. That was probably the most complete answer ever.
Under what license are you releasing DataEx.hs? I'm wondering if I may
use it in my package (under BSD3 license) until something like it is
included in SYB.
Pedro: How are extensions to SYB handled? code.google only seems to
handle issues -
Lennart Augustsson wrote:
Yes, of course you have to trust Djinn to believe its proof.
That's no different from having to trust me if I had done the proof by hand.
Our you would have to trust yourself if you did the proof.
True, though I think I didn't make my point clearly.
The question is,
Thank you for posting both of these links. I've struggled off and on
with trying to understand reactive functional programming; both of these
look like they'll help. Your first example is *delightfully* simple!
Greg
On 2010-May-26, Jinjing Wang wrote:
Dear list,
As I'm learning frp and
Daniel Fischer daniel.is.fisc...@web.de writes:
On Friday 28 May 2010 20:44:20, Donn Cave wrote:
Quoth Vo Minh Thu not...@gmail.com,
...
Control.Monad.Error provides an instance for Either.
... in the mtl transformer library, in case anyone else besides
myself didn't know that. And I see
On Saturday 29 May 2010 01:28:59, Ivan Lazar Miljenovic wrote:
Daniel Fischer daniel.is.fisc...@web.de writes:
On Friday 28 May 2010 20:44:20, Donn Cave wrote:
Quoth Vo Minh Thu not...@gmail.com,
...
Control.Monad.Error provides an instance for Either.
... in the mtl transformer
Daniel Fischer daniel.is.fisc...@web.de writes:
But if you want to have
instance Monad (Either ConcreteType) where ...
, you can have
fail msg = Left someDefaultValue
(or let the value depend on the message) and you can construct
Left someMeaningfulValue in concrete situations.
On Saturday 29 May 2010 02:26:38, Ivan Lazar Miljenovic wrote:
Daniel Fischer daniel.is.fisc...@web.de writes:
But if you want to have
instance Monad (Either ConcreteType) where ...
, you can have
fail msg = Left someDefaultValue
(or let the value depend on the message) and
Under what license are you releasing DataEx.hs? I'm wondering if I may
use it in my package (under BSD3 license) until something like it is
included in SYB.
DataEx.hs as other such code of mine has been written in the hope it
might be useful, or at least instructive. I usually place such code
36 matches
Mail list logo
