home *** CD-ROM | disk | FTP | other *** search
- ;For example, consider the following tak benchmark code from
- ;Richard P Gabriel,
- ;"Performance and Evaluation of Lisp Systems";
- ;MIT Press, 1985.
-
-
- ; tak
- ; function-call-heavy; test of function call and recursion
-
- (define (tak x y z)
- (if (not (< y x))
- z
- (tak (tak (- x 1) y z)
- (tak (- y 1) z x)
- (tak (- z 1) x y))))
-
- ;; call this for benchmark..
- ;; (tak 18 12 6)
-
- ;On our Sun 3/140, C Scheme gets through this in 75 seconds while UMB Scheme
- ;takes 98 seconds; in this instance C Scheme runs faster.
- ;
- ;Ahem and in GNU Scheme on an archimedes it does it in 13secs.
- ; 41.56 secs in EdScheme.
-