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?
Name:
Anonymous2014-05-19 16:08
>>15 An endotensor is a tensor of monoid endofunctor that maps to it's own category. Multiplication in that field is defined as successive recursive function calls (an example of a algebraic functions doing this: f(f(f(...f(x)...))); note that if f() is the successor function then this defines addition for the field of real numbers).