You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Scheme (and possibly racket) has function called apply and list. Will these function also be available in hackett? What about their type signatures?
Note:
Even though apply takes a list as an argument in scheme it would make much more sense to take a tuple as an argument. There should be also a tuple variant of list. Also foo and apply foo . tuple should be equal.
The text was updated successfully, but these errors were encountered:
It’s unlikely that either of these will exist as functions, but it’s quite possible they will exist as forms. The list form is already available as [ square brackets ], but as you mention, homogenous lists probably aren’t what you’re looking for, anyway. Tuples (of arbitrary size) are not currently implemented, but they are planned.
Addressing apply is a little trickier. Implementing it as a macro probably wouldn’t be too hard, but that would restrict higher-order usage. It’s possible that it could be implemented more cleverly, though, with the use of a special Tuple typeclass and some clever macro machinery.
Scheme (and possibly racket) has function called
apply
andlist
. Will these function also be available in hackett? What about their type signatures?Note:
Even though
apply
takes a list as an argument in scheme it would make much more sense to take a tuple as an argument. There should be also atuple
variant of list. Alsofoo
andapply foo . tuple
should be equal.The text was updated successfully, but these errors were encountered: