Author: Dan Andersson
Date: 20:35:14 11/14/02
Go up one level in this thread
What are you trying to prove? Lazy evaluation, in the CS sense, can be optimized. As can most anything. Using well known transformations. A language implementation can have some implementation detail that makes it slow. Like making assignments immutable for example. That makes it neccessary to destroy and recreate all data at certain points. That is slow. But then you use a tree representation of large data and you go from N to log N. Or list access may be by traversion. Then you use a good data representation. Slowness usually stems from poor comprehension on the programmers part. Using lists as arrays an such. MvH Dan Anderssond
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.