isabelle-cookbook: comparison ProgTutorial/Advanced.thy

equal deleted inserted replaced

-:6e2479089226
+:cecd7a941885
 theory Advanced
 imports Base First_Steps
 begin
-chapter {* Advanced Isabelle\label{chp:advanced} *}
+chapter \<open>Advanced Isabelle\label{chp:advanced}\<close>
-text {*
+text \<open>
 \begin{flushright}
 {\em All things are difficult before they are easy.} \\[1ex]
 proverb\\[2ex]
 {\em Programming is not just an act of telling a computer what
 to do: it is also an act of telling other programmers what you
 can be seen as the ``long-term memory'' of Isabelle. There is usually only
 one theory active at each moment. Proof contexts and local theories, on the
 other hand, store local data for a task at hand. They act like the
 ``short-term memory'' and there can be many of them that are active in
 parallel.
-*}
+\<close>
-section {* Theories\label{sec:theories} *}
+section \<open>Theories\label{sec:theories}\<close>
-text {*
+text \<open>
 Theories, as said above, are the most basic layer of abstraction in
 Isabelle. They record information about definitions, syntax declarations, axioms,
 theorems and much more.  For example, if a definition is made, it
 must be stored in a theory in order to be usable later on. Similar
 with proofs: once a proof is finished, the proved theorem needs to
 usable. All relevant data of a theory can be queried with the
 Isabelle command \isacommand{print\_theory}.
 \begin{isabelle}
 \isacommand{print\_theory}\\
-@{text "> names: Pure Code_Generator HOL \<dots>"}\\
+\<open>> names: Pure Code_Generator HOL \<dots>\<close>\\
-@{text "> classes: Inf < type \<dots>"}\\
+\<open>> classes: Inf < type \<dots>\<close>\\
-@{text "> default sort: type"}\\
+\<open>> default sort: type\<close>\\
-@{text "> syntactic types: #prop \<dots>"}\\
+\<open>> syntactic types: #prop \<dots>\<close>\\
-@{text "> logical types: 'a \<times> 'b \<dots>"}\\
+\<open>> logical types: 'a \<times> 'b \<dots>\<close>\\
-@{text "> type arities: * :: (random, random) random \<dots>"}\\
+\<open>> type arities: * :: (random, random) random \<dots>\<close>\\
-@{text "> logical constants: == :: 'a \<Rightarrow> 'a \<Rightarrow> prop \<dots>"}\\
+\<open>> logical constants: == :: 'a \<Rightarrow> 'a \<Rightarrow> prop \<dots>\<close>\\
-@{text "> abbreviations: \<dots>"}\\
+\<open>> abbreviations: \<dots>\<close>\\
-@{text "> axioms: \<dots>"}\\
+\<open>> axioms: \<dots>\<close>\\
-@{text "> oracles: \<dots>"}\\
+\<open>> oracles: \<dots>\<close>\\
-@{text "> definitions: \<dots>"}\\
+\<open>> definitions: \<dots>\<close>\\
-@{text "> theorems: \<dots>"}
+\<open>> theorems: \<dots>\<close>
 \end{isabelle}
-Functions acting on theories often end with the suffix @{text "_global"},
+Functions acting on theories often end with the suffix \<open>_global\<close>,
 for example the function @{ML read_term_global in Syntax} in the structure
 @{ML_struct Syntax}. The reason is to set them syntactically apart from
 functions acting on contexts or local theories, which will be discussed in
 the next sections. There is a tendency amongst Isabelle developers to prefer
 ``non-global'' operations, because they have some advantages, as we will also
 stored.  This is a fundamental principle in Isabelle. A similar situation
 arises with declaring a constant, which can be done on the ML-level with
 function @{ML_ind declare_const in Sign} from the structure @{ML_struct
 Sign}. To see how \isacommand{setup} works, consider the following code:
-*}
+\<close>
-ML %grayML{*let
+ML %grayML\<open>let
 val thy = @{theory}
 val bar_const = ((@{binding "BAR"}, @{typ "nat"}), NoSyn)
 in
 Sign.declare_const @{context} bar_const thy
-end*}
+end\<close>
-text {*
+text \<open>
 If you simply run this code\footnote{Recall that ML-code needs to be enclosed in
-\isacommand{ML}~@{text "\<verbopen> \<dots> \<verbclose>"}.} with the
+\isacommand{ML}~\<open>\<verbopen> \<dots> \<verbclose>\<close>.} with the
-intention of declaring a constant @{text "BAR"} having type @{typ nat}, then
+intention of declaring a constant \<open>BAR\<close> having type @{typ nat}, then
 indeed you obtain a theory as result. But if you query the
 constant on the Isabelle level using the command \isacommand{term}
 \begin{isabelle}
-\isacommand{term}~@{text BAR}\\
+\isacommand{term}~\<open>BAR\<close>\\
-@{text "> \"BAR\" :: \"'a\""}
+\<open>> "BAR" :: "'a"\<close>
 \end{isabelle}
 you can see that you do \emph{not} obtain the expected constant of type @{typ nat}, but a free
 variable (printed in blue) of polymorphic type. The problem is that the
 ML-expression above did not ``register'' the declaration with the current theory.
 This is what the command \isacommand{setup} is for. The constant is properly
 declared with
-*}
+\<close>
-setup %gray {* fn thy =>
+setup %gray \<open>fn thy =>
 let
 val bar_const = ((@{binding "BAR"}, @{typ "nat"}), NoSyn)
 val (_, thy') = Sign.declare_const @{context} bar_const thy
 in
 thy'
-end *}
+end\<close>
-text {*
+text \<open>
 where the declaration is actually applied to the current theory and
 \begin{isabelle}
 \isacommand{term}~@{text [quotes] "BAR"}\\
-@{text "> \"BAR\" :: \"nat\""}
+\<open>> "BAR" :: "nat"\<close>
 \end{isabelle}
 now returns a (black) constant with the type @{typ nat}, as expected.
 In a sense, \isacommand{setup} can be seen as a transaction that
-takes the current theory @{text thy}, applies an operation, and
+takes the current theory \<open>thy\<close>, applies an operation, and
-produces a new current theory @{text thy'}. This means that we have
+produces a new current theory \<open>thy'\<close>. This means that we have
 to be careful to apply operations always to the most current theory,
 not to a \emph{stale} one. Consider again the function inside the
 \isacommand{setup}-command:
 \begin{isabelle}
 \begin{graybox}
-\isacommand{setup}~@{text "\<verbopen>"} @{ML
+\isacommand{setup}~\<open>\<verbopen>\<close> @{ML
 "fn thy =>
 let
 val bar_const = ((@{binding \"BAR\"}, @{typ \"nat\"}), NoSyn)
 val (_, thy') = Sign.declare_const @{context} bar_const thy
 in
 thy
-end"}~@{text "\<verbclose>"}\isanewline
+end"}~\<open>\<verbclose>\<close>\isanewline
-@{text "> ERROR: \"Stale theory encountered\""}
+\<open>> ERROR: "Stale theory encountered"\<close>
 \end{graybox}
 \end{isabelle}
-This time we erroneously return the original theory @{text thy}, instead of
+This time we erroneously return the original theory \<open>thy\<close>, instead of
-the modified one @{text thy'}. Such buggy code will always result into
+the modified one \<open>thy'\<close>. Such buggy code will always result into
 a runtime error message about stale theories.
 \begin{readmore}
 Most of the functions about theories are implemented in
 @{ML_file "Pure/theory.ML"} and @{ML_file "Pure/global_theory.ML"}.
 \end{readmore}
-*}
+\<close>
-section {* Contexts *}
+section \<open>Contexts\<close>
-text {*
+text \<open>
 Contexts are arguably more important than theories, even though they only
 contain ``short-term memory data''. The reason is that a vast number of
 functions in Isabelle depend in one way or another on contexts. Even such
 mundane operations like printing out a term make essential use of contexts.
 For this consider the following contrived proof-snippet whose purpose is to
 fix two variables:
-*}
+\<close>
 lemma "True"
 proof -
-ML_prf {* Variable.dest_fixes @{context} *}
+ML_prf \<open>Variable.dest_fixes @{context}\<close>
 fix x y
-ML_prf {* Variable.dest_fixes @{context} *}(*<*)oops(*>*)
+ML_prf \<open>Variable.dest_fixes @{context}\<close>(*<*)oops(*>*)
-text {*
+text \<open>
 The interesting point is that we injected ML-code before and after
 the variables are fixed. For this remember that ML-code inside a proof
-needs to be enclosed inside \isacommand{ML\_prf}~@{text "\<verbopen> \<dots> \<verbclose>"},
+needs to be enclosed inside \isacommand{ML\_prf}~\<open>\<verbopen> \<dots> \<verbclose>\<close>,
-not \isacommand{ML}~@{text "\<verbopen> \<dots> \<verbclose>"}. The function
+not \isacommand{ML}~\<open>\<verbopen> \<dots> \<verbclose>\<close>. The function
 @{ML_ind dest_fixes in Variable} from the structure @{ML_struct Variable} takes
 a context and returns all its currently fixed variable (names). That
 means a context has a dataslot containing information about fixed variables.
-The ML-antiquotation @{text "@{context}"} points to the context that is
+The ML-antiquotation \<open>@{context}\<close> points to the context that is
 active at that point of the theory. Consequently, in the first call to
 @{ML dest_fixes in Variable} this dataslot is  empty; in the second it is
-filled with @{text x} and @{text y}. What is interesting is that contexts
+filled with \<open>x\<close> and \<open>y\<close>. What is interesting is that contexts
 can be stacked. For this consider the following proof fragment:
-*}
+\<close>
 lemma "True"
 proof -
 fix x y
 { fix z w
-ML_prf {* Variable.dest_fixes @{context} *}
+ML_prf \<open>Variable.dest_fixes @{context}\<close>
 }
-ML_prf {* Variable.dest_fixes @{context} *}(*<*)oops(*>*)
+ML_prf \<open>Variable.dest_fixes @{context}\<close>(*<*)oops(*>*)
-text {*
+text \<open>
 Here the first time we call @{ML dest_fixes in Variable} we have four fixes variables;
-the second time we get only the fixes variables @{text x} and @{text y} as answer, since
+the second time we get only the fixes variables \<open>x\<close> and \<open>y\<close> as answer, since
-@{text z} and @{text w} are not anymore in the scope of the context.
+\<open>z\<close> and \<open>w\<close> are not anymore in the scope of the context.
 This means the curly-braces act on the Isabelle level as opening and closing statements
 for a context. The above proof fragment corresponds roughly to the following ML-code
-*}
+\<close>
-ML %grayML{*val ctxt0 = @{context};
+ML %grayML\<open>val ctxt0 = @{context};
 val ([x, y], ctxt1) = Variable.add_fixes ["x", "y"] ctxt0;
-val ([z, w], ctxt2) = Variable.add_fixes ["z", "w"] ctxt1*}
+val ([z, w], ctxt2) = Variable.add_fixes ["z", "w"] ctxt1\<close>
-text {*
+text \<open>
 where the function @{ML_ind add_fixes in Variable} fixes a list of variables
 specified by strings. Let us come back to the point about printing terms. Consider
-printing out the term \mbox{@{text "(x, y, z, w)"}} using our function @{ML_ind pretty_term}.
+printing out the term \mbox{\<open>(x, y, z, w)\<close>} using our function @{ML_ind pretty_term}.
 This function takes a term and a context as argument. Notice how the printing
 of the term changes according to which context is used.
 \begin{isabelle}
 \begin{graybox}
 [ pretty_term ctxt0 trm,
 pretty_term ctxt1 trm,
 pretty_term ctxt2 trm ])
 end"}\\
 \setlength{\fboxsep}{0mm}
-@{text ">"}~@{text "("}\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text x}}}@{text ","}~%
+\<open>>\<close>~\<open>(\<close>\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>x\<close>}}\<open>,\<close>~%
-\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text y}}}@{text ","}~%
+\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>y\<close>}}\<open>,\<close>~%
-\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text z}}}@{text ","}~%
+\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>z\<close>}}\<open>,\<close>~%
-\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text w}}}@{text ")"}\\
+\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>w\<close>}}\<open>)\<close>\\
-@{text ">"}~@{text "("}\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{@{text x}}}@{text ","}~%
+\<open>>\<close>~\<open>(\<close>\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{\<open>x\<close>}}\<open>,\<close>~%
-\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{@{text y}}}@{text ","}~%
+\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{\<open>y\<close>}}\<open>,\<close>~%
-\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text z}}}@{text ","}~%
+\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>z\<close>}}\<open>,\<close>~%
-\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text w}}}@{text ")"}\\
+\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>w\<close>}}\<open>)\<close>\\
-@{text ">"}~@{text "("}\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{@{text x}}}@{text ","}~%
+\<open>>\<close>~\<open>(\<close>\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{\<open>x\<close>}}\<open>,\<close>~%
-\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{@{text y}}}@{text ","}~%
+\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{\<open>y\<close>}}\<open>,\<close>~%
-\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{@{text z}}}@{text ","}~%
+\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{\<open>z\<close>}}\<open>,\<close>~%
-\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{@{text w}}}@{text ")"}
+\colorbox{gray!20}{\raisebox{0mm}[3mm][1mm]{\<open>w\<close>}}\<open>)\<close>
 \end{graybox}
 \end{isabelle}
 The term we are printing is in all three cases the same---a tuple containing
 four free variables. As you can see, however, in case of @{ML "ctxt0"} all
 variables are highlighted indicating a problem, while in case of @{ML
-"ctxt1"} @{text x} and @{text y} are printed as normal (blue) free
+"ctxt1"} \<open>x\<close> and \<open>y\<close> are printed as normal (blue) free
-variables, but not @{text z} and @{text w}. In the last case all variables
+variables, but not \<open>z\<close> and \<open>w\<close>. In the last case all variables
 are printed as expected. The point of this example is that the context
 contains the information which variables are fixed, and designates all other
 free variables as being alien or faulty.  Therefore the highlighting.
 While this seems like a minor detail, the concept of making the context aware
 of fixed variables is actually quite useful. For example it prevents us from
 @{ML_response_fake [gray, display]
 "@{context}
 |> Variable.variant_fixes [\"y\", \"y\", \"z\"]"
 "([\"y\", \"ya\", \"z\"], ...)"}
-Now a fresh variant for the second occurence of @{text y} is created
+Now a fresh variant for the second occurence of \<open>y\<close> is created
 avoiding any clash. In this way we can also create fresh free variables
 that avoid any clashes with fixed variables. In Line~3 below we fix
-the variable @{text x} in the context @{text ctxt1}. Next we want to
+the variable \<open>x\<close> in the context \<open>ctxt1\<close>. Next we want to
 create two fresh variables of type @{typ nat} as variants of the
 string @{text [quotes] "x"} (Lines 6 and 7).
 @{ML_response_fake [display, gray, linenos]
 "let
 Variable.variant_frees ctxt1 [] frees)
 end"
 "([(\"x\", \"nat\"), (\"xa\", \"nat\")],
 [(\"xa\", \"nat\"), (\"xb\", \"nat\")])"}
-As you can see, if we create the fresh variables with the context @{text ctxt0},
+As you can see, if we create the fresh variables with the context \<open>ctxt0\<close>,
-then we obtain @{text "x"} and @{text "xa"}; but in @{text ctxt1} we obtain @{text "xa"}
+then we obtain \<open>x\<close> and \<open>xa\<close>; but in \<open>ctxt1\<close> we obtain \<open>xa\<close>
-and @{text "xb"} avoiding @{text x}, which was fixed in this context.
+and \<open>xb\<close> avoiding \<open>x\<close>, which was fixed in this context.
 Often one has the problem that given some terms, create fresh variables
 avoiding any variable occurring in those terms. For this you can use the
 function @{ML_ind declare_term in Variable} from the structure @{ML_struct Variable}.
 in
 Variable.variant_frees ctxt1 [] frees
 end"
 "[(\"xb\", \"nat\"), (\"xc\", \"nat\")]"}
-The result is @{text xb} and @{text xc} for the names of the fresh
+The result is \<open>xb\<close> and \<open>xc\<close> for the names of the fresh
-variables, since @{text x} and @{text xa} occur in the term we declared.
+variables, since \<open>x\<close> and \<open>xa\<close> occur in the term we declared.
 Note that @{ML_ind declare_term in Variable} does not fix the
 variables; it just makes them ``known'' to the context. You can see
 that if you print out a declared term.
 \begin{isabelle}
 val ctxt1 = Variable.declare_term trm @{context}
 in
 pwriteln (pretty_term ctxt1 trm)
 end"}\\
 \setlength{\fboxsep}{0mm}
-@{text ">"}~\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text P}}}~%
+\<open>>\<close>~\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>P\<close>}}~%
-\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text x}}}~%
+\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>x\<close>}}~%
-\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text y}}}~%
+\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>y\<close>}}~%
-\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text z}}}
+\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>z\<close>}}
 \end{graybox}
 \end{isabelle}
 All variables are highligted, indicating that they are not
 fixed. However, declaring a term is helpful when parsing terms using
 (Syntax.read_term ctxt0 \"x\",
 Syntax.read_term ctxt1 \"x\")
 end"
 "(Free (\"x\", \"'a\"), Free (\"x\", \"nat\"))"}
-Parsing the string in the context @{text "ctxt0"} results in a free variable
+Parsing the string in the context \<open>ctxt0\<close> results in a free variable
-with a default polymorphic type, but in case of @{text "ctxt1"} we obtain a
+with a default polymorphic type, but in case of \<open>ctxt1\<close> we obtain a
 free variable of type @{typ nat} as previously declared. Which
 type the parsed term receives depends upon the last declaration that
 is made, as the next example illustrates.
 @{ML_response_fake [gray, display]
 |> pretty_term ctxt0
 |> pwriteln
 end"}
 \end{linenos}
 \setlength{\fboxsep}{0mm}
-@{text ">"}~\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{@{text P}}}~%
+\<open>>\<close>~\colorbox{gray!5}{\raisebox{0mm}[3mm][1mm]{\<open>P\<close>}}~%
-@{text "?x ?y ?z"}
+\<open>?x ?y ?z\<close>
 \end{graybox}
 \end{isabelle}
 In Line 3 we fix the variables @{term x}, @{term y} and @{term z} in
-context @{text ctxt1}.  The function @{ML_ind export_terms in
+context \<open>ctxt1\<close>.  The function @{ML_ind export_terms in
 Variable} from the structure @{ML_struct Variable} can be used to transfer
 terms between contexts. Transferring means to turn all (free)
 variables that are fixed in one context, but not in the other, into
 schematic variables. In our example, we are transferring the term
-@{text "P x y z"} from context @{text "ctxt1"} to @{text "ctxt0"},
+\<open>P x y z\<close> from context \<open>ctxt1\<close> to \<open>ctxt0\<close>,
 which means @{term x}, @{term y} and @{term z} become schematic
 variables (as can be seen by the leading question marks in the result).
-Note that the variable @{text P} stays a free variable, since it not fixed in
+Note that the variable \<open>P\<close> stays a free variable, since it not fixed in
-@{text ctxt1}; it is even highlighed, because @{text "ctxt0"} does
+\<open>ctxt1\<close>; it is even highlighed, because \<open>ctxt0\<close> does
 not know about it. Note also that in Line 6 we had to use the
 function @{ML_ind singleton}, because the function @{ML_ind
 export_terms in Variable} normally works over lists of terms.
 The case of transferring theorems is even more useful. The reason is
 in
 singleton (Proof_Context.export ctxt1 ctxt0) foo_thm
 end"
 "?P ?x ?y ?z ?x ?y ?z"}
-Since we fixed all variables in @{text ctxt1}, in the exported
+Since we fixed all variables in \<open>ctxt1\<close>, in the exported
 result all of them are schematic. The great point of contexts is
 that exporting from one to another is not just restricted to
 variables, but also works with assumptions. For this we can use the
 function @{ML_ind export in Assumption} from the structure
 @{ML_struct Assumption}. Consider the following code.
 Assumption.export false ctxt1 ctxt0 eq'
 end"
 "x \<equiv> y \<Longrightarrow> y \<equiv> x"}
 The function @{ML_ind add_assumes in Assumption} from the structure
-@{ML_struct Assumption} adds the assumption \mbox{@{text "x \<equiv> y"}}
+@{ML_struct Assumption} adds the assumption \mbox{\<open>x \<equiv> y\<close>}
-to the context @{text ctxt1} (Line 3). This function expects a list
+to the context \<open>ctxt1\<close> (Line 3). This function expects a list
 of @{ML_type cterm}s and returns them as theorems, together with the
 new context in which they are ``assumed''. In Line 4 we use the
 function @{ML_ind symmetric in Thm} from the structure @{ML_struct
 Thm} in order to obtain the symmetric version of the assumed
-meta-equality. Now exporting the theorem @{text "eq'"} from @{text
+meta-equality. Now exporting the theorem \<open>eq'\<close> from \<open>ctxt1\<close> to \<open>ctxt0\<close> means @{term "y \<equiv> x"} will be prefixed with
-ctxt1} to @{text ctxt0} means @{term "y \<equiv> x"} will be prefixed with
 the assumed theorem. The boolean flag in @{ML_ind export in
 Assumption} indicates whether the assumptions should be marked with
 the goal marker (see Section~\ref{sec:basictactics}). In normal
 circumstances this is not necessary and so should be set to @{ML
 false}.  The result of the export is then the theorem \mbox{@{term
 val eq' = Thm.symmetric eq
 in
 Proof_Context.export ctxt1 ctxt0 [eq']
 end"
 "[?x \<equiv> ?y \<Longrightarrow> ?y \<equiv> ?x]"}
-*}
+\<close>
-text {*
+text \<open>
-*}
+\<close>
 (*
 ML %grayML{*Proof_Context.debug := true*}
 ML %grayML{*Proof_Context.verbose := true*}
 thm this
 oops
 *)
-section {* Local Theories and Local Setups\label{sec:local} (TBD) *}
+section \<open>Local Theories and Local Setups\label{sec:local} (TBD)\<close>
-text {*
+text \<open>
 In contrast to an ordinary theory, which simply consists of a type
 signature, as well as tables for constants, axioms and theorems, a local
 theory contains additional context information, such as locally fixed
 variables and local assumptions that may be used by the package. The type
 @{ML_type local_theory} is identical to the type of \emph{proof contexts}
 A similar command is \isacommand{local\_setup}, which expects a function
 of type @{ML_type "local_theory -> local_theory"}. Later on we will also
 use the commands \isacommand{method\_setup} for installing methods in the
 current theory and \isacommand{simproc\_setup} for adding new simprocs to
 the current simpset.
-*}
+\<close>
-section {* Morphisms (TBD) *}
+section \<open>Morphisms (TBD)\<close>
-text {*
+text \<open>
 Morphisms are arbitrary transformations over terms, types, theorems and bindings.
 They can be constructed using the function @{ML_ind morphism in Morphism},
 which expects a record with functions of type
 \begin{isabelle}
 \begin{tabular}{rl}
-@{text "binding:"} & @{text "binding -> binding"}\\
+\<open>binding:\<close> & \<open>binding -> binding\<close>\\
-@{text "typ:"}     & @{text "typ -> typ"}\\
+\<open>typ:\<close>     & \<open>typ -> typ\<close>\\
-@{text "term:"}    & @{text "term -> term"}\\
+\<open>term:\<close>    & \<open>term -> term\<close>\\
-@{text "fact:"}    & @{text "thm list -> thm list"}
+\<open>fact:\<close>    & \<open>thm list -> thm list\<close>
 \end{tabular}
 \end{isabelle}
 The simplest morphism is the  @{ML_ind identity in Morphism}-morphism defined as
-*}
+\<close>
-ML %grayML{*val identity = Morphism.morphism "" {binding = [], typ = [], term = [], fact = []}*}
+ML %grayML\<open>val identity = Morphism.morphism "" {binding = [], typ = [], term = [], fact = []}\<close>
-text {*
+text \<open>
 Morphisms can be composed with the function @{ML_ind "$>" in Morphism}
-*}
+\<close>
-ML %grayML{*fun trm_phi (Free (x, T)) = Var ((x, 0), T)
+ML %grayML\<open>fun trm_phi (Free (x, T)) = Var ((x, 0), T)
 | trm_phi (Abs (x, T, t)) = Abs (x, T, trm_phi t)
 | trm_phi (t $ s) = (trm_phi t) $ (trm_phi s)
-| trm_phi t = t*}
+| trm_phi t = t\<close>
-ML %grayML{*val phi = Morphism.term_morphism "foo" trm_phi*}
+ML %grayML\<open>val phi = Morphism.term_morphism "foo" trm_phi\<close>
-ML %grayML{*Morphism.term phi @{term "P x y"}*}
+ML %grayML\<open>Morphism.term phi @{term "P x y"}\<close>
-text {*
+text \<open>
 @{ML_ind term_morphism in Morphism}
 @{ML_ind term in Morphism},
 @{ML_ind thm in Morphism}
 \begin{readmore}
 Morphisms are implemented in the file @{ML_file "Pure/morphism.ML"}.
 \end{readmore}
-*}
+\<close>
-section {* Misc (TBD) *}
+section \<open>Misc (TBD)\<close>
-text {*
+text \<open>
 FIXME: association lists:
 @{ML_file "Pure/General/alist.ML"}
 FIXME: calling the ML-compiler
-*}
+\<close>
-section {* What Is In an Isabelle Name? (TBD) *}
+section \<open>What Is In an Isabelle Name? (TBD)\<close>
-text {*
+text \<open>
 On the ML-level of Isabelle, you often have to work with qualified names.
 These are strings with some additional information, such as positional
 information and qualifiers. Such qualified names can be generated with the
-antiquotation @{text "@{binding \<dots>}"}. For example
+antiquotation \<open>@{binding \<dots>}\<close>. For example
 @{ML_response [display,gray]
 "@{binding \"name\"}"
 "name"}
 An example where a qualified name is needed is the function
 @{ML_ind define in Local_Theory}.  This function is used below to define
 the constant @{term "TrueConj"} as the conjunction @{term "True \<and> True"}.
-*}
+\<close>
-local_setup %gray {*
+local_setup %gray \<open>
 Local_Theory.define ((@{binding "TrueConj"}, NoSyn),
-((@{binding "TrueConj_def"}, []), @{term "True \<and> True"})) #> snd *}
+((@{binding "TrueConj_def"}, []), @{term "True \<and> True"})) #> snd\<close>
-text {*
+text \<open>
 Now querying the definition you obtain:
 \begin{isabelle}
-\isacommand{thm}~@{text "TrueConj_def"}\\
+\isacommand{thm}~\<open>TrueConj_def\<close>\\
-@{text "> "}~@{thm TrueConj_def}
+\<open>> \<close>~@{thm TrueConj_def}
 \end{isabelle}
 \begin{readmore}
 The basic operations on bindings are implemented in
 @{ML_file "Pure/General/binding.ML"}.
 \footnote{\bf FIXME give a pointer to \isacommand{local\_setup}; if not, then explain
 why @{ML snd} is needed.}
 \footnote{\bf FIXME: There should probably a separate section on binding, long-names
 and sign.}
-*}
+\<close>
-ML {* Sign.intern_type @{theory} "list" *}
+ML \<open>Sign.intern_type @{theory} "list"\<close>
-ML {* Sign.intern_const @{theory} "prod_fun" *}
+ML \<open>Sign.intern_const @{theory} "prod_fun"\<close>
-text {*
+text \<open>
 \footnote{\bf FIXME: Explain the following better; maybe put in a separate
 section and link with the comment in the antiquotation section.}
 Occasionally you have to calculate what the ``base'' name of a given
 constant is. For this you can use the function @{ML_ind  Long_Name.base_name}. For example:
 \begin{readmore}
 Functions about naming are implemented in @{ML_file "Pure/General/name_space.ML"};
 functions about signatures in @{ML_file "Pure/sign.ML"}.
 \end{readmore}
-*}
+\<close>
-text {*
+text \<open>
 @{ML_ind "Binding.name_of"} returns the string without markup
 @{ML_ind "Binding.concealed"}
-*}
+\<close>
-section {* Concurrency (TBD) *}
+section \<open>Concurrency (TBD)\<close>
-text {*
+text \<open>
 @{ML_ind prove_future in Goal}
 @{ML_ind future_result in Goal}
-*}
+\<close>
-section {* Parse and Print Translations (TBD) *}
+section \<open>Parse and Print Translations (TBD)\<close>
-section {* Summary *}
+section \<open>Summary\<close>
-text {*
+text \<open>
 TBD
-*}
+\<close>
 end

changeset 565	cecd7a941885
parent 562	daf404920ab9
child 567	f7c97e64cc2a