# HG changeset patch
# User Thomas Sewell <tsewell@nicta.com.au>
# Date 1252648611 -36000
# Node ID 2f1701a6d4e89a9e32a8fa18a93bbd40ad23c6ff
# Parent  192d58483fdf9c78084c491a7e2e9f694ec7b14e
Adjust some documentation.

diff -r 192d58483fdf -r 2f1701a6d4e8 src/HOL/IsTuple.thy
--- a/src/HOL/IsTuple.thy	Thu Sep 10 16:38:18 2009 +1000
+++ b/src/HOL/IsTuple.thy	Fri Sep 11 15:56:51 2009 +1000
@@ -13,9 +13,9 @@
 text {*
 This module provides operators and lemmas for types isomorphic to tuples.
 These types are used in defining efficient records. Consider the record
-access/update simplification, alpha (beta_update f rec) = alpha rec for
-distinct fields alpha and beta of some record type with n fields. There
-are n^2 such theorems, which is prohibits storage of all of them for
+access/update simplification "alpha (beta_update f rec) = alpha rec" for
+distinct fields alpha and beta of some record rec with n fields. There
+are n^2 such theorems, which prohibits storage of all of them for
 large n. The rules can be proved on the fly by case decomposition and
 simplification in O(n) time. By creating O(n) isomorphic-tuple types
 while defining the record, however, we can prove the access/update
@@ -49,16 +49,20 @@
 steps to the tuple tree, we consume O(log(n)^2) time as the intermediate
 terms are O(log(n)) in size and the types needed have size bounded by K.
 To enable this analagous traversal, we define the functions seen below:
-istuple_fst, istuple_snd, istuple_fst_update and istuple_snd. These
-functions generalise tuple operations by taking a parameter that
+istuple_fst, istuple_snd, istuple_fst_update and istuple_snd_update.
+These functions generalise tuple operations by taking a parameter that
 encapsulates a tuple isomorphism. The rewrites needed on these functions
 now need an additional assumption which is that the isomorphism works.
 
-These rewrites are typically used in a structured way. With a little
-thinking they can be presented as an introduction rule set rather than
-a rewrite rule set. This is an optimisation, as net matching can be
-performed at one term location for each step rather than the simplifier
-searching the term for possible applications.
+These rewrites are typically used in a structured way. They are here
+presented as the introduction rule isomorphic_tuple.intros rather than
+as a rewrite rule set. The introduction form is an optimisation, as net
+matching can be performed at one term location for each step rather than
+the simplifier searching the term for possible pattern matches. The rule
+set is used as it is viewed outside the locale, with the locale assumption
+(that the isomorphism is valid) left as rule assumption. All rules are
+structured to aid net matching, using either a point-free form or an
+encapsulating predicate.
 *}
 
 typedef ('a, 'b, 'c) tuple_isomorphism