On Thu, 22 May 1997, Mike Doyle wrote: > In-Reply-To: <Pine.OSF.3.95.970521095457.24057D-100000@otto.bf.rmit.edu.au> > >The distinction between 'procedural' and 'declarative' is related to > >that between an algorithm and a proof > Having written procedures (algorithms) for Euclidean geometry in Geomland > - including animating a construction of a Paucellier Cell to check whether > it is a straight line motion - I conclude that your assertion re Euclidean > Geometry vs Turtle Geometry falls. Hardly. So Geomland is a contrivance to procedurally render Euclidean Geometry. It's possible to make a declarative Turtle Geometry with Prolog, but aside from the fun of the hack, why bother? Jeff --------------------------------------------------------------- Please post messages to the Logo forum to logo-l@gsn.org. Mail questions about the list administration to logofdn@gsn.org. To unsubscribe send unsubscribe logo-l to majordomo@gsn.org.
Global SchoolNet Foundation -
Linking Kids Around the World!
Copyright GSN - All Rights Reserved
- Comments
& Questions
Visit GSN's
Global
Schoolhouse for more exciting learning resources!
Search our Site
-
Home