On Mon, Jun 29, 2009 at 7:36 PM, Geoffrey
Marchant wrote:
> I think I can see the point of forcing a list without forcing the actual
> data, but is there a way to do this that works on circular lists as well?
There can't be a way to do so that is pure, because such a function
could distinguish bet
I don't normally post blog links here, but this one is near and dear to my
heart: what can we do to make Haskell a more hospitable language for text
processing?
http://www.serpentine.com/blog/2009/06/30/python-and-haskell-text-apis-compare/
If you have comments or suggestions, please feel welcome
Hi everyone!
(First of all, I don't know Monads!)
I made a GCL (Guarded Command Language) Compiler and Interpreter for my
Languages and Machines course in my University with alex, happy and ghc. I
asked about a week ago about the use of unsafePerformIO for that same
project, now I have two new do
Hi.
Quite a while ago I launched Leksah and couldn't get anything done at
all; so I thought it is probably never be completed and abandoned
attempts to find an IDE for Haskell.
However, 3 days ago I launched the new version and it works fantastic!
It has an IntelliSense popup with type annotations
That is true. But I think we could avoid (or resolve) the problem of
wrong type thing in other ways, or we just resolve one thing by typing
much more code.
On Tue, Jun 30, 2009 at 11:37 AM, Jason Dagit wrote:
>
>
> On Mon, Jun 29, 2009 at 7:01 PM, Magicloud Magiclouds
> wrote:
>>
>> Hi,
>> There
I think Integer is prefered in Haskell. I mean normally, I should use
it in my code. So following my example, why cannot CPid be treated as
Integer. Only when it needs to be transfered to C or whatsoever, we
convert it to Long or whatsoever. So we have a unified type system,
not a bunch of types I
We implemented the VM by writing a smallish compiler to C for it in
Haskell. It ran *damn* fast, but we couldn't get rid of some bug that
did not let us run the 4rth task at all, although the others worked
fine :(
2009/6/30 Ahn, Ki Yung :
> John Meacham 쓴 글:
>>
>> I implemented the VM in C, it was
On Mon, Jun 29, 2009 at 7:01 PM, Magicloud Magiclouds <
magicloud.magiclo...@gmail.com> wrote:
> Hi,
> There are times, when we need to make some system calls, or call C
> library. So we have to deal with C data types.
> For example, CPid, which is an integer, actually. So we can do
> "fromInteg
Ahn, Ki Yung 쓴 글:
Magicloud Magiclouds 쓴 글:
Hi,
There are times, when we need to make some system calls, or call C
library. So we have to deal with C data types.
For example, CPid, which is an integer, actually. So we can do
"fromIntegral pid". Then why do not we define "type CPid = Integer"
Magicloud Magiclouds 쓴 글:
Hi,
There are times, when we need to make some system calls, or call C
library. So we have to deal with C data types.
For example, CPid, which is an integer, actually. So we can do
"fromIntegral pid". Then why do not we define "type CPid = Integer",
and convert Haske
I think I can see the point of forcing a list without forcing the actual
data, but is there a way to do this that works on circular lists as well?
On Mon, Jun 29, 2009 at 3:30 AM, Ketil Malde wrote:
> Deniz Dogan writes:
>
> > What is the spine of a list? Google seems to fail me on this one.
>
Hi,
There are times, when we need to make some system calls, or call C
library. So we have to deal with C data types.
For example, CPid, which is an integer, actually. So we can do
"fromIntegral pid". Then why do not we define "type CPid = Integer",
and convert Haskell Integer with C Int intern
2009/6/29 Lanny Ripple
> When you get bored or stumped with the problem you might pass your
> time with Orbiter [http://orbit.medphys.ucl.ac.uk/]. Or you could
> just use all the orbital mechanics math from the documentation. :)
>
> Enjoy,
> -ljr
>
That's cool... I'll try it someday!
___
When you get bored or stumped with the problem you might pass your
time with Orbiter [http://orbit.medphys.ucl.ac.uk/]. Or you could
just use all the orbital mechanics math from the documentation. :)
Enjoy,
-ljr
Rafael Gustavo da Cunha Pereira Pinto wrote:
> Hi All,
>
> As the ICFP 2009 co
G'day all.
Quoting Andrew Coppin :
That's just scary. I was just in the middle of writing the exact same
thing! :-D (I read that very article...)
When you're both done, please compare with the implementation that's
been in Edison for about five years:
http://www.cs.princeton.edu/~rdockins/ed
I just uploaded a new package [1] for generalized booleans, which provides
type classes with generalizations of boolean values & operations,
if-then-else, Eq and Ord. These values & types come up for me with every
new deep DSEL, and I think they do for others as well. The design space has
some tr
On Tue, 2009-06-30 at 00:45 +0400, Bulat Ziganshin wrote:
> Hello Duncan,
>
> Tuesday, June 30, 2009, 12:03:15 AM, you wrote:
>
> > struct ex {
> > int x;
> > int y;
> > int z;
> > };
>
> > ex example_functions (ex p)
>
> afaik, there is C ABI, that defines how to pass and return
John Meacham 쓴 글:
I implemented the VM in C, it was pretty obviously geared towards
such an implementation and it took all of an hour. Then I interfaced
with it via the FFI. Why use just one language when you can use two? :)
You could also have used Data.Binary. That's what I did.
I wasn't a
Similar to mine except that I implemented with all of the memory (data,
instruction, input and output ports) with the Data.Map library. One
thing to care about is the heap memory profiling. You'll need to make
sure that Map.insert function do not pile up as thunk. This is a
typical memory le
On Mon, Jun 29, 2009 at 12:55 PM, Andrew Coppin wrote:
This is an exercise in pure frustration! Sometimes it seems as if
> *everything* is broken on Windows.
>
In my opinion you're right, Windows, and things built on it, tend to be very
broken. Maybe that's why so many of the Haskell devs aren'
Ross Mellgren wrote:
I presume that many of the developers do not have windows machines
(presumably because windows sucks). Maybe you could help them by
trying to track down where the error in the code is, and even better
yet submitting a patch?
This is all free by the virtue of people giving
---
(PLEASE DISTRIBUTE -- **DEADLINE EXTENDED** -- PLEASE DISTRIBUTE)
---
Final Call for Papers
INAP 2009
You can use QuasiQuotation, where your bracketing syntax looks like:
[$foo| blah blah blah |]
and 'foo' represents a quasi-quoter, and the stuff inside the brackets
is any arbitrary syntax recognized by it.
http://www.haskell.org/ghc/docs/latest/html/users_guide/template-haskell.html#th-quasiquo
On 30 Jun 2009, at 00:03, John Meacham wrote:
The fact it didn't have any
looping meant that it wasn't even fully turing complete and you
probably
couldn't speed it up much anyway, it already had an intrinsically
short
running time.
Exactly! That's an ideal situation, you don't have to sp
I'd like to add my own custom list delimiters to ghc; such as the [: and :] of
Data Parallel Haskell. The purpose is mainly to learn a little about GHC's
internals.
Any suggestions on the GHC files I should look at first? Alternatively, maybe
this is actually possible from outside the compiler.
Hello Duncan,
Tuesday, June 30, 2009, 12:03:15 AM, you wrote:
> struct ex {
> int x;
> int y;
> int z;
> };
> ex example_functions (ex p)
afaik, there is C ABI, that defines how to pass and return parameters
of simple types, it's common for all compilers supporting so-called
"cde
duncan.coutts:
> On Fri, 2009-06-26 at 13:00 +0100, Simon Marlow wrote:
>
> > Maybe bzlib allocates using malloc()? That would not be tracked by
> > GHC's memory management, but could cause OOM.
>
> Yes it does.
>
> > Another problem is that if you ask for a large amount of memory in one
> >
On Wed, 2009-06-24 at 18:48 -0700, John Meacham wrote:
> On Wed, Jun 24, 2009 at 10:23:29AM -0300, Maurício wrote:
> > However, isn't just knowing the size and alignment enough to
> > write a generic struct handler that, by using the appropriate
> > calling convention, is going to work with any st
On Fri, 2009-06-26 at 13:00 +0100, Simon Marlow wrote:
> Maybe bzlib allocates using malloc()? That would not be tracked by
> GHC's memory management, but could cause OOM.
Yes it does.
> Another problem is that if you ask for a large amount of memory in one
> go, the request is usually honour
Don Stewart wrote:
magnus:
When will the Haskell Platform arrive properly? With that I mean,
when will GHC stop shipping with a set of base libraries (e.g.
network)?
Next GHC release.
Excellent, exactly the kind of answer I was hoping for.
That release can't come too soon as far as I'm con
---
Haskell Weekly News
http://sequence.complete.org/hwn/20090629
Issue 123 - June 29, 2009
---
Welcome to issue 123 of HWN, a newsletter covering
I presume that many of the developers do not have windows machines
(presumably because windows sucks). Maybe you could help them by
trying to track down where the error in the code is, and even better
yet submitting a patch?
This is all free by the virtue of people giving what time they can
On Mon, Jun 29, 2009 at 11:51:43PM +0400, Miguel Mitrofanov wrote:
> I was excited when I read about the VM - I'd imagined all sorts of cool
> things, like assembler, linker, compiler (for something C-like), maybe
> even debugger... And what a disappointment it was when I understood that
> nothi
Jason Dagit wrote:
On Mon, Jun 29, 2009 at 11:57 AM, Andrew Coppin
mailto:andrewcop...@btinternet.com>> wrote:
Rather less fortunately, it still doesn't actually fix my problem:
E:\Haskell\AOC-HalfInteger>cabal configure
Resolving dependencies...
Configuring AOC-HalfInteger-
I was excited when I read about the VM - I'd imagined all sorts of
cool things, like assembler, linker, compiler (for something C-like),
maybe even debugger... And what a disappointment it was when I
understood that nothing of this kind is needed.
On 29 Jun 2009, at 22:55, John Meacham wrot
On Mon, Jun 29, 2009 at 2:12 PM, Jason Dagit wrote:
>
>
> I can't say for certain, but just reading the output it looks like it
> created a tarball in a temporary folder (that worked) and then when it tried
> to clean it up it failed. Sounds like a bug report is in order.
>
You may want to check
On Mon, Jun 29, 2009 at 11:40:28AM -0700, Justin Bailey wrote:
>
> Anyways, for those who care, the heart of my VM implementation was a
> monadic fold over the program, with a mutable array representing the
> machine's memory, all inside ''runSTUArray.'' I used a simple data
> type to represent th
On Mon, Jun 29, 2009 at 11:57 AM, Andrew Coppin wrote:
> Andrew Coppin wrote:
>
>> Indeed. I've heard a few people claim that cabal-install is the best thing
>> since sliced bread, but I've never touched it. I don't even know where to
>> get it. (Presumably this will become fairly obvious once I
I spent too much time reading the files, until today, when Minh Tuh pointed
me the right direction on reading the floats...
Anyway, I will still keep trying until Xmas :-)
On Mon, Jun 29, 2009 at 15:40, Justin Bailey wrote:
> Anyone have thoughts to share? I'd love to read others' experiences
Andrew Coppin wrote:
Indeed. I've heard a few people claim that cabal-install is the best
thing since sliced bread, but I've never touched it. I don't even know
where to get it. (Presumably this will become fairly obvious once I go
look for it...)
Fortunately, it turns out that a trivial Goog
I implemented the VM in C, it was pretty obviously geared towards
such an implementation and it took all of an hour. Then I interfaced
with it via the FFI. Why use just one language when you can use two? :)
I wasn't able to make any time on sunday though so didn't end up
submitting a final entry w
Anyone have thoughts to share? I'd love to read others' experiences
but there isn't much coming up with searches or on redditt ...
I was happiest with the VM I implemented. Sadly, I wasn't able to
solve any of the scenarios, but my VM ran damn fast. That didn't seem
to matter so much this year as
On Tue, Jun 30, 2009 at 03:29:45AM +1000, Alex Mason wrote:
> (being able to insert 230,000+ words, check that all those
> words are actually in the set, write the set out to disk using
> the Data.Binary instance, reading them back in, and checking
> the old and new sets are equal takes about 3.5 s
Antoine Latter wrote:
Personally, I've never used "runhaskell Setup sdist" and I've only
ever used "cabal sdist". But I'm not sure where I learned that.
I think cabal-install is a pretty standard util for people to have,
and it ships with the Haskell platform now. So the big hurdle is
documentat
On Mon, Jun 29, 2009 at 1:03 PM, Andrew
Coppin wrote:
>
> This was not at all clear to me from reading the ticker.
>
> OK, so I need to find another seperate tool in order to do this. I guess not
> every single Haskell user tries to release stuff to Hackage, while
> presumably most users want to in
Alex Mason wrote:
TernaryTrees is a package that extends Data.Set ad Data.Map with some
ternary tree structures, based on the article
[http://www.pcplus.co.uk/node/3074/] .
That's just scary. I was just in the middle of writing the exact same
thing! :-D (I read that very article...)
Please
Derek Elkins wrote:
On Sun, Jun 28, 2009 at 4:11 PM, Antoine Latter wrote:
On Sun, Jun 28, 2009 at 3:42 PM, Andrew
Coppin wrote:
Ah. Apparently it's "fixed":
http://hackage.haskell.org/trac/hackage/ticket/40
Except that it isn't fixed. Yay for me..
If one actually reads the dis
TernaryTrees is a package that extends Data.Set ad Data.Map with some
ternary tree structures, based on the article [http://www.pcplus.co.uk/node/3074/
] .
So far there are three modules: Data.Set.TernarySet,
Data.Map.TernaryMap and Data.Set.StringSet, which can hold `Ord a =>
[a]`, Ord a
Code or it didn't happen. :)
Günther Schmidt wrote:
Hi folks,
I would like to announce that I have not merely managed to make the
RTS choke during runtime on stack overflows like lesser programmers,
no, *I* have managed to write code that ghc is not even able to
compile due to exhausting vi
Hi folks,
I would like to announce that I have not merely managed to make the RTS
choke during runtime on stack overflows like lesser programmers, no, *I*
have managed to write code that ghc is not even able to compile due to
exhausting virtual memory!
Top that!
Günther
___
magnus:
> When will the Haskell Platform arrive properly? With that I mean,
> when will GHC stop shipping with a set of base libraries (e.g.
> network)?
Next GHC release.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mail
Thanks for this! I am using it since yesterday. And also for all the Hack work. I can switch my loli app's back end
between happstack and hyena (eg) by changing a single import. Nice.
There is a problem with Safari, I think in either loli or hack: at the top of the page you see http headers ("HT
On Mon, Jun 29, 2009 at 3:41 PM, Daniel Fischer wrote:
> Am Montag 29 Juni 2009 10:47:05 schrieb david48:
>> connecter :: IConnection conn => conn
>> connecter = connectMySQL mysqlInfo
>>
>> And even though I suspect that's the correct type, it fails too :
>
> No, that's too general a type, that sa
On Sun, Jun 28, 2009 at 10:05 PM, Tony Morris wrote:
> Is there a canonical function for traversing the spine of a list?
>
> I could use e.g. (seq . length) but this feels dirty, so I have foldl'
> (const . const $ ()) () which still doesn't feel right. What's the
> typical means of doing this?
Yo
When will the Haskell Platform arrive properly? With that I mean,
when will GHC stop shipping with a set of base libraries (e.g.
network)?
/M
--
Magnus Therning(OpenPGP: 0xAB4DFBA4)
magnus＠therning．org Jabber: magnus＠therning．org
http://therning.org/magnus
Hi Haskellers,
I'm looking for people at the University of Edinburgh who have a swipe
card with access to the Informatics Forum and could hang around on 29
August (or perhaps 6 Sep).
Thanks!
PS. You may also be interested in some Hackathon news: we've reserved a
room at the ICFP venue suitable f
loli is a DSL built on hack. It allows you to easily define routes,
build your custom template backends through a simple Template
interface, and integrate with other hack middleware.
* driver
The simplest app looks like this
import Network.Loli
import Hack.Handler.Happstack
Am Montag 29 Juni 2009 10:47:05 schrieb david48:
> Hello Daniel and all,
> Your suggestion #1 : Can't import Database.HDBC.MySQL.Connection :
>
> da...@pcdavid2:~/projets/haskell/caimonitor$ ghci -Wall Bdd.hs
> GHCi, version 6.10.3: http://www.haskell.org/ghc/ :? for help
> Loading package ghc-pri
Hi Tuh2009/6/29 minh thu
> > First step solved. (BTW: I am attaching the first version to this e-mail.
> I
> > will upload to Hackage upon completion, when getIEEE754float64le and
> > putIEEE754float64le functions are done!)
>
> Indeed, I found the binary format a difficulty for haskell. But in
Hi Rafael,
2009/6/29 Rafael Gustavo da Cunha Pereira Pinto :
>
> Hi All,
>
> As the ICFP 2009 contest (http://www.icfpcontest.org) approaches its end, I
> decided to write down some thoughts I had while trying.
>
> On Friday I downloaded the task (http://www.icfpcontest.org/task-1.9.pdf),
> read i
On Mon, Jun 29, 2009 at 2:27 PM, Felipe Lessa wrote:
> On Mon, Jun 29, 2009 at 01:28:47PM +0400, Alexey Khudyakov wrote:
>> I use wicd to manage wireless connections for about three month and
>> I'm pretty happy with it. It seems to be much saner than network manager.
>> Didn't any serious problems
Hi All,
As the ICFP 2009 contest (http://www.icfpcontest.org) approaches its end, I
decided to write down some thoughts I had while trying.
On Friday I downloaded the task (http://www.icfpcontest.org/task-1.9.pdf),
read it for a while, and, since my goal is to finish by Xmas, went to the
swimming
On Mon, Jun 29, 2009 at 01:28:47PM +0400, Alexey Khudyakov wrote:
> I use wicd to manage wireless connections for about three month and
> I'm pretty happy with it. It seems to be much saner than network manager.
> Didn't any serious problems with it.
I second that. I've gone away from NM because
On Sun, Jun 28, 2009 at 01:12:35PM -0500, Antoine Latter wrote:
> On Sun, Jun 28, 2009 at 12:52 PM, Antoine Latter wrote:
> > I'd like to announce the 0.3.* series release of the X Haskell
> > Bindings. This release, like the prior 0.2.* series focuses on making
> > the API prettier. This release
Deniz Dogan writes:
> What is the spine of a list? Google seems to fail me on this one.
A (single-linked) list can be seen as a set of cons cells, where each
cell contains two pointers, one to the next cons cell, and one to the
cell's data contents ('car' and 'cdr' in Lisp parlance).
The spine
On Mon, Jun 29, 2009 at 12:58 PM, Ketil Malde wrote:
>
> Hi,
>
> A bit off-topic, but this is the café, after all...
>
> Like many here, I run XMonad as my window manager on top of Linux.
> On - at least my brand of - Linux, networking is generally handled by
> NetworkManager, which really needs it
2009/6/29 Martijn van Steenbergen :
> Tony Morris wrote:
>>
>> Is there a canonical function for traversing the spine of a list?
>>
>> I could use e.g. (seq . length) but this feels dirty, so I have foldl'
>> (const . const $ ()) () which still doesn't feel right. What's the
>> typical means of doi
I have made some modifications to the lhaskell.vim (v1.04) file to add
a feature, and fix up some bugs. I don't know if this is the right
place to post for patches, but the file I have claims that the
haskell-cafe is the maintainer.
First, I made it so that \begin{spec} and \end{spec} environments
Jochem Berndsen wrote:
My default is to start developing, then adding -Wall -Werror and make it
compile again.
That and hlint!
Martijn.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
A bit off-topic, but this is the café, after all...
Like many here, I run XMonad as my window manager on top of Linux.
On - at least my brand of - Linux, networking is generally handled by
NetworkManager, which really needs its associated applet (nm-applet)
to work properly. While I discove
Hello Daniel and all,
Your suggestion #1 : Can't import Database.HDBC.MySQL.Connection :
da...@pcdavid2:~/projets/haskell/caimonitor$ ghci -Wall Bdd.hs
GHCi, version 6.10.3: http://www.haskell.org/ghc/ :? for help
Loading package ghc-prim ... linking ... done.
Loading package integer ... linking
Tony Morris wrote:
Is there a canonical function for traversing the spine of a list?
I could use e.g. (seq . length) but this feels dirty, so I have foldl'
(const . const $ ()) () which still doesn't feel right. What's the
typical means of doing this?
(seq . length) doesn't sound that bad to m
On Sun, Jun 28, 2009 at 10:41:29PM -0400, John Van Enk wrote:
> Has any one managed to install gtk2hs on a Windows box running the
> Haskell Platform? I've had no luck; it seems the gtk2hs installer is
> unable to find the GHC installation.
After some digging, I found a thread on gtk2hs-devel [1]
73 matches
Mail list logo
