Fix some unicode issues

articles/2025-01-07-carton-and-cachet.md

@@ -25,8 +25,8 @@ objects, which are zlib compression and compression between objects using a
 patch.
 
 Furthermore, if we have 2 blobs (2 versions of a file), one of which contains
-‘A’ and the other contains ‘A+B’, the second blob will probably be saved in the
-form of a patch requiring the contents of the first blob and adding ‘+B’. At a
+'A' and the other contains 'A+B', the second blob will probably be saved in the
+form of a patch requiring the contents of the first blob and adding '+B'. At a
 higher level and according to our use of Git, we understand that this second
 level of compression is very interesting: we generally just add/remove new
 keywords in our files of our project.
@@ -44,8 +44,8 @@ an optimality in what can be considered as common between two files and what is
 not. It is at this stage that the use of [duff][duff] is introduced.
 
 This is a small library which can generate a patch between two files according
-to the series of bytes common to both files. We're talking about ‘series of
-bytes’ here because these elements common to our two files are not necessary
+to the series of bytes common to both files. We're talking about 'series of
+bytes' here because these elements common to our two files are not necessary
 humanly readable. To find these series of common bytes, we use [Rabin's
 fingerprint][rabin] algorithm: [a rolling hash][rolling-hash] used since time
 immemorial.
@@ -106,7 +106,7 @@ GitHub notification example.
 One attribute that we wanted to pay close attention to throughout our
 experimentation was "isomorphism". This property is very simple: imagine a
 function that takes an email as input and transforms it into another value
-using a method (such as compression). Isomorphism ensures that we can ‘undo’
+using a method (such as compression). Isomorphism ensures that we can 'undo'
 this method and obtain exactly the same result again:
 
 ```