Continued fraction/Arithmetic/Construct from rational number: Difference between revisions

I amfound notthe certainreference to "lazy evaluation" is the best way to describe what is neededmisleading, for it implies featuresa special feature of a programming language. Haskell, for example, evaluates lists "lazily". ATS2 has the notation '''$delay''', forand there are various "lazy evaluationlist" ofimplementations thatfor kindScheme. I considered using such methods, but decided against doing so.

What one is--I am certain--supposed to write is means for generating an arbitrary number of terms of a continued fraction, one term after another. It happens that, for a rational number, eventually all further terms are known to be infiniteswamped by an infinity, and so need not be computed. The finite terms ''could'' be returned as a finite-length list. However, this will not be so when irrational numbers enter the picture. SoTherefore one needs a way to generate ''any''an indefinite number'' of terms. AndBut this is something that requires no "lazy" features of a language. It could be done about as easily in standard C! asThe inresulting code might, indeed, evaluate terms "lazily", but no special language features are ATSrequired.