Bikeshed Stackless

What if a function marked as [stackless] would allocate its' stack frame on the heap? This would include parameters pushed by the caller and the return address.

Each task would have a "lowest used address" global variable (lowest_used) that records

+

+------------+
| Parameters |
|            |
+------------+
| Ret Addr   |
+------------+
| Locals     |
|            |
+------------+
| Parameters |
|            |
+------------+
| Ret Addr   |
+------------+
| Locals     |
|            |
+------------+