diff --git a/Data/SortedList.hs b/Data/SortedList.hs
--- a/Data/SortedList.hs
+++ b/Data/SortedList.hs
@@ -20,6 +20,8 @@
   , uncons
     -- * Inserting
   , insert
+    -- * Deleting
+  , delete
     -- * Sublists
   , take
   , drop
@@ -175,6 +177,11 @@
 insert x xs = mappend (singleton x) xs
 #endif
 
+-- | Delete the first occurrence of the given element.
+delete :: Eq a => a -> SortedList a -> SortedList a
+{-# INLINE delete #-}
+delete x (SortedList xs) = SortedList $ List.delete x xs
+
 -- | Extract the prefix with the given length from a sorted list.
 take :: Int -> SortedList a -> SortedList a
 take n = fst . splitAt n
@@ -245,8 +252,8 @@
 --   Note that 'map' will hang if the argument is an infinite list.
 --
 --   Even though 'SortedList' can't be made an instance of 'Functor',
---   'map' /does/ hold the 'Functor' laws. The problem to write
---   this instance is the 'Ord' instance requirement on the type of
+--   'map' /does/ hold the 'Functor' laws (for finite lists).
+--   We can't however write an instance because of the 'Ord' instance requirement on the type of
 --   the elements of the result list. Therefore, while 'SortedList'
 --   is not a functor type in general, it is when restricted to elements of
 --   orderable types.
diff --git a/sorted-list.cabal b/sorted-list.cabal
--- a/sorted-list.cabal
+++ b/sorted-list.cabal
@@ -1,5 +1,5 @@
 name:                sorted-list
-version:             0.1.4.2
+version:             0.1.5.0
 synopsis:            Type-enforced sorted lists and related functions.
 description:         Type-enforced sorted lists and related functions.
                      .