(define (some-procedure a b c d) (some-code))

(list 1 2 3)

(define (func a b c d) ...)(apply func '(1 2 3 4))

(define (curry func n-args)  (define (curry-aux acc)    (lambda args      (if (< (+ (length acc) (length args)) n-args)          (curry-aux (append acc args))          (apply func (append acc args)))))  (curry-aux ()))(define cfunc (curry func 4))(func 1 2 3 4) == (cfunc 1 2 3 4) == ((cfunc 1 2) 3 4) == ((((cfunc 1) 2) 3) 4) == ...

(define partially (apply cfunc '(1 2)))(partially 3 4) == (func 1 2 3 4)

(define (curry fun . args)  (lambda x (apply fun (append args x))))(define (func a b c d)  (display a) (newline)  (display b) (newline)  (display c) (newline)  (display d) (newline))(define cfunc (apply curry (cons func '(1 2))))

> (cfunc 3 4)1234

Quote:Original post by Zahlman
I think that's a little more complicated than necessary :)

*** Source Snippet Removed ***

(define (curry1 fun arglst)  (lambda x (apply fun (append arglst x))))(define (curry2 fun . arglst)  (lambda x (apply fun (append arglst x)))); Usage(define curried1 (curry1 func 1 2 3))(define curried2 (curry2 func '(1 2 3)))

Quote:Original post by Zahlman
Ah, of course. (Wasn't there another syntax like (define name (lambda x y (stuff)))?)

(define (func a b c)  body)==(define func  (lambda (a b c)     body))

...== (define (func . args)  (let ((a (car args))        (b (cadr args))        (c (caddr args)))     body))==(define func  (lambda args    (let ((a (car args))          (b (cadr args))          (c (caddr args)))      body)))

Quote:Original post by Zahlman
I think that's a little more complicated than necessary :)

*** Source Snippet Removed ***

(define (curry fun args)  (lambda x (apply fun (append args x))))(define (func a b c d)  (display a) (newline)  (display b) (newline)  (display c) (newline)  (display d) (newline))(define cfunc (curry func '(1 2)))