From eebb9c23c6bb823a1add01315bda706af62d9f29 Mon Sep 17 00:00:00 2001
From: Avaq <aldwin.vlasblom@gmail.com>
Date: Sat, 4 Feb 2017 18:25:47 +0100
Subject: [PATCH] Simplify the overly wordy documentation for S.compose

---
 index.js | 8 ++------
 1 file changed, 2 insertions(+), 6 deletions(-)

diff --git a/index.js b/index.js
index a2a26384..2c714a27 100644
--- a/index.js
+++ b/index.js
@@ -769,12 +769,8 @@
 
   //# compose :: (b -> c) -> (a -> b) -> a -> c
   //.
-  //. Takes two functions assumed to be unary and a value of any type,
-  //. and returns the result of applying the first function to the result
-  //. of applying the second function to the given value.
-  //.
-  //. In general terms, `compose` performs right-to-left composition of two
-  //. unary functions.
+  //. Composes two unary functions, from right to left. Equivalent to Haskell's
+  //. `(.)` function.
   //.
   //. This is the B combinator from combinatory logic.
   //.