Lisp

Is there a lisp with manual memory management? I.e. with the ability to choose between pass-by-value and pass-by-ref, to free and allocate memory, to choose what gets allocated on heap, stack, registers, to choose the memory layout of structs, etc?

>>10
Lambdas are not closures because they are not closed under endotensor multiplication except for the degenerate case. That is to say, the set of all lambdas form a commutative ring, while true closures form a commutative field. Furthermore, the transformation T: C >L is onto, but not injective, meaning that while every lambda has an associated closure form, not every closure can be a lambda.