Just to add to Carter's message: if you happened to install Xcode 5
anyway, then realized your mistake and uninstalled it and installed
Xcode 4 again, you will STILL have the command line tools that came
with Xcode 5 and your Haskell toolchain will STILL be broken -- and so
far I have been unable
Hi Carter,
Thanks for this heads up! Many of us here are cutting edge Mac users, and
would have been bitten by this.
Darin and I plan to spend some time next month preparing an unofficial
patched version of ghc 7.6 that should play nice with clang / xcode 5,
though at such a time ghc 7.8 will
glad to help.
an alternative for the discerning power user is to install a recent version
of gcc locally (eg 4.8), and build 7.6.3 with that! (or just repoint your
ghc settings file to a locally built version of real gcc.)
yes, assuming we have the time (after all, it's all volunteer time), that
Wow, thank you for the heads up!
f
Le 2013-09-17 05:16, Carter Schonwald a écrit :
Hey everyone,
if you are actively using ghc 7.6 on your mac,
for now please do not install xcode 5.
It will break your ghc install, because 7.6 doesn't know how to
correctly use Clang for the CPP work.
Hey everyone,
if you are actively using ghc 7.6 on your mac,
for now please do not install xcode 5.
It will break your ghc install, because 7.6 doesn't know how to correctly
use Clang for the CPP work. (ghc head / and thus 7.8 will work fine with
xcode 5, thanks to some outstanding work by
Another option: use cabal-dev with --enable-library-profiling. It should do
the trick.
Best regards,
Krzysztof Skrzętnicki
On Wed, Apr 17, 2013 at 11:13 PM, Anatoly Yakovenko
aeyakove...@gmail.comwrote:
___
Haskell-Cafe mailing list
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
My simple way is to move ~/.ghc (or ~/.ghc and ~/.cabal) somewhere else,
then make (e.g. by running cabal update) or edit ~/.cabal/config to say
library profiling, executable profiling and documentation: True, then run
cabal install on one of my projects.
On Wed, Apr 17, 2013 at 5:13 PM,
If the raw SPARQL is rdfs:label D (programming language)@en, what would
the hsparql http://hackage.haskell.org/package/hsparql syntax be?
The docshttps://github.com/robstewart57/hsparql/blob/master/tests/DBPedia.hs
don't
include any language literal examples.
--
Cheers,
Andrew Pennebaker
On Sun, Oct 21, 2012 at 10:41 AM, Andrew Pennebaker
andrew.penneba...@gmail.com wrote:
If the raw SPARQL is rdfs:label D (programming language)@en, what would
the hsparql syntax be?
The docs don't include any language literal examples.
Have you emailed the maintainer of the package? Not all
I can't figure out how to use Data.Random.Source.IO to generate random
numbers in a multiplatform way.
I can generate random numbers in Unix using Data.Random.Source.DevRandom,
and there is an example in the GitHub documentation for Windows using
Data.Random.Source.MWC, but there is no example
Cafe
| Subject: [Haskell-cafe] why do I need class context in declaring data
| constructor?
|
| I had a toy program that encodes simply typed lambda in types. It used
| to work fine with GHC prior to 7.2. But now it no longer compiles.
| Here is a minimal fragment that demonstrates this problem
: haskell-cafe-boun...@haskell.org [mailto:haskell-cafe-
| boun...@haskell.org] On Behalf Of Paul Liu
| Sent: 30 August 2012 20:52
| To: Haskell Cafe
| Subject: [Haskell-cafe] why do I need class context in declaring data
| constructor?
|
| I had a toy program that encodes simply typed lambda
I had a toy program that encodes simply typed lambda in types. It used
to work fine with GHC prior to 7.2. But now it no longer compiles.
Here is a minimal fragment that demonstrates this problem.
{-# LANGUAGE GADTs,
MultiParamTypeClasses,
FlexibleInstances,
FlexibleContexts #-}
Sorry Yuras, I missed this.
It turns out that I made a mistake when trying to pinpoint my problem.
I had started out using WM_COPY_DATA and COPYDATASTRUCT, but upon
facing issues, tried simple sending of a C string and a WM_APP
message. However, that simplifying resulted in me losing the memory
Cross-posted from Haskell-beginners. Apologies for not posting in the
right place (though I am a beginner and have probably made a simpleton
error).
I'm new to Haskell, and have had some good success with FFI so far,
but using Win32's sendMessage to send a pointer in LPARAM or WPARAM is
resulting
On Wed, 2012-07-18 at 18:22 +0200, Simon Peter Nicholls wrote:
Some sending code:
Foreign.C.String.withCWString frustrator $ \s - do
let wParam = System.Win32.Types.castPtrToUINT s ::
System.Win32.Types.WPARAM
Graphics.Win32.sendMessage wnd
Saw this float by in twitter, and it made me a bit sad. Obviously this is still
a large misunderstanding of FP in the larger programming community and it make
me wonder what we FP enthusiasts are doing wrong to not get the message out to
people.
Programming languages that require random
Ben Kolera ben.kol...@gmail.com wrote:
Programming languages that require random senseless voodoo to get an
effect are awesome. Let's make programming hard through poor design.
[1]
[...]
Is it even worth trying to convince people so set in their ways?
Someone saying something as stupid as
I believe you are observing and commiserating over what Paul Graham
famously refers to as the blub paradox[0].
Here is the problem from my perspective. It is a bootstrapping problem: you
have to think FP is good to invest the time to learn it, but you have to
invest a lot of time to learn it
On Tue, Jun 19, 2012 at 05:59:57AM +1000, Ben Kolera wrote:
Saw this float by in twitter, and it made me a bit sad. Obviously
this is still a large misunderstanding of FP in the larger
programming community and it make me wonder what we FP enthusiasts
are doing wrong to not get the message out
On 18 June 2012 22:28, Ertugrul Söylemez e...@ertes.de wrote:
You just have to live with the fact that there will always be a small
percentage of retarded people. It's best to just ignore them.
Well, they're not stupid. Just very stubborn. Like most programmers.
Stupid people can be taught to
Christopher Done chrisd...@googlemail.com wrote:
You just have to live with the fact that there will always be a
small percentage of retarded people. It's best to just ignore them.
Well, they're not stupid. Just very stubborn. Like most programmers.
Stupid people can be taught to be
just to add to the ridiculousness quotient of this conversation
http://web.archive.org/web/20080406183542/http://www.lisperati.com/landoflisp/panel01.html
(i don't know where to find this other than in the web archive.)
ben
On Jun 18, 2012, at 1:44 PM, Christopher Done wrote:
On 18 June 2012
On Mon, Jun 18, 2012 at 1:39 PM, Jonathan Geddes
geddes.jonat...@gmail.comwrote:
I believe you are observing and commiserating over what Paul Graham
famously refers to as the blub paradox[0].
Here is the problem from my perspective. It is a bootstrapping problem:
you have to think FP is good
On Mon, Jun 18, 2012 at 10:51 PM, Ertugrul Söylemez e...@ertes.de wrote:
Indeed there is a line to be drawn here. However, I think I can fit
both kinds of people under the adjective retarded.
Off-topic: it would be even better to avoid using this ugly adjective to
describe anyone, as it is
On Mon, Jun 18, 2012 at 5:21 PM, Gregory Collins g...@gregorycollins.netwrote:
On Mon, Jun 18, 2012 at 10:51 PM, Ertugrul Söylemez e...@ertes.de wrote:
Indeed there is a line to be drawn here. However, I think I can fit
both kinds of people under the adjective retarded.
Off-topic: it
Agreed, definitely out of context now that he has inadvertently cleared that up
since this post. That thing that they say about jumping to assumptions …
definitely well proven and in force today. Shouldn't be posting to mailing
lists so early in the morning. :-/
To be clear though, this post
I'm interested in mentoring any projects related to concurrent data
structure implementation. Is it too late to propose new projects?
http://parfunk.blogspot.com/2012/02/potential-gsoc-haskell-lock-free-data.html
-Ryan
On Mon, Feb 13, 2012 at 7:19 PM, Johan Tibell
On Wed, Feb 15, 2012 at 7:40 PM, Ryan Newton rrnew...@gmail.com wrote:
I'm interested in mentoring any projects related to concurrent data
structure implementation. Is it too late to propose new projects?
http://parfunk.blogspot.com/2012/02/potential-gsoc-haskell-lock-free-data.html
Not
Other than changing the status myself, how do I get a priority
attached to my GSoC proposal?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, Feb 13, 2012 at 3:20 PM, Greg Weber g...@gregweber.info wrote:
Other than changing the status myself, how do I get a priority
attached to my GSoC proposal?
What priorities are you referring to?
-- Johan
___
Haskell-Cafe mailing list
http://hackage.haskell.org/trac/summer-of-code/report/1
There is a column 'Priority'. And there are now several unrated proposals.
On Mon, Feb 13, 2012 at 3:40 PM, Johan Tibell johan.tib...@gmail.com wrote:
On Mon, Feb 13, 2012 at 3:20 PM, Greg Weber g...@gregweber.info wrote:
Other than
It's usually the (potential) mentors who do the rating. I know we did that
two years ago; can't remember last year, though.
On 13 February 2012 23:45, Greg Weber g...@gregweber.info wrote:
http://hackage.haskell.org/trac/summer-of-code/report/1
There is a column 'Priority'. And there are now
Yes. I rated some myself and left a motivation for my rating and waited for
someone to disagree. :) In general I was just trying to help students out
by pushing down proposals that (in my experience) where too hard to
complete in a summer or that were too narrow to benefit a larger portion of
the
On Sun, Jan 22, 2012 at 5:25 PM, David Barbour dmbarb...@gmail.com wrote:
The laws for monads only apply to actual values and combinators of the monad
algebra
You seem to argue that, even in a lazy language like Haskell,
equational laws should be considered only for values, as if they where
Thanks for the reference. I base my opinion on my own observations - e.g.
the repeated failures of attempting to model stream processing with
infinite lists, the relative success of modeling exceptions explicitly with
monads compared to use of `fail` or SomeException, etc..
On Mon, Jan 23, 2012
On Mon, Jan 23, 2012 at 10:45 AM, David Barbour dmbarb...@gmail.com wrote:
the repeated failures of attempting to model stream processing with infinite
lists,
I'm curious about what failures you're talking about.
- Jake
___
Haskell-Cafe mailing list
Space leaks, time leaks, resource leaks, subtle divergence issues when
filtering lists, etc.
On Mon, Jan 23, 2012 at 11:57 AM, Jake McArthur jake.mcart...@gmail.comwrote:
On Mon, Jan 23, 2012 at 10:45 AM, David Barbour dmbarb...@gmail.com
wrote:
the repeated failures of attempting to model
On Sat, Jan 21, 2012 at 8:09 PM, David Barbour dmbarb...@gmail.com wrote:
In any case, I think the monad identity concept messed up. The property:
return x = f = f x
Logically only has meaning when `=` applies to values in the domain.
`undefined` is not a value in the domain.
We can
observably different from `undefined`
If we understand `undefined` as meaning a computation that never ends, then
you cannot ever observe whether one `undefined` is or is not equivalent to
another. In strict languages, this is especially obvious.
In any case, I don't accept a concept of
Отправлено с iPad
22.01.2012, в 20:25, David Barbour dmbarb...@gmail.com написал(а):
Attempting to shoehorn `undefined` into your reasoning about domain algebras
and models and monads is simply a mistake.
No. Using the complete semantics — which includes bottoms aka undefined — is a
2012/1/22 MigMit miguelim...@yandex.ru
Отправлено с iPad
22.01.2012, в 20:25, David Barbour dmbarb...@gmail.com написал(а):
Attempting to shoehorn `undefined` into your reasoning about domain
algebras and models and monads is simply a mistake.
No. Using the complete semantics — which
The do notation translates
do {x - a;f} into
a=(\x - f)
However when we're working in the IO monad the semantics we want requires that
the lambda expression be strict in its argument. So is this a special case for
IO? If I wanted this behavior in other monads is there a way to specify
On 21 Jan 2012, at 21:29, Victor S. Miller wrote:
The do notation translates
do {x - a;f} into
a=(\x - f)
However when we're working in the IO monad the semantics we want requires
that the lambda expression be strict in its argument. So is this a special
case for IO? If I wanted
* Victor S. Miller victorsmil...@gmail.com [2012-01-21 12:29:32-0500]
The do notation translates
do {x - a;f} into
a=(\x - f)
However when we're working in the IO monad the semantics we want
requires that the lambda expression be strict in its argument.
I'm not aware of any semantics
As noted, IO is not strict in the value x, only in the operation that
generates x. However, should you desire strictness in a generic way, it
would be trivial to model a transformer monad to provide it.
E.g.
data StrictT m a = StrictT (m a)
runStrictT :: StrictT m a - m a
runStrictT (StrictT
On 21/01/2012 17:29, Victor S. Miller wrote:
The do notation translates
do {x- a;f} into
a=(\x - f)
However when we're working in the IO monad the semantics we want requires that
the lambda expression be strict in its argument. So is this a special case for
IO? If I wanted this behavior
* David Barbour dmbarb...@gmail.com [2012-01-21 10:01:00-0800]
As noted, IO is not strict in the value x, only in the operation that
generates x. However, should you desire strictness in a generic way, it
would be trivial to model a transformer monad to provide it.
Again, that wouldn't be a
On 21/01/2012 18:08, Steve Horne wrote:
Even so, to see that strictness isn't the issue, imagine that (=)
were rewritten using a unary executeActionAndExtractResult function.
You could easily rewrite your lamba to contain this expression in
place of x, without actually evaluating that
On Sat, Jan 21, 2012 at 10:08 AM, Roman Cheplyaka r...@ro-che.info wrote:
* David Barbour dmbarb...@gmail.com [2012-01-21 10:01:00-0800]
As noted, IO is not strict in the value x, only in the operation that
generates x. However, should you desire strictness in a generic way, it
would be
On Sat, Jan 21, 2012 at 1:45 PM, David Barbour dmbarb...@gmail.com wrote:
On Sat, Jan 21, 2012 at 10:08 AM, Roman Cheplyaka r...@ro-che.info wrote:
* David Barbour dmbarb...@gmail.com [2012-01-21 10:01:00-0800]
As noted, IO is not strict in the value x, only in the operation that
generates
On Sat, Jan 21, 2012 at 10:51 AM, David Menendez d...@zednenem.com wrote:
The Eval monad has the property: return undefined = const e = e.
You can't write `const e` in the Eval monad.
From what I can tell, your proposed monads do not.
You can't write `const e` as my proposed monad,
* David Barbour dmbarb...@gmail.com [2012-01-21 11:02:40-0800]
On Sat, Jan 21, 2012 at 10:51 AM, David Menendez d...@zednenem.com wrote:
The Eval monad has the property: return undefined = const e = e.
You can't write `const e` in the Eval monad.
Why not?
ghci runEval $ return
Oops, I was misreading. You have `e` here as the next monad.
In any case, I think the monad identity concept messed up. The property:
return x = f = f x
Logically only has meaning when `=` applies to values in the domain.
`undefined` is not a value in the domain.
We can define monads - which
On Sat, Jan 21, 2012 at 11:08 AM, Roman Cheplyaka r...@ro-che.info wrote:
* David Barbour dmbarb...@gmail.com [2012-01-21 11:02:40-0800]
On Sat, Jan 21, 2012 at 10:51 AM, David Menendez d...@zednenem.com
wrote:
The Eval monad has the property: return undefined = const e = e.
You
* David Barbour dmbarb...@gmail.com [2012-01-21 11:09:43-0800]
Logically only has meaning when `=` applies to values in the domain.
`undefined` is not a value in the domain.
We can define monads - which meet monad laws - even in strict languages.
In strict languages 'undefined' is not a
(StrictT op) = f = StrictT (op = \ x - x `seq` runStrictT (f x))
Are you sure? Here you evaluate the result, and not the computation itself.
Wouldn't it be:
(StrictT op) = f = op ` seq` StrictT (op = \x - runStrictT (f x))
??
2012/1/21 David Barbour dmbarb...@gmail.com
On Sat, Jan 21, 2012
Evaluating the argument/result was my intention. Evaluating the computation
itself might be useful in some cases, though.
Regards,
Dave
On Sat, Jan 21, 2012 at 3:20 PM, Yves Parès yves.pa...@gmail.com wrote:
(StrictT op) = f = StrictT (op = \ x - x `seq` runStrictT (f x))
Are you sure?
On 23/11/11 19:11, heathmatlock wrote:
Question: Do you want a mascot?
No.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Monday 05 December 2011, 17:03:35, Mark Lentczner wrote:
On 23/11/11 19:11, heathmatlock wrote:
Question: Do you want a mascot?
No.
I thought it was dead. Since it isn't: also no.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Yes
On 23/11/11 19:11, heathmatlock wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Yes.
On Thu, Dec 1, 2011 at 9:39 AM, Paulo J. Matos pa...@matos-sorge.comwrote:
Yes
On 23/11/11 19:11, heathmatlock wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
Yes and I like that one. :D
On Fri, Nov 25, 2011 at 9:46 AM, Liyang HU haskell@liyang.hu wrote:
On 25 November 2011 17:28, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
wrote:
And we already have one: http://paraiso-lang.org/ikmsm/books/c80.html
Uh. W...T...F...???
Do I
Yes
On Wed, Nov 23, 2011 at 1:11 PM, heathmatlock heathmatl...@gmail.com wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
--
Heath Matlock
+1 256 274 4225
___
i wouldn't mind a cool mascot, so yes
hex
--
* my blog is cooler than yours: http://serialhex.github.com
* The wise man said: Never argue with an idiot. They bring you down to
their level and beat you with experience.
* As a programmer, it is your job to put yourself out of business. What
you
heathmatlock heathmatlock at gmail.com writes:
Question: Do you want a mascot?
Yes
And we already have one: http://paraiso-lang.org/ikmsm/books/c80.html
/Liyang
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 25 November 2011 19:13, Liyang HU haskell@liyang.hu wrote:
heathmatlock heathmatlock at gmail.com writes:
Question: Do you want a mascot?
Yes
And we already have one: http://paraiso-lang.org/ikmsm/books/c80.html
Uh. W...T...F...???
Do I want to know what's going on there? :p
On 25 November 2011 17:28, Ivan Lazar Miljenovic ivan.miljeno...@gmail.com
wrote:
And we already have one: http://paraiso-lang.org/ikmsm/books/c80.html
Uh. W...T...F...???
Do I want to know what's going on there? :p
It's called Reduce! λ Girl, a parody of Invade! Squid Girl.
On Friday 25 November 2011, 09:28:29, Ivan Lazar Miljenovic wrote:
On 25 November 2011 19:13, Liyang HU haskell@liyang.hu wrote:
heathmatlock heathmatlock at gmail.com writes:
Question: Do you want a mascot?
Yes
And we already have one: http://paraiso-lang.org/ikmsm/books/c80.html
Yes.
2011/11/24 Colin Adams colinpaulad...@gmail.com
No.
On 23 November 2011 19:11, heathmatlock heathmatl...@gmail.com wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
No.
Am Mittwoch, den 23.11.2011, 13:11 -0600 schrieb heathmatlock:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
___
Haskell-Cafe mailing list
2011/11/23 Giovanni Tirloni gtirl...@sysdroid.com:
2. It floods people with email they don't care (unless they care to keep
track of the results)
Not that I care that much about a mascot (I like the lamb though), but
a few threads about it hardly counts for a flooding.
Besides, a good email
I have the same position. want a good mascot... Count this as yes.
2011/11/23 Gábor Lehel illiss...@gmail.com:
I don't want a bad mascot. I do want a good mascot.
If you must count me down for one side or the other, count this as a yes.
On Wed, Nov 23, 2011 at 8:11 PM, heathmatlock
David Virebayre dav.vire+hask...@gmail.com writes:
Also, this is café, right ? Aren't people subscribed to this list
supposed to expect a broad range of topics ?
I don't mind a broad range of topics, but using it to collect polls is
IMHO abusing it. I guess I can dust off the killfiling
@Wolfgang Jeltsch: I'm sorry, that was indeed my intension.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
And also: Yes!
(sorry for double post)
On 24 November 2011 20:51, philipp siegmantel
philipp.siegman...@googlemail.com wrote:
@Wolfgang Jeltsch: I'm sorry, that was indeed my intension.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
No
On 24 November 2011 06:11, heathmatlock heathmatl...@gmail.com wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
No
On 23 Nov 2011, at 23:11, heathmatlock wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
No
--
Scott Lawrence
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Yes
On Wed, Nov 23, 2011 at 19:11, heathmatlock heathmatl...@gmail.com wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
___
Haskell-Cafe mailing list
Yes
PS: Why not using Doodle for the poll?
signature.asc
Description: Digital signature
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I don't want a bad mascot. I do want a good mascot.
If you must count me down for one side or the other, count this as a yes.
On Wed, Nov 23, 2011 at 8:11 PM, heathmatlock heathmatl...@gmail.com wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if
Yes
Reasoning:
Haskell has the image of being unfriendly, assenine, filled with crazy symbols,
and the dreaded MATHS! A mascot would say you know what, this is fun!
if (*ra4 != 0xffc78948) { return false; }
On 23 Nov 2011, at 19:40, Alexander Bernauer wrote:
Yes
PS: Why not using
On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer alex-hask...@copton.net
wrote:
Yes
PS: Why not using Doodle for the poll?
Email is an easy way to make sure nobody votes twice.
--
Heath Matlock
+1 256 274 4225
___
Haskell-Cafe mailing list
Yes
2011/11/23 heathmatlock heathmatl...@gmail.com
On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer
alex-hask...@copton.net wrote:
Yes
PS: Why not using Doodle for the poll?
Email is an easy way to make sure nobody votes twice.
--
Heath Matlock
+1 256 274 4225
Yes
If some people don't like it, they won't use it.
I doubt it will find its way in highly technical haskell core team, but
it could appear for fun here and there in web material. For example,
I think we could have 3 variants of it, reflecting the haskell level
(beginner, confirmed, guru).
2011/11/23 heathmatlock heathmatl...@gmail.com:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
{^_^}
|||
2011/11/23 Alejandro Serrano Mena trup...@gmail.com
Yes
2011/11/23 heathmatlock heathmatl...@gmail.com
On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer
alex-hask...@copton.net wrote:
Yes
PS: Why not using Doodle for the poll?
Email is an easy way to make sure
On Wed, Nov 23, 2011 at 5:52 PM, heathmatlock heathmatl...@gmail.comwrote:
On Wed, Nov 23, 2011 at 1:40 PM, Alexander Bernauer
alex-hask...@copton.net wrote:
Yes
PS: Why not using Doodle for the poll?
Email is an easy way to make sure nobody votes twice.
1. It's unlikely to get
I second this.
One way is to use Forms from Google Docs.
1. They have been used with success before for similar pools
2. Can provide more elaborate questions
3. Automatically put results into a spreadsheet, which is useful
4. Protect against double-voters (sort of)
5. No spam
Best regards,
heathmatlock wrote:
Question: Do you want a mascot?
No.
I also really think this poll should have been in a web
site somewhere and not on this list.
Erik
--
--
Erik de Castro Lopo
http://www.mega-nerd.com/
On Wed, Nov 23, 2011 at 2:25 PM, Giovanni Tirloni gtirl...@sysdroid.comwrote:
1. It's unlikely to get feedback from the larger Haskell community
2. It floods people with email they don't care (unless they care to keep
track of the results)
3. One can just as easily create throw-away emails,
I wouldn't mind getting a lamb-astronaut tshirt with a lambda-bind
logo on it for my kid, and maybe next month a lion-skateboarder with a
lambda-bind on his deck, and then maybe something with a dinosaur.
I guess I don't really want a mascot either, but I like this artwork.
Conrad.
On 24
I closed the poll, it's showing 51% no and 50% yes, 129 to 128 respectively.
I also found out you can vote as many times as you want without
restriction, with no IP logging whatsoever. This is why I don't like
putting polls on places where users regularly use anonymity for their own
agendas, e.g.
Before sleeping, I would like to point out as of right now there are 12 up
votes and 5 down votes, 70% yes and 30% no for the topic on Reddit. It
doesn't necessarily reflect the view on the question being posed, but it
seems about right from my discussions. With that, I will try to refrain
from
Yes
2011/11/24 Conrad Parker con...@metadecks.org:
I wouldn't mind getting a lamb-astronaut tshirt with a lambda-bind
logo on it for my kid, and maybe next month a lion-skateboarder with a
lambda-bind on his deck, and then maybe something with a dinosaur.
I guess I don't really want a mascot
No.
On 23 November 2011 19:11, heathmatlock heathmatl...@gmail.com wrote:
Question: Do you want a mascot?
Answers:
Yes
No
--
This is an attempt to figure out if this idea is going anywhere.
___
Haskell-Cafe mailing list
If you are to describe a system, which consists of several subsystems, how do
you approach the problem? What types, classes, functions whatever do you
introduce?
I guess it is a common problem, is there a general method? Just to describe,
not to solve (though if the description implies the
1 - 100 of 453 matches
Mail list logo
