You might also like my `fancy-app` package, which is much simpler but
does what I want most of the time.
Sam
On Fri, Oct 12, 2018 at 11:01 AM Sam Tobin-Hochstadt
wrote:
>
> Here's I think a nicer version. I omitted the error checking and
> renaming, and used a hash table mapping positions
Here's I think a nicer version. I omitted the error checking and
renaming, and used a hash table mapping positions (starting from 0) to
values to be supplied for that argument. It's rather inefficient but
could be easily optimized.
#lang racket
(define (reduce-arity f h)
(λ args
(define h*
fre. 12. okt. 2018 kl. 16.50 skrev Matthew Butterick :
> I know about `curry` and `curryr`, of course. But is there a way to
> accomplish arbitrary currying at run time (not just at the ends of the
> argument list)? (Or is it called partial application?)
Maybe cut ?
I know about `curry` and `curryr`, of course. But is there a way to accomplish
arbitrary currying at run time (not just at the ends of the argument list)? (Or
is it called partial application?)
Let's suppose we have `f`:
(define f (λ (a b c d) (+ a b c d)))
(f 1 2 3 4) ; 10
And we want to
4 matches
Mail list logo
