src/HOL/IMP/BExp.thy

--- a/src/HOL/IMP/BExp.thy	Fri Sep 07 07:20:55 2012 +0200
+++ b/src/HOL/IMP/BExp.thy	Fri Sep 07 08:35:35 2012 +0200
@@ -2,17 +2,17 @@
 
 subsection "Boolean Expressions"
 
-text_raw{*\begin{isaverbatimwrite}\newcommand{\BExpbexpdef}{% *}
+text_raw{*\snip{BExpbexpdef}{0}{1}{% *}
 datatype bexp = Bc bool | Not bexp | And bexp bexp | Less aexp aexp
-text_raw{*}\end{isaverbatimwrite}*}
+text_raw{*}%endsnip*}
 
-text_raw{*\begin{isaverbatimwrite}\newcommand{\BExpbvaldef}{% *}
+text_raw{*\snip{BExpbvaldef}{1}{2}{% *}
 fun bval :: "bexp \<Rightarrow> state \<Rightarrow> bool" where
 "bval (Bc v) s = v" |
 "bval (Not b) s = (\<not> bval b s)" |
 "bval (And b\<^isub>1 b\<^isub>2) s = (bval b\<^isub>1 s \<and> bval b\<^isub>2 s)" |
 "bval (Less a\<^isub>1 a\<^isub>2) s = (aval a\<^isub>1 s < aval a\<^isub>2 s)"
-text_raw{*}\end{isaverbatimwrite}*}
+text_raw{*}%endsnip*}
 
 value "bval (Less (V ''x'') (Plus (N 3) (V ''y'')))
             <''x'' := 3, ''y'' := 1>"
@@ -31,37 +31,37 @@
 
 text{* Optimizing constructors: *}
 
-text_raw{*\begin{isaverbatimwrite}\newcommand{\BExplessdef}{% *}
+text_raw{*\snip{BExplessdef}{0}{2}{% *}
 fun less :: "aexp \<Rightarrow> aexp \<Rightarrow> bexp" where
 "less (N n\<^isub>1) (N n\<^isub>2) = Bc(n\<^isub>1 < n\<^isub>2)" |
 "less a\<^isub>1 a\<^isub>2 = Less a\<^isub>1 a\<^isub>2"
-text_raw{*}\end{isaverbatimwrite}*}
+text_raw{*}%endsnip*}
 
 lemma [simp]: "bval (less a1 a2) s = (aval a1 s < aval a2 s)"
 apply(induction a1 a2 rule: less.induct)
 apply simp_all
 done
 
-text_raw{*\begin{isaverbatimwrite}\newcommand{\BExpanddef}{% *}
+text_raw{*\snip{BExpanddef}{2}{2}{% *}
 fun "and" :: "bexp \<Rightarrow> bexp \<Rightarrow> bexp" where
 "and (Bc True) b = b" |
 "and b (Bc True) = b" |
 "and (Bc False) b = Bc False" |
 "and b (Bc False) = Bc False" |
 "and b\<^isub>1 b\<^isub>2 = And b\<^isub>1 b\<^isub>2"
-text_raw{*}\end{isaverbatimwrite}*}
+text_raw{*}%endsnip*}
 
 lemma bval_and[simp]: "bval (and b1 b2) s = (bval b1 s \<and> bval b2 s)"
 apply(induction b1 b2 rule: and.induct)
 apply simp_all
 done
 
-text_raw{*\begin{isaverbatimwrite}\newcommand{\BExpnotdef}{% *}
+text_raw{*\snip{BExpnotdef}{2}{2}{% *}
 fun not :: "bexp \<Rightarrow> bexp" where
 "not (Bc True) = Bc False" |
 "not (Bc False) = Bc True" |
 "not b = Not b"
-text_raw{*}\end{isaverbatimwrite}*}
+text_raw{*}%endsnip*}
 
 lemma bval_not[simp]: "bval (not b) s = (\<not> bval b s)"
 apply(induction b rule: not.induct)
@@ -70,13 +70,13 @@
 
 text{* Now the overall optimizer: *}
 
-text_raw{*\begin{isaverbatimwrite}\newcommand{\BExpbsimpdef}{% *}
+text_raw{*\snip{BExpbsimpdef}{0}{2}{% *}
 fun bsimp :: "bexp \<Rightarrow> bexp" where
 "bsimp (Bc v) = Bc v" |
 "bsimp (Not b) = not(bsimp b)" |
 "bsimp (And b\<^isub>1 b\<^isub>2) = and (bsimp b\<^isub>1) (bsimp b\<^isub>2)" |
 "bsimp (Less a\<^isub>1 a\<^isub>2) = less (asimp a\<^isub>1) (asimp a\<^isub>2)"
-text_raw{*}\end{isaverbatimwrite}*}
+text_raw{*}%endsnip*}
 
 value "bsimp (And (Less (N 0) (N 1)) b)"