On 2009 Feb 5, at 9:44, Peter Verswyvelen wrote:
2) modify .hgignore to make sure only these files are added that are
part of the project. I want this process to be automated, I don't
want to check each time which files to add, since this is error prone.
.darcs/prefs/boring (regexes of files
Jonathan Cast wrote:
> Konsole
>
ctrl+shift+f, incremental, all matches highlight, case (in)sensitive,
regexen.
Konsole 2.1 (KDE 4.1.2), that is. I'd use its tab support, but I have
xmonad. In fact, it comes with a nice editor: I just have to type vi.
--
(c) this sig last receiving data proce
allbery:
> On 2009 Feb 5, at 10:26, Eugene Kirpichov wrote:
>> My benchmark (parsing a huge logfile with a regex like "GET
>> /foo.xml.*fooid=([0-9]++).*barid=([0-9]++)") shows that plain PCRE is
>> the fastest one (I tried PCRE, PCRE-light and TDFA; DFA can't do
>> capturing groups at all, TDFA wa
On 2009 Feb 5, at 10:26, Eugene Kirpichov wrote:
My benchmark (parsing a huge logfile with a regex like "GET
/foo.xml.*fooid=([0-9]++).*barid=([0-9]++)") shows that plain PCRE is
the fastest one (I tried PCRE, PCRE-light and TDFA; DFA can't do
capturing groups at all, TDFA was abysmally slow (abo
Tim Newsham wrote:
> The only difference with IO then is that to get IO programs to run,
> you have
> to do it inside another IO program.
Almost. Add to your mental model a "runIO" that is invoked when your
program runs as: "runIO main". Your haskell compiler or interpretter
arranges this
On Tue, 2009-02-03 at 19:25 +, Andrew Coppin wrote:
> Don Stewart wrote:
> > The platform is a set of blessed libraries and tools. The distros will
> > still need to package that.
> >
> > To do that for Windows, we're still going to need a windows packaging
> > team, along side Debian, Arch, Ge
On Fri, 2009-02-06 at 08:28 -0200, Marco Túlio Gontijo e Silva wrote:
> > $ ./setup configure --enable-library-profiling --disable-library-vanilla
> > /usr/bin/ld: dist/build/Control/Monad/Cont.o: No such file: No such file
> > or directory
> >
> > I'm using ghc6 6.10.1+dfsg1-5 and binutils 2.19
On Fri, 2009-02-06 at 11:48 +0100, David Waern wrote:
> 2009/2/6 Alistair Bayley :
> >>> [1 of 1] Compiling Test.Fail( Test\Fail.hs, Test\Fail.o )
> >>>
> >>> Test\Fail.hs:11:26:
> >>>Can't make a derived instance of `Typeable Fail'
> >>> (You need -XDeriveDataTypeable to derive an
Henning Thielemann ha scritto:
On Thu, 5 Feb 2009, Manlio Perillo wrote:
Yitzchak Gale ha scritto:
Ah, OK. Thanks. Now we have a well-defined problem. :)
Good :).
I have used this example to describe how to avoid big integers at all:
http://haskell.org/haskellwiki/Integers_too_big_for_
Then you are talking about something very different from the subject that
Andrew started.. He clearly ask about "unsafeXXX understood as impurity
"which defiles our ability to reason logically about haskell programs like
we would like to".
I also want to discuss here that any signature of type IO
kirk.martinez:
> Hello, fellow Haskell hackers! I am writing a term paper on Haskell in
> Business, and while I have gathered a lot of good information on the Internet,
> I would really like direct feedback from software professionals who have used
> Haskell in a business setting. I would really
On Fri, Feb 6, 2009 at 12:17 PM, Lennart Augustsson
wrote:
> It doesn't really matter if TeX is a good or bad idea for writing maths.
> For our users, they might do a formula if it's TeX, they won't if it's
> something else.
Generally, I'd agree, but I just took a look at AsciiMathML, and it's
pr
Kirk Martinez wrote:
> Hello, fellow Haskell hackers! I am writing a term paper on Haskell in
> Business, and while I have gathered a lot of good information on the
I do hope you will publish your results somewhere.
> * What were the pros and cons you considered when choosing a
> langu
It doesn't really matter if TeX is a good or bad idea for writing maths.
For our users, they might do a formula if it's TeX, they won't if it's
something else.
-- Lennart
On Fri, Feb 6, 2009 at 4:03 PM, Wolfgang Jeltsch
wrote:
> Am Freitag, 6. Februar 2009 11:31 schrieb George Pollard:
>> I th
Hello, fellow Haskell hackers! I am writing a term paper on Haskell in
Business, and while I have gathered a lot of good information on the
Internet, I would really like direct feedback from software professionals
who have used Haskell in a business setting. I would really appreciate a
few minute
On Fri, Feb 6, 2009 at 5:22 PM, Alberto G. Corona wrote:
> then Data.List.head Data.Maybe.fromMaybe etc are also unsafe?.
Yes, I consider them unsafe. Whenever I see those functions I know
that I have to look elsewhere to see if their preconditions hold. I
would have preferred that listToMaybe w
So if IO represents a program that when executed interacts with the world's
state, is it safe to say that when I return (State Int Int), that I'm
returning a "State program"? That'd make sense as it really does look like
we force the State to be evaluated with runState, evalState or execState.
On Fri, Feb 6, 2009 at 1:13 PM, Chaddaï Fouché wrote:
> On Wed, Feb 4, 2009 at 4:56 PM, Gwern Branwen wrote:
>>
>> Now, to implement it, I would probably say to myself, "well, we'll
>> create a temporary file, we'll write some basic imports into it, then
>> we'll write the user's expression into
> Do you document the preconditions?
Yes. The 'safe' variants of those functions have all preconditions
listed in the accompanying (haddock) comments. The 'unsafe' variants
simply state that they promote exceptions to errors.
> It seems to me that this is more useful than naming a function
> unsaf
2009/2/6 Wolfgang Jeltsch :
> So using TeX as a general language for math is a very bad idea, in my opinion.
> The problem is that there is no good language which provides enough
> structural information for conversion into MathML and is at the same time
> simple to write and read. Maybe, both requ
On Wed, Feb 4, 2009 at 4:56 PM, Gwern Branwen wrote:
>
> Now, to implement it, I would probably say to myself, "well, we'll
> create a temporary file, we'll write some basic imports into it, then
> we'll write the user's expression into it as the definition of a
> function 'foo', and main will be
In this program, the HGL window only updates when I mouseover it. Can
someone tell me why this is / how I should avoid it?
Thanks!
Rodrigo
module Main where
import Graphics.HGL
import Control.Concurrent
import Control.Concurrent.MVar
import Control.Monad
main = do
stringMVar <- newEmptyMVa
On Thu, 5 Feb 2009, Don Stewart wrote:
andrewcoppin:
Jochem Berndsen wrote:
The HAppS project has been abandoned, see
http://groups.google.com/group/HAppS/msg/d128331e213c1031 .
The Happstack project is intended to continue development. For more
details, see http://happstack.com/faq.html .
On Fri, 2009-02-06 at 14:56 +0100, Deniz Dogan wrote:
> 2009/2/6 Jonathan Cast :
> > Emacs' terminal is also lacking all the modern conveniences, like
> > addressable cursors and builtin line-editing designed for 1970s printing
> > terminals and practically no searching capabilities. Alternatively
--- Begin Message ---
Don Stewart wrote:
andrewcoppin:
So we've got HAppS, Happstack, WASH, Turbinado, probably others... Does
anybody know how all these relate to each other? Where their strengths
and weaknesses lie?
A comparative analysis of the 10+ Haskell web frameworks would be
awe
--- Begin Message ---
Simon Peyton-Jones wrote:
| By the way: it is possible to use a private constructor (via some
| special GHC flag?).
| I would like to do a quick performance check using the existing
| fromRational specialization by constructing a Rational directly.
|
| I know that Haskell a
On Thu, 5 Feb 2009, Manlio Perillo wrote:
Yitzchak Gale ha scritto:
Ah, OK. Thanks. Now we have a well-defined problem. :)
Good :).
I have used this example to describe how to avoid big integers at all:
http://haskell.org/haskellwiki/Integers_too_big_for_floats
_
> AL lib: alSource.c:2291: alcDestroyContext(): 1 Source(s) NOT deleted
Brian, have you tried
currentContext $= Nothing
before closing the device ?
It works for me now : no message from ALSA (and still the sounds)
_
Téléphonez
On Fri, 2009-02-06 at 09:40 +0100, David Waern wrote:
> 2009/2/6 Max Rabkin :
> > On Thu, Feb 5, 2009 at 4:25 PM, David Waern wrote:
> >> As for running arbitrary commands, I think we are opening up to a lot
> >> of unfamiliar syntax. I'd like to hear what everyone thinks about
> >> that.
> >
> >
| By the way: it is possible to use a private constructor (via some
| special GHC flag?).
| I would like to do a quick performance check using the existing
| fromRational specialization by constructing a Rational directly.
|
| I know that Haskell allows declaration hiding for program safety, but
|
> "Roel" == Roel van Dijk writes:
Roel> On Fri, Feb 6, 2009 at 1:00 PM, Antoine Latter
wrote:
>> Tangential to all of this - sometimes my unsafeXXX functions
>> are pure, but partial. So I'll have:
>>
>> foo :: a -> b -> Maybe c
>>
>> and
>>
>> unsafe
Am Freitag, 6. Februar 2009 11:31 schrieb George Pollard:
> I think that the TeX *language* is great for writing mathematics,
> but that we should be wary of blindly incorporating TeX *output*
> into Haddock.
>
> Most of Haddock's documentation is currently HTML-based, and
> if we add TeX mathemati
I have written a small overview, how mutually recursive modules are
currently supported and how they can be avoided:
http://haskell.org/haskellwiki/Mutually_recursive_modules
Please add information about other compilers and more ideas on breaking
cycles.
___
On Fri, Feb 6, 2009 at 1:00 PM, Antoine Latter wrote:
> Tangential to all of this - sometimes my unsafeXXX functions are pure,
> but partial. So I'll have:
>
> foo :: a -> b -> Maybe c
>
> and
>
> unsafeFoo :: a -> b -> c
I use the "unsafe" prefix in the same way. For me it means 'assume
that pr
2009/2/6 Jonathan Cast :
> Emacs' terminal is also lacking all the modern conveniences, like
> addressable cursors and builtin line-editing designed for 1970s printing
> terminals and practically no searching capabilities. Alternatively, you
> could say it's incompatible with modern Unix's biggest
I don't think we need one large GUI toolkit.
We need orthogonal little pieces that could be combined together into a
toolkit... Less is more...
So first we need to identify what these pieces really are, what they "mean"
and how they can be composed together to make a bigger thing...
So what *is*
On Thu, Feb 5, 2009 at 3:11 PM, Andrew Wagner wrote:
> So we all know the age-old rule of thumb, that unsafeXXX is simply evil and
> anybody that uses it should be shot (except when it's ok).
> I understand that unsafeXXX allows impurity, which defiles our ability to
> reason logically about haske
2009/2/6 Alistair Bayley :
>>> [1 of 1] Compiling Test.Fail( Test\Fail.hs, Test\Fail.o )
>>>
>>> Test\Fail.hs:11:26:
>>>Can't make a derived instance of `Typeable Fail'
>>> (You need -XDeriveDataTypeable to derive an instance for this class)
>>>In the data type declaration for
Gregg Reynolds writes:
> You've defined >>= in such a way that it carries additional semantic
> weight.
Would it be appropriate to sum up this discussion thusly:
1. What gets and gets not optimized away in a monad depends on the
implementation of (>>=)
2. For IO, (>>=) is - must be - implem
* Luke Palmer [2009-02-06 01:09:45-0700]
> On Fri, Feb 6, 2009 at 1:02 AM, Achim Schneider wrote:
>
> > I've been thinking a bit, and come to the conclusion that we should
> > just do it as others did it before: Start off with application-specific
> > tk's, figure out what's cool and what's comp
>> [1 of 1] Compiling Test.Fail( Test\Fail.hs, Test\Fail.o )
>>
>> Test\Fail.hs:11:26:
>>Can't make a derived instance of `Typeable Fail'
>> (You need -XDeriveDataTypeable to derive an instance for this class)
>>In the data type declaration for `Fail'
>
> Are you processing the
On Fri, 2009-02-06 at 01:35 +0100, David Waern wrote:
> I received this question from Lennart Augustsson (via Simon M) and
> thought I'd send out an inquiry to the Haskell community in general
> (Lennart, I hope you don't mind):
>
> Lennart writes:
> > We have some local patches for haddock that e
For those who follow, I finally find the way to mix (simpler than I thought)
import Sound.ALUT
playSound :: IO ()
playSound = withProgNameAndArgs runALUT $ \ _ _ -> do
↠ buffer1 <- createBuffer $ Sine 440 0 1
↠ buffer2 <- createBuffer $ HelloWorld
↠ [source1,source2] <- genObjectNames 2
↠ buff
Hi,
Em Qui, 2009-02-05 às 20:38 -0200, Marco Túlio Gontijo e Silva escreveu:
> I'm trying to package ghc-paths for debian, and I got to this:
>
> $ ./setup configure --enable-library-profiling --disable-library-vanilla
> Configuring ghc-paths-0.1.0.5...
> $ ./setup build
> Preprocessing library g
On 2009-02-05 15:20, Gregg Reynolds wrote:
I think I've just about got monads figured out, but [...]
I don't think anyone has mentioned Simon's "Tackling the awkward squad"
paper in this thread. This tutorial, which contains a semantics for a
subset of IO, should answer some of the questions ra
2009/2/6 Alistair Bayley :
> I have this test case for Haddock (2.3.0):
>
> --
>
> |
> Module : Test.Haddock
> Copyright : (c) 2009 Alistair Bayley
> License : BSD-style
> Maintainer : alist...@abayley.org
> Stability : stable
> Por
by the way, a mean to get it done without error is to not use
runALUTUsingCurrentContext :
import Sound.ALUT
playSound :: IO ()
playSound = withProgNameAndArgs runALUT $ \ _ _ -> do
buffer1 <- createBuffer $ Sine 440 0 1
buffer2 <- createBuffer HelloWorld
[source] <- genOjectNames 1
queueBuffe
Hi,
> My opinion is that unsafeXXX is acceptable only when its use is
> preserved behind an abstraction that is referentially transparent and
> type safe. Others may be able to help refine this statement.
I would agree with this. The problem is that impurity spreads easily.
For example, suppose w
I have this test case for Haddock (2.3.0):
--
|
Module : Test.Haddock
Copyright : (c) 2009 Alistair Bayley
License : BSD-style
Maintainer : alist...@abayley.org
Stability : stable
Portability : portable
Test case for Haddock.
On Fri, Feb 6, 2009 at 12:35 AM, David Waern wrote:
[..]
> As for running arbitrary commands, I think we are opening up to a lot
> of unfamiliar syntax. I'd like to hear what everyone thinks about
> that.
How do I find out what I need to install in order to build
documentation for a specific pack
Henning Thielemann wrote:
4) hg commit -m "message"
this commits my changes locally. I always do this before pulling since
then I'm sure my changes are saved in the case a merge goes wrong.
In old darcs its precisely the other way round. Since it is so slow on
merging ready patches, you better
Hello Malcolm,
Friday, February 6, 2009, 11:49:56 AM, you wrote:
>> gpu is just set of simd-like instructions. so the reason why you will
>> never see haskell on gpu is the same as why you will never see it
>> implemented via simd instructions :D
> Because SIMD/GPU deals only with numbers, not p
(Also... Haskell on the GPU. It's been talked about for years, but
will
it ever actually happen?)
gpu is just set of simd-like instructions. so the reason why you will
never see haskell on gpu is the same as why you will never see it
implemented via simd instructions :D
Because SIMD/GPU deal
Am 05.02.2009 um 09:10 schrieb Andrew Coppin:
And so, inspired by the marketing litrature, I just spent £££ on a
very expensive new GPU that supports CUDA. The only problem is... I
can't seem to get any software to use it.
Does anybody know how to make this stuff actually work?
(Also... Ha
2009/2/6 Max Rabkin :
> On Thu, Feb 5, 2009 at 4:25 PM, David Waern wrote:
>> As for running arbitrary commands, I think we are opening up to a lot
>> of unfamiliar syntax. I'd like to hear what everyone thinks about
>> that.
>
> I personally find it useful to have Haddock comments readable in the
Hello Luke,
Friday, February 6, 2009, 11:09:45 AM, you wrote:
> I've been thinking a bit, and come to the conclusion that we should
> just do it as others did it before: Start off with application-specific
> tk's, figure out what's cool and what's compatible and then put them
> into libraries
Hello Andrew,
Thursday, February 5, 2009, 11:10:42 AM, you wrote:
> Does anybody know how to make this stuff actually work?
nvidia has cuda site where you can download sdk. afair, dr dobbs
journal has (online) series of arcticles which describes how to
program it step-by-step
> (Also... Haskell
On Fri, Feb 6, 2009 at 1:02 AM, Achim Schneider wrote:
> I've been thinking a bit, and come to the conclusion that we should
> just do it as others did it before: Start off with application-specific
> tk's, figure out what's cool and what's compatible and then put them
> into libraries. In short:
I've been thinking a bit, and come to the conclusion that we should
just do it as others did it before: Start off with application-specific
tk's, figure out what's cool and what's compatible and then put them
into libraries. In short: Stop building cathedrals.
--
(c) this sig last receiving data
59 matches
Mail list logo
