Unify quoting in metadata.xml files for machine processing

Force unified quoting in all metadata.xml files since lxml does not
preserve original use of single and double quotes. Ensuring unified
quoting before the process allows distinguishing the GLEP 67-related
metadata.xml changes from unrelated quoting changes.

1 files changed, 16 insertions, 16 deletions

diff --git a/sci-mathematics/isabelle/metadata.xml b/sci-mathematics/isabelle/metadata.xml
index 41285400dc40..986ebca59252 100644
--- a/sci-mathematics/isabelle/metadata.xml
+++ b/sci-mathematics/isabelle/metadata.xml
@@ -5,7 +5,7 @@
   <email>gienah@gentoo.org</email>
 </maintainer>
 <herd>sci-mathematics</herd>
-<longdescription lang='en'>
+<longdescription lang="en">
 Isabelle is a generic proof assistant. It allows mathematical
 formulas to be expressed in a formal language and provides tools
 for proving those formulas in a logical calculus. The main
@@ -15,29 +15,29 @@ correctness of computer hardware or software and proving
 properties of computer languages and protocols.
 </longdescription>
 <use>
-  <flag name='Pure'>Pure is the basis for all object-logics.</flag>
-  <flag name='FOL'>FOL (Many-sorted First-Order Logic) provides basic
+  <flag name="Pure">Pure is the basis for all object-logics.</flag>
+  <flag name="FOL">FOL (Many-sorted First-Order Logic) provides basic
   classical and intuitionistic first-order logic. It is polymorphic.</flag>
-  <flag name='HOL'>(Higher-Order Logic) is a version of classical higher-order
+  <flag name="HOL">(Higher-Order Logic) is a version of classical higher-order
   logic resembling that of the HOL System.</flag>
-  <flag name='ZF'>ZF (Set Theory) offers a formulation of Zermelo-Fraenkel
+  <flag name="ZF">ZF (Set Theory) offers a formulation of Zermelo-Fraenkel
   set theory on top of FOL.</flag>
-  <flag name='CCL'>CCL (Classical Computational Logic)</flag>
-  <flag name='CTT'>CTT (Constructive Type Theory) is an extensional version
+  <flag name="CCL">CCL (Classical Computational Logic)</flag>
+  <flag name="CTT">CTT (Constructive Type Theory) is an extensional version
   of Martin-Löf's Type Theory.</flag>
-  <flag name='Cube'>Cube (The Lambda Cube)</flag>
-  <flag name='FOLP'>FOLP (FOL with Proof Terms)</flag>
-  <flag name='LCF'>LCF (Logic of Computable Functions)</flag>
-  <flag name='Sequents'>Sequents (first-order, modal and linear logics)</flag>
-  <flag name='graphbrowsing'>Generate theory browsing information,
+  <flag name="Cube">Cube (The Lambda Cube)</flag>
+  <flag name="FOLP">FOLP (FOL with Proof Terms)</flag>
+  <flag name="LCF">LCF (Logic of Computable Functions)</flag>
+  <flag name="Sequents">Sequents (first-order, modal and linear logics)</flag>
+  <flag name="graphbrowsing">Generate theory browsing information,
   including HTML documents that show a theory's definition, the
   theorems proved in its ML file and the relationship with its
   ancestors and descendants.</flag>
-  <flag name='ledit'>Use ledit for the isabelle tty line editor</flag> 
-  <flag name='readline'>Use readline (rlwrap) for the isabelle tty line
+  <flag name="ledit">Use ledit for the isabelle tty line editor</flag> 
+  <flag name="readline">Use readline (rlwrap) for the isabelle tty line
   editor</flag> 
-  <flag name='proofgeneral'>Add support for the
+  <flag name="proofgeneral">Add support for the
   <pkg>app-emacs/proofgeneral</pkg> proof assistant front end.</flag>
-  <flag name='pide'>Build Isabelle/jEdit Prover IDE (PIDE).</flag> 
+  <flag name="pide">Build Isabelle/jEdit Prover IDE (PIDE).</flag> 
 </use>
 </pkgmetadata>