Thread View: comp.lang.functional
2 messages
2 total messages
Started by Doreen Yen
Thu, 14 Jun 1990 14:43
generate and test, map
Author: Doreen Yen
Date: Thu, 14 Jun 1990 14:43
Date: Thu, 14 Jun 1990 14:43
12 lines
882 bytes
882 bytes
It seems obvious that parallelism for functional programming can be
had with MAP and REDUCE. What are the refs. that actually say this?
Logic programmers find solutions with generate&test and improve
efficiency by pushing the testing into the generation (Shapiro,Coelho).
What is the equivalent idea for functional programmers? Is this in any
way related to lazy evaluation?
Doreen Yen UUCP: ..!{ihnp4,decvax}!duke!dy
CSNET: dy@duke
ARPA: dy@cs.duke.edu
"Have a Happy Year of the Horse"
Re: generate and test, map
Author: Joe Keane
Date: Fri, 15 Jun 1990 22:30
Date: Fri, 15 Jun 1990 22:30
8 lines
1063 bytes
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.
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads