In mathematics and computer science, currying or Schönfinkelisation, invented by Moses Schönfinkel and later re-invented by Haskell Curry,[1] is the technique of transforming a function that takes multiple arguments (or an n-tuple of arguments) in such a way that it can be called as a chain of
This article is about the mathematical technique. For the cooking process of this name, see Curry. For the leather finishing process, see Currier. For horse grooming, see Currycomb. In mathematics ...
In mathematics and computer science, currying or Schönfinkelisation, invented by Moses Schönfinkel and later re-invented by Haskell Curry,[1] is the technique of transforming a function that takes multiple arguments (or an n-tuple of arguments) in such a way that it can be called as a chain of
このブックマークにはスターがありません。
最初のスターをつけてみよう！