I am developing a code for symbolical computations (not general
purpose) with quadratic surds and rationals, some thousand - thousand-
a-half lines of GNU-MIT scheme, and I am encountering from time to
time memory related errors as "Out of memory" and "Maximum recursion
An important part of my code deals with merging two sorted files, each
line beeing a scheme object, into a unique sorted file. I am using no
Maybe someone can help me in finding a library, defining a function
that takes two input files, one output file and a predicate for
comparing two elements, and manages the work by itself?
Some other questions:
Is there a way to extract a dependency graph from my rather spaghetti
Is there a way to decide statically wheter my functions do really
always behave as tail-recursive (as I intended)?
Is there a way of profiling my scheme code, so that I can select the
data on which my code behaves badly?
Thanks in advance