I wondered if anyone knew the legalities of using the haskell logo, in
particular, this one:
http://media.nokrev.com/junk/haskell-logos/logo1.png
on a website, a personal blog in particular. While I am not yet a primarily
haskell coder, I'm using it more and more. I find this logo in particular to
On 6/25/11 1:34 AM, Evan Laforge wrote:
> So there's a range of possible Monoid instances for each type,
More for some types than for others. For Maybe there are three:
* always take the first/left value;
* always take the last/right value;
* or, use a semigroup operation defined on the values
Not being especially mathematically inclined, every once and a while I
get a little panicked when I notice that, e.g. Data.Map mappend is a
plain left-biased union, and doesn't actually mappend the values of
the map.
Then I remember that monoids are associative, not commutative, and
it's totally a
Hi Justin, this message might be better on the haskell-cafe list (or
the excellent beginers list!).
When you tried to write the get/put implementations, what problems
were you running into?
Antoine
On Sat, Jun 25, 2011 at 7:50 AM, Justin Bailey wrote:
> I'd like to carry around some state when
(forgot to CC the list)
On Jun 24, 2011, at 8:27 PM, Daniel Patterson wrote:
> It looks, from looking at the provided instances (not from having done it
> myself), that you need to define safeConvert functions to and from your
> value. Here is a partial list of conversions to and from String.
>
Hi *,
The title is self-explanatory. I'd like to store information from
an algebraic data type in an SQL database, but the type signature of
toSql (toSql
:: Data.Convertible.Base.Convertible a SqlValue => a -> SqlValue)
doesn't make sense to me.
How is this done (how do I make an instan
what haskell compiler are you using? And what does the "include" line do?
That does not look like a GHC error message (the only compiler I'm familiar
with), but it seems like it is saying that you should not have the extra
newlines between the function type signature and declaration. - that's o
On Thu, 23 Jun 2011, larry.liuxinyu wrote:
I think that version is still a brute-force solution. The only difference is
that it uses EOF (sentinel) so that it can sort the
suffixes instead of rotations.
However, the big-O complexity is the same.
Let's take the rbwt for example:
> rbwt xs = l
I found the library myself, and i already put the code in that site:
http://hpaste.org/48277
That's what i have tried to do for making the task by calling the one
string function by another one:
include kursovazadacha
parse :: [a] -> [a]
parse [] = []
parse (x:xs) = eval (x:xs)
The error
What have you tried to do in order to make it work for the list, and what error
results? What is confusing about the error message? More generally, how could
you transform an operation on a single string into one that does the same thing
to a list of strings? You've probably talked about higher
Hello all,
I am experiencing some issues to do my course task in university.
I have to write a calculator- function in Haskell. The function
argument is a list of strings and also form such list, as each string
of the argument made definite action:
- If the string has the form of an arithmetic _e
On Thu, Jun 23, 2011 at 9:14 PM, wren ng thornton wrote:
> On 6/23/11 4:30 PM, Alexander Solla wrote:
> > Please read "Fast and Loose Reasoning is Morally Correct".
> >
> http://www.comlab.ox.ac.uk/people/jeremy.gibbons/publications/fast+loose.pdf
> >
> > As I have told you before, it is perfectl
Announcing the Hackage release of two new versions[1,2] of the random-
fu package:
Version 0.1.4 is a build-fix release that extends support of the 0.1
API to GHC 7.
Version 0.2 is a significantly restructured version of the package.
Its API is mostly the same as the old for end users, bu
On 23/06/2011 11:30 PM, Jack Henahan wrote:
My solution for the '[0] with a link far down the page' issue is just to search
for '[0]'.
My solution is to never read the text version and only ever read the
HTML version. Works great for me. :-)
___
Hi,
Examples are very helpful to me too -- thank you for sharing. I'm especially
curious to see if there are any examples that allow you to use or convert
non-iteratee-based functions. I have only just begun reading about iteratees
and might be missing the point, but it seems like many of the exam
On Fri, 24 Jun 2011 15:11:59 +0200, David Place wrote:
Hi,
I've been trying to learn Iteratee IO. I've made some progress by
studying John Millikin's examples in the source of the enumerator
package.
I was surprised how confusing I found the tutorials that are available.
I think that
On Thu, Jun 23, 2011 at 6:37 PM, Felipe Almeida Lessa <
felipe.le...@gmail.com> wrote:
> On Thu, Jun 23, 2011 at 6:53 PM, Rogan Creswick
> wrote:
> > Short, obfsucated, urls may direct you places you don't want to go,
> > but I fail to see how that concern applies to HWN: since each url is
> > ac
Erik de Castro Lopo:
> Manuel M T Chakravarty wrote:
>
>> In fact, you are better of not to know. Given that GHC (like all
>> non-trivial software) surely infringes on some patents, the damages
>> that a patent holder can sue you for are less if you do not know about
>> the patents you are infrin
Hi,
I've been trying to learn Iteratee IO. I've made some progress by studying
John Millikin's examples in the source of the enumerator package.
I was surprised how confusing I found the tutorials that are available. I
think that it is primarily because of the lack of concrete examples. It w
On 21/06/2011 10:02, Herbert Valerio Riedel wrote:
Hello Simon,
On Fri, 2011-06-17 at 09:05 +0100, Simon Marlow wrote:
What's happening there? The actual processing work seems to be done in a
single HEC... but what are the remaining 11 HECs doing exactly? Am I
doing something wrong?
The answe
20 matches
Mail list logo
