Well done!
Our flagship GUI bindings... Go team!
-- Don
pgavin:
> Hi everyone,
>
> Oh, dear... it seems I've forgotten how to spell "cafe", and sent this
> message to haskell-c...@haskell.org the first time around. I resent it
> to all the lists again (just to make sure everyone interested
leimy2k:
> Was there a reason for this? If so, it'd be nice if the package that was
> build
> explained why... otherwise it feels kind of arbitrary, and would be nice if
> there was documentation available to make it link dynamically in case someone
> didn't want to LGPL their program.
>
> Anyon
On Tue, Feb 10, 2009 at 6:26 AM, Malcolm Wallace
wrote:
>> Gentle Haskellers,
>>
>> The Google Summer of Code will be running again this year. Once again,
>> haskell.org has the opportunity to bid to become a mentoring
>> organisation. (Although, as always, there is no guarantee of
>> acceptanc
Wonderful! Who maintains the mac-ports port of it? I'm itching to
get hieroglyph working on the Mac.
On Tue, Feb 10, 2009 at 11:40 PM, Peter Gavin wrote:
> Hi everyone,
>
> Oh, dear... it seems I've forgotten how to spell "cafe", and sent this
> message to haskell-c...@haskell.org the first tim
Was there a reason for this? If so, it'd be nice if the package that was
build explained why... otherwise it feels kind of arbitrary, and would be
nice if there was documentation available to make it link dynamically in
case someone didn't want to LGPL their program.
Anyone know the steps to make
Hi everyone,
Oh, dear... it seems I've forgotten how to spell "cafe", and sent this
message to haskell-c...@haskell.org the first time around. I resent it
to all the lists again (just to make sure everyone interested receives
it), so I apologize for any duplicated messages you might have rece
(The following is a quasi essay/list of past Summer of Code projects;
my hope is to guide thinking about what Summer of Code projects would
be good to pick, and more specifically what should be avoided.
If you're in a hurry, my conclusions are at the bottom.
The whole thing is written in Markdown;
2009/2/10 Jamie :
On Tue, 10 Feb 2009, Conrad Meyer wrote:
On Tuesday 10 February 2009 07:18:00 am Jamie wrote:
What I would like to see is H.264 video codec in Haskell. H.264/MPEG-4
is
getting very popular nowadays and it would be great to have encoder and
decoder in haskell. Can use x264
On Tue, 10 Feb 2009, Conrad Meyer wrote:
On Tuesday 10 February 2009 07:18:00 am Jamie wrote:
What I would like to see is H.264 video codec in Haskell. H.264/MPEG-4 is
getting very popular nowadays and it would be great to have encoder and
decoder in haskell. Can use x264 (encoder) and ffmpeg
Alberto G. Corona wrote:
forwarded:
Yes! if no state is passed, the optimization makes sense and the term is
not executed, like any lazy evaluation. For example, I used the debugger
(that is, without optimizations) to verify it with the Maybe monad:
op x= x+x
print $ Just (op 1) >>= \y-> retur
minh thu wrote:
Joachim Breitner:
> I thought about Zippers, but I understand that they improve _navigating_
> in a Tree-like structure, or to refrence _one_ position in a tree.
>
> But if I would deconstruct my tree to the list of _all_ locations, with
> > type Loc a = (Tree a, Cxt a)
> and the
Sure it does!
Thanks.
(...)So, for example if you have:
foreign import ccall "string.h strlen" cstrlen :: Ptr CChar -> IO CSize
fatype -> ftype :: ftype
fatype :: fatype
qtycon "Ptr"
atype1 "CChar"
fatype :: frtype
qtycon "IO"
atype1 "CSize"
(I struggled a bit with findin
Hello,
it is a real code snippet, but I failed to include the necessary pragma (which
is:
{-# OPTIONS_GHC -fglasgow-exts #-}
or
{-# OPTIONS_GHC -XMagicHash #-}
at the beginning of the file).
the "#" suffix is for unboxed types:
http://www.haskell.org/ghc/docs/latest/html/users_guide/primiti
Richard O'Keefe wrote:
Gregg Reynolds wrote:
> Sure, you can treat a morphism as an object, but only by moving to a
> higher (or different) level of abstraction.
False as a generalisation about mathematics.
False about functional programming languages, the very essence
of which is treating f
George Pollard ha scritto:
[...]
So, it seems nanosleep get interruped by a signal.
This works:
import System.Posix
main = do
putStrLn "Waiting for 5 seconds."
blockSignals $ addSignal sigVTALRM emptySignalSet
sleep 5
putStrLn "Done."
So (see my earlier em
On 11 Feb 2009, at 2:22 am, Gregg Reynolds wrote:
Is the result of evaluation a thunk/suspension/closer?
As T. S. Eliot wrote,
"Teach us to care and not to care
Teach us to sit still."
There are some things it is better not to care about
and this is one of them.
(Dash it, this really
I would love a mentor to help me with a Haskell binding to libnova.
This is part of a larger project I have in mind, but the libnova
binding seems like the first step.
I don't expect this to be picked as an official GSoC, but this seemed
like a good time to look
for a mentor for this project.
Mic
Corey O'Connor ha scritto:
2009/2/10 George Pollard :
import System.Posix
main = do
putStrLn "Waiting for 5 seconds."
blockSignals $ addSignal sigVTALRM emptySignalSet
sleep 5
putStrLn "Done."
Huh! Does the GHC runtime uses this signal? Perhaps for scheduling?
Righ
Also attached is a diff for strace between non-threaded and threaded.
execve("./sleep", ["./sleep"], [/* 38 vars */]) = 0
execve("./sleep", ["./sleep"], [/* 38 vars */]) = 0
brk(0) = 0x83c2000 | brk(0)
= 0x8f
On 10 Feb 2009, at 9:16 pm, Wolfgang Jeltsch wrote:
I did *not* want to argue pro “designed-for-HTML”. I wanted to argue
contra “designed-for-PDF” and pro “designed-for-any-output-format”.
Fair enough.
I suppose I should point out what seems obvious to me,
which is that one could embed a subst
To Haskell and Libraries and Haskell-Cafe,
Whilst improving regex-tdfa I have run across new bugs. Some patterns were
getting compiled wrong and others were affected by an execution bug.
As this package has actual users, I wanted to make sure they get these fixes
immediately.
Three Cheers
2009/2/10 George Pollard :
>> import System.Posix
>>
>> main = do
>> putStrLn "Waiting for 5 seconds."
>> blockSignals $ addSignal sigVTALRM emptySignalSet
>> sleep 5
>> putStrLn "Done."
>>
Huh! Does the GHC runtime uses this signal? Perhaps for scheduling?
Cheers,
-Corey
On Wed, 2009-02-11 at 00:05 +0100, Manlio Perillo wrote:
> John Ky ha scritto:
> > Hi Haskell Cafe,
> >
> > I wrote very short program to sleep for 5 seconds compiled with the
> > -threaded option in ghc on the Mac OS X 1.5.
> >
> > I am finding that using the sleep function doesn't sleep at all
fatype is the function argument type. atype[i] are type arguments.
qtycon is a qualified (e.g. possibly with module prefix) type
constructor, e.g. Just
So, for example if you have:
foreign import ccall "string.h strlen" cstrlen :: Ptr CChar -> IO CSize
fatype -> ftype :: ftype
fatype :: f
On Tue, 2009-02-10 at 09:57 -0800, Corey O'Connor wrote:
> The POSIX sleep function is defined as:
> sleep() makes the current process sleep until seconds seconds have
> elapsed or a signal arrives which is not ignored.
>
> Sounds like a signal is arriving that is interrupting the sleep.
>
>
The FFI spec says (at
http://www.cse.unsw.edu.au/~chak/haskell/ffi/ffi/ffise3.html#x6-120003.2):
There I see:
---
Foreign types are produced according to the following grammar:
ftype --> frtype
| fatype -> ftype
frtype --> fatype
| ()
fatype --> qtycon atype[1] ... atype[k
John Ky ha scritto:
Hi Haskell Cafe,
I wrote very short program to sleep for 5 seconds compiled with the
-threaded option in ghc on the Mac OS X 1.5.
I am finding that using the sleep function doesn't sleep at all, whereas
using threadDelay does:
[...]
main = do
putStrLn "Waiting for
On Tuesday 10 February 2009 06:41:54 am Simon Marlow wrote:
> John Goerzen wrote:
> > Just to close -- I will point out that ghci doesn't work on many
> > platforms that Hugs does (though ghc does). Hugs is the only
> > interpreter on some of these platforms.
>
> I didn't see anyone follow up to t
On Tuesday 10 February 2009 07:18:00 am Jamie wrote:
> What I would like to see is H.264 video codec in Haskell. H.264/MPEG-4 is
> getting very popular nowadays and it would be great to have encoder and
> decoder in haskell. Can use x264 (encoder) and ffmpeg (en/de coder)
> as a base to start wit
* Corey O'Connor [2009-02-10 10:21:54-0800]
> I released a new version of data-spacepart that resolved some of the
> issues with the previous release. One issue I had was the previous
> release used the version numbering scheme I use at work:
> [date].[release] Which does not appear to work as wel
Hello Maurнcio,
Tuesday, February 10, 2009, 11:56:40 PM, you wrote:
1. haskell compiler should check that your haskell imports match C
function prototypes. ghc does it in -fvia-C mode if you declare .h
file where the function prototype may be found:
foreign import ccall unsafe "Environment.h Up
The FFI spec says (at http://www.cse.unsw.edu.au/~chak/haskell/ffi/ffi/ffise3.html#x6-120003.2)
:
The argument types at[i] produced by fatype must be marshallable
foreign types; that is, each ati is either (1) a basic foreign type or
(2) a type synonym or renamed datatype of a marshallable f
I'd like to see some good libgcrypt[1] bindings to complement our existing
cryptography packages.
/jve
[1] http://www.gnupg.org/documentation/manuals/gcrypt/
On Tue, Feb 10, 2009 at 10:18 AM, Jamie wrote:
> What I would like to see is H.264 video codec in Haskell. H.264/MPEG-4 is
> getting ver
Yes, I can. Thanks. Just forget my idea, with
this I can provide all those types in a library.
I'm confused. When is it possible to use a type
as a parameter to a foreign function call? My
first guess was that I had to provide an instance
for class Storable, but after I tried writing
a complex-li
Not to say the issue shouldn't be tracked down, but shouldn't a more
portable function be used anyway?
untested example:
maxBoundMicroSecInSec =(maxBound `div` 10^6)
threadDelaySec :: Int -> IO ()
threadDelaySec s
| s > maxBoundMicroSecInSec = threadDelay (maxBoundMicroSecInSec *
10^6) >> thr
Hi,
Am Dienstag, den 10.02.2009, 16:36 +0100 schrieb minh thu:
> So here some code, notice the process function which work on a list
> of data (drawn from the tree). As said above, it can make use of a [0..]
> list if the 'tags' or 'names' are needed for processing.
>
> Is it applicable to your p
I released a new version of data-spacepart that resolved some of the
issues with the previous release. One issue I had was the previous
release used the version numbering scheme I use at work:
[date].[release] Which does not appear to work as well as the
traditional X.Y.Z release numbering scheme w
Hi,
Am Dienstag, den 10.02.2009, 11:59 +0100 schrieb Heinrich Apfelmus:
> However, I would be surprised if someAlgorithm could not be formulated
> directly on the tree or at least satisfies a few invariants like for example
>
> map fst . someAlgorithm = map snd
>
> Also, how does cutTreeA
The POSIX sleep function is defined as:
sleep() makes the current process sleep until seconds seconds have
elapsed or a signal arrives which is not ignored.
Sounds like a signal is arriving that is interrupting the sleep.
-Corey O'Connor
2009/2/9 John Ky :
> Hi Peter,
>
> Source code:
> im
mads_lindstroem:
> Hi all,
>
> Is it possible to ask the GHC garbage collector to run ? Something like
> a collectAllGarbage :: IO() call.
System.Mem.performGC
iirc,
Don
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/
Hi all,
Is it possible to ask the GHC garbage collector to run ? Something like
a collectAllGarbage :: IO() call.
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 7 feb 2009, at 22:40, Don Stewart wrote:
bulat.ziganshin:
Hello Don,
Saturday, February 7, 2009, 8:20:23 PM, you wrote:
We need a voting site set up. There was some progress prior to the
end
of the year. Updates welcome!
i think that there are a lot of free voting/survey services
ava
I think you can use Data.Word and Data.Int types for this, that is.
Data.Word.Word16 == uint16_t, Data.Word.Word32 == uint32_t, etc.
Data.Int.Int16 = int16_t, Data.Int.Int32 = int32_t, etc.
There are Foreign.Storable.Storable instances for those.
-Ross
On Feb 10, 2009, at 6:32 AM, Maurí cio wr
Malcolm.Wallace:
> Gentle Haskellers,
>
> The Google Summer of Code will be running again this year. Once again,
> haskell.org has the opportunity to bid to become a mentoring
> organisation. (Although, as always, there is no guarantee of
> acceptance.)
>
> If you have ideas for student project
SNMP would be really cool. So far the best implementation of SNMP I've had
the pleasure to work with is part of the Erlang OTP distribution, and being
able to compete with Erlang on that level would be really nice.
On Tue, Feb 10, 2009 at 7:18 AM, Jamie wrote:
> What I would like to see is H.26
2009/2/10 minh thu :
> 2009/2/10 Joachim Breitner :
>> Hi,
>>
>> Am Dienstag, den 10.02.2009, 10:05 +0100 schrieb minh thu:
>>> I forgot to mention you can try to tie the knot too, using the result
>>> of the processing in the first mapping (and then you don't need the
>>> second one)...
>>
>> coul
What I would like to see is H.264 video codec in Haskell. H.264/MPEG-4 is
getting very popular nowadays and it would be great to have encoder and
decoder in haskell. Can use x264 (encoder) and ffmpeg (en/de coder)
as a base to start with.
Jamie
John Goerzen wrote:
Just to close -- I will point out that ghci doesn't work on many
platforms that Hugs does (though ghc does). Hugs is the only
interpreter on some of these platforms.
I didn't see anyone follow up to this so I'll just mention that nowadays
GHCi works wherever GHC works, si
The result of an evaluation is always in WHNF (weak head normal form).
So if it's a function, it's been evaluated to \ x -> ..., but no
evaluation under lambda.
Similarely, if it's a data type it has been evaluated so the outermost
form is a constructor, but no evaluation inside the constructor.
T
2009/2/10 Joachim Breitner :
> Hi,
>
> Am Dienstag, den 10.02.2009, 10:05 +0100 schrieb minh thu:
>> I forgot to mention you can try to tie the knot too, using the result
>> of the processing in the first mapping (and then you don't need the
>> second one)...
>
> could you elaborate who to tie that
On Mon, Feb 9, 2009 at 10:17 PM, Richard O'Keefe wrote:
>
> On 10 Feb 2009, at 5:07 pm, Gregg Reynolds wrote:
>
>> Thanks. I see the error of my ways. So, IO expressions must be evaluated
>> if they are in the chain leading to main.
>>
>
>
> We need some standard terminology to distinguish
> be
forwarded:
Yes! if no state is passed, the optimization makes sense and the term is
not executed, like any lazy evaluation. For example, I used the debugger
(that is, without optimizations) to verify it with the Maybe monad:
op x= x+x
print $ Just (op 1) >>= \y-> return (Just 2)
does not evalua
Just be careful. The judge uses lazy evaluation, so if you get arrested you
might spend 20 years in the holding pen. On the bright side, you can pay
for stuff whenever you feel like it.
2009/2/9 Lyle Kopnicky
> Looks like a lot of fun!
>
> http://www.haskellchamber.com/page6.html
>
> _
Hi,
After reading an ISO draft for standard C, I found
a few types that could be usefull when binding to
libraries (these are from ):
int8_t, uint8_t, int16_t, uint16_t, int32_t,
uint32_t, int64_t, uint64_t
What about if they were included in the next version
of GHC Foreign.C.Types module? For
Heinrich Apfelmus schrieb:
> Henning Thielemann wrote:
>> I want for long to write math formulas in a paper in Haskell. Actually,
>> lhs2TeX can do such transformations but it is quite limited in handling
>> of parentheses and does not support more complicated transformations
>> (transforming prefi
When using this inside the Windows command prompt (CMD.EXE) I get
darcs: diff: runInteractiveProcess: does not exist (No such file or
directory)
It works fine under MSYS.
Also when using --diff-command to launch a GUI diff tool, Darcs does not
seem to copy any changes the GUI tool did to the "new
Wolfgang Jeltsch schrieb:
> This reminds me of an idea which I had some time ago. The idea is to write
> all
> your documentation in Template Haskell, possibly using quasiquoting to
> support Haddock-like syntax. Then you could write math as ordinary Haskell
> expressions and embed these expre
Joachim Breitner wrote:
>
> Assume you have a tree (and you can think of a real tree here), defined
> by something like this:
>
> data Tree a = Bud | Branch a Double Tree Tree
> -- | ` Lenght of this branch
> -- ` General storage field for additiona
Hi,
Am Dienstag, den 10.02.2009, 10:05 +0100 schrieb minh thu:
> I forgot to mention you can try to tie the knot too, using the result
> of the processing in the first mapping (and then you don't need the
> second one)...
could you elaborate who to tie that particular knot? I unfortunately, I
don
If I understand you correctly, the problem is to annotate an already
constructed tree with arbitrary pieces of new data -- hopefully
without reconstructing the tree. Perhaps the approach used in the
FLOLAC type-checkers would be helpful. The `tree' was an expression in
lambda-calculus to type chec
2009/2/10 minh thu :
> 2009/2/10 Joachim Breitner :
>> Hi,
>>
>> Am Montag, den 09.02.2009, 16:41 -0700 schrieb Luke Palmer:
>>> 2009/2/9 Joachim Breitner
>>> Now while this works, and while ST is still somewhat pure, I'm
>>> wondering
>>> if there is no better way of expre
2009/2/10 Joachim Breitner :
> Hi,
>
> Am Montag, den 09.02.2009, 16:41 -0700 schrieb Luke Palmer:
>> 2009/2/9 Joachim Breitner
>> Now while this works, and while ST is still somewhat pure, I'm
>> wondering
>> if there is no better way of expressing "This piece of
>>
Hi,
Am Montag, den 09.02.2009, 16:41 -0700 schrieb Luke Palmer:
> 2009/2/9 Joachim Breitner
> Now while this works, and while ST is still somewhat pure, I'm
> wondering
> if there is no better way of expressing "This piece of
> information came
> from the p
Am Montag, 9. Februar 2009 22:58 schrieb Robert Greayer:
> I'm sure this isn't the solution you are looking for, but when I had to do
> something similar (integrate an Eclipse plugin to Haskell code) the
> simplest approach I found was to simply invoke the Haskell in a separate
> process, binding t
Am Dienstag, 10. Februar 2009 02:56 schrieben Sie:
> On 10 Feb 2009, at 1:19 am, Wolfgang Jeltsch wrote:
> > This is only true if your destination format is PDF, DVI or PS. For
> > a webpage, you’ll need MathML in the end and TeX is not so good in
> > producing MathML, I suppose.
>
> Hmm. I find d
I can confirm this behaviour, on:
Linux 2.6.27-11-generic #1 SMP i686 GNU/Linux
Difference in the RTS between non-working and working:
("RTS way", "rts_thr")
("RTS way", "rts")
- George
signature.asc
Description: This is a digitally signed message part
_
66 matches
Mail list logo
