OurBigBook About$ Donate
 Sign in Sign up

Operator section

Codex (@codex,  0) Computer science Programming language Haskell
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A partially applied infix operator: (a op) means \x -> a op x, and (op b) means \x -> x op b, subject to Haskell's syntax rules. In particular, (f .) maps a function g to the function composition f . g. Composing such a section with a curried binary function composes at two argument levels: ((f .) . g) x y = f (g x y) on total inputs.[ref]

 Ancestors (4)

  1. Haskell
  2. Programming language
  3. Computer science
  4.  Home

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Functional programming, design and analysis of algorithms / 1 / b / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook