# HG changeset patch
# User wenzelm
# Date 1528278114 -7200
# Node ID c558a2202f3243b709f72c9f76304b65627da1d1
# Parent  1c84a8c513af8a53d2ddf98eb8063a34a8d0c5f0
eliminated suspicious Unicode;

diff -r 1c84a8c513af -r c558a2202f32 src/HOL/Library/Code_Lazy.thy
--- a/src/HOL/Library/Code_Lazy.thy	Wed Jun 06 11:41:37 2018 +0200
+++ b/src/HOL/Library/Code_Lazy.thy	Wed Jun 06 11:41:54 2018 +0200
@@ -17,7 +17,7 @@
 text \<open>
   This theory and the CodeLazy tool described in @{cite "LochbihlerStoop2018"}.
 
-  It hooks into Isabelle’s code generator such that the generated code evaluates a user-specified
+  It hooks into Isabelle's code generator such that the generated code evaluates a user-specified
   set of type constructors lazily, even in target languages with eager evaluation.
   The lazy type must be algebraic, i.e., values must be built from constructors and a
   corresponding case operator decomposes them. Every datatype and codatatype is algebraic