On Tue, Oct 25, 2011 at 4:34 AM, wren ng thornton w...@freegeek.org wrote:
I'm not so sure about that exemption. The experimental stability level
seems to be the norm on Hackage and often means I use this for real
projects, but because I use it for real projects I'm not quite willing to
hammer
On 25 October 2011 18:54, Gregory Collins g...@gregorycollins.net wrote:
On Tue, Oct 25, 2011 at 4:34 AM, wren ng thornton w...@freegeek.org wrote:
I'm not so sure about that exemption. The experimental stability level
seems to be the norm on Hackage and often means I use this for real
Ivan Lazar Miljenovic ivan.miljeno...@gmail.com writes:
Right, but first we need to define what all those terms _mean_... and
it's no good saying your package is stable if you change the API in
a large-scale fashion every release.
I think there are better criteria to use, like:
- do exported
On Tue, Oct 25, 2011 at 11:17, Ketil Malde ke...@malde.org wrote:
Ivan Lazar Miljenovic ivan.miljeno...@gmail.com writes:
Right, but first we need to define what all those terms _mean_... and
it's no good saying your package is stable if you change the API in
a large-scale fashion every
On 25 October 2011 20:17, Ketil Malde ke...@malde.org wrote:
Ivan Lazar Miljenovic ivan.miljeno...@gmail.com writes:
Right, but first we need to define what all those terms _mean_... and
it's no good saying your package is stable if you change the API in
a large-scale fashion every release.
So I'm combining Haskell software with some non-free/closed source work.
I was wondering what sort of effort it would take to organise a blanket
license for everything in the Haskell Platform, and whether it would be
worthwhile to anybody.
Here's my use case:
- I am combining my Haskell [:-)]
On 25 October 2011 21:37, Eric Y. Kow eric@gmail.com wrote:
So I'm combining Haskell software with some non-free/closed source work.
I was wondering what sort of effort it would take to organise a blanket
license for everything in the Haskell Platform, and whether it would be
worthwhile to
On Tue, Oct 25, 2011 at 06:37:49AM -0400, Eric Y. Kow wrote:
- My user is concerned that a large number of having a large number of
individual licenses even though textually identical modulo author,
date, etc would mean a big hassle getting their lawyers and their
user's lawyers to sign
On Tue, Oct 25, 2011 at 21:46:21 +1100, Ivan Lazar Miljenovic wrote:
- My user is concerned that a large number of having a large number of
individual licenses even though textually identical modulo author,
date, etc would mean a big hassle getting their lawyers and their
user's lawyers
One possible solution (which would avoid a blanket license) would be to
have a tool generate SPDX (http://spdx.org/ and
http://www.linuxfoundation.org/collaborate/workgroups/spdx) metadata
from cabal metadata. SPDX (software package data exchange) is a format
for machine-readable descriptions
On Tue, Oct 25, 2011 at 2:17 AM, Ketil Malde ke...@malde.org wrote:
Ivan Lazar Miljenovic ivan.miljeno...@gmail.com writes:
Right, but first we need to define what all those terms _mean_... and
it's no good saying your package is stable if you change the API in
a large-scale fashion every
Max Rabkin max.rab...@gmail.com writes:
This is useful information, but to call it stability is not only
misleading, but it also prevents the package from using that field to
indicate whether or not it is stable!
Oh, right - I'm not much interested in the stability of a package. What
I want
IANAL, but I'll bite, since I have needed to live with this for quite some
time now. Obviously readers are directed to take independent legal advice
before they do anything for themselves, and all of the other standard
disclaimers.
On 25 October 2011 11:58, Eric Y. Kow eric@gmail.com wrote:
On Tue, Oct 25, 2011 at 10:40 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 25 October 2011 16:02, Rustom Mody rustompm...@gmail.com wrote:
On Mon, Oct 24, 2011 at 10:16 AM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
On 24 October 2011 13:51, Rustom Mody
Dear all,
We are currently seeking two new Lecturers (Assistant Professors)
in Computer Science at the University of Nottingham, UK. These
posts are available from 1st January 2012 on a fixed-term basis
for three years. Applications from within the area of functional
programming would be most
On Mon, Oct 24, 2011 at 11:55:53AM -0700, David Barbour wrote:
Thanks.
Diagrams package seems it could be promising for a declarative UI model -
i.e. integration with functional reactive programming and similar models -
so long as I'm willing to sacrifice `native` look and feel, which
On Mon, Oct 24, 2011 at 01:58:33PM -0700, Jason Dagit wrote:
On Sun, Oct 23, 2011 at 11:47 AM, Brent Yorgey byor...@seas.upenn.edu wrote:
I am pleased to announce the release of version 0.4 of diagrams, a
full-featured framework and embedded domain-specific language for
declarative drawing.
Eric Y. Kow wrote:
So I'm combining Haskell software with some non-free/closed source work.
I was wondering what sort of effort it would take to organise a blanket
license for everything in the Haskell Platform, and whether it would be
worthwhile to anybody...
- My user is concerned that a
I have an application in mind where concurrent access to large arrays (up to
millions of elements) of mostly small elements (Int or Double) is common.
Typical access patterns would be chunk-wise, i.e. reads or writes from index
n up to index m. Imagine stuff like images, scientific data, etc.
As far as I lnow the function 'unsafeIOToSTM' is not transactional in nature
- IO actions will be performed immediately and are not rolled back, and are
then re-performed on retry.
On Oct 25, 2011 12:49 PM, Ben Franksen ben.frank...@online.de wrote:
I have an application in mind where concurrent
Hi,
Can someone provide guidance on how handle operator precedence and
associativity with Polyparse?
Thanks in advance.
-Tom
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, Oct 25, 2011 at 10:47 AM, Ben Franksen ben.frank...@online.dewrote:
The main question is: does the STM transaction actually see that I
changed
part of the underlying array, so that the transaction gets re-tried? Or do I
have to implement this manually, and if yes: how?
Create an
On 26 October 2011 02:17, Rustom Mody rustompm...@gmail.com wrote:
In the Data.GraphViz.Types.Generalised page you have the starting line:
It is sometimes useful to be able to manipulate a Dot graph as an actual
graph. This representation lets you do so...
Evidently some other context is
David Barbour wrote:
On Tue, Oct 25, 2011 at 10:47 AM, Ben Franksen
ben.frank...@online.dewrote:
The main question is: does the STM transaction actually see that I
changed
part of the underlying array, so that the transaction gets re-tried? Or do
I
have to implement this manually, and
Ben Franksen ben.frank...@online.de writes:
An array of TVars is certainly *much* too inefficient for what I have in
mind w.r.t. both memory and cpu time.
You must be a lot more confident than I if you say this without
benchmarking first. :-) IME, there are (at least) two possible problems
Are the archives of this list searchable?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
In response to this:
dbanas@dbanas-eeepc:~$ cabal install arrows
Resolving dependencies...
Configuring lazysmallcheck-0.6...
Preprocessing library lazysmallcheck-0.6...
Building lazysmallcheck-0.6...
[1 of 1] Compiling Test.LazySmallCheck ( Test/LazySmallCheck.hs,
dist/build/Test/LazySmallCheck.o
On Tue, Oct 25, 2011 at 1:24 PM, Ketil Malde ke...@malde.org wrote:
You must be a lot more confident than I if you say this without
benchmarking first. :-) IME, there are (at least) two possible problems
here, 1) transactions scale (quadratically, I think) with the number of
TVars touched, so
Cap'n:
http://www.mail-archive.com/haskell-cafe@haskell.org/
But I usually just use a search engine.
Tom / amindfv
On Tue, Oct 25, 2011 at 4:27 PM, Captain Freako capn.fre...@gmail.comwrote:
Are the archives of this list searchable?
___
On Tuesday 25 October 2011, 22:32:23, Captain Freako wrote:
dbanas@dbanas-eeepc:~$ cabal install base
and got this:
Resolving dependencies...
cabal: internal error: impossible
Is it really impossible to use cabal to reinstall `base'?
Fortunately, yes. Reinstalling base is impossible
Ketil Malde wrote:
Ben Franksen ben.frank...@online.de writes:
An array of TVars is certainly *much* too inefficient for what I have in
mind w.r.t. both memory and cpu time.
You must be a lot more confident than I if you say this without
benchmarking first. :-)
Ok, not science, but an
On 10/25/11 1:27 PM, Captain Freako wrote:
Are the archives of this list searchable?
http://news.gmane.org/group/gmane.comp.lang.haskell.cafe . A newsreader like
thunderbird makes searching especially quick.
___
Haskell-Cafe mailing list
I am very pleased to officially announce Hac Boston, a Haskell hackathon to
be held January 21-23, 2012 at MIT in Cambridge, MA.
The hackathon will officially kick off at 2:30 Friday afternoon, and go
until 5pm on Sunday with the occasional break for sleep.
Everyone is welcome -- you do not have
Correction: January 20-22nd ;)
On Tue, Oct 25, 2011 at 5:45 PM, Edward Kmett ekm...@gmail.com wrote:
I am very pleased to officially announce Hac Boston, a Haskell hackathon
to be held January 21-23, 2012 at MIT in Cambridge, MA.
The hackathon will officially kick off at 2:30 Friday
On 26 October 2011 06:37, Tom Hawkins tomahawk...@gmail.com wrote:
Hi,
Can someone provide guidance on how handle operator precedence and
associativity with Polyparse?
Do you mean parsing something like 1 + 2 * 3 ? I don't think
there's any real difference in using Polyparse vs Parsec for
Isn't the question just about packages included in the Haskell
Platform, for which The current set of [acceptable] licenses is just
the BSD3 license:
http://trac.haskell.org/haskell-platform/wiki/AddingPackages#Interimlicensepolicy
http://trac.haskell.org/haskell-platform/ticket/85
It might be
Can someone provide guidance on how handle operator precedence and
associativity with Polyparse?
Do you mean parsing something like 1 + 2 * 3 ? I don't think
there's any real difference in using Polyparse vs Parsec for this,
except for doing p `orElse` q rather than try p | q.
Actually, I
On 26 October 2011 10:49, Tom Hawkins tomahawk...@gmail.com wrote:
Can someone provide guidance on how handle operator precedence and
associativity with Polyparse?
Do you mean parsing something like 1 + 2 * 3 ? I don't think
there's any real difference in using Polyparse vs Parsec for this,
Thanks, Daniel.
So, do you have any advice for me, with regard to solving this issue:
Implicit import declaration:
Could not find module `Prelude':
Perhaps you haven't installed the dyn libraries for package `base'?
?
That is, how do I get the dynamic versions of the `base' package
On Wednesday 26 October 2011, 02:00:49, Captain Freako wrote:
So, do you have any advice for me, with regard to solving this issue:
Implicit import declaration:
Could not find module `Prelude':
Perhaps you haven't installed the dyn libraries for package
`base'?
?
That is, how
On 26 October 2011 11:15, Daniel Fischer
daniel.is.fisc...@googlemail.com wrote:
On Wednesday 26 October 2011, 02:00:49, Captain Freako wrote:
So, do you have any advice for me, with regard to solving this issue:
Implicit import declaration:
Could not find module `Prelude':
Perhaps
Patrick LeBoutillier patrick.leboutillier at gmail.com writes:
[...]
exprt = Ap (Const mapt) (Const idt)
test = runTI $ tiExpr initialEnv [] exprt
When I execute the test function above in ghci I get:
([],TVar (Tyvar v3 Star)).
I was expecting someting like below for the type
42 matches
Mail list logo
