Re: generate and test, map

Article View: comp.lang.functional

Article #324

Back to comp.lang.functional Previous Next

#324

From: Joe Keane
Date: Fri, 15 Jun 1990 22:30

8 lines
1063 bytes

In article <20193@duke.cs.duke.edu> dy@grad17.cs.duke.edu (Doreen Yen) writes:
>It seems obvious that parallelism for functional programming can be
>had with MAP and REDUCE.  What are the refs. that actually say this?

It's nothing special.  If REDUCE can evaluate elements of the list in
parallel, it's only because the reduction function (CONS for MAP) can evaluate
its arguments in parallel.  This is true exactly if the reduction function is
strict in both arguments, which is always in a strict language.

Technical Details

Message-ID: <2936@osc.COM>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!watserv1!watmath!att!bellcore!rutgers!usc!zaphod.mps.ohio-state.edu!mips!pacbell.com!pacbell!osc!jgk

References: <20193@duke.cs.duke.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!watserv1!watmath!att!bellcore!rutgers!usc!zaphod.mps.ohio-state.edu!mips!pacbell.com!pacbell!osc!jgk
From: jgk@osc.COM (Joe Keane)
Newsgroups: comp.lang.functional
Subject: Re: generate and test, map
Summary: Parallelism comes from strict arguments.
Keywords: functional programming  logic programming   parallel programming
Message-ID: <2936@osc.COM>
Date: 15 Jun 90 22:30:15 GMT
References: <20193@duke.cs.duke.edu>
Reply-To: jgk@osc.COM (Joe Keane)
Organization: Object Sciences Corp., Menlo Park, CA
Lines: 8

Reply to Parent Message