Update README.md

andreyomatveev · web-flow · commit fc9f6367a029 · 2022-08-29T01:42:46.000+05:00
diff --git a/README.md b/README.md
@@ -1,6 +1,5 @@
-# Farey (Sub)sequences: A Clojure namespace and a Haskell module #
-A Clojure namespace `fareysequences.clj` and a Haskell module `FareySequencesModule.hs` exporting a dozen of functions coded after several selected formulas presented 
-in the monograph [A.O. Matveev, Farey Sequences: Duality and Maps Between Subsequences](https://doi.org/10.1515/9783110547665), Berlin, Boston: De Gruyter, 2017. 
+# Farey (Sub)sequences: A Clojure namespace, and Haskell and Python modules #
+A Clojure namespace `fareysequences.clj`, and a Haskell module `FareySequencesModule.hs`, and a Python module `fareysequences.py` exporting a dozen of functions coded after several selected formulas presented in the monograph [A.O. Matveev, Farey Sequences: Duality and Maps Between Subsequences](https://doi.org/10.1515/9783110547665), Berlin, Boston: De Gruyter, 2017. 
 
 ## Our Dramatis Personae ##
   (See Table 1.1 of the monograph):
@@ -21,11 +20,12 @@ then first you should realize what you hold in your hands in the beginning.
 
 If you have two neighboring fractions, then you proceed in the recurrent manner by means of a relatively fast function 
 of the form `predecessor-of-pair-of-neighbors-in-personage` or `successor-of-pair-of-neighbors-in-personage`, in Clojure 
-(`predecessorOfPairOfNeighborsInPersonage` or `successorOfPairOfNeighborsInPersonage`, in Haskell), depending on which direction (descending 
-or ascending) you take.
+(`predecessorOfPairOfNeighborsInPersonage` or `successorOfPairOfNeighborsInPersonage`, in Haskell; `predecessor_of_pair_of_neighbors_in_personage` 
+or `successor_of_pair_of_neighbors_in_personage`, in Python), depending on which direction (descending or ascending) you take.
 
 If you have one fraction then, in order to obtain your starting pair of neighboring fractions, you make one-time use of a relatively slow 
-function of the form `predecessor-in-personage` or `successor-in-personage`, in Clojure (`predecessorInPersonage` or `successorInPersonage`, in Haskell), 
-and then you proceed by calling, in the recurrent manner, the corresponding relatively fast function of the form 
-`predecessor-of-pair-of-neighbors-in-personage` or `successor-of-pair-of-neighbors-in-personage` 
-(`predecessorOfPairOfNeighborsInPersonage` or `successorOfPairOfNeighborsInPersonage`).
+function of the form `predecessor-in-personage` or `successor-in-personage`, in Clojure (`predecessorInPersonage` or `successorInPersonage`, in Haskell;
+`predecessor_in_personage` or `successor_in_personage`, in Python), and then you proceed by calling, in the recurrent manner, the corresponding relatively fast
+function of the form `predecessor-of-pair-of-neighbors-in-personage` or `successor-of-pair-of-neighbors-in-personage` 
+(`predecessorOfPairOfNeighborsInPersonage` or `successorOfPairOfNeighborsInPersonage`; `predecessor_of_pair_of_neighbors_in_personage` 
+or `successor_of_pair_of_neighbors_in_personage`).
