Is it possible to prove the theoretical stability (that is, prove that a collection algorithm will work as expected) of a garbage collector used in conjunction with C language?

When using 'optional' keyword for declaring a lambda, such as 'optional (x y z)', what does x, y and z signify?

Which of the following is NOT a garbage collection technique?

What is the main disadvantage of the bitmapped memory allocation scheme of the manual memory management?

When does a memory leak happen?

Which data structure does a compiler use to solve the register allocation problem?

What is the difference between eq and eql type predicates in Common Lisp?

What is the advantage of using a suballocator in a memory management system?

Which of the following problems prevents garbage collectors from being used in the real-time systems?

What is the return value of the subtype 'predicate', in case it CANNOT decide what is the relation between types it is asked about?

Is garbage collection available in Common Lisp implementations?