On Mar 19, 2008, at 2:12 , Austin Seipp wrote:
Excerpts from Will Thompson's message of Sun Mar 16 08:37:00 -0500
2008:
Currently the module's name is HFuse. Presumably it really belongs
under System somewhere; System.Posix.Fuse maybe? What do folks
think?
Are there any guidelines for pi
Excerpts from Will Thompson's message of Sun Mar 16 08:37:00 -0500 2008:
> Currently the module's name is HFuse. Presumably it really belongs
> under System somewhere; System.Posix.Fuse maybe? What do folks think?
> Are there any guidelines for picking a namespace?
I don't think there's any sort
Hello, haskellers, a few days ago I had asked about building recent
ghc on macos 10.3.9. I have made a bit of progress along those lines,
here's a small update on what worked and what didn't. Instead of
trying to proceed with the porting procedure, I went back to an
install: I ended up going to 6.2
My current set of tools are
Haskell
/ \
Perl --- C
I often use all three in one project. I think they complement each other
well as they are all relative extremes in their genre.
John
--
John Meacham - ⑆repetae.net⑆john⑈
_
On Wednesday 19 March 2008 00:14:30 [EMAIL PROTECTED] wrote:
> Quoting Jeremy Shaw <[EMAIL PROTECTED]>:
> > I like to imagine it works like this:
> >
> > bad static type < dynamic typing < good static typing.
>
> More succinctly:
>
> Algol < Smalltalk < ML
>
> Or perhaps:
>
> C < Ruby < H
G'day all.
Quoting Jeremy Shaw <[EMAIL PROTECTED]>:
I like to imagine it works like this:
bad static type < dynamic typing < good static typing.
More succinctly:
Algol < Smalltalk < ML
Or perhaps:
C < Ruby < Haskell
Cheers,
Andrew Bromage
_
Hi,
> It would be great to get more than the above!
The "Feedback Directed Implicit Parallelism" part is available in a
paper from ICFP 2007:
http://research.microsoft.com/~tharris/papers/2007-fdip.pdf
There might be papers online for the other segments of the talk, too.
- Chris.
--
Ch
oops ... my bad ... it was at Standford's CS dept on Feb 29 at 1:30:
This presentation describes a variety of ways to write parallel and
concurrent programs in the lazy functional language Haskell. We start off by
introducing par/pseq annotations which provide guidance to the run-time
about how w
[ccing to list]
On 3/18/08, Walt Potter <[EMAIL PROTECTED]> wrote:
> Tim,
>
> We're using -O2 to optimize, but not changing the heap size. We're
> trying to get the profiling running on our file.
> The sets have about 25 million elements each. Each element is a sequence
> of length 16.
>
> We
2008/3/18 Galchin Vasili <[EMAIL PROTECTED]>:
> Recently Satnam Singh of Microsoft Research gave a talk at Google about
> concurrency, Haskell STM, etc. Was there a transcript of this talk?
Do you have the exact date of this talk? I can't see that anyone
called Satnam has given a talk at Googl
On 3/18/08, Walt Potter <[EMAIL PROTECTED]> wrote:
> All,
> We're running out of space when we intersect two large sets. We've
> imported Data.Set.
> Any suggestions?
>
What optimization and other compiler flags (heap size, etc.) are you
using? Have you tried profiling?
Cheers,
Tim
--
Tim Ch
Hello,
Recently Satnam Singh of Microsoft Research gave a talk at Google about
concurrency, Haskell STM, etc. Was there a transcript of this talk?
Thanks, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/l
All,
We're running out of space when we intersect two large sets. We've
imported Data.Set.
Any suggestions?
Thanks, Walt
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
All,
Apologies for multiple listings.
A small cadre of us are organizing a Northwest Functional Programming
Interest Group (hey... NWFPIG, that's kinda funny). Our next
meeting is at the
The Seattle Public Library
1000 - 4th Ave.
Seattle, WA 98104
from 18:30 - 20:00 on March 19th.
On this mee
> > is probably the wrong thing to do. Static typing makes it harder to
> > maintain software because it's harder to change it."
ive found Ruby code is harder to change. you have to invest a significant
amount of time duplicating virtually every expression in your entire system in
test-form (wit
At Tue, 18 Mar 2008 09:41:15 -0700,
Justin Bailey wrote:
>
> >From a recent interview[1] with the guy leading Ruby development on
> .NET at Microsoft:
>
> "You spend less time writing software than you spend maintaining
> software. Optimizing for writing software versus maintaining software
> is
Hi & thanks for your answers Manuel,
Using your idea of separating the lattice and conversion from the
> definition of multiplication, you can at least save yourself the class
> instances:
Ok
type family Join a b :: *
Aah, meet and join but of course - memory memory memory seems
to get easi
Dear all,
We are advertising two new Lectureships (Assistant Professorships)
in Computer Science at the University of Nottingham in England.
Applications in the area of functional programming are particularly
welcome. Further details are available from:
http://jobs.nottingham.ac.uk/vacancies.
On Mar 18, 2008, at 12:00 PM, Thomas Schilling wrote:
... I think it's worth to try to make it clear that static typing
can help programmers new to the code easily check where things are
used and gives them the confidence that their changes won't
introduce unintended side effects.
It's
On 3/17/08, Hugo Pacheco <[EMAIL PROTECTED]> wrote:
> On the other side, it fails to compile when this signature is explicit:
> fff :: forall d x. (FunctorF d) => d -> F d x -> F d x
> fff a = fmapF a id
Interestingly, this works when you also give a type signature to "id":
fff :: forall d x. (Fu
On 18 mar 2008, at 19.47, Don Stewart wrote:
jgbailey:
From a recent interview[1] with the guy leading Ruby development on
.NET at Microsoft:
"You spend less time writing software than you spend maintaining
software. Optimizing for writing software versus maintaining software
is probably th
jgbailey:
> >From a recent interview[1] with the guy leading Ruby development on
> .NET at Microsoft:
>
> "You spend less time writing software than you spend maintaining
> software. Optimizing for writing software versus maintaining software
> is probably the wrong thing to do. Static typing mak
Hello Justin,
Tuesday, March 18, 2008, 7:41:15 PM, you wrote:
> is probably the wrong thing to do. Static typing makes it harder to
> maintain software because it's harder to change it."
> Two years ago I would have agreed with that statement. Now - no way.
f few weeks ago i made a post to main
Jules Bean wrote:
> Justin Bailey wrote:
>>> From a recent interview[1] with the guy leading Ruby development on
>> .NET at Microsoft:
>>
>> "You spend less time writing software than you spend maintaining
>> software. Optimizing for writing software versus maintaining software
>> is probably the
Hi Uwe,
On Sat, 2008-03-15 at 14:04 -0700, Uwe Hollerbach wrote:
> I'm trying
> for now to build ghc 6.6.1 -- so I started by upgrading gcc to 3.4.6.
> That's working. So, with that in place, I went to the "porting ghc to
> a new arch" page and started going through the steps. I'm using a
> laptop
On Thu, 2008-03-06 at 09:31 -0800, John MacFarlane wrote:
> > * A "compatibility" Text.ParserCombinators.Parsec tree for the old
> > Parsec. It's not perfect, but it should work with most Parsec 2
> > code.
>
> A data point: I recompiled pandoc with the new Text.ParserCombinators
Justin Bailey wrote:
From a recent interview[1] with the guy leading Ruby development on
.NET at Microsoft:
"You spend less time writing software than you spend maintaining
software. Optimizing for writing software versus maintaining software
is probably the wrong thing to do. Static typing ma
I find it interesting that "change" is equated with "maintenance". I would
say that maintenance is a very small subset of change. It's true that you
can change a program in a dynamically typed language more easily, in the
same way that changes are easier to make if you don't use source control an
It's not an issue of error codes. Though error code of WSAEWOULDBLOCK
and EAGAIN is different this is not the problem. You've posted a link
to preprocessed source code. And there is no implementation of
throwErrnoIfMinus1Retry_repeatOnBlock for Windows. This function for
Windows treat WSAEWOULDBLOC
>From a recent interview[1] with the guy leading Ruby development on
.NET at Microsoft:
"You spend less time writing software than you spend maintaining
software. Optimizing for writing software versus maintaining software
is probably the wrong thing to do. Static typing makes it harder to
mainta
Thanks very much
Daniel Fischer-4 wrote:
>
> Am Dienstag, 18. März 2008 16:00 schrieb iliali16:
>> Hi guys again just want to ask you I have this function ready
>
>> but when I use it for example
>>
>> image2PS spiral iliali
>>
>> it tells me that the iliali is undefined. What do you thing how
On Tue, Mar 18, 2008 at 3:41 AM, Vitaliy Akimov
<[EMAIL PROTECTED]> wrote:
> Unfortunally this way seems to be wrong. Error codes for winsockets
> and BSD-sockets are different.
Hmm, "Networking broken on Windows" would seem to be a pretty big
issue. One of the Windows peeps like to speak up her
iliali16 wrote:
I have this function ready
image2PS:: Image -> String -> IO()
but when I use it for example
image2PS spiral iliali
it tells me that the iliali is undefined.
iliali is a variable, which has to be bound so it can be used, e.g.
iliali = "iliali"
main = image2PS spiral il
Am Dienstag, 18. März 2008 16:00 schrieb iliali16:
> Hi guys again just want to ask you I have this function ready
> but when I use it for example
>
> image2PS spiral iliali
>
> it tells me that the iliali is undefined. What do you thing how should I
> use it. Thanks in advance!
image2PS spiral "
Hi guys again just want to ask you I have this function ready
-- Creates a Postscript file from an Image
-- page shows -200 <= x <= 200, 300 <= y <= 300
-- boundaries, plus origin plotted on output
image2PS:: Image -> String -> IO()
image2PS (Image contents) filename =
writeFile filename (hea
Thanks to all of you I got it I was missing the notation. Thanks again!
iliali16 wrote:
>
> Hi guys I am a bit new to haskell but I am doing good till now. I have to
> write a function that takes 2 inputs and then reutns one composite output.
> Now my problem is that I have to make composition
Op 17-mrt-2008, om 5:39 heeft Emir Pasalic het volgende geschreven:
And is the plural 'gatte'? :)
Not in Dutch, then it's 'gaten' (which is irregular, and the
Afrikaners don't like irregularities, so they regularized it).
Reinier
___
Haskell-Cafe
On 18 mar 2008, at 13.51, Luke Palmer wrote:
On Tue, Mar 18, 2008 at 12:24 PM, iliali16 <[EMAIL PROTECTED]> wrote:
Now the problem comes here:
play (p1 :>: p2) state
|play p1 state == (i1,state1) && play p2 state1 ==
(i2,state2)
= (i1+++i2,state2)
I know that if I manage t
On Tue, 2008-03-18 at 09:28 +, Alistair Bayley wrote:
> On 17/03/2008, Felix Martini <[EMAIL PROTECTED]> wrote:
> > Ryan Ingram wrote:
> > > For reference, I'm using GHC6.8.1 on WinXP.
> >
> > > setup.hs: ld is required but it could not be found.
> >
> > I did have the same issue with GHC 6.
On Tue, Mar 18, 2008 at 12:24 PM, iliali16 <[EMAIL PROTECTED]> wrote:
> Now the problem comes here:
> play (p1 :>: p2) state
> |play p1 state == (i1,state1) && play p2 state1 == (i2,state2)
> = (i1+++i2,state2)
>
> I know that if I manage to do that function the one above with this
Hi guys I am a bit new to haskell but I am doing good till now. I have to
write a function that takes 2 inputs and then reutns one composite output.
Now my problem is that I have to make composition of that function meaning
that I have to access in some way the output of the function before it is
Google announced last night that Haskell.org has been accepted as a
mentoring organisation for this year's Summer of Code (amongst 175 Open
Source organisations).
http://code.google.com/soc/2008/
The game is on!
Student applications open at 1900 UTC on Mon 24th March, and close at
2400 UTC o
> Do you have any program transformation DSL to make things easier? Or
> quickcheck tests or anything to make things easier?
I'm not sure I follow how these would make the port easier?
We don't have a DSL, but we do have a very sophisticated API:
http://www.cs.kent.ac.uk/projects/refactor-fp/har
> I believe that the limitation is that they use Programatica's parser
> to get an AST to run their refactorings on. I think they've looked
> several times at using ghc's apis to do this, but hit various
> problems. I think that the main problem is that no other parser
> preserves things like cod
> So that's why it doesn't work on Windows, I think I should find some
> way to make a socket unblocking after its creation.
Unfortunally this way seems to be wrong. Error codes for winsockets
and BSD-sockets are different.
___
Haskell-Cafe mailing lis
Do you have any program transformation DSL to make things easier? Or
quickcheck tests or anything to make things easier?
On 18 mar 2008, at 11.28, C.M.Brown wrote:
Hi Nikolas,
I supppose you're talking about HaRe, that Thomas Schilling linked
to.
I have no idea how that system is built
> C-jump is a neat idea, mapping something fun (downhill
> skiing) with programming. I look at this game and
> wonder what it would look like in the wonderful world
> of higher-order functions.
http://haskell.org/haskellwiki/Potential_projects
Greetings Marc Weber
___
Hi Nikolas,
> I supppose you're talking about HaRe, that Thomas Schilling linked to.
> I have no idea how that system is built so I can't answer your
> question. But in principle I don't see why not. :-)
In principle it would actually be quite difficult. HaRe is Haskell 98,
built upon the Program
Alistair Bayley wrote:
> Upgrading GHC to fix this seems a little extreme. You can just add
> gcc-lib (i.e. C:\ghc\ghc-6.8.1\gcc-lib) to your path.
Version 6.8.2 is a bugfix release over 6.8.1 and fixes other bugs as well.
___
Haskell-Cafe mailing list
H
Maybe off topic, but when I saw this, I thought, "Why
isn't there a Haskell version of this game?" (Or is
there?)
C-jump is a neat idea, mapping something fun (downhill
skiing) with programming. I look at this game and
wonder what it would look like in the wonderful world
of higher-order functio
2008/3/17, Adam Langley <[EMAIL PROTECTED]>:
> On Mon, Mar 17, 2008 at 2:29 AM, Vitaliy Akimov
>
>
> The important point here is that the recvFrom calls in
> Network.Socket[1] don't block.
Yes, this is the answer. Network.Socket.socket calls
System.Posix.Internals.setNonBlockingFD to set socket
On 17/03/2008, Felix Martini <[EMAIL PROTECTED]> wrote:
> Ryan Ingram wrote:
> > For reference, I'm using GHC6.8.1 on WinXP.
>
> > setup.hs: ld is required but it could not be found.
>
> I did have the same issue with GHC 6.8.1 on Windows. It is fixed in
> version 6.8.2.
>
> http://haskell.org/
52 matches
Mail list logo
