I was bored so I threw together this logo tonight
http://james-sanders.com/d/haskellers.png.
If you like it I could clean it up a bit.
J. Sanders
On 09/16/10 03:52, Michael Snoyman wrote:
Hi all,
Often times when trying to pitch Haskell to potential clients the
concern is the lack of
On 10/9/10 2:02 AM, Alex Rozenshteyn wrote:
This came up as I was doing homework for natural language processing.
I'm constructing a trigram model from training data, but I also need the
bigram and unigram counts. I could, for each triple of characters, add the
3 tuple to a trigram map and
Hi Brandon,
True, when I replace [] with [], I get a different error message:
No instance for (PolyVariadic [[Char]] (WMonoid String))
which now looks a bit like the Int example. In both cases, GHC appears
to be unable to derive the appropriate instance of PolyVariadic. Why
this is so, but
2010/10/9 André Batista Martins andre...@netcabo.pt Said:
Might have not been clear, but i will try illustrate .
f:: a- b - c - (b,(c,a))
f1 :: c - a - d
-
I think I would attack this with glue consisting of:
comb f f1 a b c = arr (\(a,b,c) - f a b c) arr
And in fact in both cases, it appears that GHC is trying to derive the
*wrong* instances of PolyVariadic.
It should be deriving:
PolyVariadic Int (WMonoid Int)
not
PolyVariadic Int (WMonoid m)
and
PolyVariadic [String] (WMonoid [String])
not
PolyVariadic [String] (WMonoid String)
Hi,
I tried an implementation of knight's tour and it does not seem to
terminate. I am looking for some feedback on algorithm and Haskellness
of my implementation (knight.hs attached).
--
Regards,
Kashyap
type Position = (Int,Int)
getPossiblePositions :: Position - [Position]
Isn't mark is always increasing the size of the board? - I haven't run
the code but I if this is the behaviour you want 'mark' is probably
not a good name (I'd expect mark to be returning something the same
size but with marked elements).
In _mark_ the before and after are always splits, so the
Apologies -- I was running a wrong snippet. Mark is working correctly,
I'll have another look...
On 10 October 2010 09:15, Stephen Tetley stephen.tet...@gmail.com wrote:
Isn't mark is always increasing the size of the board? - I haven't run
the code but I if this is the behaviour you want
Hello Kashyap
Quite probably the algorithm is working correctly just that for boards
5 it takes a pathologically long time (for boards = 5 I haven't
checked the answer is correct just that it is computed).
In the first message I was looking for places where the input data
grew or stayed constant
On Fri, Oct 8, 2010 at 10:26 AM, Vincent Hanquez t...@snarc.org wrote:
On Fri, Oct 08, 2010 at 08:47:39AM +0200, Michael Snoyman wrote:
By the way, a native zlib implementation would definitely go on my
wishlist. Any takers? ;)
Me too ! that's the only thing that prevented me from adding the
On Fri, Oct 8, 2010 at 3:29 PM, Maciej Piechotka uzytkown...@gmail.com wrote:
I had in mind something like:
import Data.ByteString
import Data.Iteratee
clientEnum :: MonadIO m
= params
- Enumerator ByteString m a
- Enumerator ByteString m a
clientEnum
OK, upon further investigation, the problem is that GHC cannot in
general infer the return type of polyToMonoid despite the hint it is
given (the type signature of the first parameter).
If I write:
main = putStrLn $ show $ unwrap $ ((polyToMonoid [] True (Just
(5::Int))) :: WMonoid [String])
or
On Sun, Oct 10, 2010 at 8:00 AM, James Sanders jimmyjaz...@gmail.com wrote:
I was bored so I threw together this logo tonight
http://james-sanders.com/d/haskellers.png.
If you like it I could clean it up a bit.
Overall, I like the current logo for two reasons: it adds color/depth,
and it
On 10 October 2010 21:01, Michael Snoyman mich...@snoyman.com wrote:
On Sun, Oct 10, 2010 at 8:00 AM, James Sanders jimmyjaz...@gmail.com wrote:
I was bored so I threw together this logo tonight
http://james-sanders.com/d/haskellers.png.
If you like it I could clean it up a bit.
Overall, I
Thank you Stephen,
Quite probably the algorithm is working correctly just that for boards
5 it takes a pathologically long time (for boards = 5 I haven't
checked the answer is correct just that it is computed).
I checked it out with 5 and looks like the answer is correct also :)
In the first
I thanks for the answers.
On this paper, i found this example
The student has accidental given the arguments of map in the wrong
order. Again, the logged student programs show that this is indeed
a common mistake.
(1,8): Type error in application
expression :
Sorry, i don't refer the paper on other email. But the paper was Helium,
for Learning Haskell
No dia 10 de Outubro de 2010 12:22, André Batista Martins
andre...@netcabo.pt escreveu:
I thanks for the answers.
On this paper, i found this example
The student has accidental given the arguments
For anyone who's interested, the code I have now is:
{-# LANGUAGE TypeSynonymInstances, FlexibleInstances,
MultiParamTypeClasses #-}
module PolyTest where
import Data.Monoid
class Monoid m = Monoidable a m where
toMonoid :: a - m
squish :: Monoidable a m = m - a - m
squish m a = (m
On 10 October 2010 11:31, C K Kashyap ckkash...@gmail.com wrote:
Did you mean this
http://www.cs.tufts.edu/~nr/comp150fp/archive/richard-bird/sudoku.pdf?
I was actually meaning these slides...
http://icfp06.cs.uchicago.edu/bird-talk.pdf
Also, is this the book -
2010/10/10 André Batista Martins andre...@netcabo.pt:
[Snip]
I think that work has been done, in helium compiler. But i can't identify
the algorithm for this propose.
It may be a hand written hint that generates the very precise help
probable fix : re-order arguments.
See the paper
It is interesting to see that the dummy parameters can actually be
replaced by:
mempty :: [String]
mempty :: String
mempty: Int
in my three examples and the code still compiles and gives the
expected results.
This suggests that a further simplification might be possible (ideally
in straight
Hey all,
Haskellers became popular a lot faster than I'd anticipated. This has
prompted me to need to make some changes that I was only planning on
implementing later on. As usual, all points are up for discussion
(this is intended to be a community-run site after all).
* Pagination on homepage.
You can use Djinn to generate the glue. Note that in the example you
give there are many possible ways to make the glue just looking at the
types.
Changing the output types of f so they can't be confused with the
input types we get:
Djinn ? compose :: (c1 - a1 - d) - (a- b - c - (b1,c1,a1)) -
(a
For example, the notation can be reduced to:
poly([String],True () (Just (5::Int)))
using:
#define poly(TYPE,VALUES) ((polyToMonoid (mempty :: TYPE) VALUES) ::
TYPE)
which I think is as concise as it can get.
Kevin
On Oct 10, 1:47 pm, Kevin Jardine kevinjard...@gmail.com wrote:
It is
On 10/10/10, Michael Snoyman mich...@snoyman.com wrote:
On Fri, Oct 8, 2010 at 3:29 PM, Maciej Piechotka uzytkown...@gmail.com
wrote:
I had in mind something like:
import Data.ByteString
import Data.Iteratee
clientEnum :: MonadIO m
= params
- Enumerator ByteString m
On Sun, Oct 10, 2010 at 3:09 PM, Maciej Piechotka uzytkown...@gmail.com wrote:
On 10/10/10, Michael Snoyman mich...@snoyman.com wrote:
On Fri, Oct 8, 2010 at 3:29 PM, Maciej Piechotka uzytkown...@gmail.com
wrote:
I had in mind something like:
import Data.ByteString
import Data.Iteratee
2010/10/10 Michael Snoyman mich...@snoyman.com:
Hi,
Haskellers became popular a lot faster than I'd anticipated. This has
I've noticed a new 'flag this user' on my profile, but it's not clear
(at least to me) what this does. Out of curiosity, I clicked on it,
got a uninformative (again, to me)
One final example to end with:
-- mixed type product example
instance Monoid Double where
mappend = (*)
mempty = (1.0) :: Double
instance Monoidable Int Double where
toMonoid = fromIntegral
instance Monoidable Double Double where
toMonoid = id
#define productOf(VALUES)
The student has accidental given the arguments of map in the wrong order
I am using for = flip map a lot, in code like
for [ 1 .. 10 ] $ \ i - ...
in fact that's one of my most dearly missed Prelude functions.
Note that we have Control.Monad.forM
forM [ 1 .. 10 ] $ \ i - do ...
Oh, and
On Sun, Oct 10, 2010 at 6:32 PM, Johannes Waldmann
waldm...@imn.htwk-leipzig.de wrote:
Oh, and while we're at it - are there standard notations
for forward function composition and application?
I mean instead of h . g . f $ x
I'd sometimes prefer x ? f ? g ? h
but what are the ?
Stephen Tetley wrote:
On 10 October 2010 11:31, C K Kashyap ckkash...@gmail.com wrote:
Did you mean this
http://www.cs.tufts.edu/~nr/comp150fp/archive/richard-bird/sudoku.pdf?
I was actually meaning these slides...
http://icfp06.cs.uchicago.edu/bird-talk.pdf
But the paper is definitely
On 10 October 2010 22:32, Johannes Waldmann waldm...@imn.htwk-leipzig.dewrote:
Oh, and while we're at it - are there standard notations
for forward function composition and application?
I mean instead of h . g . f $ x
I'd sometimes prefer x ? f ? g ? h
but what are the ?
While
No, wrong. I am speaking nonsense here.
Of course one also needs to define a *forward* function composition operator
to get the effect you originally wanted.
My point was: you need to find/define two operators, not just one. That
still holds :)
Best,
On 10 October 2010 23:47, Ozgur Akgun
My point was: you need to find/define two operators, not just one.
Sure, I need flip ($) and flip (.)
Since the Prelude forgot to define these (and flip map),
the question was: are there established names for these two operators?
J.
___
On Mon, Oct 11, 2010 at 00:51, Ozgur Akgun ozgurak...@gmail.com wrote:
My point was: you need to find/define two operators, not just one. That
still holds :)
No it doesn't.
f $ g $ h $ x == f (g (h x)) == f . g . h $ x == x $$ h $$ g $$ f
if you have the correct associativity for ($$)
--Max
Greetings,
I have put together a package to test possible implementations of the
RealFrac methods for Double and Float (base-2 IEEE754) and uploaded a
.tar.gz bundle to http://hackage.haskell.org/trac/ghc/ticket/2271 .
On the one hand, pure Haskell implementations, on the other hand
On 10/10/10 7:00 PM, Johannes Waldmann wrote:
My point was: you need to find/define two operators, not just one.
Sure, I need flip ($) and flip (.)
Since the Prelude forgot to define these (and flip map),
the question was: are there established names for these two operators?
I don't
On Sun, Oct 10, 2010 at 7:02 PM, Daniel Fischer
daniel.is.fisc...@web.de wrote:
Greetings,
I have put together a package to test possible implementations of the
RealFrac methods for Double and Float (base-2 IEEE754) and uploaded a
.tar.gz bundle to
Sorry, I'm still catching up. I'm replying to first few messages.
instance Show a = Monoidable a [String] where
toMonoid a = [show a]
main = putStrLn $ unwrap $ polyToMonoid [] True () (Just (5::Int))
fails to compile.
The error message points to the first problem:
No instances
On Monday 11 October 2010 02:31:13, Antoine Latter wrote:
I got a lot of errors (or warnings?) during compilation.
Yuck.
Is it something I should worry about?
No.
I'm using GHC 6.12.1 on 64-bit Linux.
Just means I should've looked closely at the #if's.
On 64 bits,
data Int64 = I64# Int#
On Sunday 10 October 2010 5:32:16 pm Johannes Waldmann wrote:
I mean instead of h . g . f $ x
I'd sometimes prefer x ? f ? g ? h
but what are the ?
Note, before anyone gets too excited about this, there are some built-in
things about the language that make forward chaining less nice.
On Monday 11 October 2010 02:49:30, Daniel Fischer wrote:
Give me a couple of minutes to fix it.
New bundle uploaded, I think it should work now.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Sun, Oct 10, 2010 at 4:47 PM, Ozgur Akgun ozgurak...@gmail.com wrote:
On 10 October 2010 22:32, Johannes Waldmann waldm...@imn.htwk-leipzig.de
wrote:
Oh, and while we're at it - are there standard notations
for forward function composition and application?
I mean instead of h . g .
The gravatars don't need to be on the front page but just on viewing the
profile. Why not just a big list possibly in random order then
sortable/searchable in various ways such as location, particular skills,
etc. This site could potentially become useless to anyone who's years
experience is less
Hi everybody,
I'm working on a module that encodes static facts about the real
world. For now, I'm working on an ISO 3166 compliant list of
countries, country names, and country codes. I've run into a bit of
an optimization issue.
There is a static bijective correspondence between
I would not worry about doing that at runtime.
The only reliable way to make sure it happens at compile time that I
can think of would be some Template Haskell.
(Or some really deep magic with dictionaries.)
-- Lennart
On Mon, Oct 11, 2010 at 3:51 AM, Alexander Solla a...@2piix.com wrote:
Hi
On Sun, Oct 10, 2010 at 7:02 PM, Daniel Fischer
daniel.is.fisc...@web.de wrote:
Greetings,
I have put together a package to test possible implementations of the
RealFrac methods for Double and Float (base-2 IEEE754) and uploaded a
.tar.gz bundle to
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 10/10/10 21:22 , Tim Matthews wrote:
seems crazy. I don't know how that works and whether having that status
absent means a haskeller is 'fake'/'imaginary' etc but I can't see how
anyone would like to be labeled '¬real' or 'not real'.
I'll
Sorry to everyone for not getting back so quickly, I kept getting
errors from postfix when I tried sending mail to the cafe. Hopefully
this one will go through. As I see it, two open issues are flagging
and real Haskellers.
Flagging: this was simply a mistake in terminology on my part. I've
On Oct 10, 2010, at 10:56 AM, Michael Snoyman wrote:
I'm worried about spam accounts being featured on
the homepage. Real Haskeller is not meant to be exclusive, it's a
minimal level of oversight by the admins.
A more common approach to the problem of spam accounts -- which is very real --
is
On Mon, Oct 11, 2010 at 5:59 AM, Mark Lentczner ma...@glyphic.com wrote:
On Oct 10, 2010, at 10:56 AM, Michael Snoyman wrote:
I'm worried about spam accounts being featured on
the homepage. Real Haskeller is not meant to be exclusive, it's a
minimal level of oversight by the admins.
A more
51 matches
Mail list logo
