|Tail Recursion/Garbage Collection in C firstname.lastname@example.org (1994-02-13)|
|From:||email@example.com (Henry G. Baker)|
|Keywords:||Lisp, C, optimize|
|Date:||Sun, 13 Feb 1994 22:59:10 GMT|
I have just posted a 34Kbyte ANSI C file to comp.lang.scheme.c which shows
a novel way to implement tail recursion and garbage collection in C. This
program, called "CBOYER", is a hand-compiled version of the Lisp Boyer
Benchmark in a continuation-passing style of C. Due to its novel use of
the stack, it may make an interesting benchmark to compare hardware
I would be interested in any measurement results and feedback.
-- Henry Baker
Return to the
Search the comp.compilers archives again.