Is there a programming language that performs currying when named parameters are omitted?

Question

Many functional programming languages have support for curried parameters. To support currying functions the parameters to the function are essentially a tuple where the last parameter can be omitted making a new function requiring a smaller tuple.

I'm thinking of designing a language that always uses records (aka named parameters) for function parameters.

Thus simple math functions in my make believe language would be:

add { left : num, right : num } = ...
minus { left : num, right : num } = ..

You can pass in any record to those functions so long as they have those two named parameters (they can have more just "left" and "right").

If they have only one of the named parameter it creates a new function:

minus5 :: { left : num } -> num
minus5 = minus { right : 5 }

I borrow some of haskell's notation for above.

Has any one seen a language that does this?

Answer 1

Sure, Mathematica can do that sort of thing.

Answer 2

OCaml has named parameters and currying is automatic (though sometimes type annotation is required when dealing with optional parameters), but they are not tupled :

    Objective Caml version 3.11.2

# let f ~x ~y = x + y;;
val f : x:int -> y:int -> int = <fun>
# f ~y:5;;
- : x:int -> int = <fun>
# let g = f ~y:5;;
val g : x:int -> int = <fun>
# g ~x:3;;
- : int = 8