What about "promote" ?
On Tue, Aug 6, 2013 at 6:15 PM, Tom Ellis <
tom-lists-haskell-cafe-2...@jaguarpaw.co.uk> wrote:
> On Tue, Aug 06, 2013 at 10:03:04AM +0200, J. Stutterheim wrote:
> > `putStrLn "Hi"` is not a pure value...
>
> Why not?
>
> ___
> H
Hi café.
I've come up with a little version of 'uniq' that should take into account
md5 sums of the file changes... In essence, this:
main :: IO ()
main = getContents
>>= mapM check . lines -- PROBLEM
>>= mapM_ (putStrLn . (" --> " ++ )) . strip
check :: String -> IO (String, ABCD)
ch
Thanks a lot for that Adam.
Glad to hear I wasn't too far off the right track :-)
Regards,
- Lyndon
On Thu, Jul 4, 2013 at 5:34 PM, Adam Gundry wrote:
> Hi,
>
> On 04/07/13 02:19, Lyndon Maydwell wrote:
> > I'm wracking my brain trying to figure out a s
Hi Café.
I'm wracking my brain trying to figure out a simple, reasonably general,
implementation for a category instance for pairs of categories.
So far I've looked at [1], which seems great, but doesn't use the built-in
category instance, and [2], which I'm just not sure about.
Ideally I'd like
Done :)
On Wed, May 29, 2013 at 12:22 PM, Conrad Parker wrote:
> On 29 May 2013 08:54, Lyndon Maydwell wrote:
> > How can I join the group?
>
> by asking any of the current members :) I've added you.
>
> > P.S. I've attached a simple image for the Gravatar if
How can I join the group?
P.S. I've attached a simple image for the Gravatar if it looks okay.
On Tue, May 28, 2013 at 12:40 PM, Conrad Parker wrote:
> On 28 May 2013 05:29, Alexander Solla wrote:
> > As per recent discussions, I'm making a list of volunteers who are
> willing
> > to pick up s
Don't underestimate how greatly people appreciate being saved a couple of
minutes!
On Mon, May 6, 2013 at 8:01 PM, Niklas Hambüchen wrote:
> On 06/05/13 17:46, Tillmann Rendel wrote:
> > So what about this: Hackage could try to automatically collect and
> > display information about the develop
But what if the package is already perfect?
Jokes aside, I think that activity alone wouldn't be a good indicator.
On Mon, May 6, 2013 at 9:59 AM, Conrad Parker wrote:
> On 6 May 2013 09:42, Felipe Almeida Lessa wrote:
> > Just checking the repo wouldn't work. It may still have some activity
6/2013 01:47 PM, Lyndon Maydwell wrote:
> > >You could do:
> > >
> > >runKleisli . mconcat . map Kleisli :: Monoid (Kleisli m a b) => [a
> > >-> m b] -> a -> m b
> > >
> > >Would that work for you?
> > I can't find an instance
Wow looks like this Monoid instance isn't included in Control.Monad... My
mistake.
On Tue, Apr 16, 2013 at 8:47 PM, Lyndon Maydwell wrote:
> You could do:
>
> runKleisli . mconcat . map Kleisli :: Monoid (Kleisli m a b) => [a -> m b]
> -> a -> m b
>
> Would t
You could do:
runKleisli . mconcat . map Kleisli :: Monoid (Kleisli m a b) => [a -> m b]
-> a -> m b
Would that work for you?
On Tue, Apr 16, 2013 at 8:35 PM, Christopher Howard <
christopher.how...@frigidcode.com> wrote:
> So, I'm doing something like this
>
> foldl (>>=) someA list :: Monad
If I find my line is longer than 80 characters, I just shorten my
function and variable names!
It's perfectly idio(ma)tic!
On Mon, Oct 29, 2012 at 9:52 PM, Michael Orlitzky wrote:
> On 10/29/2012 07:50 AM, Rustom Mody wrote:
>> There was a recent discussion on the python list regarding maximum l
ackage... have you filed a bug report with the maintainers thats
> reproducible?
>
>
> On Thu, Sep 27, 2012 at 3:49 AM, Lyndon Maydwell wrote:
>>
>> I'm experiencing the same issues with compiled 64 bit working
>> correctly, but interpreted causing all sorts of issu
I'm experiencing the same issues with compiled 64 bit working
correctly, but interpreted causing all sorts of issues with Scotty.
On Thu, Sep 27, 2012 at 3:45 PM, Christiaan Baaij
wrote:
> The behaviour seems to differ between versions of OS X.
>
> A student has OS X 10.8 installed and is observi
You will be warned about the top-level definitions not including a
type-signature if you use the -Wall flag. This isn't really a complete
solution to your gripes, but it does address the change in behaviour
that you saw when adding/removing the commented code, and would draw
your attention to the l
I'd guess that type-inference is allowing rgbliste to use Integers
when farbliste is commented out, but restricting it to 16 Bit types
when it is uncommented. I don't have the GTK module installed on this
machine, but try adding some type annotations to see if this is the
case.
The maxBound of Wor
t you are looking for?
>
> Doaitse
>
>
>
> Op 4 mei 2012 om 09:02 heeft Lyndon Maydwell het
> volgende geschreven:
>
>> Hi all.
>>
>> What's the best indentation-aware parser at the moment?
>>
>>
>> I see three when I look in cabal:
>
Hi all.
What's the best indentation-aware parser at the moment?
I see three when I look in cabal:
lyndon@pugno:~ » cabal list indent
* IndentParser
Synopsis: Combinators for parsing indentation based syntatic structures
Default available version: 0.2.1
Installed versions: [ Not inst
Hi Café.
I'm pondering over an old chestnut that I'd forgotten about until recently.
I'd like to be able to express schemas for general recursive datatypes
(excluding functions and possibly encoding bounds) and have an
interactive constructor for that datatype generated automatically.
Originally
Nice tip!
On Mon, Apr 16, 2012 at 4:42 PM, Daniël de Kok wrote:
> On Apr 16, 2012, at 5:28 AM, Lyndon Maydwell wrote:
>> I've found that I had to make several modifications to the
>> bootstrap.sh and cabal-install.cabal files in order to get this to
>> work. I am wonder
Hi Café.
I'm building GHC from package ghc-7.4.1-src.tar.bz2 as the binary
download was throwing segfaults for me (and apparently a few others).
This has worked well and my issues with GHC and GHCi are now resolved.
However I have needed to build cabal-install. This can't be done using
cabal-insta
Could template-Haskell be used somehow?
- Lyndon Maydwell
On Mar 10, 2012 4:50 AM, "Clark Gaebel" wrote:
> In Haskell, what's the canonical way of declaring a top-level array
> (Data.Vector of a huge list of doubles, in my case)? Performance is
> key in my case.
>
ResourceT was still open, which could result in pulling from a closed
> handle.
>
> Michael
>
> On Tue, Feb 21, 2012 at 9:57 AM, Lyndon Maydwell wrote:
>> Hi Michael,
>>
>>
>> The behaviour of my original code has now changed to output nothing
>> wit
2012 at 3:30 PM, Michael Snoyman wrote:
> On Tue, Feb 21, 2012 at 7:40 AM, Michael Snoyman wrote:
>> On Tue, Feb 21, 2012 at 5:46 AM, Lyndon Maydwell wrote:
>>> Hi Michael, Café.
>>>
>>> I'm writing some code using the conduit library and am encounte
Hi Michael, Café.
I'm writing some code using the conduit library and am encountering
the following error output (while the program appears to function
correctly) when using Data.Conduit.Lazy.
The error given is:
> profile_simple_test_data: Control.Monad.Trans.Resource.stateCleanup: There is
>
Hi Café.
Has anyone read the news at http://kennethreitz.com/xcode-gcc-and-homebrew.html?
It looks like Apple is going to support a minimalist command-line
based toolchain for Xcode called "Command Line Tools for Xcode" based
on the OSX-GCC-Installer project.
Would Haskell support this rather t
I wonder how the arrival of an anonymous anecdote on IRC was the
smoking gun needed to justify calling out the Haskell community on its
cognitive dissonance. Surely you would need some statistical evidence,
a public display from a very prominent member, or some officially
endorsed stance to convinc
I would make the 'type' symbol a single character ala Agda. For example,
a : Int
If your users are writing a lot of types, make it easy!
On Dec 22, 2011 10:42 AM, "Alexander Solla" wrote:
>
>
> On Tue, Dec 20, 2011 at 10:30 PM, Gregory Crosswhite <
> gcrosswh...@gmail.com> wrote:
>
>>
>> On D
Could Int be overflowing?
On Tue, Nov 8, 2011 at 7:21 PM, mukesh tiwari
wrote:
> Hello all
> Being a Haskell enthusiastic , first I tried to solve this problem in
> Haskell but it running for almost 10 minutes on my computer but not getting
> the answer. A similar C++ program outputs the answer a
Thank you for the correction Brent.
The Diagrams package is a wonderful project.
- Lyndon Maydwell
On Oct 13, 2011 2:03 AM, "Brent Yorgey" wrote:
> On Wed, Oct 12, 2011 at 12:57:45PM +0800, Lyndon Maydwell wrote:
> >
> > The closest I've seen to this proces f
Hi Cafe.
I came across an interesting page about interactive abstraction called
"Up and Down the Latter of Abstraction" [1] while browsing
hacker-news.
Under the appendix "Tools & Implementation" Bret Victor ponders:
"Perhaps language theorists will stop messing around with arrows and
depende
Pattern matching will warn you if you neglect to consider the empty list.
On Fri, Sep 16, 2011 at 10:24 AM, Michael Litchard wrote:
> Someone commented on StackOverflow that pattern matching the first
> element of a list was preferable to head. This makes sense
> intuitively. Could someone articu
The problem is that you need to convert (length xs) to a Num, then
return a Fractional.
On Fri, Jul 1, 2011 at 2:07 PM, Nathan Howell wrote:
> (/) operates on a Fractional instance... but length returns an Int, which is
> not a Fractional.
> You can convert the Int to a Fractional instance:
> mea
It's probably obvious, but is there a reason why the links in this
email are being minimised?
On Thu, Jun 23, 2011 at 11:08 AM, Daniel Santa Cruz wrote:
> Welcome to issue 187 of the HWN, a newsletter covering developments in
> the Haskell community. This release covers the week of June 12 t
Your errors branch has the type
writeFile "parse-errors.txt" (show errors) :: IO ()
This means that your otherwise branch should have the same type.
You can use the return function that has the type
return :: Monad m => a -> m a
specialised to m = IO
in conjunction with the value
() :: ()
g
It might not be a perfect fit, but I've found the Diagrams useful for
plotting these kind of things recently.
On Sun, Jun 12, 2011 at 11:08 PM, Eric Rasmussen
wrote:
> There is a program written in Haskell called Timeplot that does this:
> http://www.haskell.org/haskellwiki/Timeplot
>
> It's an e
pass would just combine terms, the second would apply
> 'deBlank' and reduce, then the third would be as above.
> There are two alternatives which may be simpler:
> 1) Expand "Changes c" into explicit modifications and do all your
> reductions on the resulting Image.
&g
ed
> the 'Just's at all, and it should work fine.
> John
>
>>
>> From: Lyndon Maydwell
>>
>> (missed including cafe)
>>
>> f :: [Modification] -> Maybe [Modification]
>> and
>> f _ = Just $ f ...
>> are incompatible
>>
&
t 04:09 +0800, Lyndon Maydwell wrote:
>> (missed including cafe)
>>
>> f :: [Modification] -> Maybe [Modification]
>> and
>> f _ = Just $ f ...
>> are incompatible
>>
>
>
> My bad:
>
> f ... = let cs' = (Rotate (x+x') : fromMaybe cs
On Tue, Jun 7, 2011 at 3:11 AM, Maciej Marcin Piechotka
wrote:
> On Mon, 2011-06-06 at 23:38 +0800, Lyndon Maydwell wrote:
>> I'm writing an optimisation routine using Uniplate. Unfortunately, a
>> sub-function I'm writing is getting caught in an infinite loop because
I'm writing an optimisation routine using Uniplate. Unfortunately, a
sub-function I'm writing is getting caught in an infinite loop because
it doesn't return Nothing when there are no optimisations left.
I'd like a way to move the last Just into f, but this makes recursion
very messy. I was wonder
I would be fantastic if XCode wasn't a dependency. As well as the
inconvenience it also weighs in at around 5G (IIRC) of space which is
still somewhat significant.
Not to detract at all from the work of the wonderful GHC and Haskell
Platform contributors in any way. For me it would just make it th
s fold :: (Foldable t, Monoid m) => t m -> m in Data.Foldable, but it
> would add another Foldable constraint.
>
> You search a function like:
> concatMPlus :: (MonadPlus m, Monoid a) => m a -> a
> but this cannot exist ;) ("m a -> m a" would, but not "m a -&
I think this is because mconcat expects a list.
On Tue, May 31, 2011 at 3:31 PM, John Ky wrote:
> Thanks Malcom.
> I suspected that much, so I added it:
> data Stream m a
> = Chunks (m a)
> | EOF
> deriving (Show, Eq)
> instance (Monad m, MonadPlus m, Monoid (m a)) => Monoid (Stream m a) where
>
I just tried to use the generic form with (Maybe a) and 'mconcat'
prevented this from working, so that needs to be considered too.
On Mon, May 30, 2011 at 10:53 PM, Casey McCann wrote:
> On Mon, May 30, 2011 at 9:01 AM, John Ky wrote:
>> instance Monoid (Stream a) where
>> mempty = Chunks me
Because they are more general functions that work on all monads rather
than just lists.
This allows Stream to be defined more flexibly.
On Mon, May 30, 2011 at 9:01 PM, John Ky wrote:
> Hi all,
> I'm trying to learn about enumerators by reading this paper and came across
> some code on page 2 th
If you're looking for efficiency, I believe you can actually do #1 in
constant time:
On Sat, May 7, 2011 at 7:31 AM, wrote:
> -- Instead of this
> -- sumMultiples3or5 s = sum [x | x <- [3..s-1], x `mod` 3 == 0 || x `mod` 5
> == 0]
>
>
> -- Isn't this faster
>
> sumMultiples3or5 s = sum ([x | x
Hoogle is very useful for the kinds of questions where you can
estimate a likely type:
http://www.haskell.org/hoogle/?hoogle=Integral+a+%3D%3E+a+-%3E+a+-%3E+%28a%2Ca%29
On Sat, May 7, 2011 at 12:50 AM, Chris Smith wrote:
> Sure... see quotRem in the prelude.
>
> On May 6, 2011 10:49 AM, wrote:
I get this too.
I've heard that it is resolved in 7.0.3 but I can't recall where.
(System Version: Mac OS X 10.6.7 (10J869), The Glorious Glasgow
Haskell Compilation System, version 7.0.2)
On Sat, Apr 16, 2011 at 10:47 AM, Andrew Pennebaker
wrote:
> GHC 7 compiles fine, but there's an additiona
Agda's concept of holes seems perfect for this. Does Haskell have
anything similar?
On Fri, Apr 8, 2011 at 9:50 PM, Kazu Yamamoto wrote:
> I made a mistake. Use M-t instead of C-cC-t.
>
>>> Currently what I do is declare a signature for helper, and then if it
>>> gets a type error try to figure o
Many thanks to the Cabal devs :-)
On Sat, Apr 2, 2011 at 7:12 PM, Daniel Fischer
wrote:
> On Saturday 02 April 2011 11:51:03, Lyndon Maydwell wrote:
>> The version of cabal-install on this page seems to be out of date:
>> http://www.haskell.org/cabal/download.html
>
>
:
> On Saturday 02 April 2011 11:10:42, Lyndon Maydwell wrote:
>> Hi all.
>>
>> I'm having some issues setting up cabal on EC2.
>>
>> I've installed ghc 7.0.2, however, the bootstrap.sh script for
>>
>> cabal-install is complaining about missin
Hi all.
I'm having some issues setting up cabal on EC2.
I've installed ghc 7.0.2, however, the bootstrap.sh script for
cabal-install is complaining about missing dependencies:
> Linking Setup ...
> Configuring Cabal-1.8.0.2...
> Setup: At least the following dependencies are missing:
> base >=4
Should that be inner :: s?
> data Shape = forall s. (Shapeful s)
> => Shape { sx, sy :: Double,
> inner :: a }
>
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Does anyone have any Binaries that are built to run on EC2?
That would be super!
On Tue, Feb 2, 2010 at 1:11 AM, Jason Dusek wrote:
> 2010/01/31 Marc Weber :
>> If all you want is standard debian or such it does'nt matter.
>> However I tried installing NixOS Linux and I've had lot's of
>> troubl
> Will methods explained here work for boolean expressions?
The convenience of defining using specialised datatypes for
serialising numeric operations comes from Num being a typeclass. This
is not the case for Bool:
Prelude> :info Num
class (Eq a, Show a) => Num a where
(+) :: a -> a -> a
..
That's true, but I've not had any luck with any other GUI libraries :(
On Wed, Feb 16, 2011 at 9:35 PM, Felipe Almeida Lessa
wrote:
> On Wed, Feb 16, 2011 at 11:26 AM, Lyndon Maydwell wrote:
>> OpenGL + GLUT has always been very reliable for me.
>
> I don't think
OpenGL + GLUT has always been very reliable for me.
On Wed, Feb 16, 2011 at 5:11 PM, Heinrich Apfelmus
wrote:
> Chris Smith wrote:
>>
>> Mihai Maruseac wrote:
>>>
>>> Right now, I am unsure on what is best to use. Can someone give me any
>>> hints on which is the most kept-to-date and most suppor
I've never used darcsden before. I take it your username is simon?
On Mon, Feb 14, 2011 at 5:43 AM, Simon Michael wrote:
>>> Would it be worth re-exporting a type-aliased GLdouble to completely
>>> hide the implementation?
>
> PS, and now I understand more clearly - yes, you're quite right. I mea
Wow.
I've been working almost exclusively with GLUT because it seems to be
the only multi-platform graphics toolkit that works for me. This looks
great! It certainly seems to take the pain out of texture-loading
which always drives me up the wall.
The examples seem to be loading OpenGL in order t
Does the Python implementation operate on Strings, or all lists?
I think this could be quite important as many split implementations
take regular expressions as arguments. This could be quite challenging
for general lists.
That said, I would like to see some of these features in the split package
I've always had issues with GLUT under ghci. If GHC 7 fixes this it
will make me happy :)
On Sun, Nov 21, 2010 at 7:54 AM, Luke Palmer wrote:
> On Sat, Nov 20, 2010 at 4:46 PM, Conal Elliott wrote:
>> I'm trying to find some way to do interactive, OpenGL-based graphics in
>> Haskell on Mac OS X.
This looks great!
On Fri, Sep 3, 2010 at 4:59 PM, Christian Eltges wrote:
> Hello,
>
> I was wondering why the File-Icon installed by GHC with the lambda for
> .hs files hasn't changed to the new
> bind+lambda icon used on haskel.org.
> Is this because it should be the same as the icon used by hu
$HOME/.cabal/bin
On Wed, Sep 1, 2010 at 10:55 AM, Ivan Lazar Miljenovic
wrote:
> Do you have ~/.cabal/bin or $HOME/.cabal/bin ? The latter is
> preferable as some issues arise with the former...
>
> On 1 September 2010 03:29, Lyndon Maydwell wrote:
>> Yep :)
>>
0 um 15:57 schrieb Lyndon Maydwell:
>
>> Yep. Definitely the same user.
>>
>> On Tue, Aug 31, 2010 at 7:35 PM, Ivan Lazar Miljenovic
>> wrote:
>>> On 31 August 2010 20:38, Lyndon Maydwell wrote:
>>>> ghc-pkg check doesn't list any broken dependen
Yep. Definitely the same user.
On Tue, Aug 31, 2010 at 7:35 PM, Ivan Lazar Miljenovic
wrote:
> On 31 August 2010 20:38, Lyndon Maydwell wrote:
>> ghc-pkg check doesn't list any broken dependencies.
>
> You sure this is with the same user? ghci is unlikely to complain
>
ghc-pkg check doesn't list any broken dependencies.
On Tue, Aug 31, 2010 at 9:27 AM, Ivan Lazar Miljenovic
wrote:
> On 31 August 2010 03:18, Lyndon Maydwell wrote:
>> Thanks!
>>
>> This makes perfect sense, but as I just discovered using ghci -v there
>> is an
>
> This should make QuickCheck 2 the default in GHCI. If it doesn't, you
> may need to specify the version:
>
> ghci -package QuickCheck-2.2
>
> For Cabal-packaged libraries/applications, simply update your version
> requirements.
>
>
> On Mon, Aug 30, 2010 at
I'm just trying these examples, and I can't figure out how to import
quickcheck2 rather than quickcheck1. I've looked around but I can't
seem to find any information on this. How do I do it?
Thanks!
On Mon, Aug 30, 2010 at 11:56 PM, John Millikin wrote:
> Define a custom element generator, which
I vaguely recall that there is a way to avoid this if you don't import
any terminal functions or something similar. I don't remember the
specifics though.
Sorry I couldn't be of more help!
On Fri, Aug 13, 2010 at 4:18 PM, Eitan Goldshtrom
wrote:
> Hi. I'm working in Windows on an OpenGL applic
Seconded.
I've started using the Haskell Platform mainly because the ports
version is out of date.
Unfortunately it keeps getting pulled in as a dependency of something
even though I'm not using it.
On Wed, Aug 11, 2010 at 10:49 PM, Ozgur Akgun wrote:
> Dear Cafe,
>
> I wonder who is maintainin
e you using a recent version of GHC?
>
> Groetjes,
>
> Martijn.
>
>
> On 8/10/10 22:22, Lyndon Maydwell wrote:
>>
>> Hi Cafe.
>>
>> I have written some QuickCheck properties in my source and am using
>> these for testing, however, when I compile
Is there a way to just ignore the warnings for QuickCheck?
On Wed, Aug 11, 2010 at 4:32 AM, Christopher Done
wrote:
> On 10 August 2010 22:25, Lyndon Maydwell wrote:
>> On Wed, Aug 11, 2010 at 4:23 AM, Christopher Done
>> wrote:
>>> On 10 August 2010 22:22, Lyndon Maydw
I'm using qualified properties with (import Test.QuickCheck ((==>)))
so that may not be possible.
On Wed, Aug 11, 2010 at 4:23 AM, Christopher Done
wrote:
> On 10 August 2010 22:22, Lyndon Maydwell wrote:
>> Hi Cafe.
>>
>> I have written some QuickCheck propert
Hi Cafe.
I have written some QuickCheck properties in my source and am using
these for testing, however, when I compile my program I get warned
about unused imports:
> Warning: Module `Test.QuickCheck' is imported, but nothing from it is used
Is there a way to suppress these warnings for a parti
Sassy?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
That's true I suppose, although since there are no implicit parameters
in haskell, it really has to be a DSL in implementation, rather than
just theory right?
On Mon, Aug 2, 2010 at 12:51 PM, Ivan Miljenovic
wrote:
> On 2 August 2010 14:47, Lyndon Maydwell wrote:
>> I thought
I thought it was pure as, conceptually, readFile isn't 'run' rather it
constructs a pure function that accepts a unique world state as a
parameter. This might be totally unrealistic, but this is how I see IO
functions remaining pure. Is this a good mental model?
> In terms of what a function does
You cannot break out of a monad if all you have available to use are
the monad typeclass functions, however there is nothing preventing an
instance from being created that allows escape. Many of these escape
methods come in the form of runX functions, but you can use
constructors to break out with
I find it useful to have a seed argument to nearly all random
functions rather than using ones with an IO signature. This way you
can speed up your program quite a bit and also make testing much
easier. I think that MonadRandom does this automatically too.
__
I made (presumably) inefficient huffman algorithm not too long ago:
http://www.hpaste.org/fastcgi/hpaste.fcgi/view?id=26484#a26484
I guess it doesn't normally need to be terribly efficient as the
result can be stored in a map of some sort.
On Wed, Jun 23, 2010 at 10:41 PM, John Lato wrote:
>> F
I don't think I can be of much help with regards to the questions, but
would you be able to post a link to the SPJ lecture?
Thanks :-)
On Tue, Jun 15, 2010 at 4:08 PM, Amiruddin Nagri wrote:
>
> My current project is about making an accounting engine that handles all
> the journal entries, trans
This sounds fantastic. Now I wish I had started learning haskell a few
years earlier.
As a side note, how is this project getting around the language
restrictions apple put in the developer license agreement?
--- [http://daringfireball.net/2010/04/iphone_agreement_bans_flash_compiler]
In the new
I hardly think you can say that _why had a negative impact on the ruby
community...
On Tue, Apr 6, 2010 at 9:53 AM, Christopher Done
wrote:
> On 6 April 2010 01:52, Ivan Miljenovic wrote:
>> On 6 April 2010 10:48, Christopher Done wrote:
>>> This discussion makes me ponder whether someone like
How would enforcing a 'real names' policy affect a contributor like
_why (http://en.wikipedia.org/wiki/Why_the_lucky_stiff)? I assume they
would not join the community.
I get the feeling that this discussion is somehow linked to haskell's
type-system, but have no idea why...
__
Reminds me of To Dissect a Mockingbird [http://dkeenan.com/Lambda/].
On Tue, Mar 23, 2010 at 7:12 AM, Ivan Miljenovic
wrote:
> On 23 March 2010 10:02, Dupont Corentin wrote:
>> I’m relatively new to Haskell.
>
> Welcome!
>
>> I’m wondering if it exist a tool to graphically represent Haskell code
Well you need to define a new datatype to make a hertrogenous list, so
I don't think there's any real way you can get around people doing
that...
On Thu, Mar 18, 2010 at 1:27 PM, Darrin Chandler
wrote:
> On Thu, Mar 18, 2010 at 01:06:25PM +0800, Lyndon Maydwell wrote:
>> You
You could probably also use a typeclass for pointy things rather than
a data type, this would then require you to use existential
quantification to construct a hetrogenous list.
For example:
Class Point where
getCartesian :: ...
getPolar :: ...
data Shape = Point p => ... | Polygon [p]
Thanks for the replies.
I have heard of Hash Life, but I thought I'd try a more naive approach
first, build up some type-classes, then create some more interesting
implementations (although I think I'd struggle with implementing Hash
Life in haskell at this point).
> What is the meaning of fuzzy
I'm avoiding hard-coding bools anywhere as I intend to allow
fuzzy-representations at some point.
On Wed, Feb 3, 2010 at 12:10 AM, Serguey Zefirov wrote:
> 2010/2/2 Lyndon Maydwell :
>> I chose the array mainly for the fast lookup time compared to lists,
>> are you sugge
re of non-early life games now that I think of it.
On Tue, Feb 2, 2010 at 11:48 PM, Serguey Zefirov wrote:
> 2010/2/2 Lyndon Maydwell :
>> Hi Cafe.
>>
>> I've made a basic game of life implementation with Haskell and OpenGL:
>> https://github.com/sordina/Life/
>
Hi Cafe.
I've made a basic game of life implementation with Haskell and OpenGL:
https://github.com/sordina/Life/
The basic premise is to generate a random snapshot, then iterate the
successor function on it to create an infinite list of snapshots, then
output them using OpenGL. I haven't really r
It might be worth looking at something like a curses library.
On Mon, Feb 1, 2010 at 4:45 PM, Mark Spezzano
wrote:
> I've tried this example and it just lets me type in anything in CAPITALS,
> which is nice, but Delete key doesn't delete and the arrow keys unfortunately
> let me manoeuvre the c
, 2010 at 4:58 PM, Christian Maeder
wrote:
> Lyndon Maydwell schrieb:
>> For example, when I "cabal install -v storable-complex" I get the following:
>>
>> /usr/bin/ghc -package-name storable-complex-0.2.1 --make
>> -hide-all-packages -i -idist/build -i. -idist/
Hi Cafe!
That's a capital "i" for anyone with font issues.
I posted this question to beginners a while ago, but received no
meaningful response so I'm trying cafe instead :-)
Most packages I try to install off Hackage with cabal are giving me
the error "ghc: unrecognised flags: -I".
For example
Aren't symbols made redundant by algebraic data types?
On Tue, Dec 8, 2009 at 4:48 PM, Michael Vanier wrote:
> jean-christophe mincke wrote:
>>
>> Hello,
>>
>> Has there already been attempts to introduce lisp like symbols in haskell?
>>
>>
>> Thank you
>>
>> Regards
>>
>> J-C
>>
>
> J-C,
>
> Do
this?
On Mon, Dec 7, 2009 at 4:52 PM, drostin77 wrote:
>
> I take 'Hood. Er... any responses to my questions?
>
>
> Ketil Malde-5 wrote:
>>
>> Lyndon Maydwell writes:
>>
>>> On Mon, Dec 7, 2009 at 2:43 PM, Colin Adams>
>>> wrote:
'Hood?
On Mon, Dec 7, 2009 at 2:43 PM, Colin Adams
wrote:
> 2009/12/7 drostin77 :
>>
>> Hello Hopefully Helpful Haskell Community!
>>
>> (I really wanted that to be alliteration... couldn't come up with an h word
>> for community)
>
> House?
> ___
> Has
You can define the methods with the same names in different modules,
then when you are importing them into the same module for use, use a
qualified import.
import qualified Dog
import qualified Tree
This will allow you to use exactly the syntax you described.
Dog.bark
Tree.bark
Plus if you only
Exception handling code should generally be assumed to work, so if
something goes wrong there you would normally like to know about it.
Also, there is nothing preventing you from wrapping the rescue code in
further exception handling, however, if the initial error were raised
upon encountering a se
1 - 100 of 106 matches
Mail list logo
