Re: question about concurrency implementation

Dean Herington <[EMAIL PROTECTED]> writes: > From Simon Marlow's reply, I gather that the current implementations of > Concurrent Haskell provide "concurrency" but not "parallelism", and that > provision of parallelism is not likely in the near term. Uh, GPH exists, doesn't it? So you can get "

Re: question about concurrency implementation

By "true concurrency" I meant "simultaneous execution of multiple threads by multiple processors". This involves both concepts you define: "concurrency" (to have multiple threads) and "parallelism" (to have them execute possibly simultaneously when multiple processors are available). >From Sim

Re: Strictness!

Jay Cox <[EMAIL PROTECTED]> writes: > On Thu, 14 Mar 2002, Brian Huffman wrote: > > > In Haskell you can produce the desired behavior by using pattern guards. > > Since the pattern guards always get evaluated before the result does, they > > can be used to make things more strict. Here is the fo

Hello

We Welcome You Angie's Show Palace Your Private Virtual Date Awaits You. Are you tired of those XXX sites that boast they have 10,000 photos and videos that are available on many other adult web sites? We are. Why not have hundreds of photos of our very sexy girls that you can take

Re: question about concurrency implementation

> I'm curious about the implementation of Concurrent Haskell in GHC > and Hugs. Hugs' implementation of concurrency is non-preemptive wherease GHC's implementation is preemptive (or "almost preemptive") as described by Simon. > Does access to values possibly shared among threads cost the same i

Haskell slicing tool?

Are there any tools to perform program slicing on Haskell? I often find myself wanting to find all "fromJusts" invoked from the current function, or all functions that use a particular member of my monad's ADT. Sengan ___ Haskell mailing list [EMAIL PR

Re: using less stack

> Apologies for the typo: that should have been 5 elements, not 500. > > Amanda Clare wrote: > > I have stack problems: my program uses too much stack. I suspect, from > > removing bits of code, that it's due to a foldr in my program. If I use > > foldr or foldl on a long list (eg >500 bulk

Re: using less stack

Apologies for the typo: that should have been 5 elements, not 500. Amanda Clare wrote: > I have stack problems: my program uses too much stack. I suspect, from > removing bits of code, that it's due to a foldr in my program. If I use > foldr or foldl on a long list (eg >500 bulky elements f

RE: question about concurrency implementation

> I'm curious about the implementation of Concurrent Haskell in GHC and > Hugs. Does access to values possibly shared among threads > cost the same > in Concurrent Haskell as in regular Haskell? I'm guessing > the answer is > "yes", because Concurrent Haskell is provided by default in > GHC.

Haskell 98 report: March release

Folks Before I get buried in ICFP submissions I thought I should get out the H98 report draft. It's in the usual place: http://research.microsoft.com/~simonpj/haskell98-revised Main changes since the Dec release are: Much improved informal semantics of pattern matching (3.17).

using less stack

I have stack problems: my program uses too much stack. I suspect, from removing bits of code, that it's due to a foldr in my program. If I use foldr or foldl on a long list (eg >500 bulky elements for a 3M stack), is this likely to be filling the stack? What is it that gets stored on the stack

question about concurrency implementation

I'm curious about the implementation of Concurrent Haskell in GHC and Hugs. Does access to values possibly shared among threads cost the same in Concurrent Haskell as in regular Haskell? I'm guessing the answer is "yes", because Concurrent Haskell is provided by default in GHC. If the costs are

PhD studentship in Nottingham

Dear all, I'm seeking applicants for a PhD studentship in the area of functional programming, to start on 1st October 2002 for a period of three years. You will normally require a first-class Honours degree (or equivalent qualification) in Computer Science and/or Mathematics, and some experience

Reminder: GCSE/SAIG Submissions

Please excuse multiple listings of this announcement.       CALL FOR PAPERS     Submission Deadline: March 21, 2002   The First ACM SIGPLAN/SIGSOFT Conference on   Generators and Components (GCSE/SAIG'02)     Supporte

Functional and Declarative Programming in Education (FDPE02)

Functional and Declarative Programming in Education (FDPE02) A one day workshop at PLI'02 Monday 7 October 2002, Pittsburgh, PA, USA CALL FOR SUBMISSIONS Functional and declarative programming plays an increasingly important role in computing education at all levels. The aim of this w

Final CFP: Unification in non-classical logics

=== We apologize if you receive this more than once === Final call for papers Unification in Non-Clas