1\DOC C 2 3\TYPE {C : ('a -> 'b -> 'c) -> 'b -> 'a -> 'c} 4 5\KEYWORDS 6Combinator. 7 8\SYNOPSIS 9Permutes first two arguments to curried function: {C f x y} 10equals {f y x}. 11 12\FAILURE 13{C f} never fails and {C f x} never fails, but {C f x y} fails if {f y x} 14fails. 15 16\EXAMPLE 17{ 18- map (C cons []) [1,2,3]; 19> val it = [[1], [2], [3]] : int list list 20} 21 22 23\SEEALSO 24Lib.##, Lib.I, Lib.K, Lib.S, Lib.W. 25\ENDDOC 26