Theory Fixrec_ex

theory Fixrec_ex
imports HOLCF
(*  Title:      HOL/HOLCF/Tutorial/Fixrec_ex.thy
    Author:     Brian Huffman

section ‹Fixrec package examples›

theory Fixrec_ex
imports HOLCF

subsection ‹Basic ‹fixrec› examples›

text ‹
  Fixrec patterns can mention any constructor defined by the domain
  package, as well as any of the following built-in constructors:
  Pair, spair, sinl, sinr, up, ONE, TT, FF.

text ‹Typical usage is with lazy constructors.›

fixrec down :: "'a u → 'a"
where "down⋅(up⋅x) = x"

text ‹With strict constructors, rewrite rules may require side conditions.›

fixrec from_sinl :: "'a ⊕ 'b → 'a"
where "x ≠ ⊥ ⟹ from_sinl⋅(sinl⋅x) = x"

text ‹Lifting can turn a strict constructor into a lazy one.›

fixrec from_sinl_up :: "'a u ⊕ 'b → 'a"
where "from_sinl_up⋅(sinl⋅(up⋅x)) = x"

text ‹Fixrec also works with the HOL pair constructor.›

fixrec down2 :: "'a u × 'b u → 'a × 'b"
where "down2⋅(up⋅x, up⋅y) = (x, y)"

subsection ‹Examples using ‹fixrec_simp››

text ‹A type of lazy lists.›

domain 'a llist = lNil | lCons (lazy 'a) (lazy "'a llist")

text ‹A zip function for lazy lists.›

text ‹Notice that the patterns are not exhaustive.›

  lzip :: "'a llist → 'b llist → ('a × 'b) llist"
  "lzip⋅(lCons⋅x⋅xs)⋅(lCons⋅y⋅ys) = lCons⋅(x, y)⋅(lzip⋅xs⋅ys)"
| "lzip⋅lNil⋅lNil = lNil"

text ‹‹fixrec_simp› is useful for producing strictness theorems.›
text ‹Note that pattern matching is done in left-to-right order.›

lemma lzip_stricts [simp]:
  "lzip⋅⊥⋅ys = ⊥"
  "lzip⋅lNil⋅⊥ = ⊥"
  "lzip⋅(lCons⋅x⋅xs)⋅⊥ = ⊥"
by fixrec_simp+

text ‹‹fixrec_simp› can also produce rules for missing cases.›

lemma lzip_undefs [simp]:
  "lzip⋅lNil⋅(lCons⋅y⋅ys) = ⊥"
  "lzip⋅(lCons⋅x⋅xs)⋅lNil = ⊥"
by fixrec_simp+

subsection ‹Pattern matching with bottoms›

text ‹
  As an alternative to using ‹fixrec_simp›, it is also possible
  to use bottom as a constructor pattern.  When using a bottom
  pattern, the right-hand-side must also be bottom; otherwise, ‹fixrec› will not be able to prove the equation.

  from_sinr_up :: "'a ⊕ 'b → 'b"
  "from_sinr_up⋅⊥ = ⊥"
| "from_sinr_up⋅(sinr⋅(up⋅x)) = x"

text ‹
  If the function is already strict in that argument, then the bottom
  pattern does not change the meaning of the function.  For example,
  in the definition of @{term from_sinr_up}, the first equation is
  actually redundant, and could have been proven separately by

text ‹
  A bottom pattern can also be used to make a function strict in a
  certain argument, similar to a bang-pattern in Haskell.

  seq :: "'a → 'b → 'b"
  "seq⋅⊥⋅y = ⊥"
| "x ≠ ⊥ ⟹ seq⋅x⋅y = y"

subsection ‹Skipping proofs of rewrite rules›

text ‹Another zip function for lazy lists.›

text ‹
  Notice that this version has overlapping patterns.
  The second equation cannot be proved as a theorem
  because it only applies when the first pattern fails.

  lzip2 :: "'a llist → 'b llist → ('a × 'b) llist"
  "lzip2⋅(lCons⋅x⋅xs)⋅(lCons⋅y⋅ys) = lCons⋅(x, y)⋅(lzip2⋅xs⋅ys)"
| (unchecked) "lzip2⋅xs⋅ys = lNil"

text ‹
  Usually fixrec tries to prove all equations as theorems.
  The "unchecked" option overrides this behavior, so fixrec
  does not attempt to prove that particular equation.

text ‹Simp rules can be generated later using ‹fixrec_simp›.›

lemma lzip2_simps [simp]:
  "lzip2⋅(lCons⋅x⋅xs)⋅lNil = lNil"
  "lzip2⋅lNil⋅(lCons⋅y⋅ys) = lNil"
  "lzip2⋅lNil⋅lNil = lNil"
by fixrec_simp+

lemma lzip2_stricts [simp]:
  "lzip2⋅⊥⋅ys = ⊥"
  "lzip2⋅(lCons⋅x⋅xs)⋅⊥ = ⊥"
by fixrec_simp+

subsection ‹Mutual recursion with ‹fixrec››

text ‹Tree and forest types.›

domain 'a tree = Leaf (lazy 'a) | Branch (lazy "'a forest")
and    'a forest = Empty | Trees (lazy "'a tree") "'a forest"

text ‹
  To define mutually recursive functions, give multiple type signatures
  separated by the keyword ‹and›.

  map_tree :: "('a → 'b) → ('a tree → 'b tree)"
  map_forest :: "('a → 'b) → ('a forest → 'b forest)"
  "map_tree⋅f⋅(Leaf⋅x) = Leaf⋅(f⋅x)"
| "map_tree⋅f⋅(Branch⋅ts) = Branch⋅(map_forest⋅f⋅ts)"
| "map_forest⋅f⋅Empty = Empty"
| "ts ≠ ⊥ ⟹
    map_forest⋅f⋅(Trees⋅t⋅ts) = Trees⋅(map_tree⋅f⋅t)⋅(map_forest⋅f⋅ts)"

lemma map_tree_strict [simp]: "map_tree⋅f⋅⊥ = ⊥"
by fixrec_simp

lemma map_forest_strict [simp]: "map_forest⋅f⋅⊥ = ⊥"
by fixrec_simp

  Theorems generated:
  @{text map_tree_def}  @{thm map_tree_def}
  @{text map_forest_def}  @{thm map_forest_def}
  @{text map_tree.unfold}  @{thm map_tree.unfold}
  @{text map_forest.unfold}  @{thm map_forest.unfold}
  @{text map_tree.simps}  @{thm map_tree.simps}
  @{text map_forest.simps}  @{thm map_forest.simps}
  @{text map_tree_map_forest.induct}  @{thm map_tree_map_forest.induct}

subsection ‹Looping simp rules›

text ‹
  The defining equations of a fixrec definition are declared as simp
  rules by default.  In some cases, especially for constants with no
  arguments or functions with variable patterns, the defining
  equations may cause the simplifier to loop.  In these cases it will
  be necessary to use a ‹[simp del]› declaration.

  repeat :: "'a → 'a llist"
  [simp del]: "repeat⋅x = lCons⋅x⋅(repeat⋅x)"

text ‹
  We can derive other non-looping simp rules for @{const repeat} by
  using the ‹subst› method with the ‹repeat.simps› rule.

lemma repeat_simps [simp]:
  "repeat⋅x ≠ ⊥"
  "repeat⋅x ≠ lNil"
  "repeat⋅x = lCons⋅y⋅ys ⟷ x = y ∧ repeat⋅x = ys"
by (subst repeat.simps, simp)+

lemma llist_case_repeat [simp]:
  "llist_case⋅z⋅f⋅(repeat⋅x) = f⋅x⋅(repeat⋅x)"
by (subst repeat.simps, simp)

text ‹
  For mutually-recursive constants, looping might only occur if all
  equations are in the simpset at the same time.  In such cases it may
  only be necessary to declare ‹[simp del]› on one equation.

  inf_tree :: "'a tree" and inf_forest :: "'a forest"
  [simp del]: "inf_tree = Branch⋅inf_forest"
| "inf_forest = Trees⋅inf_tree⋅(Trees⋅inf_tree⋅Empty)"

subsection ‹Using ‹fixrec› inside locales›

locale test =
  fixes foo :: "'a → 'a"
  assumes foo_strict: "foo⋅⊥ = ⊥"

  bar :: "'a u → 'a"
  "bar⋅(up⋅x) = foo⋅x"

lemma bar_strict: "bar⋅⊥ = ⊥"
by fixrec_simp