Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!uakari.primate.wisc.edu!unmvax!pprg.unm.edu!topgun.dspo.gov!lanl!opus!ted
From: ted@nmsu.edu (Ted Dunning)
Newsgroups: comp.lang.scheme
Subject: Re: Parity with conventional programs
Message-ID: 
Date: 3 Oct 89 22:56:48 GMT
References: <8910020245.AA06270@solaria.mcs.anl.gov> <10684@phoenix.Princeton.EDU>
Sender: news@nmsu.edu
Organization: NMSU Computer Science
Lines: 17
In-reply-to: markv@phoenix.Princeton.EDU's message of 3 Oct 89 16:54:41 GMT


In article <10684@phoenix.Princeton.EDU> markv@phoenix.Princeton.EDU (Mark T Vandewettering) writes:

   wide variety of problems.  An interesting problem that I recently
   "rediscovered" was to implement Conway's "life" cellular automaton in a
   functional language.  Using program transformations, it is a very
   interesting problem, with many possible solutions that are interesting 
   to parallelize.


could you post something on this?  say some code/discussion on how you
did it?

--
ted@nmsu.edu
			remember, when extensions and subsets are outlawed,
			only outlaws will have extensions or subsets