Is there any destructuring lambda in T (or a clean way to simulate one)?
I'd like to be able to do something like:
(define (foo (x y) z)
(list x y z))
(foo '((a b) c)) ==> (a b c)
Basically I need a lambda form that destructures its arguments instead of
mapping them only at the top level.
Ashwin.
-------