modernized header uniformly as section;
authorwenzelm
Sun Nov 02 18:21:45 2014 +0100 (2014-11-02)
changeset 588895b7a9633cfa8
parent 58888 9537bf1c4853
child 58890 0ca19a9fdc60
modernized header uniformly as section;
src/CCL/CCL.thy
src/CCL/Fix.thy
src/CCL/Gfp.thy
src/CCL/Hered.thy
src/CCL/Lfp.thy
src/CCL/Set.thy
src/CCL/Term.thy
src/CCL/Trancl.thy
src/CCL/Type.thy
src/CCL/Wfd.thy
src/CCL/ex/Flag.thy
src/CCL/ex/List.thy
src/CCL/ex/Nat.thy
src/CCL/ex/Stream.thy
src/CTT/Arith.thy
src/CTT/Bool.thy
src/CTT/CTT.thy
src/CTT/Main.thy
src/CTT/ex/Elimination.thy
src/CTT/ex/Equality.thy
src/CTT/ex/Synthesis.thy
src/CTT/ex/Typechecking.thy
src/Cube/Cube.thy
src/Cube/Example.thy
src/Doc/Isar_Ref/First_Order_Logic.thy
src/Doc/Logics_ZF/FOL_examples.thy
src/Doc/Logics_ZF/IFOL_examples.thy
src/Doc/Logics_ZF/ZF_examples.thy
src/Doc/Tutorial/Protocol/Event.thy
src/Doc/Tutorial/Protocol/Message.thy
src/Doc/Tutorial/Types/Records.thy
src/FOL/FOL.thy
src/FOL/IFOL.thy
src/FOL/ex/Classical.thy
src/FOL/ex/First_Order_Logic.thy
src/FOL/ex/Foundation.thy
src/FOL/ex/If.thy
src/FOL/ex/Intro.thy
src/FOL/ex/Intuitionistic.thy
src/FOL/ex/Nat.thy
src/FOL/ex/Natural_Numbers.thy
src/FOL/ex/Prolog.thy
src/FOL/ex/Propositional_Cla.thy
src/FOL/ex/Propositional_Int.thy
src/FOL/ex/Quantifiers_Cla.thy
src/FOL/ex/Quantifiers_Int.thy
src/FOLP/FOLP.thy
src/FOLP/IFOLP.thy
src/FOLP/ex/Foundation.thy
src/FOLP/ex/Intro.thy
src/FOLP/ex/Nat.thy
src/FOLP/ex/Propositional_Cla.thy
src/FOLP/ex/Propositional_Int.thy
src/HOL/ATP.thy
src/HOL/Algebra/Divisibility.thy
src/HOL/Archimedean_Field.thy
src/HOL/Auth/Auth_Public.thy
src/HOL/Auth/Auth_Shared.thy
src/HOL/Auth/CertifiedEmail.thy
src/HOL/Auth/Event.thy
src/HOL/Auth/Guard/Analz.thy
src/HOL/Auth/Guard/Auth_Guard_Public.thy
src/HOL/Auth/Guard/Auth_Guard_Shared.thy
src/HOL/Auth/Guard/Extensions.thy
src/HOL/Auth/Guard/Guard.thy
src/HOL/Auth/Guard/GuardK.thy
src/HOL/Auth/Guard/Guard_NS_Public.thy
src/HOL/Auth/Guard/Guard_OtwayRees.thy
src/HOL/Auth/Guard/Guard_Shared.thy
src/HOL/Auth/Guard/Guard_Yahalom.thy
src/HOL/Auth/Guard/List_Msg.thy
src/HOL/Auth/Guard/P1.thy
src/HOL/Auth/Guard/P2.thy
src/HOL/Auth/Guard/Proto.thy
src/HOL/Auth/KerberosIV.thy
src/HOL/Auth/KerberosIV_Gets.thy
src/HOL/Auth/KerberosV.thy
src/HOL/Auth/Kerberos_BAN.thy
src/HOL/Auth/Kerberos_BAN_Gets.thy
src/HOL/Auth/Message.thy
src/HOL/Auth/NS_Public.thy
src/HOL/Auth/NS_Public_Bad.thy
src/HOL/Auth/NS_Shared.thy
src/HOL/Auth/OtwayRees.thy
src/HOL/Auth/OtwayReesBella.thy
src/HOL/Auth/OtwayRees_AN.thy
src/HOL/Auth/OtwayRees_Bad.thy
src/HOL/Auth/Recur.thy
src/HOL/Auth/Smartcard/Auth_Smartcard.thy
src/HOL/Auth/Smartcard/EventSC.thy
src/HOL/Auth/Smartcard/ShoupRubin.thy
src/HOL/Auth/Smartcard/ShoupRubinBella.thy
src/HOL/Auth/Smartcard/Smartcard.thy
src/HOL/Auth/TLS.thy
src/HOL/Auth/WooLam.thy
src/HOL/Auth/Yahalom.thy
src/HOL/Auth/Yahalom2.thy
src/HOL/Auth/Yahalom_Bad.thy
src/HOL/BNF_Cardinal_Arithmetic.thy
src/HOL/BNF_Cardinal_Order_Relation.thy
src/HOL/BNF_Composition.thy
src/HOL/BNF_Def.thy
src/HOL/BNF_Fixpoint_Base.thy
src/HOL/BNF_Greatest_Fixpoint.thy
src/HOL/BNF_Least_Fixpoint.thy
src/HOL/BNF_Wellorder_Constructions.thy
src/HOL/BNF_Wellorder_Embedding.thy
src/HOL/BNF_Wellorder_Relation.thy
src/HOL/Basic_BNFs.thy
src/HOL/Cardinals/Cardinal_Arithmetic.thy
src/HOL/Cardinals/Cardinal_Order_Relation.thy
src/HOL/Cardinals/Cardinals.thy
src/HOL/Cardinals/Fun_More.thy
src/HOL/Cardinals/Order_Relation_More.thy
src/HOL/Cardinals/Order_Union.thy
src/HOL/Cardinals/Ordinal_Arithmetic.thy
src/HOL/Cardinals/Wellfounded_More.thy
src/HOL/Cardinals/Wellorder_Constructions.thy
src/HOL/Cardinals/Wellorder_Embedding.thy
src/HOL/Cardinals/Wellorder_Extension.thy
src/HOL/Cardinals/Wellorder_Relation.thy
src/HOL/Code_Evaluation.thy
src/HOL/Code_Numeral.thy
src/HOL/Codegenerator_Test/Candidates.thy
src/HOL/Codegenerator_Test/Generate.thy
src/HOL/Codegenerator_Test/Generate_Binary_Nat.thy
src/HOL/Codegenerator_Test/Generate_Efficient_Datastructures.thy
src/HOL/Codegenerator_Test/Generate_Pretty_Char.thy
src/HOL/Codegenerator_Test/Generate_Target_Nat.thy
src/HOL/Coinduction.thy
src/HOL/Complete_Lattices.thy
src/HOL/Complete_Partial_Order.thy
src/HOL/Complex.thy
src/HOL/Complex_Main.thy
src/HOL/Conditionally_Complete_Lattices.thy
src/HOL/Ctr_Sugar.thy
src/HOL/Datatype_Examples/Compat.thy
src/HOL/Datatype_Examples/Derivation_Trees/DTree.thy
src/HOL/Datatype_Examples/Derivation_Trees/Gram_Lang.thy
src/HOL/Datatype_Examples/Derivation_Trees/Parallel.thy
src/HOL/Datatype_Examples/Derivation_Trees/Prelim.thy
src/HOL/Datatype_Examples/IsaFoR.thy
src/HOL/Datatype_Examples/Koenig.thy
src/HOL/Datatype_Examples/Lambda_Term.thy
src/HOL/Datatype_Examples/Misc_Codatatype.thy
src/HOL/Datatype_Examples/Misc_Datatype.thy
src/HOL/Datatype_Examples/Misc_N2M.thy
src/HOL/Datatype_Examples/Misc_Primcorec.thy
src/HOL/Datatype_Examples/Misc_Primrec.thy
src/HOL/Datatype_Examples/Process.thy
src/HOL/Datatype_Examples/Stream_Processor.thy
src/HOL/Datatype_Examples/TreeFI.thy
src/HOL/Datatype_Examples/TreeFsetI.thy
src/HOL/Decision_Procs/Approximation.thy
src/HOL/Decision_Procs/Commutative_Ring.thy
src/HOL/Decision_Procs/Commutative_Ring_Complete.thy
src/HOL/Decision_Procs/Dense_Linear_Order.thy
src/HOL/Decision_Procs/Parametric_Ferrante_Rackoff.thy
src/HOL/Decision_Procs/Polynomial_List.thy
src/HOL/Decision_Procs/Rat_Pair.thy
src/HOL/Decision_Procs/Reflected_Multivariate_Polynomial.thy
src/HOL/Decision_Procs/ex/Commutative_Ring_Ex.thy
src/HOL/Decision_Procs/ex/Dense_Linear_Order_Ex.thy
src/HOL/Deriv.thy
src/HOL/Divides.thy
src/HOL/Enum.thy
src/HOL/Equiv_Relations.thy
src/HOL/Extraction.thy
src/HOL/Fact.thy
src/HOL/Fields.thy
src/HOL/Finite_Set.thy
src/HOL/Fun.thy
src/HOL/Fun_Def.thy
src/HOL/Fun_Def_Base.thy
src/HOL/GCD.thy
src/HOL/Groebner_Basis.thy
src/HOL/Groups.thy
src/HOL/Groups_Big.thy
src/HOL/Groups_List.thy
src/HOL/HOL.thy
src/HOL/Hahn_Banach/Bounds.thy
src/HOL/Hahn_Banach/Function_Norm.thy
src/HOL/Hahn_Banach/Function_Order.thy
src/HOL/Hahn_Banach/Hahn_Banach.thy
src/HOL/Hahn_Banach/Hahn_Banach_Ext_Lemmas.thy
src/HOL/Hahn_Banach/Hahn_Banach_Sup_Lemmas.thy
src/HOL/Hahn_Banach/Linearform.thy
src/HOL/Hahn_Banach/Normed_Space.thy
src/HOL/Hahn_Banach/Subspace.thy
src/HOL/Hahn_Banach/Vector_Space.thy
src/HOL/Hahn_Banach/Zorn_Lemma.thy
src/HOL/Hilbert_Choice.thy
src/HOL/IMP/AExp.thy
src/HOL/IMP/ASM.thy
src/HOL/IMP/Abs_Int_Den/Abs_Int_den0_fun.thy
src/HOL/IMP/Abs_Int_ITP/Complete_Lattice_ix.thy
src/HOL/IMP/Com.thy
src/HOL/IMP/Compiler.thy
src/HOL/IMP/Complete_Lattice.thy
src/HOL/IMP/Denotational.thy
src/HOL/IMP/Hoare.thy
src/HOL/IMP/Live.thy
src/HOL/IMP/Procs.thy
src/HOL/IMP/Sec_Type_Expr.thy
src/HOL/IMP/Sem_Equiv.thy
src/HOL/IMP/Small_Step.thy
src/HOL/IMP/Types.thy
src/HOL/IMP/Vars.thy
src/HOL/IMPP/Com.thy
src/HOL/IMPP/EvenOdd.thy
src/HOL/IMPP/Hoare.thy
src/HOL/IMPP/Misc.thy
src/HOL/IMPP/Natural.thy
src/HOL/IOA/Asig.thy
src/HOL/IOA/IOA.thy
src/HOL/IOA/Solve.thy
src/HOL/Imperative_HOL/Array.thy
src/HOL/Imperative_HOL/Heap.thy
src/HOL/Imperative_HOL/Heap_Monad.thy
src/HOL/Imperative_HOL/Imperative_HOL.thy
src/HOL/Imperative_HOL/Imperative_HOL_ex.thy
src/HOL/Imperative_HOL/Ref.thy
src/HOL/Imperative_HOL/ex/Imperative_Quicksort.thy
src/HOL/Imperative_HOL/ex/Imperative_Reverse.thy
src/HOL/Imperative_HOL/ex/Linked_Lists.thy
src/HOL/Imperative_HOL/ex/SatChecker.thy
src/HOL/Imperative_HOL/ex/Sorted_List.thy
src/HOL/Imperative_HOL/ex/Subarray.thy
src/HOL/Imperative_HOL/ex/Sublist.thy
src/HOL/Import/HOL_Light_Import.thy
src/HOL/Import/HOL_Light_Maps.thy
src/HOL/Import/Import_Setup.thy
src/HOL/Induct/ABexp.thy
src/HOL/Induct/Com.thy
src/HOL/Induct/Comb.thy
src/HOL/Induct/Common_Patterns.thy
src/HOL/Induct/Ordinals.thy
src/HOL/Induct/PropLog.thy
src/HOL/Induct/QuoDataType.thy
src/HOL/Induct/QuoNestedDataType.thy
src/HOL/Induct/SList.thy
src/HOL/Induct/Sigma_Algebra.thy
src/HOL/Induct/Term.thy
src/HOL/Induct/Tree.thy
src/HOL/Inductive.thy
src/HOL/Int.thy
src/HOL/Lattices.thy
src/HOL/Lattices_Big.thy
src/HOL/Lazy_Sequence.thy
src/HOL/Lifting.thy
src/HOL/Lifting_Option.thy
src/HOL/Lifting_Product.thy
src/HOL/Lifting_Set.thy
src/HOL/Lifting_Sum.thy
src/HOL/Limited_Sequence.thy
src/HOL/Limits.thy
src/HOL/List.thy
src/HOL/MacLaurin.thy
src/HOL/Main.thy
src/HOL/Map.thy
src/HOL/Matrix_LP/ComputeFloat.thy
src/HOL/Meson.thy
src/HOL/Metis.thy
src/HOL/Metis_Examples/Abstraction.thy
src/HOL/Metis_Examples/Big_O.thy
src/HOL/Metis_Examples/Binary_Tree.thy
src/HOL/Metis_Examples/Clausification.thy
src/HOL/Metis_Examples/Message.thy
src/HOL/Metis_Examples/Proxies.thy
src/HOL/Metis_Examples/Sets.thy
src/HOL/Metis_Examples/Tarski.thy
src/HOL/Metis_Examples/Trans_Closure.thy
src/HOL/Metis_Examples/Type_Encodings.thy
src/HOL/Mirabelle/Mirabelle_Test.thy
src/HOL/NanoJava/AxSem.thy
src/HOL/NanoJava/Decl.thy
src/HOL/NanoJava/Equivalence.thy
src/HOL/NanoJava/Example.thy
src/HOL/NanoJava/OpSem.thy
src/HOL/NanoJava/State.thy
src/HOL/NanoJava/Term.thy
src/HOL/NanoJava/TypeRel.thy
src/HOL/Nat.thy
src/HOL/Nat_Transfer.thy
src/HOL/Nitpick.thy
src/HOL/Nitpick_Examples/Core_Nits.thy
src/HOL/Nitpick_Examples/Datatype_Nits.thy
src/HOL/Nitpick_Examples/Hotel_Nits.thy
src/HOL/Nitpick_Examples/Induct_Nits.thy
src/HOL/Nitpick_Examples/Integer_Nits.thy
src/HOL/Nitpick_Examples/Manual_Nits.thy
src/HOL/Nitpick_Examples/Mini_Nits.thy
src/HOL/Nitpick_Examples/Mono_Nits.thy
src/HOL/Nitpick_Examples/Pattern_Nits.thy
src/HOL/Nitpick_Examples/Record_Nits.thy
src/HOL/Nitpick_Examples/Refute_Nits.thy
src/HOL/Nitpick_Examples/Special_Nits.thy
src/HOL/Nitpick_Examples/Tests_Nits.thy
src/HOL/Nitpick_Examples/Typedef_Nits.thy
src/HOL/Nominal/Examples/Nominal_Examples.thy
src/HOL/Nominal/Examples/Nominal_Examples_Base.thy
src/HOL/Nominal/Examples/Pattern.thy
src/HOL/Nominal/Examples/Standardization.thy
src/HOL/NthRoot.thy
src/HOL/Num.thy
src/HOL/Number_Theory/Binomial.thy
src/HOL/Number_Theory/Cong.thy
src/HOL/Number_Theory/Eratosthenes.thy
src/HOL/Number_Theory/Euclidean_Algorithm.thy
src/HOL/Number_Theory/Fib.thy
src/HOL/Number_Theory/Gauss.thy
src/HOL/Number_Theory/Number_Theory.thy
src/HOL/Number_Theory/Pocklington.thy
src/HOL/Number_Theory/Primes.thy
src/HOL/Number_Theory/Residues.thy
src/HOL/Number_Theory/UniqueFactorization.thy
src/HOL/Numeral_Simprocs.thy
src/HOL/Old_Number_Theory/BijectionRel.thy
src/HOL/Old_Number_Theory/Chinese.thy
src/HOL/Old_Number_Theory/Euler.thy
src/HOL/Old_Number_Theory/EulerFermat.thy
src/HOL/Old_Number_Theory/EvenOdd.thy
src/HOL/Old_Number_Theory/Factorization.thy
src/HOL/Old_Number_Theory/Fib.thy
src/HOL/Old_Number_Theory/Finite2.thy
src/HOL/Old_Number_Theory/Gauss.thy
src/HOL/Old_Number_Theory/Int2.thy
src/HOL/Old_Number_Theory/IntFact.thy
src/HOL/Old_Number_Theory/IntPrimes.thy
src/HOL/Old_Number_Theory/Legacy_GCD.thy
src/HOL/Old_Number_Theory/Pocklington.thy
src/HOL/Old_Number_Theory/Primes.thy
src/HOL/Old_Number_Theory/Quadratic_Reciprocity.thy
src/HOL/Old_Number_Theory/Residues.thy
src/HOL/Old_Number_Theory/WilsonBij.thy
src/HOL/Old_Number_Theory/WilsonRuss.thy
src/HOL/Option.thy
src/HOL/Order_Relation.thy
src/HOL/Orderings.thy
src/HOL/Parity.thy
src/HOL/Partial_Function.thy
src/HOL/Power.thy
src/HOL/Predicate.thy
src/HOL/Predicate_Compile.thy
src/HOL/Presburger.thy
src/HOL/Product_Type.thy
src/HOL/Prolog/Func.thy
src/HOL/Prolog/HOHH.thy
src/HOL/Prolog/Test.thy
src/HOL/Prolog/Type.thy
src/HOL/Proofs/Extraction/Euclid.thy
src/HOL/Proofs/Extraction/Greatest_Common_Divisor.thy
src/HOL/Proofs/Extraction/Higman.thy
src/HOL/Proofs/Extraction/Pigeonhole.thy
src/HOL/Proofs/Extraction/QuotRem.thy
src/HOL/Proofs/Extraction/Util.thy
src/HOL/Proofs/Extraction/Warshall.thy
src/HOL/Proofs/Lambda/Commutation.thy
src/HOL/Proofs/Lambda/Eta.thy
src/HOL/Proofs/Lambda/InductTermi.thy
src/HOL/Proofs/Lambda/Lambda.thy
src/HOL/Proofs/Lambda/LambdaType.thy
src/HOL/Proofs/Lambda/ListApplication.thy
src/HOL/Proofs/Lambda/ListBeta.thy
src/HOL/Proofs/Lambda/ListOrder.thy
src/HOL/Proofs/Lambda/NormalForm.thy
src/HOL/Proofs/Lambda/ParRed.thy
src/HOL/Proofs/Lambda/Standardization.thy
src/HOL/Proofs/Lambda/StrongNorm.thy
src/HOL/Proofs/Lambda/WeakNorm.thy
src/HOL/Proofs/ex/Hilbert_Classical.thy
src/HOL/Quickcheck_Examples/Completeness.thy
src/HOL/Quickcheck_Examples/Quickcheck_Examples.thy
src/HOL/Quickcheck_Examples/Quickcheck_Narrowing_Examples.thy
src/HOL/Quickcheck_Exhaustive.thy
src/HOL/Quickcheck_Narrowing.thy
src/HOL/Quickcheck_Random.thy
src/HOL/Quotient.thy
src/HOL/Quotient_Examples/DList.thy
src/HOL/Quotient_Examples/Lift_FSet.thy
src/HOL/Quotient_Examples/Lift_Fun.thy
src/HOL/Quotient_Examples/Lift_Set.thy
src/HOL/Random.thy
src/HOL/Random_Pred.thy
src/HOL/Random_Sequence.thy
src/HOL/Rat.thy
src/HOL/Real.thy
src/HOL/Real_Vector_Spaces.thy
src/HOL/Record.thy
src/HOL/Record_Benchmark/Record_Benchmark.thy
src/HOL/Relation.thy
src/HOL/Rings.thy
src/HOL/SAT.thy
src/HOL/SET_Protocol/Cardholder_Registration.thy
src/HOL/SET_Protocol/Event_SET.thy
src/HOL/SET_Protocol/Merchant_Registration.thy
src/HOL/SET_Protocol/Message_SET.thy
src/HOL/SET_Protocol/Public_SET.thy
src/HOL/SET_Protocol/Purchase.thy
src/HOL/SMT.thy
src/HOL/SMT_Examples/Boogie.thy
src/HOL/SMT_Examples/SMT_Examples.thy
src/HOL/SMT_Examples/SMT_Tests.thy
src/HOL/SMT_Examples/SMT_Word_Examples.thy
src/HOL/Semiring_Normalization.thy
src/HOL/Series.thy
src/HOL/Set.thy
src/HOL/Set_Interval.thy
src/HOL/Sledgehammer.thy
src/HOL/Statespace/DistinctTreeProver.thy
src/HOL/Statespace/StateFun.thy
src/HOL/Statespace/StateSpaceEx.thy
src/HOL/Statespace/StateSpaceLocale.thy
src/HOL/Statespace/StateSpaceSyntax.thy
src/HOL/String.thy
src/HOL/Sum_Type.thy
src/HOL/TLA/Action.thy
src/HOL/TLA/Buffer/Buffer.thy
src/HOL/TLA/Buffer/DBuffer.thy
src/HOL/TLA/Inc/Inc.thy
src/HOL/TLA/Intensional.thy
src/HOL/TLA/Memory/MemClerk.thy
src/HOL/TLA/Memory/MemClerkParameters.thy
src/HOL/TLA/Memory/Memory.thy
src/HOL/TLA/Memory/MemoryImplementation.thy
src/HOL/TLA/Memory/MemoryParameters.thy
src/HOL/TLA/Memory/ProcedureInterface.thy
src/HOL/TLA/Memory/RPC.thy
src/HOL/TLA/Memory/RPCMemoryParams.thy
src/HOL/TLA/Memory/RPCParameters.thy
src/HOL/TLA/Stfun.thy
src/HOL/TLA/TLA.thy
src/HOL/TPTP/ATP_Problem_Import.thy
src/HOL/TPTP/ATP_Theory_Export.thy
src/HOL/TPTP/MaSh_Eval.thy
src/HOL/TPTP/MaSh_Export.thy
src/HOL/TPTP/MaSh_Export_Base.thy
src/HOL/Taylor.thy
src/HOL/Topological_Spaces.thy
src/HOL/Transcendental.thy
src/HOL/Transfer.thy
src/HOL/Transitive_Closure.thy
src/HOL/Typedef.thy
src/HOL/Typerep.thy
src/HOL/UNITY/Comp.thy
src/HOL/UNITY/Comp/AllocBase.thy
src/HOL/UNITY/Comp/AllocImpl.thy
src/HOL/UNITY/Comp/Client.thy
src/HOL/UNITY/Comp/Counter.thy
src/HOL/UNITY/Comp/Counterc.thy
src/HOL/UNITY/Comp/Priority.thy
src/HOL/UNITY/Comp/Progress.thy
src/HOL/UNITY/Constrains.thy
src/HOL/UNITY/Detects.thy
src/HOL/UNITY/ELT.thy
src/HOL/UNITY/Extend.thy
src/HOL/UNITY/FP.thy
src/HOL/UNITY/Follows.thy
src/HOL/UNITY/Guar.thy
src/HOL/UNITY/Lift_prog.thy
src/HOL/UNITY/ListOrder.thy
src/HOL/UNITY/ProgressSets.thy
src/HOL/UNITY/Project.thy
src/HOL/UNITY/Rename.thy
src/HOL/UNITY/Simple/NSP_Bad.thy
src/HOL/UNITY/Simple/Token.thy
src/HOL/UNITY/SubstAx.thy
src/HOL/UNITY/Transformers.thy
src/HOL/UNITY/UNITY.thy
src/HOL/UNITY/UNITY_Main.thy
src/HOL/UNITY/Union.thy
src/HOL/UNITY/WFair.thy
src/HOL/Unix/Nested_Environment.thy
src/HOL/Unix/Unix.thy
src/HOL/Wellfounded.thy
src/HOL/Wfrec.thy
src/HOL/Zorn.thy
src/HOL/ex/Abstract_NAT.thy
src/HOL/ex/Adhoc_Overloading_Examples.thy
src/HOL/ex/Antiquote.thy
src/HOL/ex/Arith_Examples.thy
src/HOL/ex/BT.thy
src/HOL/ex/BinEx.thy
src/HOL/ex/Birthday_Paradox.thy
src/HOL/ex/Bubblesort.thy
src/HOL/ex/CTL.thy
src/HOL/ex/Cartouche_Examples.thy
src/HOL/ex/Case_Product.thy
src/HOL/ex/Chinese.thy
src/HOL/ex/Classical.thy
src/HOL/ex/Code_Binary_Nat_examples.thy
src/HOL/ex/Coherent.thy
src/HOL/ex/Eval_Examples.thy
src/HOL/ex/Execute_Choice.thy
src/HOL/ex/FinFunPred.thy
src/HOL/ex/Fundefs.thy
src/HOL/ex/Gauge_Integration.thy
src/HOL/ex/Groebner_Examples.thy
src/HOL/ex/Guess.thy
src/HOL/ex/HarmonicSeries.thy
src/HOL/ex/Hebrew.thy
src/HOL/ex/Hex_Bin_Examples.thy
src/HOL/ex/Higher_Order_Logic.thy
src/HOL/ex/Iff_Oracle.thy
src/HOL/ex/Induction_Schema.thy
src/HOL/ex/Intuitionistic.thy
src/HOL/ex/Lagrange.thy
src/HOL/ex/List_to_Set_Comprehension_Examples.thy
src/HOL/ex/LocaleTest2.thy
src/HOL/ex/ML.thy
src/HOL/ex/MT.thy
src/HOL/ex/MergeSort.thy
src/HOL/ex/Meson_Test.thy
src/HOL/ex/MonoidGroup.thy
src/HOL/ex/Multiquote.thy
src/HOL/ex/NatSum.thy
src/HOL/ex/Normalization_by_Evaluation.thy
src/HOL/ex/PER.thy
src/HOL/ex/Parallel_Example.thy
src/HOL/ex/PresburgerEx.thy
src/HOL/ex/Primrec.thy
src/HOL/ex/Quicksort.thy
src/HOL/ex/Records.thy
src/HOL/ex/Reflection_Examples.thy
src/HOL/ex/Refute_Examples.thy
src/HOL/ex/SAT_Examples.thy
src/HOL/ex/SVC_Oracle.thy
src/HOL/ex/Seq.thy
src/HOL/ex/Serbian.thy
src/HOL/ex/Set_Comprehension_Pointfree_Examples.thy
src/HOL/ex/Set_Theory.thy
src/HOL/ex/Simproc_Tests.thy
src/HOL/ex/Sqrt.thy
src/HOL/ex/Sqrt_Script.thy
src/HOL/ex/Sudoku.thy
src/HOL/ex/Tarski.thy
src/HOL/ex/Termination.thy
src/HOL/ex/ThreeDivides.thy
src/HOL/ex/Transfer_Ex.thy
src/HOL/ex/Transfer_Int_Nat.thy
src/HOL/ex/Transitive_Closure_Table_Ex.thy
src/HOL/ex/Tree23.thy
src/HOL/ex/Unification.thy
src/HOL/ex/While_Combinator_Example.thy
src/HOL/ex/svc_test.thy
src/LCF/LCF.thy
src/LCF/ex/Ex1.thy
src/LCF/ex/Ex2.thy
src/LCF/ex/Ex3.thy
src/LCF/ex/Ex4.thy
src/Sequents/LK/Nat.thy
src/Sequents/LK/Propositional.thy
src/Sequents/LK0.thy
src/Sequents/Sequents.thy
src/Tools/Adhoc_Overloading.thy
src/Tools/Code_Generator.thy
src/Tools/Permanent_Interpretation.thy
src/Tools/SML/Examples.thy
     1.1 --- a/src/CCL/CCL.thy	Sun Nov 02 18:21:14 2014 +0100
     1.2 +++ b/src/CCL/CCL.thy	Sun Nov 02 18:21:45 2014 +0100
     1.3 @@ -3,7 +3,7 @@
     1.4      Copyright   1993  University of Cambridge
     1.5  *)
     1.6  
     1.7 -header {* Classical Computational Logic for Untyped Lambda Calculus
     1.8 +section {* Classical Computational Logic for Untyped Lambda Calculus
     1.9    with reduction to weak head-normal form *}
    1.10  
    1.11  theory CCL
     2.1 --- a/src/CCL/Fix.thy	Sun Nov 02 18:21:14 2014 +0100
     2.2 +++ b/src/CCL/Fix.thy	Sun Nov 02 18:21:45 2014 +0100
     2.3 @@ -3,7 +3,7 @@
     2.4      Copyright   1993  University of Cambridge
     2.5  *)
     2.6  
     2.7 -header {* Tentative attempt at including fixed point induction; justified by Smith *}
     2.8 +section {* Tentative attempt at including fixed point induction; justified by Smith *}
     2.9  
    2.10  theory Fix
    2.11  imports Type
     3.1 --- a/src/CCL/Gfp.thy	Sun Nov 02 18:21:14 2014 +0100
     3.2 +++ b/src/CCL/Gfp.thy	Sun Nov 02 18:21:45 2014 +0100
     3.3 @@ -3,7 +3,7 @@
     3.4      Copyright   1992  University of Cambridge
     3.5  *)
     3.6  
     3.7 -header {* Greatest fixed points *}
     3.8 +section {* Greatest fixed points *}
     3.9  
    3.10  theory Gfp
    3.11  imports Lfp
     4.1 --- a/src/CCL/Hered.thy	Sun Nov 02 18:21:14 2014 +0100
     4.2 +++ b/src/CCL/Hered.thy	Sun Nov 02 18:21:45 2014 +0100
     4.3 @@ -3,7 +3,7 @@
     4.4      Copyright   1993  University of Cambridge
     4.5  *)
     4.6  
     4.7 -header {* Hereditary Termination -- cf. Martin Lo\"f *}
     4.8 +section {* Hereditary Termination -- cf. Martin Lo\"f *}
     4.9  
    4.10  theory Hered
    4.11  imports Type
     5.1 --- a/src/CCL/Lfp.thy	Sun Nov 02 18:21:14 2014 +0100
     5.2 +++ b/src/CCL/Lfp.thy	Sun Nov 02 18:21:45 2014 +0100
     5.3 @@ -3,7 +3,7 @@
     5.4      Copyright   1992  University of Cambridge
     5.5  *)
     5.6  
     5.7 -header {* The Knaster-Tarski Theorem *}
     5.8 +section {* The Knaster-Tarski Theorem *}
     5.9  
    5.10  theory Lfp
    5.11  imports Set
     6.1 --- a/src/CCL/Set.thy	Sun Nov 02 18:21:14 2014 +0100
     6.2 +++ b/src/CCL/Set.thy	Sun Nov 02 18:21:45 2014 +0100
     6.3 @@ -1,4 +1,4 @@
     6.4 -header {* Extending FOL by a modified version of HOL set theory *}
     6.5 +section {* Extending FOL by a modified version of HOL set theory *}
     6.6  
     6.7  theory Set
     6.8  imports "~~/src/FOL/FOL"
     7.1 --- a/src/CCL/Term.thy	Sun Nov 02 18:21:14 2014 +0100
     7.2 +++ b/src/CCL/Term.thy	Sun Nov 02 18:21:45 2014 +0100
     7.3 @@ -3,7 +3,7 @@
     7.4      Copyright   1993  University of Cambridge
     7.5  *)
     7.6  
     7.7 -header {* Definitions of usual program constructs in CCL *}
     7.8 +section {* Definitions of usual program constructs in CCL *}
     7.9  
    7.10  theory Term
    7.11  imports CCL
     8.1 --- a/src/CCL/Trancl.thy	Sun Nov 02 18:21:14 2014 +0100
     8.2 +++ b/src/CCL/Trancl.thy	Sun Nov 02 18:21:45 2014 +0100
     8.3 @@ -3,7 +3,7 @@
     8.4      Copyright   1993  University of Cambridge
     8.5  *)
     8.6  
     8.7 -header {* Transitive closure of a relation *}
     8.8 +section {* Transitive closure of a relation *}
     8.9  
    8.10  theory Trancl
    8.11  imports CCL
     9.1 --- a/src/CCL/Type.thy	Sun Nov 02 18:21:14 2014 +0100
     9.2 +++ b/src/CCL/Type.thy	Sun Nov 02 18:21:45 2014 +0100
     9.3 @@ -3,7 +3,7 @@
     9.4      Copyright   1993  University of Cambridge
     9.5  *)
     9.6  
     9.7 -header {* Types in CCL are defined as sets of terms *}
     9.8 +section {* Types in CCL are defined as sets of terms *}
     9.9  
    9.10  theory Type
    9.11  imports Term
    10.1 --- a/src/CCL/Wfd.thy	Sun Nov 02 18:21:14 2014 +0100
    10.2 +++ b/src/CCL/Wfd.thy	Sun Nov 02 18:21:45 2014 +0100
    10.3 @@ -3,7 +3,7 @@
    10.4      Copyright   1993  University of Cambridge
    10.5  *)
    10.6  
    10.7 -header {* Well-founded relations in CCL *}
    10.8 +section {* Well-founded relations in CCL *}
    10.9  
   10.10  theory Wfd
   10.11  imports Trancl Type Hered
    11.1 --- a/src/CCL/ex/Flag.thy	Sun Nov 02 18:21:14 2014 +0100
    11.2 +++ b/src/CCL/ex/Flag.thy	Sun Nov 02 18:21:45 2014 +0100
    11.3 @@ -3,7 +3,7 @@
    11.4      Copyright   1993  University of Cambridge
    11.5  *)
    11.6  
    11.7 -header {* Dutch national flag program -- except that the point of Dijkstra's example was to use
    11.8 +section {* Dutch national flag program -- except that the point of Dijkstra's example was to use
    11.9    arrays and this uses lists. *}
   11.10  
   11.11  theory Flag
    12.1 --- a/src/CCL/ex/List.thy	Sun Nov 02 18:21:14 2014 +0100
    12.2 +++ b/src/CCL/ex/List.thy	Sun Nov 02 18:21:45 2014 +0100
    12.3 @@ -3,7 +3,7 @@
    12.4      Copyright   1993  University of Cambridge
    12.5  *)
    12.6  
    12.7 -header {* Programs defined over lists *}
    12.8 +section {* Programs defined over lists *}
    12.9  
   12.10  theory List
   12.11  imports Nat
    13.1 --- a/src/CCL/ex/Nat.thy	Sun Nov 02 18:21:14 2014 +0100
    13.2 +++ b/src/CCL/ex/Nat.thy	Sun Nov 02 18:21:45 2014 +0100
    13.3 @@ -3,7 +3,7 @@
    13.4      Copyright   1993  University of Cambridge
    13.5  *)
    13.6  
    13.7 -header {* Programs defined over the natural numbers *}
    13.8 +section {* Programs defined over the natural numbers *}
    13.9  
   13.10  theory Nat
   13.11  imports Wfd
    14.1 --- a/src/CCL/ex/Stream.thy	Sun Nov 02 18:21:14 2014 +0100
    14.2 +++ b/src/CCL/ex/Stream.thy	Sun Nov 02 18:21:45 2014 +0100
    14.3 @@ -3,7 +3,7 @@
    14.4      Copyright   1993  University of Cambridge
    14.5  *)
    14.6  
    14.7 -header {* Programs defined over streams *}
    14.8 +section {* Programs defined over streams *}
    14.9  
   14.10  theory Stream
   14.11  imports List
    15.1 --- a/src/CTT/Arith.thy	Sun Nov 02 18:21:14 2014 +0100
    15.2 +++ b/src/CTT/Arith.thy	Sun Nov 02 18:21:45 2014 +0100
    15.3 @@ -3,7 +3,7 @@
    15.4      Copyright   1991  University of Cambridge
    15.5  *)
    15.6  
    15.7 -header {* Elementary arithmetic *}
    15.8 +section {* Elementary arithmetic *}
    15.9  
   15.10  theory Arith
   15.11  imports Bool
    16.1 --- a/src/CTT/Bool.thy	Sun Nov 02 18:21:14 2014 +0100
    16.2 +++ b/src/CTT/Bool.thy	Sun Nov 02 18:21:45 2014 +0100
    16.3 @@ -3,7 +3,7 @@
    16.4      Copyright   1991  University of Cambridge
    16.5  *)
    16.6  
    16.7 -header {* The two-element type (booleans and conditionals) *}
    16.8 +section {* The two-element type (booleans and conditionals) *}
    16.9  
   16.10  theory Bool
   16.11  imports CTT
    17.1 --- a/src/CTT/CTT.thy	Sun Nov 02 18:21:14 2014 +0100
    17.2 +++ b/src/CTT/CTT.thy	Sun Nov 02 18:21:45 2014 +0100
    17.3 @@ -3,7 +3,7 @@
    17.4      Copyright   1993  University of Cambridge
    17.5  *)
    17.6  
    17.7 -header {* Constructive Type Theory *}
    17.8 +section {* Constructive Type Theory *}
    17.9  
   17.10  theory CTT
   17.11  imports Pure
    18.1 --- a/src/CTT/Main.thy	Sun Nov 02 18:21:14 2014 +0100
    18.2 +++ b/src/CTT/Main.thy	Sun Nov 02 18:21:45 2014 +0100
    18.3 @@ -1,4 +1,4 @@
    18.4 -header {* Main includes everything *}
    18.5 +section {* Main includes everything *}
    18.6  
    18.7  theory Main
    18.8  imports CTT Arith Bool
    19.1 --- a/src/CTT/ex/Elimination.thy	Sun Nov 02 18:21:14 2014 +0100
    19.2 +++ b/src/CTT/ex/Elimination.thy	Sun Nov 02 18:21:45 2014 +0100
    19.3 @@ -6,7 +6,7 @@
    19.4  (Bibliopolis, 1984).
    19.5  *)
    19.6  
    19.7 -header "Examples with elimination rules"
    19.8 +section "Examples with elimination rules"
    19.9  
   19.10  theory Elimination
   19.11  imports CTT
    20.1 --- a/src/CTT/ex/Equality.thy	Sun Nov 02 18:21:14 2014 +0100
    20.2 +++ b/src/CTT/ex/Equality.thy	Sun Nov 02 18:21:45 2014 +0100
    20.3 @@ -3,7 +3,7 @@
    20.4      Copyright   1991  University of Cambridge
    20.5  *)
    20.6  
    20.7 -header "Equality reasoning by rewriting"
    20.8 +section "Equality reasoning by rewriting"
    20.9  
   20.10  theory Equality
   20.11  imports CTT
    21.1 --- a/src/CTT/ex/Synthesis.thy	Sun Nov 02 18:21:14 2014 +0100
    21.2 +++ b/src/CTT/ex/Synthesis.thy	Sun Nov 02 18:21:45 2014 +0100
    21.3 @@ -3,7 +3,7 @@
    21.4      Copyright   1991  University of Cambridge
    21.5  *)
    21.6  
    21.7 -header "Synthesis examples, using a crude form of narrowing"
    21.8 +section "Synthesis examples, using a crude form of narrowing"
    21.9  
   21.10  theory Synthesis
   21.11  imports Arith
    22.1 --- a/src/CTT/ex/Typechecking.thy	Sun Nov 02 18:21:14 2014 +0100
    22.2 +++ b/src/CTT/ex/Typechecking.thy	Sun Nov 02 18:21:45 2014 +0100
    22.3 @@ -3,7 +3,7 @@
    22.4      Copyright   1991  University of Cambridge
    22.5  *)
    22.6  
    22.7 -header "Easy examples: type checking and type deduction"
    22.8 +section "Easy examples: type checking and type deduction"
    22.9  
   22.10  theory Typechecking
   22.11  imports CTT
    23.1 --- a/src/Cube/Cube.thy	Sun Nov 02 18:21:14 2014 +0100
    23.2 +++ b/src/Cube/Cube.thy	Sun Nov 02 18:21:45 2014 +0100
    23.3 @@ -2,7 +2,7 @@
    23.4      Author:     Tobias Nipkow
    23.5  *)
    23.6  
    23.7 -header \<open>Barendregt's Lambda-Cube\<close>
    23.8 +section \<open>Barendregt's Lambda-Cube\<close>
    23.9  
   23.10  theory Cube
   23.11  imports Pure
    24.1 --- a/src/Cube/Example.thy	Sun Nov 02 18:21:14 2014 +0100
    24.2 +++ b/src/Cube/Example.thy	Sun Nov 02 18:21:45 2014 +0100
    24.3 @@ -1,4 +1,4 @@
    24.4 -header \<open>Lambda Cube Examples\<close>
    24.5 +section \<open>Lambda Cube Examples\<close>
    24.6  
    24.7  theory Example
    24.8  imports Cube
    25.1 --- a/src/Doc/Isar_Ref/First_Order_Logic.thy	Sun Nov 02 18:21:14 2014 +0100
    25.2 +++ b/src/Doc/Isar_Ref/First_Order_Logic.thy	Sun Nov 02 18:21:45 2014 +0100
    25.3 @@ -1,5 +1,5 @@
    25.4  
    25.5 -header \<open>Example: First-Order Logic\<close>
    25.6 +section \<open>Example: First-Order Logic\<close>
    25.7  
    25.8  theory %visible First_Order_Logic
    25.9  imports Base  (* FIXME Pure!? *)
    26.1 --- a/src/Doc/Logics_ZF/FOL_examples.thy	Sun Nov 02 18:21:14 2014 +0100
    26.2 +++ b/src/Doc/Logics_ZF/FOL_examples.thy	Sun Nov 02 18:21:45 2014 +0100
    26.3 @@ -1,4 +1,4 @@
    26.4 -header{*Examples of Classical Reasoning*}
    26.5 +section{*Examples of Classical Reasoning*}
    26.6  
    26.7  theory FOL_examples imports "~~/src/FOL/FOL" begin
    26.8  
    27.1 --- a/src/Doc/Logics_ZF/IFOL_examples.thy	Sun Nov 02 18:21:14 2014 +0100
    27.2 +++ b/src/Doc/Logics_ZF/IFOL_examples.thy	Sun Nov 02 18:21:45 2014 +0100
    27.3 @@ -1,4 +1,4 @@
    27.4 -header{*Examples of Intuitionistic Reasoning*}
    27.5 +section{*Examples of Intuitionistic Reasoning*}
    27.6  
    27.7  theory IFOL_examples imports "~~/src/FOL/IFOL" begin
    27.8  
    28.1 --- a/src/Doc/Logics_ZF/ZF_examples.thy	Sun Nov 02 18:21:14 2014 +0100
    28.2 +++ b/src/Doc/Logics_ZF/ZF_examples.thy	Sun Nov 02 18:21:45 2014 +0100
    28.3 @@ -1,4 +1,4 @@
    28.4 -header{*Examples of Reasoning in ZF Set Theory*}
    28.5 +section{*Examples of Reasoning in ZF Set Theory*}
    28.6  
    28.7  theory ZF_examples imports Main_ZFC begin
    28.8  
    29.1 --- a/src/Doc/Tutorial/Protocol/Event.thy	Sun Nov 02 18:21:14 2014 +0100
    29.2 +++ b/src/Doc/Tutorial/Protocol/Event.thy	Sun Nov 02 18:21:45 2014 +0100
    29.3 @@ -7,7 +7,7 @@
    29.4      stores are visible to him
    29.5  *)(*<*)
    29.6  
    29.7 -header{*Theory of Events for Security Protocols*}
    29.8 +section{*Theory of Events for Security Protocols*}
    29.9  
   29.10  theory Event imports Message begin
   29.11  
    30.1 --- a/src/Doc/Tutorial/Protocol/Message.thy	Sun Nov 02 18:21:14 2014 +0100
    30.2 +++ b/src/Doc/Tutorial/Protocol/Message.thy	Sun Nov 02 18:21:45 2014 +0100
    30.3 @@ -5,7 +5,7 @@
    30.4  Inductive relations "parts", "analz" and "synth"
    30.5  *)(*<*)
    30.6  
    30.7 -header{*Theory of Agents and Messages for Security Protocols*}
    30.8 +section{*Theory of Agents and Messages for Security Protocols*}
    30.9  
   30.10  theory Message imports Main begin
   30.11  ML_file "../../antiquote_setup.ML"
    31.1 --- a/src/Doc/Tutorial/Types/Records.thy	Sun Nov 02 18:21:14 2014 +0100
    31.2 +++ b/src/Doc/Tutorial/Types/Records.thy	Sun Nov 02 18:21:45 2014 +0100
    31.3 @@ -1,5 +1,5 @@
    31.4  
    31.5 -header {* Records \label{sec:records} *}
    31.6 +section {* Records \label{sec:records} *}
    31.7  
    31.8  (*<*)
    31.9  theory Records imports Main begin
    32.1 --- a/src/FOL/FOL.thy	Sun Nov 02 18:21:14 2014 +0100
    32.2 +++ b/src/FOL/FOL.thy	Sun Nov 02 18:21:45 2014 +0100
    32.3 @@ -2,7 +2,7 @@
    32.4      Author:     Lawrence C Paulson and Markus Wenzel
    32.5  *)
    32.6  
    32.7 -header {* Classical first-order logic *}
    32.8 +section {* Classical first-order logic *}
    32.9  
   32.10  theory FOL
   32.11  imports IFOL
    33.1 --- a/src/FOL/IFOL.thy	Sun Nov 02 18:21:14 2014 +0100
    33.2 +++ b/src/FOL/IFOL.thy	Sun Nov 02 18:21:45 2014 +0100
    33.3 @@ -2,7 +2,7 @@
    33.4      Author:     Lawrence C Paulson and Markus Wenzel
    33.5  *)
    33.6  
    33.7 -header {* Intuitionistic first-order logic *}
    33.8 +section {* Intuitionistic first-order logic *}
    33.9  
   33.10  theory IFOL
   33.11  imports Pure
    34.1 --- a/src/FOL/ex/Classical.thy	Sun Nov 02 18:21:14 2014 +0100
    34.2 +++ b/src/FOL/ex/Classical.thy	Sun Nov 02 18:21:45 2014 +0100
    34.3 @@ -3,7 +3,7 @@
    34.4      Copyright   1994  University of Cambridge
    34.5  *)
    34.6  
    34.7 -header{*Classical Predicate Calculus Problems*}
    34.8 +section{*Classical Predicate Calculus Problems*}
    34.9  
   34.10  theory Classical imports FOL begin
   34.11  
    35.1 --- a/src/FOL/ex/First_Order_Logic.thy	Sun Nov 02 18:21:14 2014 +0100
    35.2 +++ b/src/FOL/ex/First_Order_Logic.thy	Sun Nov 02 18:21:45 2014 +0100
    35.3 @@ -2,7 +2,7 @@
    35.4      Author:     Markus Wenzel, TU Munich
    35.5  *)
    35.6  
    35.7 -header {* A simple formulation of First-Order Logic *}
    35.8 +section {* A simple formulation of First-Order Logic *}
    35.9  
   35.10  theory First_Order_Logic imports Pure begin
   35.11  
    36.1 --- a/src/FOL/ex/Foundation.thy	Sun Nov 02 18:21:14 2014 +0100
    36.2 +++ b/src/FOL/ex/Foundation.thy	Sun Nov 02 18:21:45 2014 +0100
    36.3 @@ -3,7 +3,7 @@
    36.4      Copyright   1991  University of Cambridge
    36.5  *)
    36.6  
    36.7 -header "Intuitionistic FOL: Examples from The Foundation of a Generic Theorem Prover"
    36.8 +section "Intuitionistic FOL: Examples from The Foundation of a Generic Theorem Prover"
    36.9  
   36.10  theory Foundation
   36.11  imports IFOL
    37.1 --- a/src/FOL/ex/If.thy	Sun Nov 02 18:21:14 2014 +0100
    37.2 +++ b/src/FOL/ex/If.thy	Sun Nov 02 18:21:45 2014 +0100
    37.3 @@ -3,7 +3,7 @@
    37.4      Copyright   1991  University of Cambridge
    37.5  *)
    37.6  
    37.7 -header {* First-Order Logic: the 'if' example *}
    37.8 +section {* First-Order Logic: the 'if' example *}
    37.9  
   37.10  theory If imports FOL begin
   37.11  
    38.1 --- a/src/FOL/ex/Intro.thy	Sun Nov 02 18:21:14 2014 +0100
    38.2 +++ b/src/FOL/ex/Intro.thy	Sun Nov 02 18:21:45 2014 +0100
    38.3 @@ -5,7 +5,7 @@
    38.4  Derives some inference rules, illustrating the use of definitions.
    38.5  *)
    38.6  
    38.7 -header {* Examples for the manual ``Introduction to Isabelle'' *}
    38.8 +section {* Examples for the manual ``Introduction to Isabelle'' *}
    38.9  
   38.10  theory Intro
   38.11  imports FOL
    39.1 --- a/src/FOL/ex/Intuitionistic.thy	Sun Nov 02 18:21:14 2014 +0100
    39.2 +++ b/src/FOL/ex/Intuitionistic.thy	Sun Nov 02 18:21:45 2014 +0100
    39.3 @@ -3,7 +3,7 @@
    39.4      Copyright   1991  University of Cambridge
    39.5  *)
    39.6  
    39.7 -header {* Intuitionistic First-Order Logic *}
    39.8 +section {* Intuitionistic First-Order Logic *}
    39.9  
   39.10  theory Intuitionistic
   39.11  imports IFOL
    40.1 --- a/src/FOL/ex/Nat.thy	Sun Nov 02 18:21:14 2014 +0100
    40.2 +++ b/src/FOL/ex/Nat.thy	Sun Nov 02 18:21:45 2014 +0100
    40.3 @@ -3,7 +3,7 @@
    40.4      Copyright   1992  University of Cambridge
    40.5  *)
    40.6  
    40.7 -header {* Theory of the natural numbers: Peano's axioms, primitive recursion *}
    40.8 +section {* Theory of the natural numbers: Peano's axioms, primitive recursion *}
    40.9  
   40.10  theory Nat
   40.11  imports FOL
    41.1 --- a/src/FOL/ex/Natural_Numbers.thy	Sun Nov 02 18:21:14 2014 +0100
    41.2 +++ b/src/FOL/ex/Natural_Numbers.thy	Sun Nov 02 18:21:45 2014 +0100
    41.3 @@ -2,7 +2,7 @@
    41.4      Author:     Markus Wenzel, TU Munich
    41.5  *)
    41.6  
    41.7 -header {* Natural numbers *}
    41.8 +section {* Natural numbers *}
    41.9  
   41.10  theory Natural_Numbers
   41.11  imports FOL
    42.1 --- a/src/FOL/ex/Prolog.thy	Sun Nov 02 18:21:14 2014 +0100
    42.2 +++ b/src/FOL/ex/Prolog.thy	Sun Nov 02 18:21:45 2014 +0100
    42.3 @@ -3,7 +3,7 @@
    42.4      Copyright   1992  University of Cambridge
    42.5  *)
    42.6  
    42.7 -header {* First-Order Logic: PROLOG examples *}
    42.8 +section {* First-Order Logic: PROLOG examples *}
    42.9  
   42.10  theory Prolog
   42.11  imports FOL
    43.1 --- a/src/FOL/ex/Propositional_Cla.thy	Sun Nov 02 18:21:14 2014 +0100
    43.2 +++ b/src/FOL/ex/Propositional_Cla.thy	Sun Nov 02 18:21:45 2014 +0100
    43.3 @@ -3,7 +3,7 @@
    43.4      Copyright   1991  University of Cambridge
    43.5  *)
    43.6  
    43.7 -header {* First-Order Logic: propositional examples (classical version) *}
    43.8 +section {* First-Order Logic: propositional examples (classical version) *}
    43.9  
   43.10  theory Propositional_Cla
   43.11  imports FOL
    44.1 --- a/src/FOL/ex/Propositional_Int.thy	Sun Nov 02 18:21:14 2014 +0100
    44.2 +++ b/src/FOL/ex/Propositional_Int.thy	Sun Nov 02 18:21:45 2014 +0100
    44.3 @@ -3,7 +3,7 @@
    44.4      Copyright   1991  University of Cambridge
    44.5  *)
    44.6  
    44.7 -header {* First-Order Logic: propositional examples (intuitionistic version) *}
    44.8 +section {* First-Order Logic: propositional examples (intuitionistic version) *}
    44.9  
   44.10  theory Propositional_Int
   44.11  imports IFOL
    45.1 --- a/src/FOL/ex/Quantifiers_Cla.thy	Sun Nov 02 18:21:14 2014 +0100
    45.2 +++ b/src/FOL/ex/Quantifiers_Cla.thy	Sun Nov 02 18:21:45 2014 +0100
    45.3 @@ -3,7 +3,7 @@
    45.4      Copyright   1991  University of Cambridge
    45.5  *)
    45.6  
    45.7 -header {* First-Order Logic: quantifier examples (classical version) *}
    45.8 +section {* First-Order Logic: quantifier examples (classical version) *}
    45.9  
   45.10  theory Quantifiers_Cla
   45.11  imports FOL
    46.1 --- a/src/FOL/ex/Quantifiers_Int.thy	Sun Nov 02 18:21:14 2014 +0100
    46.2 +++ b/src/FOL/ex/Quantifiers_Int.thy	Sun Nov 02 18:21:45 2014 +0100
    46.3 @@ -3,7 +3,7 @@
    46.4      Copyright   1991  University of Cambridge
    46.5  *)
    46.6  
    46.7 -header {* First-Order Logic: quantifier examples (intuitionistic version) *}
    46.8 +section {* First-Order Logic: quantifier examples (intuitionistic version) *}
    46.9  
   46.10  theory Quantifiers_Int
   46.11  imports IFOL
    47.1 --- a/src/FOLP/FOLP.thy	Sun Nov 02 18:21:14 2014 +0100
    47.2 +++ b/src/FOLP/FOLP.thy	Sun Nov 02 18:21:45 2014 +0100
    47.3 @@ -3,7 +3,7 @@
    47.4      Copyright   1992  University of Cambridge
    47.5  *)
    47.6  
    47.7 -header {* Classical First-Order Logic with Proofs *}
    47.8 +section {* Classical First-Order Logic with Proofs *}
    47.9  
   47.10  theory FOLP
   47.11  imports IFOLP
    48.1 --- a/src/FOLP/IFOLP.thy	Sun Nov 02 18:21:14 2014 +0100
    48.2 +++ b/src/FOLP/IFOLP.thy	Sun Nov 02 18:21:45 2014 +0100
    48.3 @@ -3,7 +3,7 @@
    48.4      Copyright   1992  University of Cambridge
    48.5  *)
    48.6  
    48.7 -header {* Intuitionistic First-Order Logic with Proofs *}
    48.8 +section {* Intuitionistic First-Order Logic with Proofs *}
    48.9  
   48.10  theory IFOLP
   48.11  imports Pure
    49.1 --- a/src/FOLP/ex/Foundation.thy	Sun Nov 02 18:21:14 2014 +0100
    49.2 +++ b/src/FOLP/ex/Foundation.thy	Sun Nov 02 18:21:45 2014 +0100
    49.3 @@ -3,7 +3,7 @@
    49.4      Copyright   1991  University of Cambridge
    49.5  *)
    49.6  
    49.7 -header "Intuitionistic FOL: Examples from The Foundation of a Generic Theorem Prover"
    49.8 +section "Intuitionistic FOL: Examples from The Foundation of a Generic Theorem Prover"
    49.9  
   49.10  theory Foundation
   49.11  imports IFOLP
    50.1 --- a/src/FOLP/ex/Intro.thy	Sun Nov 02 18:21:14 2014 +0100
    50.2 +++ b/src/FOLP/ex/Intro.thy	Sun Nov 02 18:21:45 2014 +0100
    50.3 @@ -5,7 +5,7 @@
    50.4  Derives some inference rules, illustrating the use of definitions.
    50.5  *)
    50.6  
    50.7 -header {* Examples for the manual ``Introduction to Isabelle'' *}
    50.8 +section {* Examples for the manual ``Introduction to Isabelle'' *}
    50.9  
   50.10  theory Intro
   50.11  imports FOLP
    51.1 --- a/src/FOLP/ex/Nat.thy	Sun Nov 02 18:21:14 2014 +0100
    51.2 +++ b/src/FOLP/ex/Nat.thy	Sun Nov 02 18:21:45 2014 +0100
    51.3 @@ -3,7 +3,7 @@
    51.4      Copyright   1992  University of Cambridge
    51.5  *)
    51.6  
    51.7 -header {* Theory of the natural numbers: Peano's axioms, primitive recursion *}
    51.8 +section {* Theory of the natural numbers: Peano's axioms, primitive recursion *}
    51.9  
   51.10  theory Nat
   51.11  imports FOLP
    52.1 --- a/src/FOLP/ex/Propositional_Cla.thy	Sun Nov 02 18:21:14 2014 +0100
    52.2 +++ b/src/FOLP/ex/Propositional_Cla.thy	Sun Nov 02 18:21:45 2014 +0100
    52.3 @@ -3,7 +3,7 @@
    52.4      Copyright   1991  University of Cambridge
    52.5  *)
    52.6  
    52.7 -header {* First-Order Logic: propositional examples *}
    52.8 +section {* First-Order Logic: propositional examples *}
    52.9  
   52.10  theory Propositional_Cla
   52.11  imports FOLP
    53.1 --- a/src/FOLP/ex/Propositional_Int.thy	Sun Nov 02 18:21:14 2014 +0100
    53.2 +++ b/src/FOLP/ex/Propositional_Int.thy	Sun Nov 02 18:21:45 2014 +0100
    53.3 @@ -3,7 +3,7 @@
    53.4      Copyright   1991  University of Cambridge
    53.5  *)
    53.6  
    53.7 -header {* First-Order Logic: propositional examples *}
    53.8 +section {* First-Order Logic: propositional examples *}
    53.9  
   53.10  theory Propositional_Int
   53.11  imports IFOLP
    54.1 --- a/src/HOL/ATP.thy	Sun Nov 02 18:21:14 2014 +0100
    54.2 +++ b/src/HOL/ATP.thy	Sun Nov 02 18:21:45 2014 +0100
    54.3 @@ -3,7 +3,7 @@
    54.4      Author:     Jasmin Blanchette, TU Muenchen
    54.5  *)
    54.6  
    54.7 -header {* Automatic Theorem Provers (ATPs) *}
    54.8 +section {* Automatic Theorem Provers (ATPs) *}
    54.9  
   54.10  theory ATP
   54.11  imports Meson
    55.1 --- a/src/HOL/Algebra/Divisibility.thy	Sun Nov 02 18:21:14 2014 +0100
    55.2 +++ b/src/HOL/Algebra/Divisibility.thy	Sun Nov 02 18:21:45 2014 +0100
    55.3 @@ -3,7 +3,7 @@
    55.4      Author:     Stephan Hohe
    55.5  *)
    55.6  
    55.7 -header {* Divisibility in monoids and rings *}
    55.8 +section {* Divisibility in monoids and rings *}
    55.9  
   55.10  theory Divisibility
   55.11  imports "~~/src/HOL/Library/Permutation" Coset Group
    56.1 --- a/src/HOL/Archimedean_Field.thy	Sun Nov 02 18:21:14 2014 +0100
    56.2 +++ b/src/HOL/Archimedean_Field.thy	Sun Nov 02 18:21:45 2014 +0100
    56.3 @@ -2,7 +2,7 @@
    56.4      Author:     Brian Huffman
    56.5  *)
    56.6  
    56.7 -header {* Archimedean Fields, Floor and Ceiling Functions *}
    56.8 +section {* Archimedean Fields, Floor and Ceiling Functions *}
    56.9  
   56.10  theory Archimedean_Field
   56.11  imports Main
    57.1 --- a/src/HOL/Auth/Auth_Public.thy	Sun Nov 02 18:21:14 2014 +0100
    57.2 +++ b/src/HOL/Auth/Auth_Public.thy	Sun Nov 02 18:21:45 2014 +0100
    57.3 @@ -2,7 +2,7 @@
    57.4      Copyright   1996  University of Cambridge
    57.5  *)
    57.6  
    57.7 -header {* Conventional protocols: rely on conventional Message, Event and Public -- Public-key protocols *}
    57.8 +section {* Conventional protocols: rely on conventional Message, Event and Public -- Public-key protocols *}
    57.9  
   57.10  theory Auth_Public
   57.11  imports
    58.1 --- a/src/HOL/Auth/Auth_Shared.thy	Sun Nov 02 18:21:14 2014 +0100
    58.2 +++ b/src/HOL/Auth/Auth_Shared.thy	Sun Nov 02 18:21:45 2014 +0100
    58.3 @@ -2,7 +2,7 @@
    58.4      Copyright   1996  University of Cambridge
    58.5  *)
    58.6  
    58.7 -header {* Conventional protocols: rely on conventional Message, Event and Public -- Shared-key protocols *}
    58.8 +section {* Conventional protocols: rely on conventional Message, Event and Public -- Shared-key protocols *}
    58.9  
   58.10  theory Auth_Shared
   58.11  imports
    59.1 --- a/src/HOL/Auth/CertifiedEmail.thy	Sun Nov 02 18:21:14 2014 +0100
    59.2 +++ b/src/HOL/Auth/CertifiedEmail.thy	Sun Nov 02 18:21:45 2014 +0100
    59.3 @@ -2,7 +2,7 @@
    59.4      Author:     Giampaolo Bella, Christiano Longo and Lawrence C Paulson
    59.5  *)
    59.6  
    59.7 -header{*The Certified Electronic Mail Protocol by Abadi et al.*}
    59.8 +section{*The Certified Electronic Mail Protocol by Abadi et al.*}
    59.9  
   59.10  theory CertifiedEmail imports Public begin
   59.11  
    60.1 --- a/src/HOL/Auth/Event.thy	Sun Nov 02 18:21:14 2014 +0100
    60.2 +++ b/src/HOL/Auth/Event.thy	Sun Nov 02 18:21:45 2014 +0100
    60.3 @@ -8,7 +8,7 @@
    60.4      stores are visible to him
    60.5  *)
    60.6  
    60.7 -header{*Theory of Events for Security Protocols*}
    60.8 +section{*Theory of Events for Security Protocols*}
    60.9  
   60.10  theory Event imports Message begin
   60.11  
    61.1 --- a/src/HOL/Auth/Guard/Analz.thy	Sun Nov 02 18:21:14 2014 +0100
    61.2 +++ b/src/HOL/Auth/Guard/Analz.thy	Sun Nov 02 18:21:45 2014 +0100
    61.3 @@ -3,7 +3,7 @@
    61.4      Copyright   2001  University of Cambridge
    61.5  *)
    61.6  
    61.7 -header{*Decomposition of Analz into two parts*}
    61.8 +section{*Decomposition of Analz into two parts*}
    61.9  
   61.10  theory Analz imports Extensions begin
   61.11  
    62.1 --- a/src/HOL/Auth/Guard/Auth_Guard_Public.thy	Sun Nov 02 18:21:14 2014 +0100
    62.2 +++ b/src/HOL/Auth/Guard/Auth_Guard_Public.thy	Sun Nov 02 18:21:45 2014 +0100
    62.3 @@ -2,7 +2,7 @@
    62.4      Copyright   1996  University of Cambridge
    62.5  *)
    62.6  
    62.7 -header {* Blanqui's "guard" concept: protocol-independent secrecy *}
    62.8 +section {* Blanqui's "guard" concept: protocol-independent secrecy *}
    62.9  
   62.10  theory Auth_Guard_Public
   62.11  imports
    63.1 --- a/src/HOL/Auth/Guard/Auth_Guard_Shared.thy	Sun Nov 02 18:21:14 2014 +0100
    63.2 +++ b/src/HOL/Auth/Guard/Auth_Guard_Shared.thy	Sun Nov 02 18:21:45 2014 +0100
    63.3 @@ -2,7 +2,7 @@
    63.4      Copyright   1996  University of Cambridge
    63.5  *)
    63.6  
    63.7 -header {* Blanqui's "guard" concept: protocol-independent secrecy *}
    63.8 +section {* Blanqui's "guard" concept: protocol-independent secrecy *}
    63.9  
   63.10  theory Auth_Guard_Shared
   63.11  imports
    64.1 --- a/src/HOL/Auth/Guard/Extensions.thy	Sun Nov 02 18:21:14 2014 +0100
    64.2 +++ b/src/HOL/Auth/Guard/Extensions.thy	Sun Nov 02 18:21:45 2014 +0100
    64.3 @@ -3,7 +3,7 @@
    64.4      Copyright   2001  University of Cambridge
    64.5  *)
    64.6  
    64.7 -header {*Extensions to Standard Theories*}
    64.8 +section {*Extensions to Standard Theories*}
    64.9  
   64.10  theory Extensions
   64.11  imports "../Event"
    65.1 --- a/src/HOL/Auth/Guard/Guard.thy	Sun Nov 02 18:21:14 2014 +0100
    65.2 +++ b/src/HOL/Auth/Guard/Guard.thy	Sun Nov 02 18:21:45 2014 +0100
    65.3 @@ -3,7 +3,7 @@
    65.4      Copyright   2002  University of Cambridge
    65.5  *)
    65.6  
    65.7 -header{*Protocol-Independent Confidentiality Theorem on Nonces*}
    65.8 +section{*Protocol-Independent Confidentiality Theorem on Nonces*}
    65.9  
   65.10  theory Guard imports Analz Extensions begin
   65.11  
    66.1 --- a/src/HOL/Auth/Guard/GuardK.thy	Sun Nov 02 18:21:14 2014 +0100
    66.2 +++ b/src/HOL/Auth/Guard/GuardK.thy	Sun Nov 02 18:21:45 2014 +0100
    66.3 @@ -8,7 +8,7 @@
    66.4  - the hypothesis Key n ~:G (keyset G) is added
    66.5  *)
    66.6  
    66.7 -header{*protocol-independent confidentiality theorem on keys*}
    66.8 +section{*protocol-independent confidentiality theorem on keys*}
    66.9  
   66.10  theory GuardK
   66.11  imports Analz Extensions
    67.1 --- a/src/HOL/Auth/Guard/Guard_NS_Public.thy	Sun Nov 02 18:21:14 2014 +0100
    67.2 +++ b/src/HOL/Auth/Guard/Guard_NS_Public.thy	Sun Nov 02 18:21:45 2014 +0100
    67.3 @@ -5,7 +5,7 @@
    67.4  Incorporating Lowe's fix (inclusion of B's identity in round 2).
    67.5  *)
    67.6  
    67.7 -header{*Needham-Schroeder-Lowe Public-Key Protocol*}
    67.8 +section{*Needham-Schroeder-Lowe Public-Key Protocol*}
    67.9  
   67.10  theory Guard_NS_Public imports Guard_Public begin
   67.11  
    68.1 --- a/src/HOL/Auth/Guard/Guard_OtwayRees.thy	Sun Nov 02 18:21:14 2014 +0100
    68.2 +++ b/src/HOL/Auth/Guard/Guard_OtwayRees.thy	Sun Nov 02 18:21:45 2014 +0100
    68.3 @@ -3,7 +3,7 @@
    68.4      Copyright   2002  University of Cambridge
    68.5  *)
    68.6  
    68.7 -header{*Otway-Rees Protocol*}
    68.8 +section{*Otway-Rees Protocol*}
    68.9  
   68.10  theory Guard_OtwayRees imports Guard_Shared begin
   68.11  
    69.1 --- a/src/HOL/Auth/Guard/Guard_Shared.thy	Sun Nov 02 18:21:14 2014 +0100
    69.2 +++ b/src/HOL/Auth/Guard/Guard_Shared.thy	Sun Nov 02 18:21:45 2014 +0100
    69.3 @@ -3,7 +3,7 @@
    69.4      Copyright   2002  University of Cambridge
    69.5  *)
    69.6  
    69.7 -header{*lemmas on guarded messages for protocols with symmetric keys*}
    69.8 +section{*lemmas on guarded messages for protocols with symmetric keys*}
    69.9  
   69.10  theory Guard_Shared imports Guard GuardK "../Shared" begin
   69.11  
    70.1 --- a/src/HOL/Auth/Guard/Guard_Yahalom.thy	Sun Nov 02 18:21:14 2014 +0100
    70.2 +++ b/src/HOL/Auth/Guard/Guard_Yahalom.thy	Sun Nov 02 18:21:45 2014 +0100
    70.3 @@ -3,7 +3,7 @@
    70.4      Copyright   2002  University of Cambridge
    70.5  *)
    70.6  
    70.7 -header{*Yahalom Protocol*}
    70.8 +section{*Yahalom Protocol*}
    70.9  
   70.10  theory Guard_Yahalom imports "../Shared" Guard_Shared begin
   70.11  
    71.1 --- a/src/HOL/Auth/Guard/List_Msg.thy	Sun Nov 02 18:21:14 2014 +0100
    71.2 +++ b/src/HOL/Auth/Guard/List_Msg.thy	Sun Nov 02 18:21:45 2014 +0100
    71.3 @@ -3,7 +3,7 @@
    71.4      Copyright   2001  University of Cambridge
    71.5  *)
    71.6  
    71.7 -header{*Lists of Messages and Lists of Agents*}
    71.8 +section{*Lists of Messages and Lists of Agents*}
    71.9  
   71.10  theory List_Msg imports Extensions begin
   71.11  
    72.1 --- a/src/HOL/Auth/Guard/P1.thy	Sun Nov 02 18:21:14 2014 +0100
    72.2 +++ b/src/HOL/Auth/Guard/P1.thy	Sun Nov 02 18:21:45 2014 +0100
    72.3 @@ -7,7 +7,7 @@
    72.4  Mobiles Agents 1998, LNCS 1477.
    72.5  *)
    72.6  
    72.7 -header{*Protocol P1*}
    72.8 +section{*Protocol P1*}
    72.9  
   72.10  theory P1 imports "../Public" Guard_Public List_Msg begin
   72.11  
    73.1 --- a/src/HOL/Auth/Guard/P2.thy	Sun Nov 02 18:21:14 2014 +0100
    73.2 +++ b/src/HOL/Auth/Guard/P2.thy	Sun Nov 02 18:21:45 2014 +0100
    73.3 @@ -7,7 +7,7 @@
    73.4  Mobiles Agents 1998, LNCS 1477.
    73.5  *)
    73.6  
    73.7 -header{*Protocol P2*}
    73.8 +section{*Protocol P2*}
    73.9  
   73.10  theory P2 imports Guard_Public List_Msg begin
   73.11  
    74.1 --- a/src/HOL/Auth/Guard/Proto.thy	Sun Nov 02 18:21:14 2014 +0100
    74.2 +++ b/src/HOL/Auth/Guard/Proto.thy	Sun Nov 02 18:21:45 2014 +0100
    74.3 @@ -3,7 +3,7 @@
    74.4      Copyright   2002  University of Cambridge
    74.5  *)
    74.6  
    74.7 -header{*Other Protocol-Independent Results*}
    74.8 +section{*Other Protocol-Independent Results*}
    74.9  
   74.10  theory Proto imports Guard_Public begin
   74.11  
    75.1 --- a/src/HOL/Auth/KerberosIV.thy	Sun Nov 02 18:21:14 2014 +0100
    75.2 +++ b/src/HOL/Auth/KerberosIV.thy	Sun Nov 02 18:21:45 2014 +0100
    75.3 @@ -3,7 +3,7 @@
    75.4      Copyright   1998  University of Cambridge
    75.5  *)
    75.6  
    75.7 -header{*The Kerberos Protocol, Version IV*}
    75.8 +section{*The Kerberos Protocol, Version IV*}
    75.9  
   75.10  theory KerberosIV imports Public begin
   75.11  
    76.1 --- a/src/HOL/Auth/KerberosIV_Gets.thy	Sun Nov 02 18:21:14 2014 +0100
    76.2 +++ b/src/HOL/Auth/KerberosIV_Gets.thy	Sun Nov 02 18:21:45 2014 +0100
    76.3 @@ -3,7 +3,7 @@
    76.4      Copyright   1998  University of Cambridge
    76.5  *)
    76.6  
    76.7 -header{*The Kerberos Protocol, Version IV*}
    76.8 +section{*The Kerberos Protocol, Version IV*}
    76.9  
   76.10  theory KerberosIV_Gets imports Public begin
   76.11  
    77.1 --- a/src/HOL/Auth/KerberosV.thy	Sun Nov 02 18:21:14 2014 +0100
    77.2 +++ b/src/HOL/Auth/KerberosV.thy	Sun Nov 02 18:21:45 2014 +0100
    77.3 @@ -2,7 +2,7 @@
    77.4      Author:     Giampaolo Bella, Catania University
    77.5  *)
    77.6  
    77.7 -header{*The Kerberos Protocol, Version V*}
    77.8 +section{*The Kerberos Protocol, Version V*}
    77.9  
   77.10  theory KerberosV imports Public begin
   77.11  
    78.1 --- a/src/HOL/Auth/Kerberos_BAN.thy	Sun Nov 02 18:21:14 2014 +0100
    78.2 +++ b/src/HOL/Auth/Kerberos_BAN.thy	Sun Nov 02 18:21:45 2014 +0100
    78.3 @@ -3,7 +3,7 @@
    78.4      Copyright   1998  University of Cambridge
    78.5  *)
    78.6  
    78.7 -header{*The Kerberos Protocol, BAN Version*}
    78.8 +section{*The Kerberos Protocol, BAN Version*}
    78.9  
   78.10  theory Kerberos_BAN imports Public begin
   78.11  
    79.1 --- a/src/HOL/Auth/Kerberos_BAN_Gets.thy	Sun Nov 02 18:21:14 2014 +0100
    79.2 +++ b/src/HOL/Auth/Kerberos_BAN_Gets.thy	Sun Nov 02 18:21:45 2014 +0100
    79.3 @@ -2,7 +2,7 @@
    79.4      Author:     Giampaolo Bella, Catania University
    79.5  *)
    79.6  
    79.7 -header{*The Kerberos Protocol, BAN Version, with Gets event*}
    79.8 +section{*The Kerberos Protocol, BAN Version, with Gets event*}
    79.9  
   79.10  theory Kerberos_BAN_Gets imports Public begin
   79.11  
    80.1 --- a/src/HOL/Auth/Message.thy	Sun Nov 02 18:21:14 2014 +0100
    80.2 +++ b/src/HOL/Auth/Message.thy	Sun Nov 02 18:21:45 2014 +0100
    80.3 @@ -6,7 +6,7 @@
    80.4  Inductive relations "parts", "analz" and "synth"
    80.5  *)
    80.6  
    80.7 -header{*Theory of Agents and Messages for Security Protocols*}
    80.8 +section{*Theory of Agents and Messages for Security Protocols*}
    80.9  
   80.10  theory Message
   80.11  imports Main
    81.1 --- a/src/HOL/Auth/NS_Public.thy	Sun Nov 02 18:21:14 2014 +0100
    81.2 +++ b/src/HOL/Auth/NS_Public.thy	Sun Nov 02 18:21:45 2014 +0100
    81.3 @@ -6,7 +6,7 @@
    81.4  Version incorporating Lowe's fix (inclusion of B's identity in round 2).
    81.5  *)
    81.6  
    81.7 -header{*Verifying the Needham-Schroeder-Lowe Public-Key Protocol*}
    81.8 +section{*Verifying the Needham-Schroeder-Lowe Public-Key Protocol*}
    81.9  
   81.10  theory NS_Public imports Public begin
   81.11  
    82.1 --- a/src/HOL/Auth/NS_Public_Bad.thy	Sun Nov 02 18:21:14 2014 +0100
    82.2 +++ b/src/HOL/Auth/NS_Public_Bad.thy	Sun Nov 02 18:21:45 2014 +0100
    82.3 @@ -10,7 +10,7 @@
    82.4    Proc. Royal Soc. 426 (1989)
    82.5  *)
    82.6  
    82.7 -header{*Verifying the Needham-Schroeder Public-Key Protocol*}
    82.8 +section{*Verifying the Needham-Schroeder Public-Key Protocol*}
    82.9  
   82.10  theory NS_Public_Bad imports Public begin
   82.11  
    83.1 --- a/src/HOL/Auth/NS_Shared.thy	Sun Nov 02 18:21:14 2014 +0100
    83.2 +++ b/src/HOL/Auth/NS_Shared.thy	Sun Nov 02 18:21:45 2014 +0100
    83.3 @@ -3,7 +3,7 @@
    83.4      Copyright   1996  University of Cambridge
    83.5  *)
    83.6  
    83.7 -header{*Needham-Schroeder Shared-Key Protocol and the Issues Property*}
    83.8 +section{*Needham-Schroeder Shared-Key Protocol and the Issues Property*}
    83.9  
   83.10  theory NS_Shared imports Public begin
   83.11  
    84.1 --- a/src/HOL/Auth/OtwayRees.thy	Sun Nov 02 18:21:14 2014 +0100
    84.2 +++ b/src/HOL/Auth/OtwayRees.thy	Sun Nov 02 18:21:45 2014 +0100
    84.3 @@ -3,7 +3,7 @@
    84.4      Copyright   1996  University of Cambridge
    84.5  *)
    84.6  
    84.7 -header{*The Original Otway-Rees Protocol*}
    84.8 +section{*The Original Otway-Rees Protocol*}
    84.9  
   84.10  theory OtwayRees imports Public begin
   84.11  
    85.1 --- a/src/HOL/Auth/OtwayReesBella.thy	Sun Nov 02 18:21:14 2014 +0100
    85.2 +++ b/src/HOL/Auth/OtwayReesBella.thy	Sun Nov 02 18:21:45 2014 +0100
    85.3 @@ -2,7 +2,7 @@
    85.4      Author:     Giampaolo Bella, Catania University
    85.5  *)
    85.6  
    85.7 -header{*Bella's version of the Otway-Rees protocol*}
    85.8 +section{*Bella's version of the Otway-Rees protocol*}
    85.9  
   85.10  
   85.11  theory OtwayReesBella imports Public begin
    86.1 --- a/src/HOL/Auth/OtwayRees_AN.thy	Sun Nov 02 18:21:14 2014 +0100
    86.2 +++ b/src/HOL/Auth/OtwayRees_AN.thy	Sun Nov 02 18:21:45 2014 +0100
    86.3 @@ -3,7 +3,7 @@
    86.4      Copyright   1996  University of Cambridge
    86.5  *)
    86.6  
    86.7 -header{*The Otway-Rees Protocol as Modified by Abadi and Needham*}
    86.8 +section{*The Otway-Rees Protocol as Modified by Abadi and Needham*}
    86.9  
   86.10  theory OtwayRees_AN imports Public begin
   86.11  
    87.1 --- a/src/HOL/Auth/OtwayRees_Bad.thy	Sun Nov 02 18:21:14 2014 +0100
    87.2 +++ b/src/HOL/Auth/OtwayRees_Bad.thy	Sun Nov 02 18:21:45 2014 +0100
    87.3 @@ -4,7 +4,7 @@
    87.4  *)
    87.5  
    87.6  
    87.7 -header{*The Otway-Rees Protocol: The Faulty BAN Version*}
    87.8 +section{*The Otway-Rees Protocol: The Faulty BAN Version*}
    87.9  
   87.10  theory OtwayRees_Bad imports Public begin
   87.11  
    88.1 --- a/src/HOL/Auth/Recur.thy	Sun Nov 02 18:21:14 2014 +0100
    88.2 +++ b/src/HOL/Auth/Recur.thy	Sun Nov 02 18:21:45 2014 +0100
    88.3 @@ -3,7 +3,7 @@
    88.4      Copyright   1996  University of Cambridge
    88.5  *)
    88.6  
    88.7 -header{*The Otway-Bull Recursive Authentication Protocol*}
    88.8 +section{*The Otway-Bull Recursive Authentication Protocol*}
    88.9  
   88.10  theory Recur imports Public begin
   88.11  
    89.1 --- a/src/HOL/Auth/Smartcard/Auth_Smartcard.thy	Sun Nov 02 18:21:14 2014 +0100
    89.2 +++ b/src/HOL/Auth/Smartcard/Auth_Smartcard.thy	Sun Nov 02 18:21:45 2014 +0100
    89.3 @@ -2,7 +2,7 @@
    89.4      Copyright   1996  University of Cambridge
    89.5  *)
    89.6  
    89.7 -header {* Smartcard protocols: rely on conventional Message and on new EventSC and Smartcard *}
    89.8 +section {* Smartcard protocols: rely on conventional Message and on new EventSC and Smartcard *}
    89.9  
   89.10  theory Auth_Smartcard
   89.11  imports
    90.1 --- a/src/HOL/Auth/Smartcard/EventSC.thy	Sun Nov 02 18:21:14 2014 +0100
    90.2 +++ b/src/HOL/Auth/Smartcard/EventSC.thy	Sun Nov 02 18:21:45 2014 +0100
    90.3 @@ -1,4 +1,4 @@
    90.4 -header{*Theory of Events for Security Protocols that use smartcards*}
    90.5 +section{*Theory of Events for Security Protocols that use smartcards*}
    90.6  
    90.7  theory EventSC
    90.8  imports
    91.1 --- a/src/HOL/Auth/Smartcard/ShoupRubin.thy	Sun Nov 02 18:21:14 2014 +0100
    91.2 +++ b/src/HOL/Auth/Smartcard/ShoupRubin.thy	Sun Nov 02 18:21:45 2014 +0100
    91.3 @@ -1,7 +1,7 @@
    91.4  (*  Author:     Giampaolo Bella, Catania University
    91.5  *)
    91.6  
    91.7 -header{*Original Shoup-Rubin protocol*}
    91.8 +section{*Original Shoup-Rubin protocol*}
    91.9  
   91.10  theory ShoupRubin imports Smartcard begin
   91.11  
    92.1 --- a/src/HOL/Auth/Smartcard/ShoupRubinBella.thy	Sun Nov 02 18:21:14 2014 +0100
    92.2 +++ b/src/HOL/Auth/Smartcard/ShoupRubinBella.thy	Sun Nov 02 18:21:45 2014 +0100
    92.3 @@ -1,7 +1,7 @@
    92.4  (*  Author:     Giampaolo Bella, Catania University
    92.5  *)
    92.6  
    92.7 -header{*Bella's modification of the Shoup-Rubin protocol*}
    92.8 +section{*Bella's modification of the Shoup-Rubin protocol*}
    92.9  
   92.10  theory ShoupRubinBella imports Smartcard begin
   92.11  
    93.1 --- a/src/HOL/Auth/Smartcard/Smartcard.thy	Sun Nov 02 18:21:14 2014 +0100
    93.2 +++ b/src/HOL/Auth/Smartcard/Smartcard.thy	Sun Nov 02 18:21:45 2014 +0100
    93.3 @@ -1,7 +1,7 @@
    93.4  (* Author:     Giampaolo Bella, Catania University
    93.5  *)
    93.6  
    93.7 -header{*Theory of smartcards*}
    93.8 +section{*Theory of smartcards*}
    93.9  
   93.10  theory Smartcard
   93.11  imports EventSC "../All_Symmetric"
    94.1 --- a/src/HOL/Auth/TLS.thy	Sun Nov 02 18:21:14 2014 +0100
    94.2 +++ b/src/HOL/Auth/TLS.thy	Sun Nov 02 18:21:45 2014 +0100
    94.3 @@ -38,7 +38,7 @@
    94.4  Notes A {|Agent B, Nonce PMS|}.
    94.5  *)
    94.6  
    94.7 -header{*The TLS Protocol: Transport Layer Security*}
    94.8 +section{*The TLS Protocol: Transport Layer Security*}
    94.9  
   94.10  theory TLS imports Public "~~/src/HOL/Library/Nat_Bijection" begin
   94.11  
    95.1 --- a/src/HOL/Auth/WooLam.thy	Sun Nov 02 18:21:14 2014 +0100
    95.2 +++ b/src/HOL/Auth/WooLam.thy	Sun Nov 02 18:21:45 2014 +0100
    95.3 @@ -3,7 +3,7 @@
    95.4      Copyright   1996  University of Cambridge
    95.5  *)
    95.6  
    95.7 -header{*The Woo-Lam Protocol*}
    95.8 +section{*The Woo-Lam Protocol*}
    95.9  
   95.10  theory WooLam imports Public begin
   95.11  
    96.1 --- a/src/HOL/Auth/Yahalom.thy	Sun Nov 02 18:21:14 2014 +0100
    96.2 +++ b/src/HOL/Auth/Yahalom.thy	Sun Nov 02 18:21:45 2014 +0100
    96.3 @@ -3,7 +3,7 @@
    96.4      Copyright   1996  University of Cambridge
    96.5  *)
    96.6  
    96.7 -header{*The Yahalom Protocol*}
    96.8 +section{*The Yahalom Protocol*}
    96.9  
   96.10  theory Yahalom imports Public begin
   96.11  
    97.1 --- a/src/HOL/Auth/Yahalom2.thy	Sun Nov 02 18:21:14 2014 +0100
    97.2 +++ b/src/HOL/Auth/Yahalom2.thy	Sun Nov 02 18:21:45 2014 +0100
    97.3 @@ -3,7 +3,7 @@
    97.4      Copyright   1996  University of Cambridge
    97.5  *)
    97.6  
    97.7 -header{*The Yahalom Protocol, Variant 2*}
    97.8 +section{*The Yahalom Protocol, Variant 2*}
    97.9  
   97.10  theory Yahalom2 imports Public begin
   97.11  
    98.1 --- a/src/HOL/Auth/Yahalom_Bad.thy	Sun Nov 02 18:21:14 2014 +0100
    98.2 +++ b/src/HOL/Auth/Yahalom_Bad.thy	Sun Nov 02 18:21:45 2014 +0100
    98.3 @@ -3,7 +3,7 @@
    98.4      Copyright   1996  University of Cambridge
    98.5  *)
    98.6  
    98.7 -header{*The Yahalom Protocol: A Flawed Version*}
    98.8 +section{*The Yahalom Protocol: A Flawed Version*}
    98.9  
   98.10  theory Yahalom_Bad imports Public begin
   98.11  
    99.1 --- a/src/HOL/BNF_Cardinal_Arithmetic.thy	Sun Nov 02 18:21:14 2014 +0100
    99.2 +++ b/src/HOL/BNF_Cardinal_Arithmetic.thy	Sun Nov 02 18:21:45 2014 +0100
    99.3 @@ -5,7 +5,7 @@
    99.4  Cardinal arithmetic as needed by bounded natural functors.
    99.5  *)
    99.6  
    99.7 -header {* Cardinal Arithmetic as Needed by Bounded Natural Functors *}
    99.8 +section {* Cardinal Arithmetic as Needed by Bounded Natural Functors *}
    99.9  
   99.10  theory BNF_Cardinal_Arithmetic
   99.11  imports BNF_Cardinal_Order_Relation
   100.1 --- a/src/HOL/BNF_Cardinal_Order_Relation.thy	Sun Nov 02 18:21:14 2014 +0100
   100.2 +++ b/src/HOL/BNF_Cardinal_Order_Relation.thy	Sun Nov 02 18:21:45 2014 +0100
   100.3 @@ -5,7 +5,7 @@
   100.4  Cardinal-order relations as needed by bounded natural functors.
   100.5  *)
   100.6  
   100.7 -header {* Cardinal-Order Relations as Needed by Bounded Natural Functors *}
   100.8 +section {* Cardinal-Order Relations as Needed by Bounded Natural Functors *}
   100.9  
  100.10  theory BNF_Cardinal_Order_Relation
  100.11  imports Zorn BNF_Wellorder_Constructions
   101.1 --- a/src/HOL/BNF_Composition.thy	Sun Nov 02 18:21:14 2014 +0100
   101.2 +++ b/src/HOL/BNF_Composition.thy	Sun Nov 02 18:21:45 2014 +0100
   101.3 @@ -6,7 +6,7 @@
   101.4  Composition of bounded natural functors.
   101.5  *)
   101.6  
   101.7 -header {* Composition of Bounded Natural Functors *}
   101.8 +section {* Composition of Bounded Natural Functors *}
   101.9  
  101.10  theory BNF_Composition
  101.11  imports BNF_Def
   102.1 --- a/src/HOL/BNF_Def.thy	Sun Nov 02 18:21:14 2014 +0100
   102.2 +++ b/src/HOL/BNF_Def.thy	Sun Nov 02 18:21:45 2014 +0100
   102.3 @@ -6,7 +6,7 @@
   102.4  Definition of bounded natural functors.
   102.5  *)
   102.6  
   102.7 -header {* Definition of Bounded Natural Functors *}
   102.8 +section {* Definition of Bounded Natural Functors *}
   102.9  
  102.10  theory BNF_Def
  102.11  imports BNF_Cardinal_Arithmetic Fun_Def_Base
   103.1 --- a/src/HOL/BNF_Fixpoint_Base.thy	Sun Nov 02 18:21:14 2014 +0100
   103.2 +++ b/src/HOL/BNF_Fixpoint_Base.thy	Sun Nov 02 18:21:45 2014 +0100
   103.3 @@ -8,7 +8,7 @@
   103.4  Shared fixpoint operations on bounded natural functors.
   103.5  *)
   103.6  
   103.7 -header {* Shared Fixpoint Operations on Bounded Natural Functors *}
   103.8 +section {* Shared Fixpoint Operations on Bounded Natural Functors *}
   103.9  
  103.10  theory BNF_Fixpoint_Base
  103.11  imports BNF_Composition Basic_BNFs
   104.1 --- a/src/HOL/BNF_Greatest_Fixpoint.thy	Sun Nov 02 18:21:14 2014 +0100
   104.2 +++ b/src/HOL/BNF_Greatest_Fixpoint.thy	Sun Nov 02 18:21:45 2014 +0100
   104.3 @@ -7,7 +7,7 @@
   104.4  Greatest fixpoint (codatatype) operation on bounded natural functors.
   104.5  *)
   104.6  
   104.7 -header {* Greatest Fixpoint (Codatatype) Operation on Bounded Natural Functors *}
   104.8 +section {* Greatest Fixpoint (Codatatype) Operation on Bounded Natural Functors *}
   104.9  
  104.10  theory BNF_Greatest_Fixpoint
  104.11  imports BNF_Fixpoint_Base String
   105.1 --- a/src/HOL/BNF_Least_Fixpoint.thy	Sun Nov 02 18:21:14 2014 +0100
   105.2 +++ b/src/HOL/BNF_Least_Fixpoint.thy	Sun Nov 02 18:21:45 2014 +0100
   105.3 @@ -7,7 +7,7 @@
   105.4  Least fixpoint (datatype) operation on bounded natural functors.
   105.5  *)
   105.6  
   105.7 -header {* Least Fixpoint (Datatype) Operation on Bounded Natural Functors *}
   105.8 +section {* Least Fixpoint (Datatype) Operation on Bounded Natural Functors *}
   105.9  
  105.10  theory BNF_Least_Fixpoint
  105.11  imports BNF_Fixpoint_Base
   106.1 --- a/src/HOL/BNF_Wellorder_Constructions.thy	Sun Nov 02 18:21:14 2014 +0100
   106.2 +++ b/src/HOL/BNF_Wellorder_Constructions.thy	Sun Nov 02 18:21:45 2014 +0100
   106.3 @@ -5,7 +5,7 @@
   106.4  Constructions on wellorders as needed by bounded natural functors.
   106.5  *)
   106.6  
   106.7 -header {* Constructions on Wellorders as Needed by Bounded Natural Functors *}
   106.8 +section {* Constructions on Wellorders as Needed by Bounded Natural Functors *}
   106.9  
  106.10  theory BNF_Wellorder_Constructions
  106.11  imports BNF_Wellorder_Embedding
   107.1 --- a/src/HOL/BNF_Wellorder_Embedding.thy	Sun Nov 02 18:21:14 2014 +0100
   107.2 +++ b/src/HOL/BNF_Wellorder_Embedding.thy	Sun Nov 02 18:21:45 2014 +0100
   107.3 @@ -5,7 +5,7 @@
   107.4  Well-order embeddings as needed by bounded natural functors.
   107.5  *)
   107.6  
   107.7 -header {* Well-Order Embeddings as Needed by Bounded Natural Functors *}
   107.8 +section {* Well-Order Embeddings as Needed by Bounded Natural Functors *}
   107.9  
  107.10  theory BNF_Wellorder_Embedding
  107.11  imports Hilbert_Choice BNF_Wellorder_Relation
   108.1 --- a/src/HOL/BNF_Wellorder_Relation.thy	Sun Nov 02 18:21:14 2014 +0100
   108.2 +++ b/src/HOL/BNF_Wellorder_Relation.thy	Sun Nov 02 18:21:45 2014 +0100
   108.3 @@ -5,7 +5,7 @@
   108.4  Well-order relations as needed by bounded natural functors.
   108.5  *)
   108.6  
   108.7 -header {* Well-Order Relations as Needed by Bounded Natural Functors *}
   108.8 +section {* Well-Order Relations as Needed by Bounded Natural Functors *}
   108.9  
  108.10  theory BNF_Wellorder_Relation
  108.11  imports Order_Relation
   109.1 --- a/src/HOL/Basic_BNFs.thy	Sun Nov 02 18:21:14 2014 +0100
   109.2 +++ b/src/HOL/Basic_BNFs.thy	Sun Nov 02 18:21:45 2014 +0100
   109.3 @@ -7,7 +7,7 @@
   109.4  Registration of basic types as bounded natural functors.
   109.5  *)
   109.6  
   109.7 -header {* Registration of Basic Types as Bounded Natural Functors *}
   109.8 +section {* Registration of Basic Types as Bounded Natural Functors *}
   109.9  
  109.10  theory Basic_BNFs
  109.11  imports BNF_Def
   110.1 --- a/src/HOL/Cardinals/Cardinal_Arithmetic.thy	Sun Nov 02 18:21:14 2014 +0100
   110.2 +++ b/src/HOL/Cardinals/Cardinal_Arithmetic.thy	Sun Nov 02 18:21:45 2014 +0100
   110.3 @@ -5,7 +5,7 @@
   110.4  Cardinal arithmetic.
   110.5  *)
   110.6  
   110.7 -header {* Cardinal Arithmetic *}
   110.8 +section {* Cardinal Arithmetic *}
   110.9  
  110.10  theory Cardinal_Arithmetic
  110.11  imports BNF_Cardinal_Arithmetic Cardinal_Order_Relation
   111.1 --- a/src/HOL/Cardinals/Cardinal_Order_Relation.thy	Sun Nov 02 18:21:14 2014 +0100
   111.2 +++ b/src/HOL/Cardinals/Cardinal_Order_Relation.thy	Sun Nov 02 18:21:45 2014 +0100
   111.3 @@ -5,7 +5,7 @@
   111.4  Cardinal-order relations.
   111.5  *)
   111.6  
   111.7 -header {* Cardinal-Order Relations *}
   111.8 +section {* Cardinal-Order Relations *}
   111.9  
  111.10  theory Cardinal_Order_Relation
  111.11  imports BNF_Cardinal_Order_Relation Wellorder_Constructions
   112.1 --- a/src/HOL/Cardinals/Cardinals.thy	Sun Nov 02 18:21:14 2014 +0100
   112.2 +++ b/src/HOL/Cardinals/Cardinals.thy	Sun Nov 02 18:21:45 2014 +0100
   112.3 @@ -6,7 +6,7 @@
   112.4  Theory of ordinals and cardinals.
   112.5  *)
   112.6  
   112.7 -header {* Theory of Ordinals and Cardinals *}
   112.8 +section {* Theory of Ordinals and Cardinals *}
   112.9  
  112.10  theory Cardinals
  112.11  imports Ordinal_Arithmetic Cardinal_Arithmetic Wellorder_Extension
   113.1 --- a/src/HOL/Cardinals/Fun_More.thy	Sun Nov 02 18:21:14 2014 +0100
   113.2 +++ b/src/HOL/Cardinals/Fun_More.thy	Sun Nov 02 18:21:45 2014 +0100
   113.3 @@ -5,7 +5,7 @@
   113.4  More on injections, bijections and inverses.
   113.5  *)
   113.6  
   113.7 -header {* More on Injections, Bijections and Inverses *}
   113.8 +section {* More on Injections, Bijections and Inverses *}
   113.9  
  113.10  theory Fun_More
  113.11  imports Main
   114.1 --- a/src/HOL/Cardinals/Order_Relation_More.thy	Sun Nov 02 18:21:14 2014 +0100
   114.2 +++ b/src/HOL/Cardinals/Order_Relation_More.thy	Sun Nov 02 18:21:45 2014 +0100
   114.3 @@ -5,7 +5,7 @@
   114.4  Basics on order-like relations.
   114.5  *)
   114.6  
   114.7 -header {* Basics on Order-Like Relations *}
   114.8 +section {* Basics on Order-Like Relations *}
   114.9  
  114.10  theory Order_Relation_More
  114.11  imports Main
   115.1 --- a/src/HOL/Cardinals/Order_Union.thy	Sun Nov 02 18:21:14 2014 +0100
   115.2 +++ b/src/HOL/Cardinals/Order_Union.thy	Sun Nov 02 18:21:45 2014 +0100
   115.3 @@ -4,7 +4,7 @@
   115.4  The ordinal-like sum of two orders with disjoint fields
   115.5  *)
   115.6  
   115.7 -header {* Order Union *}
   115.8 +section {* Order Union *}
   115.9  
  115.10  theory Order_Union
  115.11  imports Order_Relation
   116.1 --- a/src/HOL/Cardinals/Ordinal_Arithmetic.thy	Sun Nov 02 18:21:14 2014 +0100
   116.2 +++ b/src/HOL/Cardinals/Ordinal_Arithmetic.thy	Sun Nov 02 18:21:45 2014 +0100
   116.3 @@ -5,7 +5,7 @@
   116.4  Ordinal arithmetic.
   116.5  *)
   116.6  
   116.7 -header {* Ordinal Arithmetic *}
   116.8 +section {* Ordinal Arithmetic *}
   116.9  
  116.10  theory Ordinal_Arithmetic
  116.11  imports Wellorder_Constructions
   117.1 --- a/src/HOL/Cardinals/Wellfounded_More.thy	Sun Nov 02 18:21:14 2014 +0100
   117.2 +++ b/src/HOL/Cardinals/Wellfounded_More.thy	Sun Nov 02 18:21:45 2014 +0100
   117.3 @@ -5,7 +5,7 @@
   117.4  More on well-founded relations.
   117.5  *)
   117.6  
   117.7 -header {* More on Well-Founded Relations *}
   117.8 +section {* More on Well-Founded Relations *}
   117.9  
  117.10  theory Wellfounded_More
  117.11  imports Wellfounded Order_Relation_More
   118.1 --- a/src/HOL/Cardinals/Wellorder_Constructions.thy	Sun Nov 02 18:21:14 2014 +0100
   118.2 +++ b/src/HOL/Cardinals/Wellorder_Constructions.thy	Sun Nov 02 18:21:45 2014 +0100
   118.3 @@ -5,7 +5,7 @@
   118.4  Constructions on wellorders.
   118.5  *)
   118.6  
   118.7 -header {* Constructions on Wellorders *}
   118.8 +section {* Constructions on Wellorders *}
   118.9  
  118.10  theory Wellorder_Constructions
  118.11  imports
   119.1 --- a/src/HOL/Cardinals/Wellorder_Embedding.thy	Sun Nov 02 18:21:14 2014 +0100
   119.2 +++ b/src/HOL/Cardinals/Wellorder_Embedding.thy	Sun Nov 02 18:21:45 2014 +0100
   119.3 @@ -5,7 +5,7 @@
   119.4  Well-order embeddings.
   119.5  *)
   119.6  
   119.7 -header {* Well-Order Embeddings *}
   119.8 +section {* Well-Order Embeddings *}
   119.9  
  119.10  theory Wellorder_Embedding
  119.11  imports BNF_Wellorder_Embedding Fun_More Wellorder_Relation
   120.1 --- a/src/HOL/Cardinals/Wellorder_Extension.thy	Sun Nov 02 18:21:14 2014 +0100
   120.2 +++ b/src/HOL/Cardinals/Wellorder_Extension.thy	Sun Nov 02 18:21:45 2014 +0100
   120.3 @@ -2,7 +2,7 @@
   120.4      Author:     Christian Sternagel, JAIST
   120.5  *)
   120.6  
   120.7 -header {* Extending Well-founded Relations to Wellorders *}
   120.8 +section {* Extending Well-founded Relations to Wellorders *}
   120.9  
  120.10  theory Wellorder_Extension
  120.11  imports Main Order_Union
   121.1 --- a/src/HOL/Cardinals/Wellorder_Relation.thy	Sun Nov 02 18:21:14 2014 +0100
   121.2 +++ b/src/HOL/Cardinals/Wellorder_Relation.thy	Sun Nov 02 18:21:45 2014 +0100
   121.3 @@ -5,7 +5,7 @@
   121.4  Well-order relations.
   121.5  *)
   121.6  
   121.7 -header {* Well-Order Relations *}
   121.8 +section {* Well-Order Relations *}
   121.9  
  121.10  theory Wellorder_Relation
  121.11  imports BNF_Wellorder_Relation Wellfounded_More
   122.1 --- a/src/HOL/Code_Evaluation.thy	Sun Nov 02 18:21:14 2014 +0100
   122.2 +++ b/src/HOL/Code_Evaluation.thy	Sun Nov 02 18:21:45 2014 +0100
   122.3 @@ -2,7 +2,7 @@
   122.4      Author:     Florian Haftmann, TU Muenchen
   122.5  *)
   122.6  
   122.7 -header {* Term evaluation using the generic code generator *}
   122.8 +section {* Term evaluation using the generic code generator *}
   122.9  
  122.10  theory Code_Evaluation
  122.11  imports Typerep Limited_Sequence
   123.1 --- a/src/HOL/Code_Numeral.thy	Sun Nov 02 18:21:14 2014 +0100
   123.2 +++ b/src/HOL/Code_Numeral.thy	Sun Nov 02 18:21:45 2014 +0100
   123.3 @@ -2,7 +2,7 @@
   123.4      Author:     Florian Haftmann, TU Muenchen
   123.5  *)
   123.6  
   123.7 -header {* Numeric types for code generation onto target language numerals only *}
   123.8 +section {* Numeric types for code generation onto target language numerals only *}
   123.9  
  123.10  theory Code_Numeral
  123.11  imports Nat_Transfer Divides Lifting
   124.1 --- a/src/HOL/Codegenerator_Test/Candidates.thy	Sun Nov 02 18:21:14 2014 +0100
   124.2 +++ b/src/HOL/Codegenerator_Test/Candidates.thy	Sun Nov 02 18:21:45 2014 +0100
   124.3 @@ -1,7 +1,7 @@
   124.4  
   124.5  (* Author: Florian Haftmann, TU Muenchen *)
   124.6  
   124.7 -header {* A huge collection of equations to generate code from *}
   124.8 +section {* A huge collection of equations to generate code from *}
   124.9  
  124.10  theory Candidates
  124.11  imports
   125.1 --- a/src/HOL/Codegenerator_Test/Generate.thy	Sun Nov 02 18:21:14 2014 +0100
   125.2 +++ b/src/HOL/Codegenerator_Test/Generate.thy	Sun Nov 02 18:21:45 2014 +0100
   125.3 @@ -1,7 +1,7 @@
   125.4  
   125.5  (* Author: Florian Haftmann, TU Muenchen *)
   125.6  
   125.7 -header {* Pervasive test of code generator *}
   125.8 +section {* Pervasive test of code generator *}
   125.9  
  125.10  theory Generate
  125.11  imports
   126.1 --- a/src/HOL/Codegenerator_Test/Generate_Binary_Nat.thy	Sun Nov 02 18:21:14 2014 +0100
   126.2 +++ b/src/HOL/Codegenerator_Test/Generate_Binary_Nat.thy	Sun Nov 02 18:21:45 2014 +0100
   126.3 @@ -1,7 +1,7 @@
   126.4  
   126.5  (* Author: Florian Haftmann, TU Muenchen *)
   126.6  
   126.7 -header {* Pervasive test of code generator *}
   126.8 +section {* Pervasive test of code generator *}
   126.9  
  126.10  theory Generate_Binary_Nat
  126.11  imports
   127.1 --- a/src/HOL/Codegenerator_Test/Generate_Efficient_Datastructures.thy	Sun Nov 02 18:21:14 2014 +0100
   127.2 +++ b/src/HOL/Codegenerator_Test/Generate_Efficient_Datastructures.thy	Sun Nov 02 18:21:45 2014 +0100
   127.3 @@ -1,7 +1,7 @@
   127.4  
   127.5  (* Author: Ondrej Kuncar, TU Muenchen *)
   127.6  
   127.7 -header {* Pervasive test of code generator *}
   127.8 +section {* Pervasive test of code generator *}
   127.9  
  127.10  theory Generate_Efficient_Datastructures
  127.11  imports
   128.1 --- a/src/HOL/Codegenerator_Test/Generate_Pretty_Char.thy	Sun Nov 02 18:21:14 2014 +0100
   128.2 +++ b/src/HOL/Codegenerator_Test/Generate_Pretty_Char.thy	Sun Nov 02 18:21:45 2014 +0100
   128.3 @@ -1,7 +1,7 @@
   128.4  
   128.5  (* Author: Florian Haftmann, TU Muenchen *)
   128.6  
   128.7 -header {* Pervasive test of code generator *}
   128.8 +section {* Pervasive test of code generator *}
   128.9  
  128.10  theory Generate_Pretty_Char
  128.11  imports
   129.1 --- a/src/HOL/Codegenerator_Test/Generate_Target_Nat.thy	Sun Nov 02 18:21:14 2014 +0100
   129.2 +++ b/src/HOL/Codegenerator_Test/Generate_Target_Nat.thy	Sun Nov 02 18:21:45 2014 +0100
   129.3 @@ -1,7 +1,7 @@
   129.4  
   129.5  (* Author: Florian Haftmann, TU Muenchen *)
   129.6  
   129.7 -header {* Pervasive test of code generator *}
   129.8 +section {* Pervasive test of code generator *}
   129.9  
  129.10  theory Generate_Target_Nat
  129.11  imports
   130.1 --- a/src/HOL/Coinduction.thy	Sun Nov 02 18:21:14 2014 +0100
   130.2 +++ b/src/HOL/Coinduction.thy	Sun Nov 02 18:21:45 2014 +0100
   130.3 @@ -6,7 +6,7 @@
   130.4  Coinduction method that avoids some boilerplate compared to coinduct.
   130.5  *)
   130.6  
   130.7 -header {* Coinduction Method *}
   130.8 +section {* Coinduction Method *}
   130.9  
  130.10  theory Coinduction
  130.11  imports Ctr_Sugar
   131.1 --- a/src/HOL/Complete_Lattices.thy	Sun Nov 02 18:21:14 2014 +0100
   131.2 +++ b/src/HOL/Complete_Lattices.thy	Sun Nov 02 18:21:45 2014 +0100
   131.3 @@ -1,6 +1,6 @@
   131.4  (*  Author:     Tobias Nipkow, Lawrence C Paulson and Markus Wenzel; Florian Haftmann, TU Muenchen *)
   131.5  
   131.6 -header {* Complete lattices *}
   131.7 +section {* Complete lattices *}
   131.8  
   131.9  theory Complete_Lattices
  131.10  imports Fun
   132.1 --- a/src/HOL/Complete_Partial_Order.thy	Sun Nov 02 18:21:14 2014 +0100
   132.2 +++ b/src/HOL/Complete_Partial_Order.thy	Sun Nov 02 18:21:45 2014 +0100
   132.3 @@ -3,7 +3,7 @@
   132.4     Author:   Alexander Krauss, TU Muenchen
   132.5  *)
   132.6  
   132.7 -header {* Chain-complete partial orders and their fixpoints *}
   132.8 +section {* Chain-complete partial orders and their fixpoints *}
   132.9  
  132.10  theory Complete_Partial_Order
  132.11  imports Product_Type
   133.1 --- a/src/HOL/Complex.thy	Sun Nov 02 18:21:14 2014 +0100
   133.2 +++ b/src/HOL/Complex.thy	Sun Nov 02 18:21:45 2014 +0100
   133.3 @@ -4,7 +4,7 @@
   133.4      Conversion to Isar and new proofs by Lawrence C Paulson, 2003/4
   133.5  *)
   133.6  
   133.7 -header {* Complex Numbers: Rectangular and Polar Representations *}
   133.8 +section {* Complex Numbers: Rectangular and Polar Representations *}
   133.9  
  133.10  theory Complex
  133.11  imports Transcendental
   134.1 --- a/src/HOL/Complex_Main.thy	Sun Nov 02 18:21:14 2014 +0100
   134.2 +++ b/src/HOL/Complex_Main.thy	Sun Nov 02 18:21:45 2014 +0100
   134.3 @@ -1,4 +1,4 @@
   134.4 -header {* Comprehensive Complex Theory *}
   134.5 +section {* Comprehensive Complex Theory *}
   134.6  
   134.7  theory Complex_Main
   134.8  imports
   135.1 --- a/src/HOL/Conditionally_Complete_Lattices.thy	Sun Nov 02 18:21:14 2014 +0100
   135.2 +++ b/src/HOL/Conditionally_Complete_Lattices.thy	Sun Nov 02 18:21:45 2014 +0100
   135.3 @@ -4,7 +4,7 @@
   135.4      Author:     Luke S. Serafin, Carnegie Mellon University
   135.5  *)
   135.6  
   135.7 -header {* Conditionally-complete Lattices *}
   135.8 +section {* Conditionally-complete Lattices *}
   135.9  
  135.10  theory Conditionally_Complete_Lattices
  135.11  imports Main
   136.1 --- a/src/HOL/Ctr_Sugar.thy	Sun Nov 02 18:21:14 2014 +0100
   136.2 +++ b/src/HOL/Ctr_Sugar.thy	Sun Nov 02 18:21:45 2014 +0100
   136.3 @@ -6,7 +6,7 @@
   136.4  Wrapping existing freely generated type's constructors.
   136.5  *)
   136.6  
   136.7 -header {* Wrapping Existing Freely Generated Type's Constructors *}
   136.8 +section {* Wrapping Existing Freely Generated Type's Constructors *}
   136.9  
  136.10  theory Ctr_Sugar
  136.11  imports HOL
   137.1 --- a/src/HOL/Datatype_Examples/Compat.thy	Sun Nov 02 18:21:14 2014 +0100
   137.2 +++ b/src/HOL/Datatype_Examples/Compat.thy	Sun Nov 02 18:21:45 2014 +0100
   137.3 @@ -5,7 +5,7 @@
   137.4  Tests for compatibility with the old datatype package.
   137.5  *)
   137.6  
   137.7 -header {* Tests for Compatibility with the Old Datatype Package *}
   137.8 +section {* Tests for Compatibility with the Old Datatype Package *}
   137.9  
  137.10  theory Compat
  137.11  imports "~~/src/HOL/Library/Old_Datatype"
   138.1 --- a/src/HOL/Datatype_Examples/Derivation_Trees/DTree.thy	Sun Nov 02 18:21:14 2014 +0100
   138.2 +++ b/src/HOL/Datatype_Examples/Derivation_Trees/DTree.thy	Sun Nov 02 18:21:45 2014 +0100
   138.3 @@ -5,7 +5,7 @@
   138.4  Derivation trees with nonterminal internal nodes and terminal leaves.
   138.5  *)
   138.6  
   138.7 -header {* Trees with Nonterminal Internal Nodes and Terminal Leaves *}
   138.8 +section {* Trees with Nonterminal Internal Nodes and Terminal Leaves *}
   138.9  
  138.10  theory DTree
  138.11  imports Prelim
   139.1 --- a/src/HOL/Datatype_Examples/Derivation_Trees/Gram_Lang.thy	Sun Nov 02 18:21:14 2014 +0100
   139.2 +++ b/src/HOL/Datatype_Examples/Derivation_Trees/Gram_Lang.thy	Sun Nov 02 18:21:45 2014 +0100
   139.3 @@ -5,7 +5,7 @@
   139.4  Language of a grammar.
   139.5  *)
   139.6  
   139.7 -header {* Language of a Grammar *}
   139.8 +section {* Language of a Grammar *}
   139.9  
  139.10  theory Gram_Lang
  139.11  imports DTree "~~/src/HOL/Library/Infinite_Set"
   140.1 --- a/src/HOL/Datatype_Examples/Derivation_Trees/Parallel.thy	Sun Nov 02 18:21:14 2014 +0100
   140.2 +++ b/src/HOL/Datatype_Examples/Derivation_Trees/Parallel.thy	Sun Nov 02 18:21:45 2014 +0100
   140.3 @@ -5,7 +5,7 @@
   140.4  Parallel composition.
   140.5  *)
   140.6  
   140.7 -header {* Parallel Composition *}
   140.8 +section {* Parallel Composition *}
   140.9  
  140.10  theory Parallel
  140.11  imports DTree
   141.1 --- a/src/HOL/Datatype_Examples/Derivation_Trees/Prelim.thy	Sun Nov 02 18:21:14 2014 +0100
   141.2 +++ b/src/HOL/Datatype_Examples/Derivation_Trees/Prelim.thy	Sun Nov 02 18:21:45 2014 +0100
   141.3 @@ -5,7 +5,7 @@
   141.4  Preliminaries.
   141.5  *)
   141.6  
   141.7 -header {* Preliminaries *}
   141.8 +section {* Preliminaries *}
   141.9  
  141.10  theory Prelim
  141.11  imports "~~/src/HOL/Library/FSet"
   142.1 --- a/src/HOL/Datatype_Examples/IsaFoR.thy	Sun Nov 02 18:21:14 2014 +0100
   142.2 +++ b/src/HOL/Datatype_Examples/IsaFoR.thy	Sun Nov 02 18:21:45 2014 +0100
   142.3 @@ -5,7 +5,7 @@
   142.4  Benchmark consisting of datatypes defined in IsaFoR.
   142.5  *)
   142.6  
   142.7 -header {* Benchmark Consisting of Datatypes Defined in IsaFoR *}
   142.8 +section {* Benchmark Consisting of Datatypes Defined in IsaFoR *}
   142.9  
  142.10  theory IsaFoR
  142.11  imports Real
   143.1 --- a/src/HOL/Datatype_Examples/Koenig.thy	Sun Nov 02 18:21:14 2014 +0100
   143.2 +++ b/src/HOL/Datatype_Examples/Koenig.thy	Sun Nov 02 18:21:45 2014 +0100
   143.3 @@ -6,7 +6,7 @@
   143.4  Koenig's lemma.
   143.5  *)
   143.6  
   143.7 -header {* Koenig's Lemma *}
   143.8 +section {* Koenig's Lemma *}
   143.9  
  143.10  theory Koenig
  143.11  imports TreeFI "~~/src/HOL/Library/Stream"
   144.1 --- a/src/HOL/Datatype_Examples/Lambda_Term.thy	Sun Nov 02 18:21:14 2014 +0100
   144.2 +++ b/src/HOL/Datatype_Examples/Lambda_Term.thy	Sun Nov 02 18:21:45 2014 +0100
   144.3 @@ -6,7 +6,7 @@
   144.4  Lambda-terms.
   144.5  *)
   144.6  
   144.7 -header {* Lambda-Terms *}
   144.8 +section {* Lambda-Terms *}
   144.9  
  144.10  theory Lambda_Term
  144.11  imports "~~/src/HOL/Library/FSet"
   145.1 --- a/src/HOL/Datatype_Examples/Misc_Codatatype.thy	Sun Nov 02 18:21:14 2014 +0100
   145.2 +++ b/src/HOL/Datatype_Examples/Misc_Codatatype.thy	Sun Nov 02 18:21:45 2014 +0100
   145.3 @@ -7,7 +7,7 @@
   145.4  Miscellaneous codatatype definitions.
   145.5  *)
   145.6  
   145.7 -header {* Miscellaneous Codatatype Definitions *}
   145.8 +section {* Miscellaneous Codatatype Definitions *}
   145.9  
  145.10  theory Misc_Codatatype
  145.11  imports "~~/src/HOL/Library/FSet"
   146.1 --- a/src/HOL/Datatype_Examples/Misc_Datatype.thy	Sun Nov 02 18:21:14 2014 +0100
   146.2 +++ b/src/HOL/Datatype_Examples/Misc_Datatype.thy	Sun Nov 02 18:21:45 2014 +0100
   146.3 @@ -7,7 +7,7 @@
   146.4  Miscellaneous datatype definitions.
   146.5  *)
   146.6  
   146.7 -header {* Miscellaneous Datatype Definitions *}
   146.8 +section {* Miscellaneous Datatype Definitions *}
   146.9  
  146.10  theory Misc_Datatype
  146.11  imports "~~/src/HOL/Library/Countable" "~~/src/HOL/Library/FSet"
   147.1 --- a/src/HOL/Datatype_Examples/Misc_N2M.thy	Sun Nov 02 18:21:14 2014 +0100
   147.2 +++ b/src/HOL/Datatype_Examples/Misc_N2M.thy	Sun Nov 02 18:21:45 2014 +0100
   147.3 @@ -5,7 +5,7 @@
   147.4  Miscellaneous tests for the nested-to-mutual reduction.
   147.5  *)
   147.6  
   147.7 -header \<open>Miscellaneous Tests for the Nested-to-Mutual Reduction\<close>
   147.8 +section \<open>Miscellaneous Tests for the Nested-to-Mutual Reduction\<close>
   147.9  
  147.10  theory Misc_N2M
  147.11  imports "~~/src/HOL/Library/BNF_Axiomatization"
   148.1 --- a/src/HOL/Datatype_Examples/Misc_Primcorec.thy	Sun Nov 02 18:21:14 2014 +0100
   148.2 +++ b/src/HOL/Datatype_Examples/Misc_Primcorec.thy	Sun Nov 02 18:21:45 2014 +0100
   148.3 @@ -5,7 +5,7 @@
   148.4  Miscellaneous primitive corecursive function definitions.
   148.5  *)
   148.6  
   148.7 -header {* Miscellaneous Primitive Corecursive Function Definitions *}
   148.8 +section {* Miscellaneous Primitive Corecursive Function Definitions *}
   148.9  
  148.10  theory Misc_Primcorec
  148.11  imports Misc_Codatatype
   149.1 --- a/src/HOL/Datatype_Examples/Misc_Primrec.thy	Sun Nov 02 18:21:14 2014 +0100
   149.2 +++ b/src/HOL/Datatype_Examples/Misc_Primrec.thy	Sun Nov 02 18:21:45 2014 +0100
   149.3 @@ -5,7 +5,7 @@
   149.4  Miscellaneous primitive recursive function definitions.
   149.5  *)
   149.6  
   149.7 -header {* Miscellaneous Primitive Recursive Function Definitions *}
   149.8 +section {* Miscellaneous Primitive Recursive Function Definitions *}
   149.9  
  149.10  theory Misc_Primrec
  149.11  imports Misc_Datatype
   150.1 --- a/src/HOL/Datatype_Examples/Process.thy	Sun Nov 02 18:21:14 2014 +0100
   150.2 +++ b/src/HOL/Datatype_Examples/Process.thy	Sun Nov 02 18:21:45 2014 +0100
   150.3 @@ -5,7 +5,7 @@
   150.4  Processes.
   150.5  *)
   150.6  
   150.7 -header {* Processes *}
   150.8 +section {* Processes *}
   150.9  
  150.10  theory Process
  150.11  imports "~~/src/HOL/Library/Stream"
   151.1 --- a/src/HOL/Datatype_Examples/Stream_Processor.thy	Sun Nov 02 18:21:14 2014 +0100
   151.2 +++ b/src/HOL/Datatype_Examples/Stream_Processor.thy	Sun Nov 02 18:21:45 2014 +0100
   151.3 @@ -6,7 +6,7 @@
   151.4  Stream processors---a syntactic representation of continuous functions on streams.
   151.5  *)
   151.6  
   151.7 -header {* Stream Processors---A Syntactic Representation of Continuous Functions on Streams *}
   151.8 +section {* Stream Processors---A Syntactic Representation of Continuous Functions on Streams *}
   151.9  
  151.10  theory Stream_Processor
  151.11  imports "~~/src/HOL/Library/Stream" "~~/src/HOL/Library/BNF_Axiomatization"
   152.1 --- a/src/HOL/Datatype_Examples/TreeFI.thy	Sun Nov 02 18:21:14 2014 +0100
   152.2 +++ b/src/HOL/Datatype_Examples/TreeFI.thy	Sun Nov 02 18:21:45 2014 +0100
   152.3 @@ -6,7 +6,7 @@
   152.4  Finitely branching possibly infinite trees.
   152.5  *)
   152.6  
   152.7 -header {* Finitely Branching Possibly Infinite Trees *}
   152.8 +section {* Finitely Branching Possibly Infinite Trees *}
   152.9  
  152.10  theory TreeFI
  152.11  imports Main
   153.1 --- a/src/HOL/Datatype_Examples/TreeFsetI.thy	Sun Nov 02 18:21:14 2014 +0100
   153.2 +++ b/src/HOL/Datatype_Examples/TreeFsetI.thy	Sun Nov 02 18:21:45 2014 +0100
   153.3 @@ -6,7 +6,7 @@
   153.4  Finitely branching possibly infinite trees, with sets of children.
   153.5  *)
   153.6  
   153.7 -header {* Finitely Branching Possibly Infinite Trees, with Sets of Children *}
   153.8 +section {* Finitely Branching Possibly Infinite Trees, with Sets of Children *}
   153.9  
  153.10  theory TreeFsetI
  153.11  imports "~~/src/HOL/Library/FSet"
   154.1 --- a/src/HOL/Decision_Procs/Approximation.thy	Sun Nov 02 18:21:14 2014 +0100
   154.2 +++ b/src/HOL/Decision_Procs/Approximation.thy	Sun Nov 02 18:21:45 2014 +0100
   154.3 @@ -1,7 +1,7 @@
   154.4   (* Author:     Johannes Hoelzl, TU Muenchen
   154.5     Coercions removed by Dmitriy Traytel *)
   154.6  
   154.7 -header {* Prove Real Valued Inequalities by Computation *}
   154.8 +section {* Prove Real Valued Inequalities by Computation *}
   154.9  
  154.10  theory Approximation
  154.11  imports
   155.1 --- a/src/HOL/Decision_Procs/Commutative_Ring.thy	Sun Nov 02 18:21:14 2014 +0100
   155.2 +++ b/src/HOL/Decision_Procs/Commutative_Ring.thy	Sun Nov 02 18:21:45 2014 +0100
   155.3 @@ -3,7 +3,7 @@
   155.4  Proving equalities in commutative rings done "right" in Isabelle/HOL.
   155.5  *)
   155.6  
   155.7 -header {* Proving equalities in commutative rings *}
   155.8 +section {* Proving equalities in commutative rings *}
   155.9  
  155.10  theory Commutative_Ring
  155.11  imports Main
   156.1 --- a/src/HOL/Decision_Procs/Commutative_Ring_Complete.thy	Sun Nov 02 18:21:14 2014 +0100
   156.2 +++ b/src/HOL/Decision_Procs/Commutative_Ring_Complete.thy	Sun Nov 02 18:21:45 2014 +0100
   156.3 @@ -5,7 +5,7 @@
   156.4  in normal form, the cring method is complete.
   156.5  *)
   156.6  
   156.7 -header {* Proof of the relative completeness of method comm-ring *}
   156.8 +section {* Proof of the relative completeness of method comm-ring *}
   156.9  
  156.10  theory Commutative_Ring_Complete
  156.11  imports Commutative_Ring
   157.1 --- a/src/HOL/Decision_Procs/Dense_Linear_Order.thy	Sun Nov 02 18:21:14 2014 +0100
   157.2 +++ b/src/HOL/Decision_Procs/Dense_Linear_Order.thy	Sun Nov 02 18:21:45 2014 +0100
   157.3 @@ -2,7 +2,7 @@
   157.4      Author      : Amine Chaieb, TU Muenchen
   157.5  *)
   157.6  
   157.7 -header {* Dense linear order without endpoints
   157.8 +section {* Dense linear order without endpoints
   157.9    and a quantifier elimination procedure in Ferrante and Rackoff style *}
  157.10  
  157.11  theory Dense_Linear_Order
   158.1 --- a/src/HOL/Decision_Procs/Parametric_Ferrante_Rackoff.thy	Sun Nov 02 18:21:14 2014 +0100
   158.2 +++ b/src/HOL/Decision_Procs/Parametric_Ferrante_Rackoff.thy	Sun Nov 02 18:21:45 2014 +0100
   158.3 @@ -2,7 +2,7 @@
   158.4      Author:     Amine Chaieb
   158.5  *)
   158.6  
   158.7 -header{* A formalization of Ferrante and Rackoff's procedure with polynomial parameters, see Paper in CALCULEMUS 2008 *}
   158.8 +section{* A formalization of Ferrante and Rackoff's procedure with polynomial parameters, see Paper in CALCULEMUS 2008 *}
   158.9  
  158.10  theory Parametric_Ferrante_Rackoff
  158.11  imports
   159.1 --- a/src/HOL/Decision_Procs/Polynomial_List.thy	Sun Nov 02 18:21:14 2014 +0100
   159.2 +++ b/src/HOL/Decision_Procs/Polynomial_List.thy	Sun Nov 02 18:21:45 2014 +0100
   159.3 @@ -2,7 +2,7 @@
   159.4      Author:     Amine Chaieb
   159.5  *)
   159.6  
   159.7 -header {* Univariate Polynomials as lists *}
   159.8 +section {* Univariate Polynomials as lists *}
   159.9  
  159.10  theory Polynomial_List
  159.11  imports Complex_Main
   160.1 --- a/src/HOL/Decision_Procs/Rat_Pair.thy	Sun Nov 02 18:21:14 2014 +0100
   160.2 +++ b/src/HOL/Decision_Procs/Rat_Pair.thy	Sun Nov 02 18:21:45 2014 +0100
   160.3 @@ -2,7 +2,7 @@
   160.4      Author:     Amine Chaieb
   160.5  *)
   160.6  
   160.7 -header {* Rational numbers as pairs *}
   160.8 +section {* Rational numbers as pairs *}
   160.9  
  160.10  theory Rat_Pair
  160.11  imports Complex_Main
   161.1 --- a/src/HOL/Decision_Procs/Reflected_Multivariate_Polynomial.thy	Sun Nov 02 18:21:14 2014 +0100
   161.2 +++ b/src/HOL/Decision_Procs/Reflected_Multivariate_Polynomial.thy	Sun Nov 02 18:21:45 2014 +0100
   161.3 @@ -2,7 +2,7 @@
   161.4      Author:     Amine Chaieb
   161.5  *)
   161.6  
   161.7 -header {* Implementation and verification of multivariate polynomials *}
   161.8 +section {* Implementation and verification of multivariate polynomials *}
   161.9  
  161.10  theory Reflected_Multivariate_Polynomial
  161.11  imports Complex_Main Rat_Pair Polynomial_List
   162.1 --- a/src/HOL/Decision_Procs/ex/Commutative_Ring_Ex.thy	Sun Nov 02 18:21:14 2014 +0100
   162.2 +++ b/src/HOL/Decision_Procs/ex/Commutative_Ring_Ex.thy	Sun Nov 02 18:21:45 2014 +0100
   162.3 @@ -1,6 +1,6 @@
   162.4  (*  Author:     Bernhard Haeupler *)
   162.5  
   162.6 -header {* Some examples demonstrating the comm-ring method *}
   162.7 +section {* Some examples demonstrating the comm-ring method *}
   162.8  
   162.9  theory Commutative_Ring_Ex
  162.10  imports "../Commutative_Ring"
   163.1 --- a/src/HOL/Decision_Procs/ex/Dense_Linear_Order_Ex.thy	Sun Nov 02 18:21:14 2014 +0100
   163.2 +++ b/src/HOL/Decision_Procs/ex/Dense_Linear_Order_Ex.thy	Sun Nov 02 18:21:45 2014 +0100
   163.3 @@ -1,6 +1,6 @@
   163.4  (* Author:     Amine Chaieb, TU Muenchen *)
   163.5  
   163.6 -header {* Examples for Ferrante and Rackoff's quantifier elimination procedure *}
   163.7 +section {* Examples for Ferrante and Rackoff's quantifier elimination procedure *}
   163.8  
   163.9  theory Dense_Linear_Order_Ex
  163.10  imports "../Dense_Linear_Order"
   164.1 --- a/src/HOL/Deriv.thy	Sun Nov 02 18:21:14 2014 +0100
   164.2 +++ b/src/HOL/Deriv.thy	Sun Nov 02 18:21:45 2014 +0100
   164.3 @@ -6,7 +6,7 @@
   164.4      GMVT by Benjamin Porter, 2005
   164.5  *)
   164.6  
   164.7 -header{* Differentiation *}
   164.8 +section{* Differentiation *}
   164.9  
  164.10  theory Deriv
  164.11  imports Limits
   165.1 --- a/src/HOL/Divides.thy	Sun Nov 02 18:21:14 2014 +0100
   165.2 +++ b/src/HOL/Divides.thy	Sun Nov 02 18:21:45 2014 +0100
   165.3 @@ -3,7 +3,7 @@
   165.4      Copyright   1999  University of Cambridge
   165.5  *)
   165.6  
   165.7 -header {* The division operators div and mod *}
   165.8 +section {* The division operators div and mod *}
   165.9  
  165.10  theory Divides
  165.11  imports Parity
   166.1 --- a/src/HOL/Enum.thy	Sun Nov 02 18:21:14 2014 +0100
   166.2 +++ b/src/HOL/Enum.thy	Sun Nov 02 18:21:45 2014 +0100
   166.3 @@ -1,6 +1,6 @@
   166.4  (* Author: Florian Haftmann, TU Muenchen *)
   166.5  
   166.6 -header {* Finite types as explicit enumerations *}
   166.7 +section {* Finite types as explicit enumerations *}
   166.8  
   166.9  theory Enum
  166.10  imports Map Groups_List
   167.1 --- a/src/HOL/Equiv_Relations.thy	Sun Nov 02 18:21:14 2014 +0100
   167.2 +++ b/src/HOL/Equiv_Relations.thy	Sun Nov 02 18:21:45 2014 +0100
   167.3 @@ -2,7 +2,7 @@
   167.4      Copyright   1996  University of Cambridge
   167.5  *)
   167.6  
   167.7 -header {* Equivalence Relations in Higher-Order Set Theory *}
   167.8 +section {* Equivalence Relations in Higher-Order Set Theory *}
   167.9  
  167.10  theory Equiv_Relations
  167.11  imports Groups_Big Relation
   168.1 --- a/src/HOL/Extraction.thy	Sun Nov 02 18:21:14 2014 +0100
   168.2 +++ b/src/HOL/Extraction.thy	Sun Nov 02 18:21:45 2014 +0100
   168.3 @@ -2,7 +2,7 @@
   168.4      Author:     Stefan Berghofer, TU Muenchen
   168.5  *)
   168.6  
   168.7 -header {* Program extraction for HOL *}
   168.8 +section {* Program extraction for HOL *}
   168.9  
  168.10  theory Extraction
  168.11  imports Option
   169.1 --- a/src/HOL/Fact.thy	Sun Nov 02 18:21:14 2014 +0100
   169.2 +++ b/src/HOL/Fact.thy	Sun Nov 02 18:21:45 2014 +0100
   169.3 @@ -5,7 +5,7 @@
   169.4      The integer version of factorial and other additions by Jeremy Avigad.
   169.5  *)
   169.6  
   169.7 -header{*Factorial Function*}
   169.8 +section{*Factorial Function*}
   169.9  
  169.10  theory Fact
  169.11  imports Main
   170.1 --- a/src/HOL/Fields.thy	Sun Nov 02 18:21:14 2014 +0100
   170.2 +++ b/src/HOL/Fields.thy	Sun Nov 02 18:21:45 2014 +0100
   170.3 @@ -7,7 +7,7 @@
   170.4      Author:     Jeremy Avigad
   170.5  *)
   170.6  
   170.7 -header {* Fields *}
   170.8 +section {* Fields *}
   170.9  
  170.10  theory Fields
  170.11  imports Rings
   171.1 --- a/src/HOL/Finite_Set.thy	Sun Nov 02 18:21:14 2014 +0100
   171.2 +++ b/src/HOL/Finite_Set.thy	Sun Nov 02 18:21:45 2014 +0100
   171.3 @@ -3,7 +3,7 @@
   171.4                  with contributions by Jeremy Avigad and Andrei Popescu
   171.5  *)
   171.6  
   171.7 -header {* Finite sets *}
   171.8 +section {* Finite sets *}
   171.9  
  171.10  theory Finite_Set
  171.11  imports Product_Type Sum_Type Nat
   172.1 --- a/src/HOL/Fun.thy	Sun Nov 02 18:21:14 2014 +0100
   172.2 +++ b/src/HOL/Fun.thy	Sun Nov 02 18:21:45 2014 +0100
   172.3 @@ -4,7 +4,7 @@
   172.4      Copyright   1994, 2012
   172.5  *)
   172.6  
   172.7 -header {* Notions about functions *}
   172.8 +section {* Notions about functions *}
   172.9  
  172.10  theory Fun
  172.11  imports Set
   173.1 --- a/src/HOL/Fun_Def.thy	Sun Nov 02 18:21:14 2014 +0100
   173.2 +++ b/src/HOL/Fun_Def.thy	Sun Nov 02 18:21:45 2014 +0100
   173.3 @@ -2,7 +2,7 @@
   173.4      Author:     Alexander Krauss, TU Muenchen
   173.5  *)
   173.6  
   173.7 -header {* Function Definitions and Termination Proofs *}
   173.8 +section {* Function Definitions and Termination Proofs *}
   173.9  
  173.10  theory Fun_Def
  173.11  imports Basic_BNF_Least_Fixpoints Partial_Function SAT
   174.1 --- a/src/HOL/Fun_Def_Base.thy	Sun Nov 02 18:21:14 2014 +0100
   174.2 +++ b/src/HOL/Fun_Def_Base.thy	Sun Nov 02 18:21:45 2014 +0100
   174.3 @@ -2,7 +2,7 @@
   174.4      Author:     Alexander Krauss, TU Muenchen
   174.5  *)
   174.6  
   174.7 -header {* Function Definition Base *}
   174.8 +section {* Function Definition Base *}
   174.9  
  174.10  theory Fun_Def_Base
  174.11  imports Ctr_Sugar Set Wellfounded
   175.1 --- a/src/HOL/GCD.thy	Sun Nov 02 18:21:14 2014 +0100
   175.2 +++ b/src/HOL/GCD.thy	Sun Nov 02 18:21:45 2014 +0100
   175.3 @@ -25,7 +25,7 @@
   175.4  *)
   175.5  
   175.6  
   175.7 -header {* Greatest common divisor and least common multiple *}
   175.8 +section {* Greatest common divisor and least common multiple *}
   175.9  
  175.10  theory GCD
  175.11  imports Fact
   176.1 --- a/src/HOL/Groebner_Basis.thy	Sun Nov 02 18:21:14 2014 +0100
   176.2 +++ b/src/HOL/Groebner_Basis.thy	Sun Nov 02 18:21:45 2014 +0100
   176.3 @@ -2,7 +2,7 @@
   176.4      Author:     Amine Chaieb, TU Muenchen
   176.5  *)
   176.6  
   176.7 -header {* Groebner bases *}
   176.8 +section {* Groebner bases *}
   176.9  
  176.10  theory Groebner_Basis
  176.11  imports Semiring_Normalization Parity
   177.1 --- a/src/HOL/Groups.thy	Sun Nov 02 18:21:14 2014 +0100
   177.2 +++ b/src/HOL/Groups.thy	Sun Nov 02 18:21:45 2014 +0100
   177.3 @@ -2,7 +2,7 @@
   177.4      Author:  Gertrud Bauer, Steven Obua, Lawrence C Paulson, Markus Wenzel, Jeremy Avigad
   177.5  *)
   177.6  
   177.7 -header {* Groups, also combined with orderings *}
   177.8 +section {* Groups, also combined with orderings *}
   177.9  
  177.10  theory Groups
  177.11  imports Orderings
   178.1 --- a/src/HOL/Groups_Big.thy	Sun Nov 02 18:21:14 2014 +0100
   178.2 +++ b/src/HOL/Groups_Big.thy	Sun Nov 02 18:21:45 2014 +0100
   178.3 @@ -3,7 +3,7 @@
   178.4                  with contributions by Jeremy Avigad
   178.5  *)
   178.6  
   178.7 -header {* Big sum and product over finite (non-empty) sets *}
   178.8 +section {* Big sum and product over finite (non-empty) sets *}
   178.9  
  178.10  theory Groups_Big
  178.11  imports Finite_Set
   179.1 --- a/src/HOL/Groups_List.thy	Sun Nov 02 18:21:14 2014 +0100
   179.2 +++ b/src/HOL/Groups_List.thy	Sun Nov 02 18:21:45 2014 +0100
   179.3 @@ -1,7 +1,7 @@
   179.4  
   179.5  (* Author: Tobias Nipkow, TU Muenchen *)
   179.6  
   179.7 -header {* Sum and product over lists *}
   179.8 +section {* Sum and product over lists *}
   179.9  
  179.10  theory Groups_List
  179.11  imports List
   180.1 --- a/src/HOL/HOL.thy	Sun Nov 02 18:21:14 2014 +0100
   180.2 +++ b/src/HOL/HOL.thy	Sun Nov 02 18:21:45 2014 +0100
   180.3 @@ -2,7 +2,7 @@
   180.4      Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
   180.5  *)
   180.6  
   180.7 -header {* The basis of Higher-Order Logic *}
   180.8 +section {* The basis of Higher-Order Logic *}
   180.9  
  180.10  theory HOL
  180.11  imports Pure "~~/src/Tools/Code_Generator"
   181.1 --- a/src/HOL/Hahn_Banach/Bounds.thy	Sun Nov 02 18:21:14 2014 +0100
   181.2 +++ b/src/HOL/Hahn_Banach/Bounds.thy	Sun Nov 02 18:21:45 2014 +0100
   181.3 @@ -2,7 +2,7 @@
   181.4      Author:     Gertrud Bauer, TU Munich
   181.5  *)
   181.6  
   181.7 -header \<open>Bounds\<close>
   181.8 +section \<open>Bounds\<close>
   181.9  
  181.10  theory Bounds
  181.11  imports Main "~~/src/HOL/Library/ContNotDenum"
   182.1 --- a/src/HOL/Hahn_Banach/Function_Norm.thy	Sun Nov 02 18:21:14 2014 +0100
   182.2 +++ b/src/HOL/Hahn_Banach/Function_Norm.thy	Sun Nov 02 18:21:45 2014 +0100
   182.3 @@ -2,7 +2,7 @@
   182.4      Author:     Gertrud Bauer, TU Munich
   182.5  *)
   182.6  
   182.7 -header \<open>The norm of a function\<close>
   182.8 +section \<open>The norm of a function\<close>
   182.9  
  182.10  theory Function_Norm
  182.11  imports Normed_Space Function_Order
   183.1 --- a/src/HOL/Hahn_Banach/Function_Order.thy	Sun Nov 02 18:21:14 2014 +0100
   183.2 +++ b/src/HOL/Hahn_Banach/Function_Order.thy	Sun Nov 02 18:21:45 2014 +0100
   183.3 @@ -2,7 +2,7 @@
   183.4      Author:     Gertrud Bauer, TU Munich
   183.5  *)
   183.6  
   183.7 -header \<open>An order on functions\<close>
   183.8 +section \<open>An order on functions\<close>
   183.9  
  183.10  theory Function_Order
  183.11  imports Subspace Linearform
   184.1 --- a/src/HOL/Hahn_Banach/Hahn_Banach.thy	Sun Nov 02 18:21:14 2014 +0100
   184.2 +++ b/src/HOL/Hahn_Banach/Hahn_Banach.thy	Sun Nov 02 18:21:45 2014 +0100
   184.3 @@ -2,7 +2,7 @@
   184.4      Author:     Gertrud Bauer, TU Munich
   184.5  *)
   184.6  
   184.7 -header \<open>The Hahn-Banach Theorem\<close>
   184.8 +section \<open>The Hahn-Banach Theorem\<close>
   184.9  
  184.10  theory Hahn_Banach
  184.11  imports Hahn_Banach_Lemmas
   185.1 --- a/src/HOL/Hahn_Banach/Hahn_Banach_Ext_Lemmas.thy	Sun Nov 02 18:21:14 2014 +0100
   185.2 +++ b/src/HOL/Hahn_Banach/Hahn_Banach_Ext_Lemmas.thy	Sun Nov 02 18:21:45 2014 +0100
   185.3 @@ -2,7 +2,7 @@
   185.4      Author:     Gertrud Bauer, TU Munich
   185.5  *)
   185.6  
   185.7 -header \<open>Extending non-maximal functions\<close>
   185.8 +section \<open>Extending non-maximal functions\<close>
   185.9  
  185.10  theory Hahn_Banach_Ext_Lemmas
  185.11  imports Function_Norm
   186.1 --- a/src/HOL/Hahn_Banach/Hahn_Banach_Sup_Lemmas.thy	Sun Nov 02 18:21:14 2014 +0100
   186.2 +++ b/src/HOL/Hahn_Banach/Hahn_Banach_Sup_Lemmas.thy	Sun Nov 02 18:21:45 2014 +0100
   186.3 @@ -2,7 +2,7 @@
   186.4      Author:     Gertrud Bauer, TU Munich
   186.5  *)
   186.6  
   186.7 -header \<open>The supremum w.r.t.~the function order\<close>
   186.8 +section \<open>The supremum w.r.t.~the function order\<close>
   186.9  
  186.10  theory Hahn_Banach_Sup_Lemmas
  186.11  imports Function_Norm Zorn_Lemma
   187.1 --- a/src/HOL/Hahn_Banach/Linearform.thy	Sun Nov 02 18:21:14 2014 +0100
   187.2 +++ b/src/HOL/Hahn_Banach/Linearform.thy	Sun Nov 02 18:21:45 2014 +0100
   187.3 @@ -2,7 +2,7 @@
   187.4      Author:     Gertrud Bauer, TU Munich
   187.5  *)
   187.6  
   187.7 -header \<open>Linearforms\<close>
   187.8 +section \<open>Linearforms\<close>
   187.9  
  187.10  theory Linearform
  187.11  imports Vector_Space
   188.1 --- a/src/HOL/Hahn_Banach/Normed_Space.thy	Sun Nov 02 18:21:14 2014 +0100
   188.2 +++ b/src/HOL/Hahn_Banach/Normed_Space.thy	Sun Nov 02 18:21:45 2014 +0100
   188.3 @@ -2,7 +2,7 @@
   188.4      Author:     Gertrud Bauer, TU Munich
   188.5  *)
   188.6  
   188.7 -header \<open>Normed vector spaces\<close>
   188.8 +section \<open>Normed vector spaces\<close>
   188.9  
  188.10  theory Normed_Space
  188.11  imports Subspace
   189.1 --- a/src/HOL/Hahn_Banach/Subspace.thy	Sun Nov 02 18:21:14 2014 +0100
   189.2 +++ b/src/HOL/Hahn_Banach/Subspace.thy	Sun Nov 02 18:21:45 2014 +0100
   189.3 @@ -2,7 +2,7 @@
   189.4      Author:     Gertrud Bauer, TU Munich
   189.5  *)
   189.6  
   189.7 -header \<open>Subspaces\<close>
   189.8 +section \<open>Subspaces\<close>
   189.9  
  189.10  theory Subspace
  189.11  imports Vector_Space "~~/src/HOL/Library/Set_Algebras"
   190.1 --- a/src/HOL/Hahn_Banach/Vector_Space.thy	Sun Nov 02 18:21:14 2014 +0100
   190.2 +++ b/src/HOL/Hahn_Banach/Vector_Space.thy	Sun Nov 02 18:21:45 2014 +0100
   190.3 @@ -2,7 +2,7 @@
   190.4      Author:     Gertrud Bauer, TU Munich
   190.5  *)
   190.6  
   190.7 -header \<open>Vector spaces\<close>
   190.8 +section \<open>Vector spaces\<close>
   190.9  
  190.10  theory Vector_Space
  190.11  imports Complex_Main Bounds
   191.1 --- a/src/HOL/Hahn_Banach/Zorn_Lemma.thy	Sun Nov 02 18:21:14 2014 +0100
   191.2 +++ b/src/HOL/Hahn_Banach/Zorn_Lemma.thy	Sun Nov 02 18:21:45 2014 +0100
   191.3 @@ -2,7 +2,7 @@
   191.4      Author:     Gertrud Bauer, TU Munich
   191.5  *)
   191.6  
   191.7 -header \<open>Zorn's Lemma\<close>
   191.8 +section \<open>Zorn's Lemma\<close>
   191.9  
  191.10  theory Zorn_Lemma
  191.11  imports Main
   192.1 --- a/src/HOL/Hilbert_Choice.thy	Sun Nov 02 18:21:14 2014 +0100
   192.2 +++ b/src/HOL/Hilbert_Choice.thy	Sun Nov 02 18:21:45 2014 +0100
   192.3 @@ -3,7 +3,7 @@
   192.4      Copyright   2001  University of Cambridge
   192.5  *)
   192.6  
   192.7 -header {* Hilbert's Epsilon-Operator and the Axiom of Choice *}
   192.8 +section {* Hilbert's Epsilon-Operator and the Axiom of Choice *}
   192.9  
  192.10  theory Hilbert_Choice
  192.11  imports Nat Wellfounded
   193.1 --- a/src/HOL/IMP/AExp.thy	Sun Nov 02 18:21:14 2014 +0100
   193.2 +++ b/src/HOL/IMP/AExp.thy	Sun Nov 02 18:21:45 2014 +0100
   193.3 @@ -1,4 +1,4 @@
   193.4 -header "Arithmetic and Boolean Expressions"
   193.5 +section "Arithmetic and Boolean Expressions"
   193.6  
   193.7  theory AExp imports Main begin
   193.8  
   194.1 --- a/src/HOL/IMP/ASM.thy	Sun Nov 02 18:21:14 2014 +0100
   194.2 +++ b/src/HOL/IMP/ASM.thy	Sun Nov 02 18:21:45 2014 +0100
   194.3 @@ -1,4 +1,4 @@
   194.4 -header "Stack Machine and Compilation"
   194.5 +section "Stack Machine and Compilation"
   194.6  
   194.7  theory ASM imports AExp begin
   194.8  
   195.1 --- a/src/HOL/IMP/Abs_Int_Den/Abs_Int_den0_fun.thy	Sun Nov 02 18:21:14 2014 +0100
   195.2 +++ b/src/HOL/IMP/Abs_Int_Den/Abs_Int_den0_fun.thy	Sun Nov 02 18:21:45 2014 +0100
   195.3 @@ -1,6 +1,6 @@
   195.4  (* Author: Tobias Nipkow *)
   195.5  
   195.6 -header "Denotational Abstract Interpretation"
   195.7 +section "Denotational Abstract Interpretation"
   195.8  
   195.9  theory Abs_Int_den0_fun
  195.10  imports "~~/src/Tools/Permanent_Interpretation" "../Big_Step"
   196.1 --- a/src/HOL/IMP/Abs_Int_ITP/Complete_Lattice_ix.thy	Sun Nov 02 18:21:14 2014 +0100
   196.2 +++ b/src/HOL/IMP/Abs_Int_ITP/Complete_Lattice_ix.thy	Sun Nov 02 18:21:45 2014 +0100
   196.3 @@ -1,6 +1,6 @@
   196.4  (* Author: Tobias Nipkow *)
   196.5  
   196.6 -header "Abstract Interpretation (ITP)"
   196.7 +section "Abstract Interpretation (ITP)"
   196.8  
   196.9  theory Complete_Lattice_ix
  196.10  imports Main
   197.1 --- a/src/HOL/IMP/Com.thy	Sun Nov 02 18:21:14 2014 +0100
   197.2 +++ b/src/HOL/IMP/Com.thy	Sun Nov 02 18:21:45 2014 +0100
   197.3 @@ -1,4 +1,4 @@
   197.4 -header "IMP --- A Simple Imperative Language"
   197.5 +section "IMP --- A Simple Imperative Language"
   197.6  
   197.7  theory Com imports BExp begin
   197.8  
   198.1 --- a/src/HOL/IMP/Compiler.thy	Sun Nov 02 18:21:14 2014 +0100
   198.2 +++ b/src/HOL/IMP/Compiler.thy	Sun Nov 02 18:21:45 2014 +0100
   198.3 @@ -1,6 +1,6 @@
   198.4  (* Author: Tobias Nipkow and Gerwin Klein *)
   198.5  
   198.6 -header "Compiler for IMP"
   198.7 +section "Compiler for IMP"
   198.8  
   198.9  theory Compiler imports Big_Step Star
  198.10  begin
   199.1 --- a/src/HOL/IMP/Complete_Lattice.thy	Sun Nov 02 18:21:14 2014 +0100
   199.2 +++ b/src/HOL/IMP/Complete_Lattice.thy	Sun Nov 02 18:21:45 2014 +0100
   199.3 @@ -1,4 +1,4 @@
   199.4 -header "Abstract Interpretation"
   199.5 +section "Abstract Interpretation"
   199.6  
   199.7  theory Complete_Lattice
   199.8  imports Main
   200.1 --- a/src/HOL/IMP/Denotational.thy	Sun Nov 02 18:21:14 2014 +0100
   200.2 +++ b/src/HOL/IMP/Denotational.thy	Sun Nov 02 18:21:45 2014 +0100
   200.3 @@ -1,6 +1,6 @@
   200.4  (* Authors: Heiko Loetzbeyer, Robert Sandner, Tobias Nipkow *)
   200.5  
   200.6 -header "Denotational Semantics of Commands"
   200.7 +section "Denotational Semantics of Commands"
   200.8  
   200.9  theory Denotational imports Big_Step begin
  200.10  
   201.1 --- a/src/HOL/IMP/Hoare.thy	Sun Nov 02 18:21:14 2014 +0100
   201.2 +++ b/src/HOL/IMP/Hoare.thy	Sun Nov 02 18:21:45 2014 +0100
   201.3 @@ -1,6 +1,6 @@
   201.4  (* Author: Tobias Nipkow *)
   201.5  
   201.6 -header "Hoare Logic"
   201.7 +section "Hoare Logic"
   201.8  
   201.9  theory Hoare imports Big_Step begin
  201.10  
   202.1 --- a/src/HOL/IMP/Live.thy	Sun Nov 02 18:21:14 2014 +0100
   202.2 +++ b/src/HOL/IMP/Live.thy	Sun Nov 02 18:21:45 2014 +0100
   202.3 @@ -1,6 +1,6 @@
   202.4  (* Author: Tobias Nipkow *)
   202.5  
   202.6 -header "Live Variable Analysis"
   202.7 +section "Live Variable Analysis"
   202.8  
   202.9  theory Live imports Vars Big_Step
  202.10  begin
   203.1 --- a/src/HOL/IMP/Procs.thy	Sun Nov 02 18:21:14 2014 +0100
   203.2 +++ b/src/HOL/IMP/Procs.thy	Sun Nov 02 18:21:45 2014 +0100
   203.3 @@ -1,4 +1,4 @@
   203.4 -header "Extensions and Variations of IMP"
   203.5 +section "Extensions and Variations of IMP"
   203.6  
   203.7  theory Procs imports BExp begin
   203.8  
   204.1 --- a/src/HOL/IMP/Sec_Type_Expr.thy	Sun Nov 02 18:21:14 2014 +0100
   204.2 +++ b/src/HOL/IMP/Sec_Type_Expr.thy	Sun Nov 02 18:21:45 2014 +0100
   204.3 @@ -1,4 +1,4 @@
   204.4 -header "Security Type Systems"
   204.5 +section "Security Type Systems"
   204.6  
   204.7  theory Sec_Type_Expr imports Big_Step
   204.8  begin
   205.1 --- a/src/HOL/IMP/Sem_Equiv.thy	Sun Nov 02 18:21:14 2014 +0100
   205.2 +++ b/src/HOL/IMP/Sem_Equiv.thy	Sun Nov 02 18:21:45 2014 +0100
   205.3 @@ -1,4 +1,4 @@
   205.4 -header "Constant Folding"
   205.5 +section "Constant Folding"
   205.6  
   205.7  theory Sem_Equiv
   205.8  imports Big_Step
   206.1 --- a/src/HOL/IMP/Small_Step.thy	Sun Nov 02 18:21:14 2014 +0100
   206.2 +++ b/src/HOL/IMP/Small_Step.thy	Sun Nov 02 18:21:45 2014 +0100
   206.3 @@ -1,4 +1,4 @@
   206.4 -header "Small-Step Semantics of Commands"
   206.5 +section "Small-Step Semantics of Commands"
   206.6  
   206.7  theory Small_Step imports Star Big_Step begin
   206.8  
   207.1 --- a/src/HOL/IMP/Types.thy	Sun Nov 02 18:21:14 2014 +0100
   207.2 +++ b/src/HOL/IMP/Types.thy	Sun Nov 02 18:21:45 2014 +0100
   207.3 @@ -1,4 +1,4 @@
   207.4 -header "A Typed Language"
   207.5 +section "A Typed Language"
   207.6  
   207.7  theory Types imports Star Complex_Main begin
   207.8  
   208.1 --- a/src/HOL/IMP/Vars.thy	Sun Nov 02 18:21:14 2014 +0100
   208.2 +++ b/src/HOL/IMP/Vars.thy	Sun Nov 02 18:21:45 2014 +0100
   208.3 @@ -1,6 +1,6 @@
   208.4  (* Author: Tobias Nipkow *)
   208.5  
   208.6 -header "Definite Initialization Analysis"
   208.7 +section "Definite Initialization Analysis"
   208.8  
   208.9  theory Vars imports Com
  208.10  begin
   209.1 --- a/src/HOL/IMPP/Com.thy	Sun Nov 02 18:21:14 2014 +0100
   209.2 +++ b/src/HOL/IMPP/Com.thy	Sun Nov 02 18:21:45 2014 +0100
   209.3 @@ -2,7 +2,7 @@
   209.4      Author:   David von Oheimb (based on a theory by Tobias Nipkow et al), TUM
   209.5  *)
   209.6  
   209.7 -header {* Semantics of arithmetic and boolean expressions, Syntax of commands *}
   209.8 +section {* Semantics of arithmetic and boolean expressions, Syntax of commands *}
   209.9  
  209.10  theory Com
  209.11  imports Main
   210.1 --- a/src/HOL/IMPP/EvenOdd.thy	Sun Nov 02 18:21:14 2014 +0100
   210.2 +++ b/src/HOL/IMPP/EvenOdd.thy	Sun Nov 02 18:21:45 2014 +0100
   210.3 @@ -2,7 +2,7 @@
   210.4      Author:     David von Oheimb, TUM
   210.5  *)
   210.6  
   210.7 -header {* Example of mutually recursive procedures verified with Hoare logic *}
   210.8 +section {* Example of mutually recursive procedures verified with Hoare logic *}
   210.9  
  210.10  theory EvenOdd
  210.11  imports Main Misc
   211.1 --- a/src/HOL/IMPP/Hoare.thy	Sun Nov 02 18:21:14 2014 +0100
   211.2 +++ b/src/HOL/IMPP/Hoare.thy	Sun Nov 02 18:21:45 2014 +0100
   211.3 @@ -3,7 +3,7 @@
   211.4      Copyright   1999 TUM
   211.5  *)
   211.6  
   211.7 -header {* Inductive definition of Hoare logic for partial correctness *}
   211.8 +section {* Inductive definition of Hoare logic for partial correctness *}
   211.9  
  211.10  theory Hoare
  211.11  imports Natural
   212.1 --- a/src/HOL/IMPP/Misc.thy	Sun Nov 02 18:21:14 2014 +0100
   212.2 +++ b/src/HOL/IMPP/Misc.thy	Sun Nov 02 18:21:45 2014 +0100
   212.3 @@ -2,7 +2,7 @@
   212.4      Author:     David von Oheimb, TUM
   212.5  *)
   212.6  
   212.7 -header {* Several examples for Hoare logic *}
   212.8 +section {* Several examples for Hoare logic *}
   212.9  
  212.10  theory Misc
  212.11  imports Hoare
   213.1 --- a/src/HOL/IMPP/Natural.thy	Sun Nov 02 18:21:14 2014 +0100
   213.2 +++ b/src/HOL/IMPP/Natural.thy	Sun Nov 02 18:21:45 2014 +0100
   213.3 @@ -2,7 +2,7 @@
   213.4      Author:     David von Oheimb (based on a theory by Tobias Nipkow et al), TUM
   213.5  *)
   213.6  
   213.7 -header {* Natural semantics of commands *}
   213.8 +section {* Natural semantics of commands *}
   213.9  
  213.10  theory Natural
  213.11  imports Com
   214.1 --- a/src/HOL/IOA/Asig.thy	Sun Nov 02 18:21:14 2014 +0100
   214.2 +++ b/src/HOL/IOA/Asig.thy	Sun Nov 02 18:21:45 2014 +0100
   214.3 @@ -3,7 +3,7 @@
   214.4      Copyright   1994  TU Muenchen
   214.5  *)
   214.6  
   214.7 -header {* Action signatures *}
   214.8 +section {* Action signatures *}
   214.9  
  214.10  theory Asig
  214.11  imports Main
   215.1 --- a/src/HOL/IOA/IOA.thy	Sun Nov 02 18:21:14 2014 +0100
   215.2 +++ b/src/HOL/IOA/IOA.thy	Sun Nov 02 18:21:45 2014 +0100
   215.3 @@ -3,7 +3,7 @@
   215.4      Copyright   1994  TU Muenchen
   215.5  *)
   215.6  
   215.7 -header {* The I/O automata of Lynch and Tuttle *}
   215.8 +section {* The I/O automata of Lynch and Tuttle *}
   215.9  
  215.10  theory IOA
  215.11  imports Asig
   216.1 --- a/src/HOL/IOA/Solve.thy	Sun Nov 02 18:21:14 2014 +0100
   216.2 +++ b/src/HOL/IOA/Solve.thy	Sun Nov 02 18:21:45 2014 +0100
   216.3 @@ -3,7 +3,7 @@
   216.4      Copyright   1994  TU Muenchen
   216.5  *)
   216.6  
   216.7 -header {* Weak possibilities mapping (abstraction) *}
   216.8 +section {* Weak possibilities mapping (abstraction) *}
   216.9  
  216.10  theory Solve
  216.11  imports IOA
   217.1 --- a/src/HOL/Imperative_HOL/Array.thy	Sun Nov 02 18:21:14 2014 +0100
   217.2 +++ b/src/HOL/Imperative_HOL/Array.thy	Sun Nov 02 18:21:45 2014 +0100
   217.3 @@ -2,7 +2,7 @@
   217.4      Author:     John Matthews, Galois Connections; Alexander Krauss, Lukas Bulwahn & Florian Haftmann, TU Muenchen
   217.5  *)
   217.6  
   217.7 -header {* Monadic arrays *}
   217.8 +section {* Monadic arrays *}
   217.9  
  217.10  theory Array
  217.11  imports Heap_Monad
   218.1 --- a/src/HOL/Imperative_HOL/Heap.thy	Sun Nov 02 18:21:14 2014 +0100
   218.2 +++ b/src/HOL/Imperative_HOL/Heap.thy	Sun Nov 02 18:21:45 2014 +0100
   218.3 @@ -2,7 +2,7 @@
   218.4      Author:     John Matthews, Galois Connections; Alexander Krauss, TU Muenchen
   218.5  *)
   218.6  
   218.7 -header {* A polymorphic heap based on cantor encodings *}
   218.8 +section {* A polymorphic heap based on cantor encodings *}
   218.9  
  218.10  theory Heap
  218.11  imports Main "~~/src/HOL/Library/Countable"
   219.1 --- a/src/HOL/Imperative_HOL/Heap_Monad.thy	Sun Nov 02 18:21:14 2014 +0100
   219.2 +++ b/src/HOL/Imperative_HOL/Heap_Monad.thy	Sun Nov 02 18:21:45 2014 +0100
   219.3 @@ -2,7 +2,7 @@
   219.4      Author:     John Matthews, Galois Connections; Alexander Krauss, Lukas Bulwahn & Florian Haftmann, TU Muenchen
   219.5  *)
   219.6  
   219.7 -header {* A monad with a polymorphic heap and primitive reasoning infrastructure *}
   219.8 +section {* A monad with a polymorphic heap and primitive reasoning infrastructure *}
   219.9  
  219.10  theory Heap_Monad
  219.11  imports
   220.1 --- a/src/HOL/Imperative_HOL/Imperative_HOL.thy	Sun Nov 02 18:21:14 2014 +0100
   220.2 +++ b/src/HOL/Imperative_HOL/Imperative_HOL.thy	Sun Nov 02 18:21:45 2014 +0100
   220.3 @@ -2,7 +2,7 @@
   220.4      Author:     John Matthews, Galois Connections; Alexander Krauss, Lukas Bulwahn & Florian Haftmann, TU Muenchen
   220.5  *)
   220.6  
   220.7 -header {* Entry point into monadic imperative HOL *}
   220.8 +section {* Entry point into monadic imperative HOL *}
   220.9  
  220.10  theory Imperative_HOL
  220.11  imports Array Ref
   221.1 --- a/src/HOL/Imperative_HOL/Imperative_HOL_ex.thy	Sun Nov 02 18:21:14 2014 +0100
   221.2 +++ b/src/HOL/Imperative_HOL/Imperative_HOL_ex.thy	Sun Nov 02 18:21:45 2014 +0100
   221.3 @@ -3,7 +3,7 @@
   221.4                  Alexander Krauss, Lukas Bulwahn & Florian Haftmann, TU Muenchen
   221.5  *)
   221.6  
   221.7 -header {* Monadic imperative HOL with examples *}
   221.8 +section {* Monadic imperative HOL with examples *}
   221.9  
  221.10  theory Imperative_HOL_ex
  221.11  imports Imperative_HOL Overview
   222.1 --- a/src/HOL/Imperative_HOL/Ref.thy	Sun Nov 02 18:21:14 2014 +0100
   222.2 +++ b/src/HOL/Imperative_HOL/Ref.thy	Sun Nov 02 18:21:45 2014 +0100
   222.3 @@ -2,7 +2,7 @@
   222.4      Author:     John Matthews, Galois Connections; Alexander Krauss, Lukas Bulwahn & Florian Haftmann, TU Muenchen
   222.5  *)
   222.6  
   222.7 -header {* Monadic references *}
   222.8 +section {* Monadic references *}
   222.9  
  222.10  theory Ref
  222.11  imports Array
   223.1 --- a/src/HOL/Imperative_HOL/ex/Imperative_Quicksort.thy	Sun Nov 02 18:21:14 2014 +0100
   223.2 +++ b/src/HOL/Imperative_HOL/ex/Imperative_Quicksort.thy	Sun Nov 02 18:21:45 2014 +0100
   223.3 @@ -2,7 +2,7 @@
   223.4      Author:     Lukas Bulwahn, TU Muenchen
   223.5  *)
   223.6  
   223.7 -header {* An imperative implementation of Quicksort on arrays *}
   223.8 +section {* An imperative implementation of Quicksort on arrays *}
   223.9  
  223.10  theory Imperative_Quicksort
  223.11  imports
   224.1 --- a/src/HOL/Imperative_HOL/ex/Imperative_Reverse.thy	Sun Nov 02 18:21:14 2014 +0100
   224.2 +++ b/src/HOL/Imperative_HOL/ex/Imperative_Reverse.thy	Sun Nov 02 18:21:45 2014 +0100
   224.3 @@ -2,7 +2,7 @@
   224.4      Author:     Lukas Bulwahn, TU Muenchen
   224.5  *)
   224.6  
   224.7 -header {* An imperative in-place reversal on arrays *}
   224.8 +section {* An imperative in-place reversal on arrays *}
   224.9  
  224.10  theory Imperative_Reverse
  224.11  imports Subarray "~~/src/HOL/Imperative_HOL/Imperative_HOL"
   225.1 --- a/src/HOL/Imperative_HOL/ex/Linked_Lists.thy	Sun Nov 02 18:21:14 2014 +0100
   225.2 +++ b/src/HOL/Imperative_HOL/ex/Linked_Lists.thy	Sun Nov 02 18:21:45 2014 +0100
   225.3 @@ -2,7 +2,7 @@
   225.4      Author:     Lukas Bulwahn, TU Muenchen
   225.5  *)
   225.6  
   225.7 -header {* Linked Lists by ML references *}
   225.8 +section {* Linked Lists by ML references *}
   225.9  
  225.10  theory Linked_Lists
  225.11  imports "../Imperative_HOL" "~~/src/HOL/Library/Code_Target_Int"
   226.1 --- a/src/HOL/Imperative_HOL/ex/SatChecker.thy	Sun Nov 02 18:21:14 2014 +0100
   226.2 +++ b/src/HOL/Imperative_HOL/ex/SatChecker.thy	Sun Nov 02 18:21:45 2014 +0100
   226.3 @@ -2,7 +2,7 @@
   226.4      Author:     Lukas Bulwahn, TU Muenchen
   226.5  *)
   226.6  
   226.7 -header {* An efficient checker for proofs from a SAT solver *}
   226.8 +section {* An efficient checker for proofs from a SAT solver *}
   226.9  
  226.10  theory SatChecker
  226.11  imports "~~/src/HOL/Library/RBT_Impl" Sorted_List "../Imperative_HOL"
   227.1 --- a/src/HOL/Imperative_HOL/ex/Sorted_List.thy	Sun Nov 02 18:21:14 2014 +0100
   227.2 +++ b/src/HOL/Imperative_HOL/ex/Sorted_List.thy	Sun Nov 02 18:21:45 2014 +0100
   227.3 @@ -2,7 +2,7 @@
   227.4      Author:     Lukas Bulwahn, TU Muenchen
   227.5  *)
   227.6  
   227.7 -header {* Sorted lists as representation of finite sets *}
   227.8 +section {* Sorted lists as representation of finite sets *}
   227.9  
  227.10  theory Sorted_List
  227.11  imports Main
   228.1 --- a/src/HOL/Imperative_HOL/ex/Subarray.thy	Sun Nov 02 18:21:14 2014 +0100
   228.2 +++ b/src/HOL/Imperative_HOL/ex/Subarray.thy	Sun Nov 02 18:21:45 2014 +0100
   228.3 @@ -2,7 +2,7 @@
   228.4      Author:     Lukas Bulwahn, TU Muenchen
   228.5  *)
   228.6  
   228.7 -header {* Theorems about sub arrays *}
   228.8 +section {* Theorems about sub arrays *}
   228.9  
  228.10  theory Subarray
  228.11  imports "~~/src/HOL/Imperative_HOL/Array" Sublist
   229.1 --- a/src/HOL/Imperative_HOL/ex/Sublist.thy	Sun Nov 02 18:21:14 2014 +0100
   229.2 +++ b/src/HOL/Imperative_HOL/ex/Sublist.thy	Sun Nov 02 18:21:45 2014 +0100
   229.3 @@ -2,7 +2,7 @@
   229.4      Author:     Lukas Bulwahn, TU Muenchen
   229.5  *)
   229.6  
   229.7 -header {* Slices of lists *}
   229.8 +section {* Slices of lists *}
   229.9  
  229.10  theory Sublist
  229.11  imports "~~/src/HOL/Library/Multiset"
   230.1 --- a/src/HOL/Import/HOL_Light_Import.thy	Sun Nov 02 18:21:14 2014 +0100
   230.2 +++ b/src/HOL/Import/HOL_Light_Import.thy	Sun Nov 02 18:21:45 2014 +0100
   230.3 @@ -3,7 +3,7 @@
   230.4      Author:     Alexander Krauss, QAware GmbH
   230.5  *)
   230.6  
   230.7 -header {* Main HOL Light importer *}
   230.8 +section {* Main HOL Light importer *}
   230.9  
  230.10  theory HOL_Light_Import
  230.11  imports HOL_Light_Maps
   231.1 --- a/src/HOL/Import/HOL_Light_Maps.thy	Sun Nov 02 18:21:14 2014 +0100
   231.2 +++ b/src/HOL/Import/HOL_Light_Maps.thy	Sun Nov 02 18:21:45 2014 +0100
   231.3 @@ -5,7 +5,7 @@
   231.4  Based on earlier code by Steven Obua and Sebastian Skalberg
   231.5  *)
   231.6  
   231.7 -header {* Type and constant mappings of HOL Light importer *}
   231.8 +section {* Type and constant mappings of HOL Light importer *}
   231.9  
  231.10  theory HOL_Light_Maps
  231.11  imports Import_Setup
   232.1 --- a/src/HOL/Import/Import_Setup.thy	Sun Nov 02 18:21:14 2014 +0100
   232.2 +++ b/src/HOL/Import/Import_Setup.thy	Sun Nov 02 18:21:45 2014 +0100
   232.3 @@ -3,7 +3,7 @@
   232.4      Author:     Alexander Krauss, QAware GmbH
   232.5  *)
   232.6  
   232.7 -header {* Importer machinery and required theorems *}
   232.8 +section {* Importer machinery and required theorems *}
   232.9  
  232.10  theory Import_Setup
  232.11  imports Main "~~/src/HOL/Fact"
   233.1 --- a/src/HOL/Induct/ABexp.thy	Sun Nov 02 18:21:14 2014 +0100
   233.2 +++ b/src/HOL/Induct/ABexp.thy	Sun Nov 02 18:21:45 2014 +0100
   233.3 @@ -2,7 +2,7 @@
   233.4      Author:     Stefan Berghofer, TU Muenchen
   233.5  *)
   233.6  
   233.7 -header {* Arithmetic and boolean expressions *}
   233.8 +section {* Arithmetic and boolean expressions *}
   233.9  
  233.10  theory ABexp
  233.11  imports Main
   234.1 --- a/src/HOL/Induct/Com.thy	Sun Nov 02 18:21:14 2014 +0100
   234.2 +++ b/src/HOL/Induct/Com.thy	Sun Nov 02 18:21:45 2014 +0100
   234.3 @@ -5,7 +5,7 @@
   234.4  Example of Mutual Induction via Iteratived Inductive Definitions: Commands
   234.5  *)
   234.6  
   234.7 -header{*Mutual Induction via Iteratived Inductive Definitions*}
   234.8 +section{*Mutual Induction via Iteratived Inductive Definitions*}
   234.9  
  234.10  theory Com imports Main begin
  234.11  
   235.1 --- a/src/HOL/Induct/Comb.thy	Sun Nov 02 18:21:14 2014 +0100
   235.2 +++ b/src/HOL/Induct/Comb.thy	Sun Nov 02 18:21:45 2014 +0100
   235.3 @@ -3,7 +3,7 @@
   235.4      Copyright   1996  University of Cambridge
   235.5  *)
   235.6  
   235.7 -header {* Combinatory Logic example: the Church-Rosser Theorem *}
   235.8 +section {* Combinatory Logic example: the Church-Rosser Theorem *}
   235.9  
  235.10  theory Comb imports Main begin
  235.11  
   236.1 --- a/src/HOL/Induct/Common_Patterns.thy	Sun Nov 02 18:21:14 2014 +0100
   236.2 +++ b/src/HOL/Induct/Common_Patterns.thy	Sun Nov 02 18:21:45 2014 +0100
   236.3 @@ -2,7 +2,7 @@
   236.4      Author:     Makarius
   236.5  *)
   236.6  
   236.7 -header {* Common patterns of induction *}
   236.8 +section {* Common patterns of induction *}
   236.9  
  236.10  theory Common_Patterns
  236.11  imports Main
   237.1 --- a/src/HOL/Induct/Ordinals.thy	Sun Nov 02 18:21:14 2014 +0100
   237.2 +++ b/src/HOL/Induct/Ordinals.thy	Sun Nov 02 18:21:45 2014 +0100
   237.3 @@ -2,7 +2,7 @@
   237.4      Author:     Stefan Berghofer and Markus Wenzel, TU Muenchen
   237.5  *)
   237.6  
   237.7 -header {* Ordinals *}
   237.8 +section {* Ordinals *}
   237.9  
  237.10  theory Ordinals
  237.11  imports Main
   238.1 --- a/src/HOL/Induct/PropLog.thy	Sun Nov 02 18:21:14 2014 +0100
   238.2 +++ b/src/HOL/Induct/PropLog.thy	Sun Nov 02 18:21:45 2014 +0100
   238.3 @@ -3,7 +3,7 @@
   238.4      Copyright   1994  TU Muenchen & University of Cambridge
   238.5  *)
   238.6  
   238.7 -header {* Meta-theory of propositional logic *}
   238.8 +section {* Meta-theory of propositional logic *}
   238.9  
  238.10  theory PropLog imports Main begin
  238.11  
   239.1 --- a/src/HOL/Induct/QuoDataType.thy	Sun Nov 02 18:21:14 2014 +0100
   239.2 +++ b/src/HOL/Induct/QuoDataType.thy	Sun Nov 02 18:21:45 2014 +0100
   239.3 @@ -3,7 +3,7 @@
   239.4      Copyright   2004  University of Cambridge
   239.5  *)
   239.6  
   239.7 -header{*Defining an Initial Algebra by Quotienting a Free Algebra*}
   239.8 +section{*Defining an Initial Algebra by Quotienting a Free Algebra*}
   239.9  
  239.10  theory QuoDataType imports Main begin
  239.11  
   240.1 --- a/src/HOL/Induct/QuoNestedDataType.thy	Sun Nov 02 18:21:14 2014 +0100
   240.2 +++ b/src/HOL/Induct/QuoNestedDataType.thy	Sun Nov 02 18:21:45 2014 +0100
   240.3 @@ -3,7 +3,7 @@
   240.4      Copyright   2004  University of Cambridge
   240.5  *)
   240.6  
   240.7 -header{*Quotienting a Free Algebra Involving Nested Recursion*}
   240.8 +section{*Quotienting a Free Algebra Involving Nested Recursion*}
   240.9  
  240.10  theory QuoNestedDataType imports Main begin
  240.11  
   241.1 --- a/src/HOL/Induct/SList.thy	Sun Nov 02 18:21:14 2014 +0100
   241.2 +++ b/src/HOL/Induct/SList.thy	Sun Nov 02 18:21:45 2014 +0100
   241.3 @@ -21,7 +21,7 @@
   241.4  datatype 'a m = Node 'a * 'a m list
   241.5  *)
   241.6  
   241.7 -header {* Extended List Theory (old) *}
   241.8 +section {* Extended List Theory (old) *}
   241.9  
  241.10  theory SList
  241.11  imports Sexp
   242.1 --- a/src/HOL/Induct/Sigma_Algebra.thy	Sun Nov 02 18:21:14 2014 +0100
   242.2 +++ b/src/HOL/Induct/Sigma_Algebra.thy	Sun Nov 02 18:21:45 2014 +0100
   242.3 @@ -2,7 +2,7 @@
   242.4      Author:     Markus Wenzel, TU Muenchen
   242.5  *)
   242.6  
   242.7 -header {* Sigma algebras *}
   242.8 +section {* Sigma algebras *}
   242.9  
  242.10  theory Sigma_Algebra
  242.11  imports Main
   243.1 --- a/src/HOL/Induct/Term.thy	Sun Nov 02 18:21:14 2014 +0100
   243.2 +++ b/src/HOL/Induct/Term.thy	Sun Nov 02 18:21:45 2014 +0100
   243.3 @@ -2,7 +2,7 @@
   243.4      Author:     Stefan Berghofer,  TU Muenchen
   243.5  *)
   243.6  
   243.7 -header {* Terms over a given alphabet *}
   243.8 +section {* Terms over a given alphabet *}
   243.9  
  243.10  theory Term
  243.11  imports Main
   244.1 --- a/src/HOL/Induct/Tree.thy	Sun Nov 02 18:21:14 2014 +0100
   244.2 +++ b/src/HOL/Induct/Tree.thy	Sun Nov 02 18:21:45 2014 +0100
   244.3 @@ -3,7 +3,7 @@
   244.4      Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
   244.5  *)
   244.6  
   244.7 -header {* Infinitely branching trees *}
   244.8 +section {* Infinitely branching trees *}
   244.9  
  244.10  theory Tree
  244.11  imports Main
   245.1 --- a/src/HOL/Inductive.thy	Sun Nov 02 18:21:14 2014 +0100
   245.2 +++ b/src/HOL/Inductive.thy	Sun Nov 02 18:21:45 2014 +0100
   245.3 @@ -2,7 +2,7 @@
   245.4      Author:     Markus Wenzel, TU Muenchen
   245.5  *)
   245.6  
   245.7 -header {* Knaster-Tarski Fixpoint Theorem and inductive definitions *}
   245.8 +section {* Knaster-Tarski Fixpoint Theorem and inductive definitions *}
   245.9  
  245.10  theory Inductive
  245.11  imports Complete_Lattices Ctr_Sugar
   246.1 --- a/src/HOL/Int.thy	Sun Nov 02 18:21:14 2014 +0100
   246.2 +++ b/src/HOL/Int.thy	Sun Nov 02 18:21:45 2014 +0100
   246.3 @@ -3,7 +3,7 @@
   246.4      Author:     Tobias Nipkow, Florian Haftmann, TU Muenchen
   246.5  *)
   246.6  
   246.7 -header {* The Integers as Equivalence Classes over Pairs of Natural Numbers *} 
   246.8 +section {* The Integers as Equivalence Classes over Pairs of Natural Numbers *} 
   246.9  
  246.10  theory Int
  246.11  imports Equiv_Relations Power Quotient Fun_Def
   247.1 --- a/src/HOL/Lattices.thy	Sun Nov 02 18:21:14 2014 +0100
   247.2 +++ b/src/HOL/Lattices.thy	Sun Nov 02 18:21:45 2014 +0100
   247.3 @@ -2,7 +2,7 @@
   247.4      Author:     Tobias Nipkow
   247.5  *)
   247.6  
   247.7 -header {* Abstract lattices *}
   247.8 +section {* Abstract lattices *}
   247.9  
  247.10  theory Lattices
  247.11  imports Groups
   248.1 --- a/src/HOL/Lattices_Big.thy	Sun Nov 02 18:21:14 2014 +0100
   248.2 +++ b/src/HOL/Lattices_Big.thy	Sun Nov 02 18:21:45 2014 +0100
   248.3 @@ -3,7 +3,7 @@
   248.4                  with contributions by Jeremy Avigad
   248.5  *)
   248.6  
   248.7 -header {* Big infimum (minimum) and supremum (maximum) over finite (non-empty) sets *}
   248.8 +section {* Big infimum (minimum) and supremum (maximum) over finite (non-empty) sets *}
   248.9  
  248.10  theory Lattices_Big
  248.11  imports Finite_Set Option
   249.1 --- a/src/HOL/Lazy_Sequence.thy	Sun Nov 02 18:21:14 2014 +0100
   249.2 +++ b/src/HOL/Lazy_Sequence.thy	Sun Nov 02 18:21:45 2014 +0100
   249.3 @@ -1,6 +1,6 @@
   249.4  (* Author: Lukas Bulwahn, TU Muenchen *)
   249.5  
   249.6 -header {* Lazy sequences *}
   249.7 +section {* Lazy sequences *}
   249.8  
   249.9  theory Lazy_Sequence
  249.10  imports Predicate
   250.1 --- a/src/HOL/Lifting.thy	Sun Nov 02 18:21:14 2014 +0100
   250.2 +++ b/src/HOL/Lifting.thy	Sun Nov 02 18:21:45 2014 +0100
   250.3 @@ -3,7 +3,7 @@
   250.4      Author:     Cezary Kaliszyk and Christian Urban
   250.5  *)
   250.6  
   250.7 -header {* Lifting package *}
   250.8 +section {* Lifting package *}
   250.9  
  250.10  theory Lifting
  250.11  imports Equiv_Relations Transfer
   251.1 --- a/src/HOL/Lifting_Option.thy	Sun Nov 02 18:21:14 2014 +0100
   251.2 +++ b/src/HOL/Lifting_Option.thy	Sun Nov 02 18:21:45 2014 +0100
   251.3 @@ -3,7 +3,7 @@
   251.4      Author:     Andreas Lochbihler, Karlsruhe Institute of Technology
   251.5  *)
   251.6  
   251.7 -header {* Setup for Lifting/Transfer for the option type *}
   251.8 +section {* Setup for Lifting/Transfer for the option type *}
   251.9  
  251.10  theory Lifting_Option
  251.11  imports Lifting Option
   252.1 --- a/src/HOL/Lifting_Product.thy	Sun Nov 02 18:21:14 2014 +0100
   252.2 +++ b/src/HOL/Lifting_Product.thy	Sun Nov 02 18:21:45 2014 +0100
   252.3 @@ -2,7 +2,7 @@
   252.4      Author:     Brian Huffman and Ondrej Kuncar
   252.5  *)
   252.6  
   252.7 -header {* Setup for Lifting/Transfer for the product type *}
   252.8 +section {* Setup for Lifting/Transfer for the product type *}
   252.9  
  252.10  theory Lifting_Product
  252.11  imports Lifting Basic_BNFs
   253.1 --- a/src/HOL/Lifting_Set.thy	Sun Nov 02 18:21:14 2014 +0100
   253.2 +++ b/src/HOL/Lifting_Set.thy	Sun Nov 02 18:21:45 2014 +0100
   253.3 @@ -2,7 +2,7 @@
   253.4      Author:     Brian Huffman and Ondrej Kuncar
   253.5  *)
   253.6  
   253.7 -header {* Setup for Lifting/Transfer for the set type *}
   253.8 +section {* Setup for Lifting/Transfer for the set type *}
   253.9  
  253.10  theory Lifting_Set
  253.11  imports Lifting
   254.1 --- a/src/HOL/Lifting_Sum.thy	Sun Nov 02 18:21:14 2014 +0100
   254.2 +++ b/src/HOL/Lifting_Sum.thy	Sun Nov 02 18:21:45 2014 +0100
   254.3 @@ -2,7 +2,7 @@
   254.4      Author:     Brian Huffman and Ondrej Kuncar
   254.5  *)
   254.6  
   254.7 -header {* Setup for Lifting/Transfer for the sum type *}
   254.8 +section {* Setup for Lifting/Transfer for the sum type *}
   254.9  
  254.10  theory Lifting_Sum
  254.11  imports Lifting Basic_BNFs
   255.1 --- a/src/HOL/Limited_Sequence.thy	Sun Nov 02 18:21:14 2014 +0100
   255.2 +++ b/src/HOL/Limited_Sequence.thy	Sun Nov 02 18:21:45 2014 +0100
   255.3 @@ -1,7 +1,7 @@
   255.4  
   255.5  (* Author: Lukas Bulwahn, TU Muenchen *)
   255.6  
   255.7 -header {* Depth-Limited Sequences with failure element *}
   255.8 +section {* Depth-Limited Sequences with failure element *}
   255.9  
  255.10  theory Limited_Sequence
  255.11  imports Lazy_Sequence
   256.1 --- a/src/HOL/Limits.thy	Sun Nov 02 18:21:14 2014 +0100
   256.2 +++ b/src/HOL/Limits.thy	Sun Nov 02 18:21:45 2014 +0100
   256.3 @@ -5,7 +5,7 @@
   256.4      Author:     Jeremy Avigad
   256.5  *)
   256.6  
   256.7 -header {* Limits on Real Vector Spaces *}
   256.8 +section {* Limits on Real Vector Spaces *}
   256.9  
  256.10  theory Limits
  256.11  imports Real_Vector_Spaces
   257.1 --- a/src/HOL/List.thy	Sun Nov 02 18:21:14 2014 +0100
   257.2 +++ b/src/HOL/List.thy	Sun Nov 02 18:21:45 2014 +0100
   257.3 @@ -2,7 +2,7 @@
   257.4      Author:     Tobias Nipkow
   257.5  *)
   257.6  
   257.7 -header {* The datatype of finite lists *}
   257.8 +section {* The datatype of finite lists *}
   257.9  
  257.10  theory List
  257.11  imports Sledgehammer Code_Numeral Lifting_Set Lifting_Option Lifting_Product
   258.1 --- a/src/HOL/MacLaurin.thy	Sun Nov 02 18:21:14 2014 +0100
   258.2 +++ b/src/HOL/MacLaurin.thy	Sun Nov 02 18:21:45 2014 +0100
   258.3 @@ -4,7 +4,7 @@
   258.4      Conversion of Mac Laurin to Isar by Lukas Bulwahn and Bernhard Häupler, 2005
   258.5  *)
   258.6  
   258.7 -header{*MacLaurin Series*}
   258.8 +section{*MacLaurin Series*}
   258.9  
  258.10  theory MacLaurin
  258.11  imports Transcendental
   259.1 --- a/src/HOL/Main.thy	Sun Nov 02 18:21:14 2014 +0100
   259.2 +++ b/src/HOL/Main.thy	Sun Nov 02 18:21:45 2014 +0100
   259.3 @@ -1,4 +1,4 @@
   259.4 -header {* Main HOL *}
   259.5 +section {* Main HOL *}
   259.6  
   259.7  theory Main
   259.8  imports Predicate_Compile Quickcheck_Narrowing Extraction Lifting_Sum Coinduction Nitpick
   260.1 --- a/src/HOL/Map.thy	Sun Nov 02 18:21:14 2014 +0100
   260.2 +++ b/src/HOL/Map.thy	Sun Nov 02 18:21:45 2014 +0100
   260.3 @@ -5,7 +5,7 @@
   260.4  The datatype of `maps' (written ~=>); strongly resembles maps in VDM.
   260.5  *)
   260.6  
   260.7 -header {* Maps *}
   260.8 +section {* Maps *}
   260.9  
  260.10  theory Map
  260.11  imports List
   261.1 --- a/src/HOL/Matrix_LP/ComputeFloat.thy	Sun Nov 02 18:21:14 2014 +0100
   261.2 +++ b/src/HOL/Matrix_LP/ComputeFloat.thy	Sun Nov 02 18:21:45 2014 +0100
   261.3 @@ -2,7 +2,7 @@
   261.4      Author:     Steven Obua
   261.5  *)
   261.6  
   261.7 -header {* Floating Point Representation of the Reals *}
   261.8 +section {* Floating Point Representation of the Reals *}
   261.9  
  261.10  theory ComputeFloat
  261.11  imports Complex_Main "~~/src/HOL/Library/Lattice_Algebras"
   262.1 --- a/src/HOL/Meson.thy	Sun Nov 02 18:21:14 2014 +0100
   262.2 +++ b/src/HOL/Meson.thy	Sun Nov 02 18:21:45 2014 +0100
   262.3 @@ -5,7 +5,7 @@
   262.4      Copyright   2001  University of Cambridge
   262.5  *)
   262.6  
   262.7 -header {* MESON Proof Method *}
   262.8 +section {* MESON Proof Method *}
   262.9  
  262.10  theory Meson
  262.11  imports Nat
   263.1 --- a/src/HOL/Metis.thy	Sun Nov 02 18:21:14 2014 +0100
   263.2 +++ b/src/HOL/Metis.thy	Sun Nov 02 18:21:45 2014 +0100
   263.3 @@ -4,7 +4,7 @@
   263.4      Author:     Jasmin Blanchette, TU Muenchen
   263.5  *)
   263.6  
   263.7 -header {* Metis Proof Method *}
   263.8 +section {* Metis Proof Method *}
   263.9  
  263.10  theory Metis
  263.11  imports ATP
   264.1 --- a/src/HOL/Metis_Examples/Abstraction.thy	Sun Nov 02 18:21:14 2014 +0100
   264.2 +++ b/src/HOL/Metis_Examples/Abstraction.thy	Sun Nov 02 18:21:45 2014 +0100
   264.3 @@ -5,7 +5,7 @@
   264.4  Example featuring Metis's support for lambda-abstractions.
   264.5  *)
   264.6  
   264.7 -header {* Example Featuring Metis's Support for Lambda-Abstractions *}
   264.8 +section {* Example Featuring Metis's Support for Lambda-Abstractions *}
   264.9  
  264.10  theory Abstraction
  264.11  imports "~~/src/HOL/Library/FuncSet"
   265.1 --- a/src/HOL/Metis_Examples/Big_O.thy	Sun Nov 02 18:21:14 2014 +0100
   265.2 +++ b/src/HOL/Metis_Examples/Big_O.thy	Sun Nov 02 18:21:45 2014 +0100
   265.3 @@ -5,7 +5,7 @@
   265.4  Metis example featuring the Big O notation.
   265.5  *)
   265.6  
   265.7 -header {* Metis Example Featuring the Big O Notation *}
   265.8 +section {* Metis Example Featuring the Big O Notation *}
   265.9  
  265.10  theory Big_O
  265.11  imports
   266.1 --- a/src/HOL/Metis_Examples/Binary_Tree.thy	Sun Nov 02 18:21:14 2014 +0100
   266.2 +++ b/src/HOL/Metis_Examples/Binary_Tree.thy	Sun Nov 02 18:21:45 2014 +0100
   266.3 @@ -5,7 +5,7 @@
   266.4  Metis example featuring binary trees.
   266.5  *)
   266.6  
   266.7 -header {* Metis Example Featuring Binary Trees *}
   266.8 +section {* Metis Example Featuring Binary Trees *}
   266.9  
  266.10  theory Binary_Tree
  266.11  imports Main
   267.1 --- a/src/HOL/Metis_Examples/Clausification.thy	Sun Nov 02 18:21:14 2014 +0100
   267.2 +++ b/src/HOL/Metis_Examples/Clausification.thy	Sun Nov 02 18:21:45 2014 +0100
   267.3 @@ -4,7 +4,7 @@
   267.4  Example that exercises Metis's Clausifier.
   267.5  *)
   267.6  
   267.7 -header {* Example that Exercises Metis's Clausifier *}
   267.8 +section {* Example that Exercises Metis's Clausifier *}
   267.9  
  267.10  theory Clausification
  267.11  imports Complex_Main
   268.1 --- a/src/HOL/Metis_Examples/Message.thy	Sun Nov 02 18:21:14 2014 +0100
   268.2 +++ b/src/HOL/Metis_Examples/Message.thy	Sun Nov 02 18:21:45 2014 +0100
   268.3 @@ -5,7 +5,7 @@
   268.4  Metis example featuring message authentication.
   268.5  *)
   268.6  
   268.7 -header {* Metis Example Featuring Message Authentication *}
   268.8 +section {* Metis Example Featuring Message Authentication *}
   268.9  
  268.10  theory Message
  268.11  imports Main
   269.1 --- a/src/HOL/Metis_Examples/Proxies.thy	Sun Nov 02 18:21:14 2014 +0100
   269.2 +++ b/src/HOL/Metis_Examples/Proxies.thy	Sun Nov 02 18:21:45 2014 +0100
   269.3 @@ -5,7 +5,7 @@
   269.4  rudimentary higher-order reasoning.
   269.5  *)
   269.6  
   269.7 -header {*
   269.8 +section {*
   269.9  Example that Exercises Metis's and Sledgehammer's Logical Symbol Proxies for
  269.10  Rudimentary Higher-Order Reasoning.
  269.11  *}
   270.1 --- a/src/HOL/Metis_Examples/Sets.thy	Sun Nov 02 18:21:14 2014 +0100
   270.2 +++ b/src/HOL/Metis_Examples/Sets.thy	Sun Nov 02 18:21:45 2014 +0100
   270.3 @@ -5,7 +5,7 @@
   270.4  Metis example featuring typed set theory.
   270.5  *)
   270.6  
   270.7 -header {* Metis Example Featuring Typed Set Theory *}
   270.8 +section {* Metis Example Featuring Typed Set Theory *}
   270.9  
  270.10  theory Sets
  270.11  imports Main
   271.1 --- a/src/HOL/Metis_Examples/Tarski.thy	Sun Nov 02 18:21:14 2014 +0100
   271.2 +++ b/src/HOL/Metis_Examples/Tarski.thy	Sun Nov 02 18:21:45 2014 +0100
   271.3 @@ -5,7 +5,7 @@
   271.4  Metis example featuring the full theorem of Tarski.
   271.5  *)
   271.6  
   271.7 -header {* Metis Example Featuring the Full Theorem of Tarski *}
   271.8 +section {* Metis Example Featuring the Full Theorem of Tarski *}
   271.9  
  271.10  theory Tarski
  271.11  imports Main "~~/src/HOL/Library/FuncSet"
   272.1 --- a/src/HOL/Metis_Examples/Trans_Closure.thy	Sun Nov 02 18:21:14 2014 +0100
   272.2 +++ b/src/HOL/Metis_Examples/Trans_Closure.thy	Sun Nov 02 18:21:45 2014 +0100
   272.3 @@ -5,7 +5,7 @@
   272.4  Metis example featuring the transitive closure.
   272.5  *)
   272.6  
   272.7 -header {* Metis Example Featuring the Transitive Closure *}
   272.8 +section {* Metis Example Featuring the Transitive Closure *}
   272.9  
  272.10  theory Trans_Closure
  272.11  imports Main
   273.1 --- a/src/HOL/Metis_Examples/Type_Encodings.thy	Sun Nov 02 18:21:14 2014 +0100
   273.2 +++ b/src/HOL/Metis_Examples/Type_Encodings.thy	Sun Nov 02 18:21:45 2014 +0100
   273.3 @@ -4,7 +4,7 @@
   273.4  Example that exercises Metis's (and hence Sledgehammer's) type encodings.
   273.5  *)
   273.6  
   273.7 -header {*
   273.8 +section {*
   273.9  Example that Exercises Metis's (and Hence Sledgehammer's) Type Encodings
  273.10  *}
  273.11  
   274.1 --- a/src/HOL/Mirabelle/Mirabelle_Test.thy	Sun Nov 02 18:21:14 2014 +0100
   274.2 +++ b/src/HOL/Mirabelle/Mirabelle_Test.thy	Sun Nov 02 18:21:45 2014 +0100
   274.3 @@ -2,7 +2,7 @@
   274.4      Author:     Sascha Boehme, TU Munich
   274.5  *)
   274.6  
   274.7 -header {* Simple test theory for Mirabelle actions *}
   274.8 +section {* Simple test theory for Mirabelle actions *}
   274.9  
  274.10  theory Mirabelle_Test
  274.11  imports Main Mirabelle
   275.1 --- a/src/HOL/NanoJava/AxSem.thy	Sun Nov 02 18:21:14 2014 +0100
   275.2 +++ b/src/HOL/NanoJava/AxSem.thy	Sun Nov 02 18:21:45 2014 +0100
   275.3 @@ -2,7 +2,7 @@
   275.4      Author:     David von Oheimb, Technische Universitaet Muenchen
   275.5  *)
   275.6  
   275.7 -header "Axiomatic Semantics"
   275.8 +section "Axiomatic Semantics"
   275.9  
  275.10  theory AxSem imports State begin
  275.11  
   276.1 --- a/src/HOL/NanoJava/Decl.thy	Sun Nov 02 18:21:14 2014 +0100
   276.2 +++ b/src/HOL/NanoJava/Decl.thy	Sun Nov 02 18:21:45 2014 +0100
   276.3 @@ -3,7 +3,7 @@
   276.4      Copyright   2001 Technische Universitaet Muenchen
   276.5  *)
   276.6  
   276.7 -header "Types, class Declarations, and whole programs"
   276.8 +section "Types, class Declarations, and whole programs"
   276.9  
  276.10  theory Decl imports Term begin
  276.11  
   277.1 --- a/src/HOL/NanoJava/Equivalence.thy	Sun Nov 02 18:21:14 2014 +0100
   277.2 +++ b/src/HOL/NanoJava/Equivalence.thy	Sun Nov 02 18:21:45 2014 +0100
   277.3 @@ -3,7 +3,7 @@
   277.4      Copyright   2001 Technische Universitaet Muenchen
   277.5  *)
   277.6  
   277.7 -header "Equivalence of Operational and Axiomatic Semantics"
   277.8 +section "Equivalence of Operational and Axiomatic Semantics"
   277.9  
  277.10  theory Equivalence imports OpSem AxSem begin
  277.11  
   278.1 --- a/src/HOL/NanoJava/Example.thy	Sun Nov 02 18:21:14 2014 +0100
   278.2 +++ b/src/HOL/NanoJava/Example.thy	Sun Nov 02 18:21:45 2014 +0100
   278.3 @@ -3,7 +3,7 @@
   278.4      Copyright   2001 Technische Universitaet Muenchen
   278.5  *)
   278.6  
   278.7 -header "Example"
   278.8 +section "Example"
   278.9  
  278.10  theory Example
  278.11  imports Equivalence
   279.1 --- a/src/HOL/NanoJava/OpSem.thy	Sun Nov 02 18:21:14 2014 +0100
   279.2 +++ b/src/HOL/NanoJava/OpSem.thy	Sun Nov 02 18:21:45 2014 +0100
   279.3 @@ -3,7 +3,7 @@
   279.4      Copyright   2001 Technische Universitaet Muenchen
   279.5  *)
   279.6  
   279.7 -header "Operational Evaluation Semantics"
   279.8 +section "Operational Evaluation Semantics"
   279.9  
  279.10  theory OpSem imports State begin
  279.11  
   280.1 --- a/src/HOL/NanoJava/State.thy	Sun Nov 02 18:21:14 2014 +0100
   280.2 +++ b/src/HOL/NanoJava/State.thy	Sun Nov 02 18:21:45 2014 +0100
   280.3 @@ -3,7 +3,7 @@
   280.4      Copyright   2001 Technische Universitaet Muenchen
   280.5  *)
   280.6  
   280.7 -header "Program State"
   280.8 +section "Program State"
   280.9  
  280.10  theory State imports TypeRel begin
  280.11  
   281.1 --- a/src/HOL/NanoJava/Term.thy	Sun Nov 02 18:21:14 2014 +0100
   281.2 +++ b/src/HOL/NanoJava/Term.thy	Sun Nov 02 18:21:45 2014 +0100
   281.3 @@ -2,7 +2,7 @@
   281.4      Author:     David von Oheimb, Technische Universitaet Muenchen
   281.5  *)
   281.6  
   281.7 -header "Statements and expression emulations"
   281.8 +section "Statements and expression emulations"
   281.9  
  281.10  theory Term imports Main begin
  281.11  
   282.1 --- a/src/HOL/NanoJava/TypeRel.thy	Sun Nov 02 18:21:14 2014 +0100
   282.2 +++ b/src/HOL/NanoJava/TypeRel.thy	Sun Nov 02 18:21:45 2014 +0100
   282.3 @@ -2,7 +2,7 @@
   282.4      Author:     David von Oheimb, Technische Universitaet Muenchen
   282.5  *)
   282.6  
   282.7 -header "Type relations"
   282.8 +section "Type relations"
   282.9  
  282.10  theory TypeRel
  282.11  imports Decl
   283.1 --- a/src/HOL/Nat.thy	Sun Nov 02 18:21:14 2014 +0100
   283.2 +++ b/src/HOL/Nat.thy	Sun Nov 02 18:21:45 2014 +0100
   283.3 @@ -5,7 +5,7 @@
   283.4  and * (for div and mod, see theory Divides).
   283.5  *)
   283.6  
   283.7 -header {* Natural numbers *}
   283.8 +section {* Natural numbers *}
   283.9  
  283.10  theory Nat
  283.11  imports Inductive Typedef Fun Fields
   284.1 --- a/src/HOL/Nat_Transfer.thy	Sun Nov 02 18:21:14 2014 +0100
   284.2 +++ b/src/HOL/Nat_Transfer.thy	Sun Nov 02 18:21:45 2014 +0100
   284.3 @@ -1,7 +1,7 @@
   284.4  
   284.5  (* Authors: Jeremy Avigad and Amine Chaieb *)
   284.6  
   284.7 -header {* Generic transfer machinery;  specific transfer from nats to ints and back. *}
   284.8 +section {* Generic transfer machinery;  specific transfer from nats to ints and back. *}
   284.9  
  284.10  theory Nat_Transfer
  284.11  imports Int
   285.1 --- a/src/HOL/Nitpick.thy	Sun Nov 02 18:21:14 2014 +0100
   285.2 +++ b/src/HOL/Nitpick.thy	Sun Nov 02 18:21:45 2014 +0100
   285.3 @@ -5,7 +5,7 @@
   285.4  Nitpick: Yet another counterexample generator for Isabelle/HOL.
   285.5  *)
   285.6  
   285.7 -header {* Nitpick: Yet Another Counterexample Generator for Isabelle/HOL *}
   285.8 +section {* Nitpick: Yet Another Counterexample Generator for Isabelle/HOL *}
   285.9  
  285.10  theory Nitpick
  285.11  imports Record
   286.1 --- a/src/HOL/Nitpick_Examples/Core_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   286.2 +++ b/src/HOL/Nitpick_Examples/Core_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   286.3 @@ -5,7 +5,7 @@
   286.4  Examples featuring Nitpick's functional core.
   286.5  *)
   286.6  
   286.7 -header {* Examples Featuring Nitpick's Functional Core *}
   286.8 +section {* Examples Featuring Nitpick's Functional Core *}
   286.9  
  286.10  theory Core_Nits
  286.11  imports Main
   287.1 --- a/src/HOL/Nitpick_Examples/Datatype_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   287.2 +++ b/src/HOL/Nitpick_Examples/Datatype_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   287.3 @@ -5,7 +5,7 @@
   287.4  Examples featuring Nitpick applied to datatypes.
   287.5  *)
   287.6  
   287.7 -header {* Examples Featuring Nitpick Applied to Datatypes *}
   287.8 +section {* Examples Featuring Nitpick Applied to Datatypes *}
   287.9  
  287.10  theory Datatype_Nits
  287.11  imports Main
   288.1 --- a/src/HOL/Nitpick_Examples/Hotel_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   288.2 +++ b/src/HOL/Nitpick_Examples/Hotel_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   288.3 @@ -5,7 +5,7 @@
   288.4  Nitpick example based on Tobias Nipkow's hotel key card formalization.
   288.5  *)
   288.6  
   288.7 -header {* Nitpick Example Based on Tobias Nipkow's Hotel Key Card
   288.8 +section {* Nitpick Example Based on Tobias Nipkow's Hotel Key Card
   288.9            Formalization *}
  288.10  
  288.11  theory Hotel_Nits
   289.1 --- a/src/HOL/Nitpick_Examples/Induct_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   289.2 +++ b/src/HOL/Nitpick_Examples/Induct_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   289.3 @@ -5,7 +5,7 @@
   289.4  Examples featuring Nitpick applied to (co)inductive definitions.
   289.5  *)
   289.6  
   289.7 -header {* Examples Featuring Nitpick Applied to (Co)inductive Definitions *}
   289.8 +section {* Examples Featuring Nitpick Applied to (Co)inductive Definitions *}
   289.9  
  289.10  theory Induct_Nits
  289.11  imports Main
   290.1 --- a/src/HOL/Nitpick_Examples/Integer_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   290.2 +++ b/src/HOL/Nitpick_Examples/Integer_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   290.3 @@ -5,7 +5,7 @@
   290.4  Examples featuring Nitpick applied to natural numbers and integers.
   290.5  *)
   290.6  
   290.7 -header {* Examples Featuring Nitpick Applied to Natural Numbers and Integers *}
   290.8 +section {* Examples Featuring Nitpick Applied to Natural Numbers and Integers *}
   290.9  
  290.10  theory Integer_Nits
  290.11  imports Main
   291.1 --- a/src/HOL/Nitpick_Examples/Manual_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   291.2 +++ b/src/HOL/Nitpick_Examples/Manual_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   291.3 @@ -5,7 +5,7 @@
   291.4  Examples from the Nitpick manual.
   291.5  *)
   291.6  
   291.7 -header {* Examples from the Nitpick Manual *}
   291.8 +section {* Examples from the Nitpick Manual *}
   291.9  
  291.10  (* The "expect" arguments to Nitpick in this theory and the other example
  291.11     theories are there so that the example can also serve as a regression test
   292.1 --- a/src/HOL/Nitpick_Examples/Mini_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   292.2 +++ b/src/HOL/Nitpick_Examples/Mini_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   292.3 @@ -5,7 +5,7 @@
   292.4  Examples featuring Minipick, the minimalistic version of Nitpick.
   292.5  *)
   292.6  
   292.7 -header {* Examples Featuring Minipick, the Minimalistic Version of Nitpick *}
   292.8 +section {* Examples Featuring Minipick, the Minimalistic Version of Nitpick *}
   292.9  
  292.10  theory Mini_Nits
  292.11  imports Main
   293.1 --- a/src/HOL/Nitpick_Examples/Mono_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   293.2 +++ b/src/HOL/Nitpick_Examples/Mono_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   293.3 @@ -5,7 +5,7 @@
   293.4  Examples featuring Nitpick's monotonicity check.
   293.5  *)
   293.6  
   293.7 -header {* Examples Featuring Nitpick's Monotonicity Check *}
   293.8 +section {* Examples Featuring Nitpick's Monotonicity Check *}
   293.9  
  293.10  theory Mono_Nits
  293.11  imports Main
   294.1 --- a/src/HOL/Nitpick_Examples/Pattern_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   294.2 +++ b/src/HOL/Nitpick_Examples/Pattern_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   294.3 @@ -5,7 +5,7 @@
   294.4  Examples featuring Nitpick's "destroy_constrs" optimization.
   294.5  *)
   294.6  
   294.7 -header {* Examples Featuring Nitpick's \textit{destroy\_constrs} Optimization *}
   294.8 +section {* Examples Featuring Nitpick's \textit{destroy\_constrs} Optimization *}
   294.9  
  294.10  theory Pattern_Nits
  294.11  imports Main
   295.1 --- a/src/HOL/Nitpick_Examples/Record_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   295.2 +++ b/src/HOL/Nitpick_Examples/Record_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   295.3 @@ -5,7 +5,7 @@
   295.4  Examples featuring Nitpick applied to records.
   295.5  *)
   295.6  
   295.7 -header {* Examples Featuring Nitpick Applied to Records *}
   295.8 +section {* Examples Featuring Nitpick Applied to Records *}
   295.9  
  295.10  theory Record_Nits
  295.11  imports Main
   296.1 --- a/src/HOL/Nitpick_Examples/Refute_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   296.2 +++ b/src/HOL/Nitpick_Examples/Refute_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   296.3 @@ -5,7 +5,7 @@
   296.4  Refute examples adapted to Nitpick.
   296.5  *)
   296.6  
   296.7 -header {* Refute Examples Adapted to Nitpick *}
   296.8 +section {* Refute Examples Adapted to Nitpick *}
   296.9  
  296.10  theory Refute_Nits
  296.11  imports Main
   297.1 --- a/src/HOL/Nitpick_Examples/Special_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   297.2 +++ b/src/HOL/Nitpick_Examples/Special_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   297.3 @@ -5,7 +5,7 @@
   297.4  Examples featuring Nitpick's "specialize" optimization.
   297.5  *)
   297.6  
   297.7 -header {* Examples Featuring Nitpick's \textit{specialize} Optimization *}
   297.8 +section {* Examples Featuring Nitpick's \textit{specialize} Optimization *}
   297.9  
  297.10  theory Special_Nits
  297.11  imports Main
   298.1 --- a/src/HOL/Nitpick_Examples/Tests_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   298.2 +++ b/src/HOL/Nitpick_Examples/Tests_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   298.3 @@ -5,7 +5,7 @@
   298.4  Nitpick tests.
   298.5  *)
   298.6  
   298.7 -header {* Nitpick Tests *}
   298.8 +section {* Nitpick Tests *}
   298.9  
  298.10  theory Tests_Nits
  298.11  imports Main
   299.1 --- a/src/HOL/Nitpick_Examples/Typedef_Nits.thy	Sun Nov 02 18:21:14 2014 +0100
   299.2 +++ b/src/HOL/Nitpick_Examples/Typedef_Nits.thy	Sun Nov 02 18:21:45 2014 +0100
   299.3 @@ -5,7 +5,7 @@
   299.4  Examples featuring Nitpick applied to typedefs.
   299.5  *)
   299.6  
   299.7 -header {* Examples Featuring Nitpick Applied to Typedefs *}
   299.8 +section {* Examples Featuring Nitpick Applied to Typedefs *}
   299.9  
  299.10  theory Typedef_Nits
  299.11  imports Complex_Main
   300.1 --- a/src/HOL/Nominal/Examples/Nominal_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   300.2 +++ b/src/HOL/Nominal/Examples/Nominal_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   300.3 @@ -1,6 +1,6 @@
   300.4  (*  Author:  Christian Urban TU Muenchen *)
   300.5  
   300.6 -header {* Various examples involving nominal datatypes. *}
   300.7 +section {* Various examples involving nominal datatypes. *}
   300.8  
   300.9  theory Nominal_Examples
  300.10  imports Nominal_Examples_Base Class3
   301.1 --- a/src/HOL/Nominal/Examples/Nominal_Examples_Base.thy	Sun Nov 02 18:21:14 2014 +0100
   301.2 +++ b/src/HOL/Nominal/Examples/Nominal_Examples_Base.thy	Sun Nov 02 18:21:45 2014 +0100
   301.3 @@ -1,6 +1,6 @@
   301.4  (*  Author:  Christian Urban TU Muenchen *)
   301.5  
   301.6 -header {* Various examples involving nominal datatypes. *}
   301.7 +section {* Various examples involving nominal datatypes. *}
   301.8  
   301.9  theory Nominal_Examples_Base
  301.10  imports
   302.1 --- a/src/HOL/Nominal/Examples/Pattern.thy	Sun Nov 02 18:21:14 2014 +0100
   302.2 +++ b/src/HOL/Nominal/Examples/Pattern.thy	Sun Nov 02 18:21:45 2014 +0100
   302.3 @@ -1,4 +1,4 @@
   302.4 -header {* Simply-typed lambda-calculus with let and tuple patterns *}
   302.5 +section {* Simply-typed lambda-calculus with let and tuple patterns *}
   302.6  
   302.7  theory Pattern
   302.8  imports "../Nominal"
   303.1 --- a/src/HOL/Nominal/Examples/Standardization.thy	Sun Nov 02 18:21:14 2014 +0100
   303.2 +++ b/src/HOL/Nominal/Examples/Standardization.thy	Sun Nov 02 18:21:45 2014 +0100
   303.3 @@ -3,7 +3,7 @@
   303.4      Copyright   2005, 2008 TU Muenchen
   303.5  *)
   303.6  
   303.7 -header {* Standardization *}
   303.8 +section {* Standardization *}
   303.9  
  303.10  theory Standardization
  303.11  imports "../Nominal"
   304.1 --- a/src/HOL/NthRoot.thy	Sun Nov 02 18:21:14 2014 +0100
   304.2 +++ b/src/HOL/NthRoot.thy	Sun Nov 02 18:21:45 2014 +0100
   304.3 @@ -4,7 +4,7 @@
   304.4      Conversion to Isar and new proofs by Lawrence C Paulson, 2004
   304.5  *)
   304.6  
   304.7 -header {* Nth Roots of Real Numbers *}
   304.8 +section {* Nth Roots of Real Numbers *}
   304.9  
  304.10  theory NthRoot
  304.11  imports Deriv
   305.1 --- a/src/HOL/Num.thy	Sun Nov 02 18:21:14 2014 +0100
   305.2 +++ b/src/HOL/Num.thy	Sun Nov 02 18:21:45 2014 +0100
   305.3 @@ -3,7 +3,7 @@
   305.4      Author:     Brian Huffman
   305.5  *)
   305.6  
   305.7 -header {* Binary Numerals *}
   305.8 +section {* Binary Numerals *}
   305.9  
  305.10  theory Num
  305.11  imports BNF_Least_Fixpoint
   306.1 --- a/src/HOL/Number_Theory/Binomial.thy	Sun Nov 02 18:21:14 2014 +0100
   306.2 +++ b/src/HOL/Number_Theory/Binomial.thy	Sun Nov 02 18:21:45 2014 +0100
   306.3 @@ -4,7 +4,7 @@
   306.4  Defines the "choose" function, and establishes basic properties.
   306.5  *)
   306.6  
   306.7 -header {* Binomial *}
   306.8 +section {* Binomial *}
   306.9  
  306.10  theory Binomial
  306.11  imports Cong Fact Complex_Main
   307.1 --- a/src/HOL/Number_Theory/Cong.thy	Sun Nov 02 18:21:14 2014 +0100
   307.2 +++ b/src/HOL/Number_Theory/Cong.thy	Sun Nov 02 18:21:45 2014 +0100
   307.3 @@ -23,7 +23,7 @@
   307.4  natural numbers and the integers, and added a number of new theorems.
   307.5  *)
   307.6  
   307.7 -header {* Congruence *}
   307.8 +section {* Congruence *}
   307.9  
  307.10  theory Cong
  307.11  imports Primes
   308.1 --- a/src/HOL/Number_Theory/Eratosthenes.thy	Sun Nov 02 18:21:14 2014 +0100
   308.2 +++ b/src/HOL/Number_Theory/Eratosthenes.thy	Sun Nov 02 18:21:45 2014 +0100
   308.3 @@ -2,7 +2,7 @@
   308.4      Author:     Florian Haftmann, TU Muenchen
   308.5  *)
   308.6  
   308.7 -header {* The sieve of Eratosthenes *}
   308.8 +section {* The sieve of Eratosthenes *}
   308.9  
  308.10  theory Eratosthenes
  308.11  imports Main Primes
   309.1 --- a/src/HOL/Number_Theory/Euclidean_Algorithm.thy	Sun Nov 02 18:21:14 2014 +0100
   309.2 +++ b/src/HOL/Number_Theory/Euclidean_Algorithm.thy	Sun Nov 02 18:21:45 2014 +0100
   309.3 @@ -1,6 +1,6 @@
   309.4  (* Author: Manuel Eberl *)
   309.5  
   309.6 -header {* Abstract euclidean algorithm *}
   309.7 +section {* Abstract euclidean algorithm *}
   309.8  
   309.9  theory Euclidean_Algorithm
  309.10  imports Complex_Main
   310.1 --- a/src/HOL/Number_Theory/Fib.thy	Sun Nov 02 18:21:14 2014 +0100
   310.2 +++ b/src/HOL/Number_Theory/Fib.thy	Sun Nov 02 18:21:45 2014 +0100
   310.3 @@ -8,7 +8,7 @@
   310.4  Jeremy Avigad.
   310.5  *)
   310.6  
   310.7 -header {* Fib *}
   310.8 +section {* Fib *}
   310.9  
  310.10  theory Fib
  310.11  imports Binomial
   311.1 --- a/src/HOL/Number_Theory/Gauss.thy	Sun Nov 02 18:21:14 2014 +0100
   311.2 +++ b/src/HOL/Number_Theory/Gauss.thy	Sun Nov 02 18:21:45 2014 +0100
   311.3 @@ -3,7 +3,7 @@
   311.4  Ported by lcp but unfinished
   311.5  *)
   311.6  
   311.7 -header {* Gauss' Lemma *}
   311.8 +section {* Gauss' Lemma *}
   311.9  
  311.10  theory Gauss
  311.11  imports Residues
   312.1 --- a/src/HOL/Number_Theory/Number_Theory.thy	Sun Nov 02 18:21:14 2014 +0100
   312.2 +++ b/src/HOL/Number_Theory/Number_Theory.thy	Sun Nov 02 18:21:45 2014 +0100
   312.3 @@ -1,5 +1,5 @@
   312.4  
   312.5 -header {* Comprehensive number theory *}
   312.6 +section {* Comprehensive number theory *}
   312.7  
   312.8  theory Number_Theory
   312.9  imports Fib Residues Eratosthenes
   313.1 --- a/src/HOL/Number_Theory/Pocklington.thy	Sun Nov 02 18:21:14 2014 +0100
   313.2 +++ b/src/HOL/Number_Theory/Pocklington.thy	Sun Nov 02 18:21:45 2014 +0100
   313.3 @@ -2,7 +2,7 @@
   313.4      Author:     Amine Chaieb
   313.5  *)
   313.6  
   313.7 -header {* Pocklington's Theorem for Primes *}
   313.8 +section {* Pocklington's Theorem for Primes *}
   313.9  
  313.10  theory Pocklington
  313.11  imports Residues
   314.1 --- a/src/HOL/Number_Theory/Primes.thy	Sun Nov 02 18:21:14 2014 +0100
   314.2 +++ b/src/HOL/Number_Theory/Primes.thy	Sun Nov 02 18:21:45 2014 +0100
   314.3 @@ -25,7 +25,7 @@
   314.4  *)
   314.5  
   314.6  
   314.7 -header {* Primes *}
   314.8 +section {* Primes *}
   314.9  
  314.10  theory Primes
  314.11  imports "~~/src/HOL/GCD"
   315.1 --- a/src/HOL/Number_Theory/Residues.thy	Sun Nov 02 18:21:14 2014 +0100
   315.2 +++ b/src/HOL/Number_Theory/Residues.thy	Sun Nov 02 18:21:45 2014 +0100
   315.3 @@ -5,7 +5,7 @@
   315.4  Euler's theorem and Wilson's theorem.
   315.5  *)
   315.6  
   315.7 -header {* Residue rings *}
   315.8 +section {* Residue rings *}
   315.9  
  315.10  theory Residues
  315.11  imports
   316.1 --- a/src/HOL/Number_Theory/UniqueFactorization.thy	Sun Nov 02 18:21:14 2014 +0100
   316.2 +++ b/src/HOL/Number_Theory/UniqueFactorization.thy	Sun Nov 02 18:21:45 2014 +0100
   316.3 @@ -8,7 +8,7 @@
   316.4  that, by Jeremy Avigad and David Gray.  
   316.5  *)
   316.6  
   316.7 -header {* UniqueFactorization *}
   316.8 +section {* UniqueFactorization *}
   316.9  
  316.10  theory UniqueFactorization
  316.11  imports Cong "~~/src/HOL/Library/Multiset"
   317.1 --- a/src/HOL/Numeral_Simprocs.thy	Sun Nov 02 18:21:14 2014 +0100
   317.2 +++ b/src/HOL/Numeral_Simprocs.thy	Sun Nov 02 18:21:45 2014 +0100
   317.3 @@ -1,6 +1,6 @@
   317.4  (* Author: Various *)
   317.5  
   317.6 -header {* Combination and Cancellation Simprocs for Numeral Expressions *}
   317.7 +section {* Combination and Cancellation Simprocs for Numeral Expressions *}
   317.8  
   317.9  theory Numeral_Simprocs
  317.10  imports Divides
   318.1 --- a/src/HOL/Old_Number_Theory/BijectionRel.thy	Sun Nov 02 18:21:14 2014 +0100
   318.2 +++ b/src/HOL/Old_Number_Theory/BijectionRel.thy	Sun Nov 02 18:21:45 2014 +0100
   318.3 @@ -3,7 +3,7 @@
   318.4      Copyright   2000  University of Cambridge
   318.5  *)
   318.6  
   318.7 -header {* Bijections between sets *}
   318.8 +section {* Bijections between sets *}
   318.9  
  318.10  theory BijectionRel
  318.11  imports Main
   319.1 --- a/src/HOL/Old_Number_Theory/Chinese.thy	Sun Nov 02 18:21:14 2014 +0100
   319.2 +++ b/src/HOL/Old_Number_Theory/Chinese.thy	Sun Nov 02 18:21:45 2014 +0100
   319.3 @@ -3,7 +3,7 @@
   319.4      Copyright   2000  University of Cambridge
   319.5  *)
   319.6  
   319.7 -header {* The Chinese Remainder Theorem *}
   319.8 +section {* The Chinese Remainder Theorem *}
   319.9  
  319.10  theory Chinese 
  319.11  imports IntPrimes
   320.1 --- a/src/HOL/Old_Number_Theory/Euler.thy	Sun Nov 02 18:21:14 2014 +0100
   320.2 +++ b/src/HOL/Old_Number_Theory/Euler.thy	Sun Nov 02 18:21:45 2014 +0100
   320.3 @@ -2,7 +2,7 @@
   320.4      Authors:    Jeremy Avigad, David Gray, and Adam Kramer
   320.5  *)
   320.6  
   320.7 -header {* Euler's criterion *}
   320.8 +section {* Euler's criterion *}
   320.9  
  320.10  theory Euler
  320.11  imports Residues EvenOdd
   321.1 --- a/src/HOL/Old_Number_Theory/EulerFermat.thy	Sun Nov 02 18:21:14 2014 +0100
   321.2 +++ b/src/HOL/Old_Number_Theory/EulerFermat.thy	Sun Nov 02 18:21:45 2014 +0100
   321.3 @@ -3,7 +3,7 @@
   321.4      Copyright   2000  University of Cambridge
   321.5  *)
   321.6  
   321.7 -header {* Fermat's Little Theorem extended to Euler's Totient function *}
   321.8 +section {* Fermat's Little Theorem extended to Euler's Totient function *}
   321.9  
  321.10  theory EulerFermat
  321.11  imports BijectionRel IntFact
   322.1 --- a/src/HOL/Old_Number_Theory/EvenOdd.thy	Sun Nov 02 18:21:14 2014 +0100
   322.2 +++ b/src/HOL/Old_Number_Theory/EvenOdd.thy	Sun Nov 02 18:21:45 2014 +0100
   322.3 @@ -2,7 +2,7 @@
   322.4      Authors:    Jeremy Avigad, David Gray, and Adam Kramer
   322.5  *)
   322.6  
   322.7 -header {*Parity: Even and Odd Integers*}
   322.8 +section {*Parity: Even and Odd Integers*}
   322.9  
  322.10  theory EvenOdd
  322.11  imports Int2
   323.1 --- a/src/HOL/Old_Number_Theory/Factorization.thy	Sun Nov 02 18:21:14 2014 +0100
   323.2 +++ b/src/HOL/Old_Number_Theory/Factorization.thy	Sun Nov 02 18:21:45 2014 +0100
   323.3 @@ -3,7 +3,7 @@
   323.4      Copyright   2000  University of Cambridge
   323.5  *)
   323.6  
   323.7 -header {* Fundamental Theorem of Arithmetic (unique factorization into primes) *}
   323.8 +section {* Fundamental Theorem of Arithmetic (unique factorization into primes) *}
   323.9  
  323.10  theory Factorization
  323.11  imports Primes "~~/src/HOL/Library/Permutation"
   324.1 --- a/src/HOL/Old_Number_Theory/Fib.thy	Sun Nov 02 18:21:14 2014 +0100
   324.2 +++ b/src/HOL/Old_Number_Theory/Fib.thy	Sun Nov 02 18:21:45 2014 +0100
   324.3 @@ -3,7 +3,7 @@
   324.4      Copyright   1997  University of Cambridge
   324.5  *)
   324.6  
   324.7 -header {* The Fibonacci function *}
   324.8 +section {* The Fibonacci function *}
   324.9  
  324.10  theory Fib
  324.11  imports Primes
   325.1 --- a/src/HOL/Old_Number_Theory/Finite2.thy	Sun Nov 02 18:21:14 2014 +0100
   325.2 +++ b/src/HOL/Old_Number_Theory/Finite2.thy	Sun Nov 02 18:21:45 2014 +0100
   325.3 @@ -2,7 +2,7 @@
   325.4      Authors:    Jeremy Avigad, David Gray, and Adam Kramer
   325.5  *)
   325.6  
   325.7 -header {*Finite Sets and Finite Sums*}
   325.8 +section {*Finite Sets and Finite Sums*}
   325.9  
  325.10  theory Finite2
  325.11  imports IntFact "~~/src/HOL/Library/Infinite_Set"
   326.1 --- a/src/HOL/Old_Number_Theory/Gauss.thy	Sun Nov 02 18:21:14 2014 +0100
   326.2 +++ b/src/HOL/Old_Number_Theory/Gauss.thy	Sun Nov 02 18:21:45 2014 +0100
   326.3 @@ -2,7 +2,7 @@
   326.4      Authors:    Jeremy Avigad, David Gray, and Adam Kramer
   326.5  *)
   326.6  
   326.7 -header {* Gauss' Lemma *}
   326.8 +section {* Gauss' Lemma *}
   326.9  
  326.10  theory Gauss
  326.11  imports Euler
   327.1 --- a/src/HOL/Old_Number_Theory/Int2.thy	Sun Nov 02 18:21:14 2014 +0100
   327.2 +++ b/src/HOL/Old_Number_Theory/Int2.thy	Sun Nov 02 18:21:45 2014 +0100
   327.3 @@ -2,7 +2,7 @@
   327.4      Authors:    Jeremy Avigad, David Gray, and Adam Kramer
   327.5  *)
   327.6  
   327.7 -header {*Integers: Divisibility and Congruences*}
   327.8 +section {*Integers: Divisibility and Congruences*}
   327.9  
  327.10  theory Int2
  327.11  imports Finite2 WilsonRuss
   328.1 --- a/src/HOL/Old_Number_Theory/IntFact.thy	Sun Nov 02 18:21:14 2014 +0100
   328.2 +++ b/src/HOL/Old_Number_Theory/IntFact.thy	Sun Nov 02 18:21:45 2014 +0100
   328.3 @@ -3,7 +3,7 @@
   328.4      Copyright   2000  University of Cambridge
   328.5  *)
   328.6  
   328.7 -header {* Factorial on integers *}
   328.8 +section {* Factorial on integers *}
   328.9  
  328.10  theory IntFact
  328.11  imports IntPrimes
   329.1 --- a/src/HOL/Old_Number_Theory/IntPrimes.thy	Sun Nov 02 18:21:14 2014 +0100
   329.2 +++ b/src/HOL/Old_Number_Theory/IntPrimes.thy	Sun Nov 02 18:21:45 2014 +0100
   329.3 @@ -3,7 +3,7 @@
   329.4      Copyright   2000  University of Cambridge
   329.5  *)
   329.6  
   329.7 -header {* Divisibility and prime numbers (on integers) *}
   329.8 +section {* Divisibility and prime numbers (on integers) *}
   329.9  
  329.10  theory IntPrimes
  329.11  imports Primes
   330.1 --- a/src/HOL/Old_Number_Theory/Legacy_GCD.thy	Sun Nov 02 18:21:14 2014 +0100
   330.2 +++ b/src/HOL/Old_Number_Theory/Legacy_GCD.thy	Sun Nov 02 18:21:45 2014 +0100
   330.3 @@ -3,7 +3,7 @@
   330.4      Copyright   1996  University of Cambridge
   330.5  *)
   330.6  
   330.7 -header {* The Greatest Common Divisor *}
   330.8 +section {* The Greatest Common Divisor *}
   330.9  
  330.10  theory Legacy_GCD
  330.11  imports Main
   331.1 --- a/src/HOL/Old_Number_Theory/Pocklington.thy	Sun Nov 02 18:21:14 2014 +0100
   331.2 +++ b/src/HOL/Old_Number_Theory/Pocklington.thy	Sun Nov 02 18:21:45 2014 +0100
   331.3 @@ -2,7 +2,7 @@
   331.4      Author:     Amine Chaieb
   331.5  *)
   331.6  
   331.7 -header {* Pocklington's Theorem for Primes *}
   331.8 +section {* Pocklington's Theorem for Primes *}
   331.9  
  331.10  theory Pocklington
  331.11  imports Primes
   332.1 --- a/src/HOL/Old_Number_Theory/Primes.thy	Sun Nov 02 18:21:14 2014 +0100
   332.2 +++ b/src/HOL/Old_Number_Theory/Primes.thy	Sun Nov 02 18:21:45 2014 +0100
   332.3 @@ -3,7 +3,7 @@
   332.4      Copyright   1996  University of Cambridge
   332.5  *)
   332.6  
   332.7 -header {* Primality on nat *}
   332.8 +section {* Primality on nat *}
   332.9  
  332.10  theory Primes
  332.11  imports Complex_Main Legacy_GCD
   333.1 --- a/src/HOL/Old_Number_Theory/Quadratic_Reciprocity.thy	Sun Nov 02 18:21:14 2014 +0100
   333.2 +++ b/src/HOL/Old_Number_Theory/Quadratic_Reciprocity.thy	Sun Nov 02 18:21:45 2014 +0100
   333.3 @@ -2,7 +2,7 @@
   333.4      Authors:    Jeremy Avigad, David Gray, and Adam Kramer
   333.5  *)
   333.6  
   333.7 -header {* The law of Quadratic reciprocity *}
   333.8 +section {* The law of Quadratic reciprocity *}
   333.9  
  333.10  theory Quadratic_Reciprocity
  333.11  imports Gauss
   334.1 --- a/src/HOL/Old_Number_Theory/Residues.thy	Sun Nov 02 18:21:14 2014 +0100
   334.2 +++ b/src/HOL/Old_Number_Theory/Residues.thy	Sun Nov 02 18:21:45 2014 +0100
   334.3 @@ -2,7 +2,7 @@
   334.4      Authors:    Jeremy Avigad, David Gray, and Adam Kramer
   334.5  *)
   334.6  
   334.7 -header {* Residue Sets *}
   334.8 +section {* Residue Sets *}
   334.9  
  334.10  theory Residues
  334.11  imports Int2
   335.1 --- a/src/HOL/Old_Number_Theory/WilsonBij.thy	Sun Nov 02 18:21:14 2014 +0100
   335.2 +++ b/src/HOL/Old_Number_Theory/WilsonBij.thy	Sun Nov 02 18:21:45 2014 +0100
   335.3 @@ -3,7 +3,7 @@
   335.4      Copyright   2000  University of Cambridge
   335.5  *)
   335.6  
   335.7 -header {* Wilson's Theorem using a more abstract approach *}
   335.8 +section {* Wilson's Theorem using a more abstract approach *}
   335.9  
  335.10  theory WilsonBij
  335.11  imports BijectionRel IntFact
   336.1 --- a/src/HOL/Old_Number_Theory/WilsonRuss.thy	Sun Nov 02 18:21:14 2014 +0100
   336.2 +++ b/src/HOL/Old_Number_Theory/WilsonRuss.thy	Sun Nov 02 18:21:45 2014 +0100
   336.3 @@ -3,7 +3,7 @@
   336.4      Copyright   2000  University of Cambridge
   336.5  *)
   336.6  
   336.7 -header {* Wilson's Theorem according to Russinoff *}
   336.8 +section {* Wilson's Theorem according to Russinoff *}
   336.9  
  336.10  theory WilsonRuss
  336.11  imports EulerFermat
   337.1 --- a/src/HOL/Option.thy	Sun Nov 02 18:21:14 2014 +0100
   337.2 +++ b/src/HOL/Option.thy	Sun Nov 02 18:21:45 2014 +0100
   337.3 @@ -2,7 +2,7 @@
   337.4      Author:     Folklore
   337.5  *)
   337.6  
   337.7 -header {* Datatype option *}
   337.8 +section {* Datatype option *}
   337.9  
  337.10  theory Option
  337.11  imports BNF_Least_Fixpoint Finite_Set
   338.1 --- a/src/HOL/Order_Relation.thy	Sun Nov 02 18:21:14 2014 +0100
   338.2 +++ b/src/HOL/Order_Relation.thy	Sun Nov 02 18:21:45 2014 +0100
   338.3 @@ -3,7 +3,7 @@
   338.4      Author:     Andrei Popescu, TU Muenchen
   338.5  *)
   338.6  
   338.7 -header {* Orders as Relations *}
   338.8 +section {* Orders as Relations *}
   338.9  
  338.10  theory Order_Relation
  338.11  imports Wfrec
   339.1 --- a/src/HOL/Orderings.thy	Sun Nov 02 18:21:14 2014 +0100
   339.2 +++ b/src/HOL/Orderings.thy	Sun Nov 02 18:21:45 2014 +0100
   339.3 @@ -2,7 +2,7 @@
   339.4      Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
   339.5  *)
   339.6  
   339.7 -header {* Abstract orderings *}
   339.8 +section {* Abstract orderings *}
   339.9  
  339.10  theory Orderings
  339.11  imports HOL
   340.1 --- a/src/HOL/Parity.thy	Sun Nov 02 18:21:14 2014 +0100
   340.2 +++ b/src/HOL/Parity.thy	Sun Nov 02 18:21:45 2014 +0100
   340.3 @@ -3,7 +3,7 @@
   340.4      Author:     Jacques D. Fleuriot
   340.5  *)
   340.6  
   340.7 -header {* Parity in rings and semirings *}
   340.8 +section {* Parity in rings and semirings *}
   340.9  
  340.10  theory Parity
  340.11  imports Nat_Transfer
   341.1 --- a/src/HOL/Partial_Function.thy	Sun Nov 02 18:21:14 2014 +0100
   341.2 +++ b/src/HOL/Partial_Function.thy	Sun Nov 02 18:21:45 2014 +0100
   341.3 @@ -2,7 +2,7 @@
   341.4     Author:   Alexander Krauss, TU Muenchen
   341.5  *)
   341.6  
   341.7 -header {* Partial Function Definitions *}
   341.8 +section {* Partial Function Definitions *}
   341.9  
  341.10  theory Partial_Function
  341.11  imports Complete_Partial_Order Fun_Def_Base Option
   342.1 --- a/src/HOL/Power.thy	Sun Nov 02 18:21:14 2014 +0100
   342.2 +++ b/src/HOL/Power.thy	Sun Nov 02 18:21:45 2014 +0100
   342.3 @@ -3,7 +3,7 @@
   342.4      Copyright   1997  University of Cambridge
   342.5  *)
   342.6  
   342.7 -header {* Exponentiation *}
   342.8 +section {* Exponentiation *}
   342.9  
  342.10  theory Power
  342.11  imports Num Equiv_Relations
   343.1 --- a/src/HOL/Predicate.thy	Sun Nov 02 18:21:14 2014 +0100
   343.2 +++ b/src/HOL/Predicate.thy	Sun Nov 02 18:21:45 2014 +0100
   343.3 @@ -2,7 +2,7 @@
   343.4      Author:     Lukas Bulwahn and Florian Haftmann, TU Muenchen
   343.5  *)
   343.6  
   343.7 -header {* Predicates as enumerations *}
   343.8 +section {* Predicates as enumerations *}
   343.9  
  343.10  theory Predicate
  343.11  imports String
   344.1 --- a/src/HOL/Predicate_Compile.thy	Sun Nov 02 18:21:14 2014 +0100
   344.2 +++ b/src/HOL/Predicate_Compile.thy	Sun Nov 02 18:21:45 2014 +0100
   344.3 @@ -2,7 +2,7 @@
   344.4      Author:     Stefan Berghofer, Lukas Bulwahn, Florian Haftmann, TU Muenchen
   344.5  *)
   344.6  
   344.7 -header {* A compiler for predicates defined by introduction rules *}
   344.8 +section {* A compiler for predicates defined by introduction rules *}
   344.9  
  344.10  theory Predicate_Compile
  344.11  imports Random_Sequence Quickcheck_Exhaustive
   345.1 --- a/src/HOL/Presburger.thy	Sun Nov 02 18:21:14 2014 +0100
   345.2 +++ b/src/HOL/Presburger.thy	Sun Nov 02 18:21:45 2014 +0100
   345.3 @@ -2,7 +2,7 @@
   345.4     Author:     Amine Chaieb, TU Muenchen
   345.5  *)
   345.6  
   345.7 -header {* Decision Procedure for Presburger Arithmetic *}
   345.8 +section {* Decision Procedure for Presburger Arithmetic *}
   345.9  
  345.10  theory Presburger
  345.11  imports Groebner_Basis Set_Interval
   346.1 --- a/src/HOL/Product_Type.thy	Sun Nov 02 18:21:14 2014 +0100
   346.2 +++ b/src/HOL/Product_Type.thy	Sun Nov 02 18:21:45 2014 +0100
   346.3 @@ -3,7 +3,7 @@
   346.4      Copyright   1992  University of Cambridge
   346.5  *)
   346.6  
   346.7 -header {* Cartesian products *}
   346.8 +section {* Cartesian products *}
   346.9  
  346.10  theory Product_Type
  346.11  imports Typedef Inductive Fun
   347.1 --- a/src/HOL/Prolog/Func.thy	Sun Nov 02 18:21:14 2014 +0100
   347.2 +++ b/src/HOL/Prolog/Func.thy	Sun Nov 02 18:21:45 2014 +0100
   347.3 @@ -2,7 +2,7 @@
   347.4      Author:   David von Oheimb (based on a lecture on Lambda Prolog by Nadathur)
   347.5  *)
   347.6  
   347.7 -header {* Untyped functional language, with call by value semantics *}
   347.8 +section {* Untyped functional language, with call by value semantics *}
   347.9  
  347.10  theory Func
  347.11  imports HOHH
   348.1 --- a/src/HOL/Prolog/HOHH.thy	Sun Nov 02 18:21:14 2014 +0100
   348.2 +++ b/src/HOL/Prolog/HOHH.thy	Sun Nov 02 18:21:45 2014 +0100
   348.3 @@ -2,7 +2,7 @@
   348.4      Author:   David von Oheimb (based on a lecture on Lambda Prolog by Nadathur)
   348.5  *)
   348.6  
   348.7 -header {* Higher-order hereditary Harrop formulas *}
   348.8 +section {* Higher-order hereditary Harrop formulas *}
   348.9  
  348.10  theory HOHH
  348.11  imports HOL
   349.1 --- a/src/HOL/Prolog/Test.thy	Sun Nov 02 18:21:14 2014 +0100
   349.2 +++ b/src/HOL/Prolog/Test.thy	Sun Nov 02 18:21:45 2014 +0100
   349.3 @@ -2,7 +2,7 @@
   349.4      Author:   David von Oheimb (based on a lecture on Lambda Prolog by Nadathur)
   349.5  *)
   349.6  
   349.7 -header {* Basic examples *}
   349.8 +section {* Basic examples *}
   349.9  
  349.10  theory Test
  349.11  imports HOHH
   350.1 --- a/src/HOL/Prolog/Type.thy	Sun Nov 02 18:21:14 2014 +0100
   350.2 +++ b/src/HOL/Prolog/Type.thy	Sun Nov 02 18:21:45 2014 +0100
   350.3 @@ -2,7 +2,7 @@
   350.4      Author:   David von Oheimb (based on a lecture on Lambda Prolog by Nadathur)
   350.5  *)
   350.6  
   350.7 -header {* Type inference *}
   350.8 +section {* Type inference *}
   350.9  
  350.10  theory Type
  350.11  imports Func
   351.1 --- a/src/HOL/Proofs/Extraction/Euclid.thy	Sun Nov 02 18:21:14 2014 +0100
   351.2 +++ b/src/HOL/Proofs/Extraction/Euclid.thy	Sun Nov 02 18:21:45 2014 +0100
   351.3 @@ -4,7 +4,7 @@
   351.4      Author:     Stefan Berghofer, TU Muenchen
   351.5  *)
   351.6  
   351.7 -header {* Euclid's theorem *}
   351.8 +section {* Euclid's theorem *}
   351.9  
  351.10  theory Euclid
  351.11  imports
   352.1 --- a/src/HOL/Proofs/Extraction/Greatest_Common_Divisor.thy	Sun Nov 02 18:21:14 2014 +0100
   352.2 +++ b/src/HOL/Proofs/Extraction/Greatest_Common_Divisor.thy	Sun Nov 02 18:21:45 2014 +0100
   352.3 @@ -3,7 +3,7 @@
   352.4      Author:     Helmut Schwichtenberg, LMU Muenchen
   352.5  *)
   352.6  
   352.7 -header {* Greatest common divisor *}
   352.8 +section {* Greatest common divisor *}
   352.9  
  352.10  theory Greatest_Common_Divisor
  352.11  imports QuotRem
   353.1 --- a/src/HOL/Proofs/Extraction/Higman.thy	Sun Nov 02 18:21:14 2014 +0100
   353.2 +++ b/src/HOL/Proofs/Extraction/Higman.thy	Sun Nov 02 18:21:45 2014 +0100
   353.3 @@ -3,7 +3,7 @@
   353.4      Author:     Monika Seisenberger, LMU Muenchen
   353.5  *)
   353.6  
   353.7 -header {* Higman's lemma *}
   353.8 +section {* Higman's lemma *}
   353.9  
  353.10  theory Higman
  353.11  imports Old_Datatype
   354.1 --- a/src/HOL/Proofs/Extraction/Pigeonhole.thy	Sun Nov 02 18:21:14 2014 +0100
   354.2 +++ b/src/HOL/Proofs/Extraction/Pigeonhole.thy	Sun Nov 02 18:21:45 2014 +0100
   354.3 @@ -2,7 +2,7 @@
   354.4      Author:     Stefan Berghofer, TU Muenchen
   354.5  *)
   354.6  
   354.7 -header {* The pigeonhole principle *}
   354.8 +section {* The pigeonhole principle *}
   354.9  
  354.10  theory Pigeonhole
  354.11  imports Util "~~/src/HOL/Library/Code_Target_Numeral"
   355.1 --- a/src/HOL/Proofs/Extraction/QuotRem.thy	Sun Nov 02 18:21:14 2014 +0100
   355.2 +++ b/src/HOL/Proofs/Extraction/QuotRem.thy	Sun Nov 02 18:21:45 2014 +0100
   355.3 @@ -2,7 +2,7 @@
   355.4      Author:     Stefan Berghofer, TU Muenchen
   355.5  *)
   355.6  
   355.7 -header {* Quotient and remainder *}
   355.8 +section {* Quotient and remainder *}
   355.9  
  355.10  theory QuotRem
  355.11  imports Util
   356.1 --- a/src/HOL/Proofs/Extraction/Util.thy	Sun Nov 02 18:21:14 2014 +0100
   356.2 +++ b/src/HOL/Proofs/Extraction/Util.thy	Sun Nov 02 18:21:45 2014 +0100
   356.3 @@ -2,7 +2,7 @@
   356.4      Author:     Stefan Berghofer, TU Muenchen
   356.5  *)
   356.6  
   356.7 -header {* Auxiliary lemmas used in program extraction examples *}
   356.8 +section {* Auxiliary lemmas used in program extraction examples *}
   356.9  
  356.10  theory Util
  356.11  imports Old_Datatype
   357.1 --- a/src/HOL/Proofs/Extraction/Warshall.thy	Sun Nov 02 18:21:14 2014 +0100
   357.2 +++ b/src/HOL/Proofs/Extraction/Warshall.thy	Sun Nov 02 18:21:45 2014 +0100
   357.3 @@ -2,7 +2,7 @@
   357.4      Author:     Stefan Berghofer, TU Muenchen
   357.5  *)
   357.6  
   357.7 -header {* Warshall's algorithm *}
   357.8 +section {* Warshall's algorithm *}
   357.9  
  357.10  theory Warshall
  357.11  imports Old_Datatype
   358.1 --- a/src/HOL/Proofs/Lambda/Commutation.thy	Sun Nov 02 18:21:14 2014 +0100
   358.2 +++ b/src/HOL/Proofs/Lambda/Commutation.thy	Sun Nov 02 18:21:45 2014 +0100
   358.3 @@ -3,7 +3,7 @@
   358.4      Copyright   1995  TU Muenchen
   358.5  *)
   358.6  
   358.7 -header {* Abstract commutation and confluence notions *}
   358.8 +section {* Abstract commutation and confluence notions *}
   358.9  
  358.10  theory Commutation
  358.11  imports Main
   359.1 --- a/src/HOL/Proofs/Lambda/Eta.thy	Sun Nov 02 18:21:14 2014 +0100
   359.2 +++ b/src/HOL/Proofs/Lambda/Eta.thy	Sun Nov 02 18:21:45 2014 +0100
   359.3 @@ -3,7 +3,7 @@
   359.4      Copyright   1995, 2005 TU Muenchen
   359.5  *)
   359.6  
   359.7 -header {* Eta-reduction *}
   359.8 +section {* Eta-reduction *}
   359.9  
  359.10  theory Eta imports ParRed begin
  359.11  
   360.1 --- a/src/HOL/Proofs/Lambda/InductTermi.thy	Sun Nov 02 18:21:14 2014 +0100
   360.2 +++ b/src/HOL/Proofs/Lambda/InductTermi.thy	Sun Nov 02 18:21:45 2014 +0100
   360.3 @@ -7,7 +7,7 @@
   360.4  rediscovered by Matthes and Joachimski.
   360.5  *)
   360.6  
   360.7 -header {* Inductive characterization of terminating lambda terms *}
   360.8 +section {* Inductive characterization of terminating lambda terms *}
   360.9  
  360.10  theory InductTermi imports ListBeta begin
  360.11  
   361.1 --- a/src/HOL/Proofs/Lambda/Lambda.thy	Sun Nov 02 18:21:14 2014 +0100
   361.2 +++ b/src/HOL/Proofs/Lambda/Lambda.thy	Sun Nov 02 18:21:45 2014 +0100
   361.3 @@ -3,7 +3,7 @@
   361.4      Copyright   1995 TU Muenchen
   361.5  *)
   361.6  
   361.7 -header {* Basic definitions of Lambda-calculus *}
   361.8 +section {* Basic definitions of Lambda-calculus *}
   361.9  
  361.10  theory Lambda
  361.11  imports Main
   362.1 --- a/src/HOL/Proofs/Lambda/LambdaType.thy	Sun Nov 02 18:21:14 2014 +0100
   362.2 +++ b/src/HOL/Proofs/Lambda/LambdaType.thy	Sun Nov 02 18:21:45 2014 +0100
   362.3 @@ -3,7 +3,7 @@
   362.4      Copyright   2000 TU Muenchen
   362.5  *)
   362.6  
   362.7 -header {* Simply-typed lambda terms *}
   362.8 +section {* Simply-typed lambda terms *}
   362.9  
  362.10  theory LambdaType imports ListApplication begin
  362.11  
   363.1 --- a/src/HOL/Proofs/Lambda/ListApplication.thy	Sun Nov 02 18:21:14 2014 +0100
   363.2 +++ b/src/HOL/Proofs/Lambda/ListApplication.thy	Sun Nov 02 18:21:45 2014 +0100
   363.3 @@ -3,7 +3,7 @@
   363.4      Copyright   1998 TU Muenchen
   363.5  *)
   363.6  
   363.7 -header {* Application of a term to a list of terms *}
   363.8 +section {* Application of a term to a list of terms *}
   363.9  
  363.10  theory ListApplication imports Lambda begin
  363.11  
   364.1 --- a/src/HOL/Proofs/Lambda/ListBeta.thy	Sun Nov 02 18:21:14 2014 +0100
   364.2 +++ b/src/HOL/Proofs/Lambda/ListBeta.thy	Sun Nov 02 18:21:45 2014 +0100
   364.3 @@ -3,7 +3,7 @@
   364.4      Copyright   1998 TU Muenchen
   364.5  *)
   364.6  
   364.7 -header {* Lifting beta-reduction to lists *}
   364.8 +section {* Lifting beta-reduction to lists *}
   364.9  
  364.10  theory ListBeta imports ListApplication ListOrder begin
  364.11  
   365.1 --- a/src/HOL/Proofs/Lambda/ListOrder.thy	Sun Nov 02 18:21:14 2014 +0100
   365.2 +++ b/src/HOL/Proofs/Lambda/ListOrder.thy	Sun Nov 02 18:21:45 2014 +0100
   365.3 @@ -3,7 +3,7 @@
   365.4      Copyright   1998 TU Muenchen
   365.5  *)
   365.6  
   365.7 -header {* Lifting an order to lists of elements *}
   365.8 +section {* Lifting an order to lists of elements *}
   365.9  
  365.10  theory ListOrder
  365.11  imports Main
   366.1 --- a/src/HOL/Proofs/Lambda/NormalForm.thy	Sun Nov 02 18:21:14 2014 +0100
   366.2 +++ b/src/HOL/Proofs/Lambda/NormalForm.thy	Sun Nov 02 18:21:45 2014 +0100
   366.3 @@ -2,7 +2,7 @@
   366.4      Author:     Stefan Berghofer, TU Muenchen, 2003
   366.5  *)
   366.6  
   366.7 -header {* Inductive characterization of lambda terms in normal form *}
   366.8 +section {* Inductive characterization of lambda terms in normal form *}
   366.9  
  366.10  theory NormalForm
  366.11  imports ListBeta
   367.1 --- a/src/HOL/Proofs/Lambda/ParRed.thy	Sun Nov 02 18:21:14 2014 +0100
   367.2 +++ b/src/HOL/Proofs/Lambda/ParRed.thy	Sun Nov 02 18:21:45 2014 +0100
   367.3 @@ -6,7 +6,7 @@
   367.4  confluence of beta.
   367.5  *)
   367.6  
   367.7 -header {* Parallel reduction and a complete developments *}
   367.8 +section {* Parallel reduction and a complete developments *}
   367.9  
  367.10  theory ParRed imports Lambda Commutation begin
  367.11  
   368.1 --- a/src/HOL/Proofs/Lambda/Standardization.thy	Sun Nov 02 18:21:14 2014 +0100
   368.2 +++ b/src/HOL/Proofs/Lambda/Standardization.thy	Sun Nov 02 18:21:45 2014 +0100
   368.3 @@ -3,7 +3,7 @@
   368.4      Copyright   2005 TU Muenchen
   368.5  *)
   368.6  
   368.7 -header {* Standardization *}
   368.8 +section {* Standardization *}
   368.9  
  368.10  theory Standardization
  368.11  imports NormalForm
   369.1 --- a/src/HOL/Proofs/Lambda/StrongNorm.thy	Sun Nov 02 18:21:14 2014 +0100
   369.2 +++ b/src/HOL/Proofs/Lambda/StrongNorm.thy	Sun Nov 02 18:21:45 2014 +0100
   369.3 @@ -3,7 +3,7 @@
   369.4      Copyright   2000 TU Muenchen
   369.5  *)
   369.6  
   369.7 -header {* Strong normalization for simply-typed lambda calculus *}
   369.8 +section {* Strong normalization for simply-typed lambda calculus *}
   369.9  
  369.10  theory StrongNorm imports LambdaType InductTermi begin
  369.11  
   370.1 --- a/src/HOL/Proofs/Lambda/WeakNorm.thy	Sun Nov 02 18:21:14 2014 +0100
   370.2 +++ b/src/HOL/Proofs/Lambda/WeakNorm.thy	Sun Nov 02 18:21:45 2014 +0100
   370.3 @@ -3,7 +3,7 @@
   370.4      Copyright   2003 TU Muenchen
   370.5  *)
   370.6  
   370.7 -header {* Weak normalization for simply-typed lambda calculus *}
   370.8 +section {* Weak normalization for simply-typed lambda calculus *}
   370.9  
  370.10  theory WeakNorm
  370.11  imports LambdaType NormalForm "~~/src/HOL/Library/Old_Datatype"
   371.1 --- a/src/HOL/Proofs/ex/Hilbert_Classical.thy	Sun Nov 02 18:21:14 2014 +0100
   371.2 +++ b/src/HOL/Proofs/ex/Hilbert_Classical.thy	Sun Nov 02 18:21:45 2014 +0100
   371.3 @@ -2,7 +2,7 @@
   371.4      Author:     Stefan Berghofer and Markus Wenzel, TU Muenchen
   371.5  *)
   371.6  
   371.7 -header {* Hilbert's choice and classical logic *}
   371.8 +section {* Hilbert's choice and classical logic *}
   371.9  
  371.10  theory Hilbert_Classical
  371.11  imports Main
   372.1 --- a/src/HOL/Quickcheck_Examples/Completeness.thy	Sun Nov 02 18:21:14 2014 +0100
   372.2 +++ b/src/HOL/Quickcheck_Examples/Completeness.thy	Sun Nov 02 18:21:45 2014 +0100
   372.3 @@ -3,7 +3,7 @@
   372.4      Copyright   2012 TU Muenchen
   372.5  *)
   372.6  
   372.7 -header {* Proving completeness of exhaustive generators *}
   372.8 +section {* Proving completeness of exhaustive generators *}
   372.9  
  372.10  theory Completeness
  372.11  imports Main
   373.1 --- a/src/HOL/Quickcheck_Examples/Quickcheck_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   373.2 +++ b/src/HOL/Quickcheck_Examples/Quickcheck_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   373.3 @@ -3,7 +3,7 @@
   373.4      Copyright   2004 - 2010 TU Muenchen
   373.5  *)
   373.6  
   373.7 -header {* Examples for the 'quickcheck' command *}
   373.8 +section {* Examples for the 'quickcheck' command *}
   373.9  
  373.10  theory Quickcheck_Examples
  373.11  imports Complex_Main "~~/src/HOL/Library/Dlist" "~~/src/HOL/Library/DAList_Multiset"
   374.1 --- a/src/HOL/Quickcheck_Examples/Quickcheck_Narrowing_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   374.2 +++ b/src/HOL/Quickcheck_Examples/Quickcheck_Narrowing_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   374.3 @@ -3,7 +3,7 @@
   374.4      Copyright   2011 TU Muenchen
   374.5  *)
   374.6  
   374.7 -header {* Examples for narrowing-based testing  *}
   374.8 +section {* Examples for narrowing-based testing  *}
   374.9  
  374.10  theory Quickcheck_Narrowing_Examples
  374.11  imports Main
   375.1 --- a/src/HOL/Quickcheck_Exhaustive.thy	Sun Nov 02 18:21:14 2014 +0100
   375.2 +++ b/src/HOL/Quickcheck_Exhaustive.thy	Sun Nov 02 18:21:45 2014 +0100
   375.3 @@ -1,6 +1,6 @@
   375.4  (* Author: Lukas Bulwahn, TU Muenchen *)
   375.5  
   375.6 -header {* A simple counterexample generator performing exhaustive testing *}
   375.7 +section {* A simple counterexample generator performing exhaustive testing *}
   375.8  
   375.9  theory Quickcheck_Exhaustive
  375.10  imports Quickcheck_Random
   376.1 --- a/src/HOL/Quickcheck_Narrowing.thy	Sun Nov 02 18:21:14 2014 +0100
   376.2 +++ b/src/HOL/Quickcheck_Narrowing.thy	Sun Nov 02 18:21:45 2014 +0100
   376.3 @@ -1,6 +1,6 @@
   376.4  (* Author: Lukas Bulwahn, TU Muenchen *)
   376.5  
   376.6 -header {* Counterexample generator performing narrowing-based testing *}
   376.7 +section {* Counterexample generator performing narrowing-based testing *}
   376.8  
   376.9  theory Quickcheck_Narrowing
  376.10  imports Quickcheck_Random
   377.1 --- a/src/HOL/Quickcheck_Random.thy	Sun Nov 02 18:21:14 2014 +0100
   377.2 +++ b/src/HOL/Quickcheck_Random.thy	Sun Nov 02 18:21:45 2014 +0100
   377.3 @@ -1,6 +1,6 @@
   377.4  (* Author: Florian Haftmann & Lukas Bulwahn, TU Muenchen *)
   377.5  
   377.6 -header {* A simple counterexample generator performing random testing *}
   377.7 +section {* A simple counterexample generator performing random testing *}
   377.8  
   377.9  theory Quickcheck_Random
  377.10  imports Random Code_Evaluation Enum
   378.1 --- a/src/HOL/Quotient.thy	Sun Nov 02 18:21:14 2014 +0100
   378.2 +++ b/src/HOL/Quotient.thy	Sun Nov 02 18:21:45 2014 +0100
   378.3 @@ -2,7 +2,7 @@
   378.4      Author:     Cezary Kaliszyk and Christian Urban
   378.5  *)
   378.6  
   378.7 -header {* Definition of Quotient Types *}
   378.8 +section {* Definition of Quotient Types *}
   378.9  
  378.10  theory Quotient
  378.11  imports Lifting
   379.1 --- a/src/HOL/Quotient_Examples/DList.thy	Sun Nov 02 18:21:14 2014 +0100
   379.2 +++ b/src/HOL/Quotient_Examples/DList.thy	Sun Nov 02 18:21:45 2014 +0100
   379.3 @@ -5,7 +5,7 @@
   379.4  and theory morphism version by Maksym Bortin
   379.5  *)
   379.6  
   379.7 -header {* Lists with distinct elements *}
   379.8 +section {* Lists with distinct elements *}
   379.9  
  379.10  theory DList
  379.11  imports "~~/src/HOL/Library/Quotient_List"
   380.1 --- a/src/HOL/Quotient_Examples/Lift_FSet.thy	Sun Nov 02 18:21:14 2014 +0100
   380.2 +++ b/src/HOL/Quotient_Examples/Lift_FSet.thy	Sun Nov 02 18:21:45 2014 +0100
   380.3 @@ -2,7 +2,7 @@
   380.4      Author:     Brian Huffman, TU Munich
   380.5  *)
   380.6  
   380.7 -header {* Lifting and transfer with a finite set type *}
   380.8 +section {* Lifting and transfer with a finite set type *}
   380.9  
  380.10  theory Lift_FSet
  380.11  imports Main
   381.1 --- a/src/HOL/Quotient_Examples/Lift_Fun.thy	Sun Nov 02 18:21:14 2014 +0100
   381.2 +++ b/src/HOL/Quotient_Examples/Lift_Fun.thy	Sun Nov 02 18:21:45 2014 +0100
   381.3 @@ -2,7 +2,7 @@
   381.4      Author:     Ondrej Kuncar
   381.5  *)
   381.6  
   381.7 -header {* Example of lifting definitions with contravariant or co/contravariant type variables *}
   381.8 +section {* Example of lifting definitions with contravariant or co/contravariant type variables *}
   381.9  
  381.10  
  381.11  theory Lift_Fun
   382.1 --- a/src/HOL/Quotient_Examples/Lift_Set.thy	Sun Nov 02 18:21:14 2014 +0100
   382.2 +++ b/src/HOL/Quotient_Examples/Lift_Set.thy	Sun Nov 02 18:21:45 2014 +0100
   382.3 @@ -2,7 +2,7 @@
   382.4      Author:     Lukas Bulwahn and Ondrej Kuncar
   382.5  *)
   382.6  
   382.7 -header {* Example of lifting definitions with the lifting infrastructure *}
   382.8 +section {* Example of lifting definitions with the lifting infrastructure *}
   382.9  
  382.10  theory Lift_Set
  382.11  imports Main
   383.1 --- a/src/HOL/Random.thy	Sun Nov 02 18:21:14 2014 +0100
   383.2 +++ b/src/HOL/Random.thy	Sun Nov 02 18:21:45 2014 +0100
   383.3 @@ -1,7 +1,7 @@
   383.4  
   383.5  (* Author: Florian Haftmann, TU Muenchen *)
   383.6  
   383.7 -header {* A HOL random engine *}
   383.8 +section {* A HOL random engine *}
   383.9  
  383.10  theory Random
  383.11  imports List Groups_List
   384.1 --- a/src/HOL/Random_Pred.thy	Sun Nov 02 18:21:14 2014 +0100
   384.2 +++ b/src/HOL/Random_Pred.thy	Sun Nov 02 18:21:45 2014 +0100
   384.3 @@ -1,7 +1,7 @@
   384.4  
   384.5  (* Author: Lukas Bulwahn, TU Muenchen *)
   384.6  
   384.7 -header {* The Random-Predicate Monad *}
   384.8 +section {* The Random-Predicate Monad *}
   384.9  
  384.10  theory Random_Pred
  384.11  imports Quickcheck_Random
   385.1 --- a/src/HOL/Random_Sequence.thy	Sun Nov 02 18:21:14 2014 +0100
   385.2 +++ b/src/HOL/Random_Sequence.thy	Sun Nov 02 18:21:45 2014 +0100
   385.3 @@ -1,7 +1,7 @@
   385.4  
   385.5  (* Author: Lukas Bulwahn, TU Muenchen *)
   385.6  
   385.7 -header {* Various kind of sequences inside the random monad *}
   385.8 +section {* Various kind of sequences inside the random monad *}
   385.9  
  385.10  theory Random_Sequence
  385.11  imports Random_Pred
   386.1 --- a/src/HOL/Rat.thy	Sun Nov 02 18:21:14 2014 +0100
   386.2 +++ b/src/HOL/Rat.thy	Sun Nov 02 18:21:45 2014 +0100
   386.3 @@ -2,7 +2,7 @@
   386.4      Author: Markus Wenzel, TU Muenchen
   386.5  *)
   386.6  
   386.7 -header {* Rational numbers *}
   386.8 +section {* Rational numbers *}
   386.9  
  386.10  theory Rat
  386.11  imports GCD Archimedean_Field
   387.1 --- a/src/HOL/Real.thy	Sun Nov 02 18:21:14 2014 +0100
   387.2 +++ b/src/HOL/Real.thy	Sun Nov 02 18:21:45 2014 +0100
   387.3 @@ -7,7 +7,7 @@
   387.4      Construction of Cauchy Reals by Brian Huffman, 2010
   387.5  *)
   387.6  
   387.7 -header {* Development of the Reals using Cauchy Sequences *}
   387.8 +section {* Development of the Reals using Cauchy Sequences *}
   387.9  
  387.10  theory Real
  387.11  imports Rat Conditionally_Complete_Lattices
   388.1 --- a/src/HOL/Real_Vector_Spaces.thy	Sun Nov 02 18:21:14 2014 +0100
   388.2 +++ b/src/HOL/Real_Vector_Spaces.thy	Sun Nov 02 18:21:45 2014 +0100
   388.3 @@ -3,7 +3,7 @@
   388.4      Author:     Johannes Hölzl
   388.5  *)
   388.6  
   388.7 -header {* Vector Spaces and Algebras over the Reals *}
   388.8 +section {* Vector Spaces and Algebras over the Reals *}
   388.9  
  388.10  theory Real_Vector_Spaces
  388.11  imports Real Topological_Spaces
   389.1 --- a/src/HOL/Record.thy	Sun Nov 02 18:21:14 2014 +0100
   389.2 +++ b/src/HOL/Record.thy	Sun Nov 02 18:21:45 2014 +0100
   389.3 @@ -6,7 +6,7 @@
   389.4      Author:     Florian Haftmann, TU Muenchen
   389.5  *)
   389.6  
   389.7 -header {* Extensible records with structural subtyping *}
   389.8 +section {* Extensible records with structural subtyping *}
   389.9  
  389.10  theory Record
  389.11  imports Quickcheck_Exhaustive
   390.1 --- a/src/HOL/Record_Benchmark/Record_Benchmark.thy	Sun Nov 02 18:21:14 2014 +0100
   390.2 +++ b/src/HOL/Record_Benchmark/Record_Benchmark.thy	Sun Nov 02 18:21:45 2014 +0100
   390.3 @@ -2,7 +2,7 @@
   390.4      Author:     Norbert Schirmer, DFKI
   390.5  *)
   390.6  
   390.7 -header {* Benchmark for large record *}
   390.8 +section {* Benchmark for large record *}
   390.9  
  390.10  theory Record_Benchmark
  390.11  imports Main
   391.1 --- a/src/HOL/Relation.thy	Sun Nov 02 18:21:14 2014 +0100
   391.2 +++ b/src/HOL/Relation.thy	Sun Nov 02 18:21:45 2014 +0100
   391.3 @@ -2,7 +2,7 @@
   391.4      Author:     Lawrence C Paulson, Cambridge University Computer Laboratory; Stefan Berghofer, TU Muenchen
   391.5  *)
   391.6  
   391.7 -header {* Relations -- as sets of pairs, and binary predicates *}
   391.8 +section {* Relations -- as sets of pairs, and binary predicates *}
   391.9  
  391.10  theory Relation
  391.11  imports Finite_Set
   392.1 --- a/src/HOL/Rings.thy	Sun Nov 02 18:21:14 2014 +0100
   392.2 +++ b/src/HOL/Rings.thy	Sun Nov 02 18:21:45 2014 +0100
   392.3 @@ -7,7 +7,7 @@
   392.4      Author:     Jeremy Avigad
   392.5  *)
   392.6  
   392.7 -header {* Rings *}
   392.8 +section {* Rings *}
   392.9  
  392.10  theory Rings
  392.11  imports Groups
   393.1 --- a/src/HOL/SAT.thy	Sun Nov 02 18:21:14 2014 +0100
   393.2 +++ b/src/HOL/SAT.thy	Sun Nov 02 18:21:45 2014 +0100
   393.3 @@ -5,7 +5,7 @@
   393.4  Basic setup for the 'sat' and 'satx' tactics.
   393.5  *)
   393.6  
   393.7 -header {* Reconstructing external resolution proofs for propositional logic *}
   393.8 +section {* Reconstructing external resolution proofs for propositional logic *}
   393.9  
  393.10  theory SAT
  393.11  imports HOL
   394.1 --- a/src/HOL/SET_Protocol/Cardholder_Registration.thy	Sun Nov 02 18:21:14 2014 +0100
   394.2 +++ b/src/HOL/SET_Protocol/Cardholder_Registration.thy	Sun Nov 02 18:21:45 2014 +0100
   394.3 @@ -5,7 +5,7 @@
   394.4      Author:     Piero Tramontano
   394.5  *)
   394.6  
   394.7 -header{*The SET Cardholder Registration Protocol*}
   394.8 +section{*The SET Cardholder Registration Protocol*}
   394.9  
  394.10  theory Cardholder_Registration
  394.11  imports Public_SET
   395.1 --- a/src/HOL/SET_Protocol/Event_SET.thy	Sun Nov 02 18:21:14 2014 +0100
   395.2 +++ b/src/HOL/SET_Protocol/Event_SET.thy	Sun Nov 02 18:21:45 2014 +0100
   395.3 @@ -4,7 +4,7 @@
   395.4      Author:     Lawrence C Paulson
   395.5  *)
   395.6  
   395.7 -header{*Theory of Events for SET*}
   395.8 +section{*Theory of Events for SET*}
   395.9  
  395.10  theory Event_SET
  395.11  imports Message_SET
   396.1 --- a/src/HOL/SET_Protocol/Merchant_Registration.thy	Sun Nov 02 18:21:14 2014 +0100
   396.2 +++ b/src/HOL/SET_Protocol/Merchant_Registration.thy	Sun Nov 02 18:21:45 2014 +0100
   396.3 @@ -4,7 +4,7 @@
   396.4      Author:     Lawrence C Paulson
   396.5  *)
   396.6  
   396.7 -header{*The SET Merchant Registration Protocol*}
   396.8 +section{*The SET Merchant Registration Protocol*}
   396.9  
  396.10  theory Merchant_Registration
  396.11  imports Public_SET
   397.1 --- a/src/HOL/SET_Protocol/Message_SET.thy	Sun Nov 02 18:21:14 2014 +0100
   397.2 +++ b/src/HOL/SET_Protocol/Message_SET.thy	Sun Nov 02 18:21:45 2014 +0100
   397.3 @@ -4,7 +4,7 @@
   397.4      Author:     Lawrence C Paulson
   397.5  *)
   397.6  
   397.7 -header{*The Message Theory, Modified for SET*}
   397.8 +section{*The Message Theory, Modified for SET*}
   397.9  
  397.10  theory Message_SET
  397.11  imports Main "~~/src/HOL/Library/Nat_Bijection"
   398.1 --- a/src/HOL/SET_Protocol/Public_SET.thy	Sun Nov 02 18:21:14 2014 +0100
   398.2 +++ b/src/HOL/SET_Protocol/Public_SET.thy	Sun Nov 02 18:21:45 2014 +0100
   398.3 @@ -4,7 +4,7 @@
   398.4      Author:     Lawrence C Paulson
   398.5  *)
   398.6  
   398.7 -header{*The Public-Key Theory, Modified for SET*}
   398.8 +section{*The Public-Key Theory, Modified for SET*}
   398.9  
  398.10  theory Public_SET
  398.11  imports Event_SET
   399.1 --- a/src/HOL/SET_Protocol/Purchase.thy	Sun Nov 02 18:21:14 2014 +0100
   399.2 +++ b/src/HOL/SET_Protocol/Purchase.thy	Sun Nov 02 18:21:45 2014 +0100
   399.3 @@ -4,7 +4,7 @@
   399.4      Author:     Lawrence C Paulson
   399.5  *)
   399.6  
   399.7 -header{*Purchase Phase of SET*}
   399.8 +section{*Purchase Phase of SET*}
   399.9  
  399.10  theory Purchase
  399.11  imports Public_SET
   400.1 --- a/src/HOL/SMT.thy	Sun Nov 02 18:21:14 2014 +0100
   400.2 +++ b/src/HOL/SMT.thy	Sun Nov 02 18:21:45 2014 +0100
   400.3 @@ -2,7 +2,7 @@
   400.4      Author:     Sascha Boehme, TU Muenchen
   400.5  *)
   400.6  
   400.7 -header {* Bindings to Satisfiability Modulo Theories (SMT) solvers based on SMT-LIB 2 *}
   400.8 +section {* Bindings to Satisfiability Modulo Theories (SMT) solvers based on SMT-LIB 2 *}
   400.9  
  400.10  theory SMT
  400.11  imports Divides
   401.1 --- a/src/HOL/SMT_Examples/Boogie.thy	Sun Nov 02 18:21:14 2014 +0100
   401.2 +++ b/src/HOL/SMT_Examples/Boogie.thy	Sun Nov 02 18:21:45 2014 +0100
   401.3 @@ -2,7 +2,7 @@
   401.4      Author:     Sascha Boehme, TU Muenchen
   401.5  *)
   401.6  
   401.7 -header {* Proving Boogie-generated verification conditions *}
   401.8 +section {* Proving Boogie-generated verification conditions *}
   401.9  
  401.10  theory Boogie
  401.11  imports Main
   402.1 --- a/src/HOL/SMT_Examples/SMT_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   402.2 +++ b/src/HOL/SMT_Examples/SMT_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   402.3 @@ -2,7 +2,7 @@
   402.4      Author:     Sascha Boehme, TU Muenchen
   402.5  *)
   402.6  
   402.7 -header {* Examples for the SMT binding *}
   402.8 +section {* Examples for the SMT binding *}
   402.9  
  402.10  theory SMT_Examples
  402.11  imports Complex_Main
   403.1 --- a/src/HOL/SMT_Examples/SMT_Tests.thy	Sun Nov 02 18:21:14 2014 +0100
   403.2 +++ b/src/HOL/SMT_Examples/SMT_Tests.thy	Sun Nov 02 18:21:45 2014 +0100
   403.3 @@ -2,7 +2,7 @@
   403.4      Author:     Sascha Boehme, TU Muenchen
   403.5  *)
   403.6  
   403.7 -header {* Tests for the SMT binding *}
   403.8 +section {* Tests for the SMT binding *}
   403.9  
  403.10  theory SMT_Tests
  403.11  imports Complex_Main
   404.1 --- a/src/HOL/SMT_Examples/SMT_Word_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   404.2 +++ b/src/HOL/SMT_Examples/SMT_Word_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   404.3 @@ -2,7 +2,7 @@
   404.4      Author:     Sascha Boehme, TU Muenchen
   404.5  *)
   404.6  
   404.7 -header {* Word examples for for SMT binding *}
   404.8 +section {* Word examples for for SMT binding *}
   404.9  
  404.10  theory SMT_Word_Examples
  404.11  imports "~~/src/HOL/Word/Word"
   405.1 --- a/src/HOL/Semiring_Normalization.thy	Sun Nov 02 18:21:14 2014 +0100
   405.2 +++ b/src/HOL/Semiring_Normalization.thy	Sun Nov 02 18:21:45 2014 +0100
   405.3 @@ -2,7 +2,7 @@
   405.4      Author:     Amine Chaieb, TU Muenchen
   405.5  *)
   405.6  
   405.7 -header {* Semiring normalization *}
   405.8 +section {* Semiring normalization *}
   405.9  
  405.10  theory Semiring_Normalization
  405.11  imports Numeral_Simprocs Nat_Transfer
   406.1 --- a/src/HOL/Series.thy	Sun Nov 02 18:21:14 2014 +0100
   406.2 +++ b/src/HOL/Series.thy	Sun Nov 02 18:21:45 2014 +0100
   406.3 @@ -7,7 +7,7 @@
   406.4  Additional contributions by Jeremy Avigad
   406.5  *)
   406.6  
   406.7 -header {* Infinite Series *}
   406.8 +section {* Infinite Series *}
   406.9  
  406.10  theory Series
  406.11  imports Limits
   407.1 --- a/src/HOL/Set.thy	Sun Nov 02 18:21:14 2014 +0100
   407.2 +++ b/src/HOL/Set.thy	Sun Nov 02 18:21:45 2014 +0100
   407.3 @@ -1,6 +1,6 @@
   407.4  (*  Author:     Tobias Nipkow, Lawrence C Paulson and Markus Wenzel *)
   407.5  
   407.6 -header {* Set theory for higher-order logic *}
   407.7 +section {* Set theory for higher-order logic *}
   407.8  
   407.9  theory Set
  407.10  imports Lattices
   408.1 --- a/src/HOL/Set_Interval.thy	Sun Nov 02 18:21:14 2014 +0100
   408.2 +++ b/src/HOL/Set_Interval.thy	Sun Nov 02 18:21:45 2014 +0100
   408.3 @@ -11,7 +11,7 @@
   408.4  Examples: Ico = {_ ..< _} and Ici = {_ ..}
   408.5  *)
   408.6  
   408.7 -header {* Set intervals *}
   408.8 +section {* Set intervals *}
   408.9  
  408.10  theory Set_Interval
  408.11  imports Lattices_Big Nat_Transfer
   409.1 --- a/src/HOL/Sledgehammer.thy	Sun Nov 02 18:21:14 2014 +0100
   409.2 +++ b/src/HOL/Sledgehammer.thy	Sun Nov 02 18:21:45 2014 +0100
   409.3 @@ -4,7 +4,7 @@
   409.4      Author:     Jasmin Blanchette, TU Muenchen
   409.5  *)
   409.6  
   409.7 -header {* Sledgehammer: Isabelle--ATP Linkup *}
   409.8 +section {* Sledgehammer: Isabelle--ATP Linkup *}
   409.9  
  409.10  theory Sledgehammer
  409.11  imports Presburger SMT
   410.1 --- a/src/HOL/Statespace/DistinctTreeProver.thy	Sun Nov 02 18:21:14 2014 +0100
   410.2 +++ b/src/HOL/Statespace/DistinctTreeProver.thy	Sun Nov 02 18:21:45 2014 +0100
   410.3 @@ -2,7 +2,7 @@
   410.4      Author:     Norbert Schirmer, TU Muenchen
   410.5  *)
   410.6  
   410.7 -header {* Distinctness of Names in a Binary Tree \label{sec:DistinctTreeProver}*}
   410.8 +section {* Distinctness of Names in a Binary Tree \label{sec:DistinctTreeProver}*}
   410.9  
  410.10  theory DistinctTreeProver 
  410.11  imports Main
   411.1 --- a/src/HOL/Statespace/StateFun.thy	Sun Nov 02 18:21:14 2014 +0100
   411.2 +++ b/src/HOL/Statespace/StateFun.thy	Sun Nov 02 18:21:45 2014 +0100
   411.3 @@ -2,7 +2,7 @@
   411.4      Author:     Norbert Schirmer, TU Muenchen
   411.5  *)
   411.6  
   411.7 -header {* State Space Representation as Function \label{sec:StateFun}*}
   411.8 +section {* State Space Representation as Function \label{sec:StateFun}*}
   411.9  
  411.10  theory StateFun imports DistinctTreeProver 
  411.11  begin
   412.1 --- a/src/HOL/Statespace/StateSpaceEx.thy	Sun Nov 02 18:21:14 2014 +0100
   412.2 +++ b/src/HOL/Statespace/StateSpaceEx.thy	Sun Nov 02 18:21:45 2014 +0100
   412.3 @@ -2,7 +2,7 @@
   412.4      Author:     Norbert Schirmer, TU Muenchen
   412.5  *)
   412.6  
   412.7 -header {* Examples \label{sec:Examples} *}
   412.8 +section {* Examples \label{sec:Examples} *}
   412.9  theory StateSpaceEx
  412.10  imports StateSpaceLocale StateSpaceSyntax
  412.11  begin
   413.1 --- a/src/HOL/Statespace/StateSpaceLocale.thy	Sun Nov 02 18:21:14 2014 +0100
   413.2 +++ b/src/HOL/Statespace/StateSpaceLocale.thy	Sun Nov 02 18:21:45 2014 +0100
   413.3 @@ -2,7 +2,7 @@
   413.4      Author:     Norbert Schirmer, TU Muenchen
   413.5  *)
   413.6  
   413.7 -header {* Setup for State Space Locales \label{sec:StateSpaceLocale}*}
   413.8 +section {* Setup for State Space Locales \label{sec:StateSpaceLocale}*}
   413.9  
  413.10  theory StateSpaceLocale imports StateFun 
  413.11  keywords "statespace" :: thy_decl
   414.1 --- a/src/HOL/Statespace/StateSpaceSyntax.thy	Sun Nov 02 18:21:14 2014 +0100
   414.2 +++ b/src/HOL/Statespace/StateSpaceSyntax.thy	Sun Nov 02 18:21:45 2014 +0100
   414.3 @@ -2,7 +2,7 @@
   414.4      Author:     Norbert Schirmer, TU Muenchen
   414.5  *)
   414.6  
   414.7 -header {* Syntax for State Space Lookup and Update \label{sec:StateSpaceSyntax}*}
   414.8 +section {* Syntax for State Space Lookup and Update \label{sec:StateSpaceSyntax}*}
   414.9  theory StateSpaceSyntax
  414.10  imports StateSpaceLocale
  414.11  begin
   415.1 --- a/src/HOL/String.thy	Sun Nov 02 18:21:14 2014 +0100
   415.2 +++ b/src/HOL/String.thy	Sun Nov 02 18:21:45 2014 +0100
   415.3 @@ -1,6 +1,6 @@
   415.4  (* Author: Tobias Nipkow, Florian Haftmann, TU Muenchen *)
   415.5  
   415.6 -header {* Character and string types *}
   415.7 +section {* Character and string types *}
   415.8  
   415.9  theory String
  415.10  imports Enum
   416.1 --- a/src/HOL/Sum_Type.thy	Sun Nov 02 18:21:14 2014 +0100
   416.2 +++ b/src/HOL/Sum_Type.thy	Sun Nov 02 18:21:45 2014 +0100
   416.3 @@ -3,7 +3,7 @@
   416.4      Copyright   1992  University of Cambridge
   416.5  *)
   416.6  
   416.7 -header{*The Disjoint Sum of Two Types*}
   416.8 +section{*The Disjoint Sum of Two Types*}
   416.9  
  416.10  theory Sum_Type
  416.11  imports Typedef Inductive Fun
   417.1 --- a/src/HOL/TLA/Action.thy	Sun Nov 02 18:21:14 2014 +0100
   417.2 +++ b/src/HOL/TLA/Action.thy	Sun Nov 02 18:21:45 2014 +0100
   417.3 @@ -3,7 +3,7 @@
   417.4      Copyright:  1998 University of Munich
   417.5  *)
   417.6  
   417.7 -header {* The action level of TLA as an Isabelle theory *}
   417.8 +section {* The action level of TLA as an Isabelle theory *}
   417.9  
  417.10  theory Action
  417.11  imports Stfun
   418.1 --- a/src/HOL/TLA/Buffer/Buffer.thy	Sun Nov 02 18:21:14 2014 +0100
   418.2 +++ b/src/HOL/TLA/Buffer/Buffer.thy	Sun Nov 02 18:21:45 2014 +0100
   418.3 @@ -2,7 +2,7 @@
   418.4      Author:     Stephan Merz, University of Munich
   418.5  *)
   418.6  
   418.7 -header {* A simple FIFO buffer (synchronous communication, interleaving) *}
   418.8 +section {* A simple FIFO buffer (synchronous communication, interleaving) *}
   418.9  
  418.10  theory Buffer
  418.11  imports TLA
   419.1 --- a/src/HOL/TLA/Buffer/DBuffer.thy	Sun Nov 02 18:21:14 2014 +0100
   419.2 +++ b/src/HOL/TLA/Buffer/DBuffer.thy	Sun Nov 02 18:21:45 2014 +0100
   419.3 @@ -2,7 +2,7 @@
   419.4      Author:     Stephan Merz, University of Munich
   419.5  *)
   419.6  
   419.7 -header {* Two FIFO buffers in a row, with interleaving assumption *}
   419.8 +section {* Two FIFO buffers in a row, with interleaving assumption *}
   419.9  
  419.10  theory DBuffer
  419.11  imports Buffer
   420.1 --- a/src/HOL/TLA/Inc/Inc.thy	Sun Nov 02 18:21:14 2014 +0100
   420.2 +++ b/src/HOL/TLA/Inc/Inc.thy	Sun Nov 02 18:21:45 2014 +0100
   420.3 @@ -2,7 +2,7 @@
   420.4      Author:     Stephan Merz, University of Munich
   420.5  *)
   420.6  
   420.7 -header {* Lamport's "increment" example *}
   420.8 +section {* Lamport's "increment" example *}
   420.9  
  420.10  theory Inc
  420.11  imports TLA
   421.1 --- a/src/HOL/TLA/Intensional.thy	Sun Nov 02 18:21:14 2014 +0100
   421.2 +++ b/src/HOL/TLA/Intensional.thy	Sun Nov 02 18:21:45 2014 +0100
   421.3 @@ -3,7 +3,7 @@
   421.4      Copyright:  1998 University of Munich
   421.5  *)
   421.6  
   421.7 -header {* A framework for "intensional" (possible-world based) logics
   421.8 +section {* A framework for "intensional" (possible-world based) logics
   421.9    on top of HOL, with lifting of constants and functions *}
  421.10  
  421.11  theory Intensional
   422.1 --- a/src/HOL/TLA/Memory/MemClerk.thy	Sun Nov 02 18:21:14 2014 +0100
   422.2 +++ b/src/HOL/TLA/Memory/MemClerk.thy	Sun Nov 02 18:21:45 2014 +0100
   422.3 @@ -2,7 +2,7 @@
   422.4      Author:     Stephan Merz, University of Munich
   422.5  *)
   422.6  
   422.7 -header {* RPC-Memory example: specification of the memory clerk *}
   422.8 +section {* RPC-Memory example: specification of the memory clerk *}
   422.9  
  422.10  theory MemClerk
  422.11  imports Memory RPC MemClerkParameters
   423.1 --- a/src/HOL/TLA/Memory/MemClerkParameters.thy	Sun Nov 02 18:21:14 2014 +0100
   423.2 +++ b/src/HOL/TLA/Memory/MemClerkParameters.thy	Sun Nov 02 18:21:45 2014 +0100
   423.3 @@ -2,7 +2,7 @@
   423.4      Author:     Stephan Merz, University of Munich
   423.5  *)
   423.6  
   423.7 -header {* RPC-Memory example: Parameters of the memory clerk *}
   423.8 +section {* RPC-Memory example: Parameters of the memory clerk *}
   423.9  
  423.10  theory MemClerkParameters
  423.11  imports RPCParameters
   424.1 --- a/src/HOL/TLA/Memory/Memory.thy	Sun Nov 02 18:21:14 2014 +0100
   424.2 +++ b/src/HOL/TLA/Memory/Memory.thy	Sun Nov 02 18:21:45 2014 +0100
   424.3 @@ -2,7 +2,7 @@
   424.4      Author:     Stephan Merz, University of Munich
   424.5  *)
   424.6  
   424.7 -header {* RPC-Memory example: Memory specification *}
   424.8 +section {* RPC-Memory example: Memory specification *}
   424.9  
  424.10  theory Memory
  424.11  imports MemoryParameters ProcedureInterface
   425.1 --- a/src/HOL/TLA/Memory/MemoryImplementation.thy	Sun Nov 02 18:21:14 2014 +0100
   425.2 +++ b/src/HOL/TLA/Memory/MemoryImplementation.thy	Sun Nov 02 18:21:45 2014 +0100
   425.3 @@ -2,7 +2,7 @@
   425.4      Author:     Stephan Merz, University of Munich
   425.5  *)
   425.6  
   425.7 -header {* RPC-Memory example: Memory implementation *}
   425.8 +section {* RPC-Memory example: Memory implementation *}
   425.9  
  425.10  theory MemoryImplementation
  425.11  imports Memory RPC MemClerk
   426.1 --- a/src/HOL/TLA/Memory/MemoryParameters.thy	Sun Nov 02 18:21:14 2014 +0100
   426.2 +++ b/src/HOL/TLA/Memory/MemoryParameters.thy	Sun Nov 02 18:21:45 2014 +0100
   426.3 @@ -2,7 +2,7 @@
   426.4      Author:     Stephan Merz, University of Munich
   426.5  *)
   426.6  
   426.7 -header {* RPC-Memory example: Memory parameters *}
   426.8 +section {* RPC-Memory example: Memory parameters *}
   426.9  
  426.10  theory MemoryParameters
  426.11  imports RPCMemoryParams
   427.1 --- a/src/HOL/TLA/Memory/ProcedureInterface.thy	Sun Nov 02 18:21:14 2014 +0100
   427.2 +++ b/src/HOL/TLA/Memory/ProcedureInterface.thy	Sun Nov 02 18:21:45 2014 +0100
   427.3 @@ -2,7 +2,7 @@
   427.4      Author:     Stephan Merz, University of Munich
   427.5  *)
   427.6  
   427.7 -header {* Procedure interface for RPC-Memory components *}
   427.8 +section {* Procedure interface for RPC-Memory components *}
   427.9  
  427.10  theory ProcedureInterface
  427.11  imports "../TLA" RPCMemoryParams
   428.1 --- a/src/HOL/TLA/Memory/RPC.thy	Sun Nov 02 18:21:14 2014 +0100
   428.2 +++ b/src/HOL/TLA/Memory/RPC.thy	Sun Nov 02 18:21:45 2014 +0100
   428.3 @@ -2,7 +2,7 @@
   428.4      Author:     Stephan Merz, University of Munich
   428.5  *)
   428.6  
   428.7 -header {* RPC-Memory example: RPC specification *}
   428.8 +section {* RPC-Memory example: RPC specification *}
   428.9  
  428.10  theory RPC
  428.11  imports RPCParameters ProcedureInterface Memory
   429.1 --- a/src/HOL/TLA/Memory/RPCMemoryParams.thy	Sun Nov 02 18:21:14 2014 +0100
   429.2 +++ b/src/HOL/TLA/Memory/RPCMemoryParams.thy	Sun Nov 02 18:21:45 2014 +0100
   429.3 @@ -2,7 +2,7 @@
   429.4      Author:     Stephan Merz, University of Munich
   429.5  *)
   429.6  
   429.7 -header {* Basic declarations for the RPC-memory example *}
   429.8 +section {* Basic declarations for the RPC-memory example *}
   429.9  
  429.10  theory RPCMemoryParams
  429.11  imports Main
   430.1 --- a/src/HOL/TLA/Memory/RPCParameters.thy	Sun Nov 02 18:21:14 2014 +0100
   430.2 +++ b/src/HOL/TLA/Memory/RPCParameters.thy	Sun Nov 02 18:21:45 2014 +0100
   430.3 @@ -2,7 +2,7 @@
   430.4      Author:     Stephan Merz, University of Munich
   430.5  *)
   430.6  
   430.7 -header {* RPC-Memory example: RPC parameters *}
   430.8 +section {* RPC-Memory example: RPC parameters *}
   430.9  
  430.10  theory RPCParameters
  430.11  imports MemoryParameters
   431.1 --- a/src/HOL/TLA/Stfun.thy	Sun Nov 02 18:21:14 2014 +0100
   431.2 +++ b/src/HOL/TLA/Stfun.thy	Sun Nov 02 18:21:45 2014 +0100
   431.3 @@ -3,7 +3,7 @@
   431.4      Copyright:  1998 University of Munich
   431.5  *)
   431.6  
   431.7 -header {* States and state functions for TLA as an "intensional" logic *}
   431.8 +section {* States and state functions for TLA as an "intensional" logic *}
   431.9  
  431.10  theory Stfun
  431.11  imports Intensional
   432.1 --- a/src/HOL/TLA/TLA.thy	Sun Nov 02 18:21:14 2014 +0100
   432.2 +++ b/src/HOL/TLA/TLA.thy	Sun Nov 02 18:21:45 2014 +0100
   432.3 @@ -3,7 +3,7 @@
   432.4      Copyright:  1998 University of Munich
   432.5  *)
   432.6  
   432.7 -header {* The temporal level of TLA *}
   432.8 +section {* The temporal level of TLA *}
   432.9  
  432.10  theory TLA
  432.11  imports Init
   433.1 --- a/src/HOL/TPTP/ATP_Problem_Import.thy	Sun Nov 02 18:21:14 2014 +0100
   433.2 +++ b/src/HOL/TPTP/ATP_Problem_Import.thy	Sun Nov 02 18:21:45 2014 +0100
   433.3 @@ -2,7 +2,7 @@
   433.4      Author:     Jasmin Blanchette, TU Muenchen
   433.5  *)
   433.6  
   433.7 -header {* ATP Problem Importer *}
   433.8 +section {* ATP Problem Importer *}
   433.9  
  433.10  theory ATP_Problem_Import
  433.11  imports Complex_Main TPTP_Interpret "~~/src/HOL/Library/Refute"
   434.1 --- a/src/HOL/TPTP/ATP_Theory_Export.thy	Sun Nov 02 18:21:14 2014 +0100
   434.2 +++ b/src/HOL/TPTP/ATP_Theory_Export.thy	Sun Nov 02 18:21:45 2014 +0100
   434.3 @@ -2,7 +2,7 @@
   434.4      Author:     Jasmin Blanchette, TU Muenchen
   434.5  *)
   434.6  
   434.7 -header {* ATP Theory Exporter *}
   434.8 +section {* ATP Theory Exporter *}
   434.9  
  434.10  theory ATP_Theory_Export
  434.11  imports Complex_Main
   435.1 --- a/src/HOL/TPTP/MaSh_Eval.thy	Sun Nov 02 18:21:14 2014 +0100
   435.2 +++ b/src/HOL/TPTP/MaSh_Eval.thy	Sun Nov 02 18:21:45 2014 +0100
   435.3 @@ -2,7 +2,7 @@
   435.4      Author:     Jasmin Blanchette, TU Muenchen
   435.5  *)
   435.6  
   435.7 -header {* MaSh Evaluation Driver *}
   435.8 +section {* MaSh Evaluation Driver *}
   435.9  
  435.10  theory MaSh_Eval
  435.11  imports MaSh_Export_Base
   436.1 --- a/src/HOL/TPTP/MaSh_Export.thy	Sun Nov 02 18:21:14 2014 +0100
   436.2 +++ b/src/HOL/TPTP/MaSh_Export.thy	Sun Nov 02 18:21:45 2014 +0100
   436.3 @@ -2,7 +2,7 @@
   436.4      Author:     Jasmin Blanchette, TU Muenchen
   436.5  *)
   436.6  
   436.7 -header {* MaSh Exporter *}
   436.8 +section {* MaSh Exporter *}
   436.9  
  436.10  theory MaSh_Export
  436.11  imports MaSh_Export_Base
   437.1 --- a/src/HOL/TPTP/MaSh_Export_Base.thy	Sun Nov 02 18:21:14 2014 +0100
   437.2 +++ b/src/HOL/TPTP/MaSh_Export_Base.thy	Sun Nov 02 18:21:45 2014 +0100
   437.3 @@ -2,7 +2,7 @@
   437.4      Author:     Jasmin Blanchette, TU Muenchen
   437.5  *)
   437.6  
   437.7 -header {* MaSh Exporter Base *}
   437.8 +section {* MaSh Exporter Base *}
   437.9  
  437.10  theory MaSh_Export_Base
  437.11  imports Main
   438.1 --- a/src/HOL/Taylor.thy	Sun Nov 02 18:21:14 2014 +0100
   438.2 +++ b/src/HOL/Taylor.thy	Sun Nov 02 18:21:45 2014 +0100
   438.3 @@ -2,7 +2,7 @@
   438.4      Author:     Lukas Bulwahn, Bernhard Haeupler, Technische Universitaet Muenchen
   438.5  *)
   438.6  
   438.7 -header {* Taylor series *}
   438.8 +section {* Taylor series *}
   438.9  
  438.10  theory Taylor
  438.11  imports MacLaurin
   439.1 --- a/src/HOL/Topological_Spaces.thy	Sun Nov 02 18:21:14 2014 +0100
   439.2 +++ b/src/HOL/Topological_Spaces.thy	Sun Nov 02 18:21:45 2014 +0100
   439.3 @@ -3,7 +3,7 @@
   439.4      Author:     Johannes Hölzl
   439.5  *)
   439.6  
   439.7 -header {* Topological Spaces *}
   439.8 +section {* Topological Spaces *}
   439.9  
  439.10  theory Topological_Spaces
  439.11  imports Main Conditionally_Complete_Lattices
   440.1 --- a/src/HOL/Transcendental.thy	Sun Nov 02 18:21:14 2014 +0100
   440.2 +++ b/src/HOL/Transcendental.thy	Sun Nov 02 18:21:45 2014 +0100
   440.3 @@ -4,7 +4,7 @@
   440.4      Author:     Jeremy Avigad
   440.5  *)
   440.6  
   440.7 -header{*Power Series, Transcendental Functions etc.*}
   440.8 +section{*Power Series, Transcendental Functions etc.*}
   440.9  
  440.10  theory Transcendental
  440.11  imports Fact Series Deriv NthRoot
   441.1 --- a/src/HOL/Transfer.thy	Sun Nov 02 18:21:14 2014 +0100
   441.2 +++ b/src/HOL/Transfer.thy	Sun Nov 02 18:21:45 2014 +0100
   441.3 @@ -3,7 +3,7 @@
   441.4      Author:     Ondrej Kuncar, TU Muenchen
   441.5  *)
   441.6  
   441.7 -header {* Generic theorem transfer using relations *}
   441.8 +section {* Generic theorem transfer using relations *}
   441.9  
  441.10  theory Transfer
  441.11  imports Hilbert_Choice Metis Option
   442.1 --- a/src/HOL/Transitive_Closure.thy	Sun Nov 02 18:21:14 2014 +0100
   442.2 +++ b/src/HOL/Transitive_Closure.thy	Sun Nov 02 18:21:45 2014 +0100
   442.3 @@ -3,7 +3,7 @@
   442.4      Copyright   1992  University of Cambridge
   442.5  *)
   442.6  
   442.7 -header {* Reflexive and Transitive closure of a relation *}
   442.8 +section {* Reflexive and Transitive closure of a relation *}
   442.9  
  442.10  theory Transitive_Closure
  442.11  imports Relation
   443.1 --- a/src/HOL/Typedef.thy	Sun Nov 02 18:21:14 2014 +0100
   443.2 +++ b/src/HOL/Typedef.thy	Sun Nov 02 18:21:45 2014 +0100
   443.3 @@ -2,7 +2,7 @@
   443.4      Author:     Markus Wenzel, TU Munich
   443.5  *)
   443.6  
   443.7 -header {* HOL type definitions *}
   443.8 +section {* HOL type definitions *}
   443.9  
  443.10  theory Typedef
  443.11  imports Set
   444.1 --- a/src/HOL/Typerep.thy	Sun Nov 02 18:21:14 2014 +0100
   444.2 +++ b/src/HOL/Typerep.thy	Sun Nov 02 18:21:45 2014 +0100
   444.3 @@ -1,6 +1,6 @@
   444.4  (* Author: Florian Haftmann, TU Muenchen *)
   444.5  
   444.6 -header {* Reflecting Pure types into HOL *}
   444.7 +section {* Reflecting Pure types into HOL *}
   444.8  
   444.9  theory Typerep
  444.10  imports String
   445.1 --- a/src/HOL/UNITY/Comp.thy	Sun Nov 02 18:21:14 2014 +0100
   445.2 +++ b/src/HOL/UNITY/Comp.thy	Sun Nov 02 18:21:45 2014 +0100
   445.3 @@ -8,7 +8,7 @@
   445.4  Technical Report 2000-003, University of Florida, 2000.
   445.5  *)
   445.6  
   445.7 -header{*Composition: Basic Primitives*}
   445.8 +section{*Composition: Basic Primitives*}
   445.9  
  445.10  theory Comp
  445.11  imports Union
   446.1 --- a/src/HOL/UNITY/Comp/AllocBase.thy	Sun Nov 02 18:21:14 2014 +0100
   446.2 +++ b/src/HOL/UNITY/Comp/AllocBase.thy	Sun Nov 02 18:21:45 2014 +0100
   446.3 @@ -3,7 +3,7 @@
   446.4      Copyright   1998  University of Cambridge
   446.5  *)
   446.6  
   446.7 -header{*Common Declarations for Chandy and Charpentier's Allocator*}
   446.8 +section{*Common Declarations for Chandy and Charpentier's Allocator*}
   446.9  
  446.10  theory AllocBase imports "../UNITY_Main" begin
  446.11  
   447.1 --- a/src/HOL/UNITY/Comp/AllocImpl.thy	Sun Nov 02 18:21:14 2014 +0100
   447.2 +++ b/src/HOL/UNITY/Comp/AllocImpl.thy	Sun Nov 02 18:21:45 2014 +0100
   447.3 @@ -3,7 +3,7 @@
   447.4      Copyright   1998  University of Cambridge
   447.5  *)
   447.6  
   447.7 -header{*Implementation of a multiple-client allocator from a single-client allocator*}
   447.8 +section{*Implementation of a multiple-client allocator from a single-client allocator*}
   447.9  
  447.10  theory AllocImpl imports AllocBase "../Follows" "../PPROD" begin
  447.11  
   448.1 --- a/src/HOL/UNITY/Comp/Client.thy	Sun Nov 02 18:21:14 2014 +0100
   448.2 +++ b/src/HOL/UNITY/Comp/Client.thy	Sun Nov 02 18:21:45 2014 +0100
   448.3 @@ -3,7 +3,7 @@
   448.4      Copyright   1998  University of Cambridge
   448.5  *)
   448.6  
   448.7 -header{*Distributed Resource Management System: the Client*}
   448.8 +section{*Distributed Resource Management System: the Client*}
   448.9  
  448.10  theory Client imports "../Rename" AllocBase begin
  448.11  
   449.1 --- a/src/HOL/UNITY/Comp/Counter.thy	Sun Nov 02 18:21:14 2014 +0100
   449.2 +++ b/src/HOL/UNITY/Comp/Counter.thy	Sun Nov 02 18:21:45 2014 +0100
   449.3 @@ -8,7 +8,7 @@
   449.4     Springer LNCS 1586 (1999), pages 1215-1227.
   449.5  *)
   449.6  
   449.7 -header{*A Family of Similar Counters: Original Version*}
   449.8 +section{*A Family of Similar Counters: Original Version*}
   449.9  
  449.10  theory Counter imports "../UNITY_Main" begin
  449.11  
   450.1 --- a/src/HOL/UNITY/Comp/Counterc.thy	Sun Nov 02 18:21:14 2014 +0100
   450.2 +++ b/src/HOL/UNITY/Comp/Counterc.thy	Sun Nov 02 18:21:45 2014 +0100
   450.3 @@ -11,7 +11,7 @@
   450.4     Spriner LNCS 1586 (1999), pages 1215-1227.
   450.5  *)
   450.6  
   450.7 -header{*A Family of Similar Counters: Version with Compatibility*}
   450.8 +section{*A Family of Similar Counters: Version with Compatibility*}
   450.9  
  450.10  theory Counterc imports "../UNITY_Main" begin
  450.11  
   451.1 --- a/src/HOL/UNITY/Comp/Priority.thy	Sun Nov 02 18:21:14 2014 +0100
   451.2 +++ b/src/HOL/UNITY/Comp/Priority.thy	Sun Nov 02 18:21:45 2014 +0100
   451.3 @@ -3,7 +3,7 @@
   451.4      Copyright   2001  University of Cambridge
   451.5  *)
   451.6  
   451.7 -header{*The priority system*}
   451.8 +section{*The priority system*}
   451.9  
  451.10  theory Priority imports PriorityAux begin
  451.11  
   452.1 --- a/src/HOL/UNITY/Comp/Progress.thy	Sun Nov 02 18:21:14 2014 +0100
   452.2 +++ b/src/HOL/UNITY/Comp/Progress.thy	Sun Nov 02 18:21:45 2014 +0100
   452.3 @@ -5,7 +5,7 @@
   452.4  David Meier's thesis
   452.5  *)
   452.6  
   452.7 -header{*Progress Set Examples*}
   452.8 +section{*Progress Set Examples*}
   452.9  
  452.10  theory Progress imports "../UNITY_Main" begin
  452.11  
   453.1 --- a/src/HOL/UNITY/Constrains.thy	Sun Nov 02 18:21:14 2014 +0100
   453.2 +++ b/src/HOL/UNITY/Constrains.thy	Sun Nov 02 18:21:45 2014 +0100
   453.3 @@ -5,7 +5,7 @@
   453.4  Weak safety relations: restricted to the set of reachable states.
   453.5  *)
   453.6  
   453.7 -header{*Weak Safety*}
   453.8 +section{*Weak Safety*}
   453.9  
  453.10  theory Constrains imports UNITY begin
  453.11  
   454.1 --- a/src/HOL/UNITY/Detects.thy	Sun Nov 02 18:21:14 2014 +0100
   454.2 +++ b/src/HOL/UNITY/Detects.thy	Sun Nov 02 18:21:45 2014 +0100
   454.3 @@ -5,7 +5,7 @@
   454.4  Detects definition (Section 3.8 of Chandy & Misra) using LeadsTo
   454.5  *)
   454.6  
   454.7 -header{*The Detects Relation*}
   454.8 +section{*The Detects Relation*}
   454.9  
  454.10  theory Detects imports FP SubstAx begin
  454.11  
   455.1 --- a/src/HOL/UNITY/ELT.thy	Sun Nov 02 18:21:14 2014 +0100
   455.2 +++ b/src/HOL/UNITY/ELT.thy	Sun Nov 02 18:21:45 2014 +0100
   455.3 @@ -21,7 +21,7 @@
   455.4    monos Pow_mono
   455.5  *)
   455.6  
   455.7 -header{*Progress Under Allowable Sets*}
   455.8 +section{*Progress Under Allowable Sets*}
   455.9  
  455.10  theory ELT imports Project begin
  455.11  
   456.1 --- a/src/HOL/UNITY/Extend.thy	Sun Nov 02 18:21:14 2014 +0100
   456.2 +++ b/src/HOL/UNITY/Extend.thy	Sun Nov 02 18:21:45 2014 +0100
   456.3 @@ -7,7 +7,7 @@
   456.4    function g (forgotten) maps the extended state to the "extending part"
   456.5  *)
   456.6  
   456.7 -header{*Extending State Sets*}
   456.8 +section{*Extending State Sets*}
   456.9  
  456.10  theory Extend imports Guar begin
  456.11  
   457.1 --- a/src/HOL/UNITY/FP.thy	Sun Nov 02 18:21:14 2014 +0100
   457.2 +++ b/src/HOL/UNITY/FP.thy	Sun Nov 02 18:21:45 2014 +0100
   457.3 @@ -5,7 +5,7 @@
   457.4  From Misra, "A Logic for Concurrent Programming", 1994
   457.5  *)
   457.6  
   457.7 -header{*Fixed Point of a Program*}
   457.8 +section{*Fixed Point of a Program*}
   457.9  
  457.10  theory FP imports UNITY begin
  457.11  
   458.1 --- a/src/HOL/UNITY/Follows.thy	Sun Nov 02 18:21:14 2014 +0100
   458.2 +++ b/src/HOL/UNITY/Follows.thy	Sun Nov 02 18:21:45 2014 +0100
   458.3 @@ -3,7 +3,7 @@
   458.4      Copyright   1998  University of Cambridge
   458.5  *)
   458.6  
   458.7 -header{*The Follows Relation of Charpentier and Sivilotte*}
   458.8 +section{*The Follows Relation of Charpentier and Sivilotte*}
   458.9  
  458.10  theory Follows
  458.11  imports SubstAx ListOrder "~~/src/HOL/Library/Multiset"
   459.1 --- a/src/HOL/UNITY/Guar.thy	Sun Nov 02 18:21:14 2014 +0100
   459.2 +++ b/src/HOL/UNITY/Guar.thy	Sun Nov 02 18:21:45 2014 +0100
   459.3 @@ -10,7 +10,7 @@
   459.4  Fifth International Conference on Mathematics of Program, 2000.
   459.5  *)
   459.6  
   459.7 -header{*Guarantees Specifications*}
   459.8 +section{*Guarantees Specifications*}
   459.9  
  459.10  theory Guar
  459.11  imports Comp
   460.1 --- a/src/HOL/UNITY/Lift_prog.thy	Sun Nov 02 18:21:14 2014 +0100
   460.2 +++ b/src/HOL/UNITY/Lift_prog.thy	Sun Nov 02 18:21:45 2014 +0100
   460.3 @@ -5,7 +5,7 @@
   460.4  lift_prog, etc: replication of components and arrays of processes. 
   460.5  *)
   460.6  
   460.7 -header{*Replication of Components*}
   460.8 +section{*Replication of Components*}
   460.9  
  460.10  theory Lift_prog imports Rename begin
  460.11  
   461.1 --- a/src/HOL/UNITY/ListOrder.thy	Sun Nov 02 18:21:14 2014 +0100
   461.2 +++ b/src/HOL/UNITY/ListOrder.thy	Sun Nov 02 18:21:45 2014 +0100
   461.3 @@ -10,7 +10,7 @@
   461.4  Also overloads <= and < for lists!
   461.5  *)
   461.6  
   461.7 -header {*The Prefix Ordering on Lists*}
   461.8 +section {*The Prefix Ordering on Lists*}
   461.9  
  461.10  theory ListOrder
  461.11  imports Main
   462.1 --- a/src/HOL/UNITY/ProgressSets.thy	Sun Nov 02 18:21:14 2014 +0100
   462.2 +++ b/src/HOL/UNITY/ProgressSets.thy	Sun Nov 02 18:21:45 2014 +0100
   462.3 @@ -13,7 +13,7 @@
   462.4      Swiss Federal Institute of Technology Zurich (1997)
   462.5  *)
   462.6  
   462.7 -header{*Progress Sets*}
   462.8 +section{*Progress Sets*}
   462.9  
  462.10  theory ProgressSets imports Transformers begin
  462.11  
   463.1 --- a/src/HOL/UNITY/Project.thy	Sun Nov 02 18:21:14 2014 +0100
   463.2 +++ b/src/HOL/UNITY/Project.thy	Sun Nov 02 18:21:45 2014 +0100
   463.3 @@ -7,7 +7,7 @@
   463.4  Inheritance of GUARANTEES properties under extension.
   463.5  *)
   463.6  
   463.7 -header{*Projections of State Sets*}
   463.8 +section{*Projections of State Sets*}
   463.9  
  463.10  theory Project imports Extend begin
  463.11  
   464.1 --- a/src/HOL/UNITY/Rename.thy	Sun Nov 02 18:21:14 2014 +0100
   464.2 +++ b/src/HOL/UNITY/Rename.thy	Sun Nov 02 18:21:45 2014 +0100
   464.3 @@ -3,7 +3,7 @@
   464.4      Copyright   2000  University of Cambridge
   464.5  *)
   464.6  
   464.7 -header{*Renaming of State Sets*}
   464.8 +section{*Renaming of State Sets*}
   464.9  
  464.10  theory Rename imports Extend begin
  464.11  
   465.1 --- a/src/HOL/UNITY/Simple/NSP_Bad.thy	Sun Nov 02 18:21:14 2014 +0100
   465.2 +++ b/src/HOL/UNITY/Simple/NSP_Bad.thy	Sun Nov 02 18:21:45 2014 +0100
   465.3 @@ -5,7 +5,7 @@
   465.4  Original file is ../Auth/NS_Public_Bad
   465.5  *)
   465.6  
   465.7 -header{*Analyzing the Needham-Schroeder Public-Key Protocol in UNITY*}
   465.8 +section{*Analyzing the Needham-Schroeder Public-Key Protocol in UNITY*}
   465.9  
  465.10  theory NSP_Bad imports "../../Auth/Public" "../UNITY_Main" begin
  465.11  
   466.1 --- a/src/HOL/UNITY/Simple/Token.thy	Sun Nov 02 18:21:14 2014 +0100
   466.2 +++ b/src/HOL/UNITY/Simple/Token.thy	Sun Nov 02 18:21:45 2014 +0100
   466.3 @@ -4,7 +4,7 @@
   466.4  *)
   466.5  
   466.6  
   466.7 -header {*The Token Ring*}
   466.8 +section {*The Token Ring*}
   466.9  
  466.10  theory Token
  466.11  imports "../WFair"
   467.1 --- a/src/HOL/UNITY/SubstAx.thy	Sun Nov 02 18:21:14 2014 +0100
   467.2 +++ b/src/HOL/UNITY/SubstAx.thy	Sun Nov 02 18:21:45 2014 +0100
   467.3 @@ -5,7 +5,7 @@
   467.4  Weak LeadsTo relation (restricted to the set of reachable states)
   467.5  *)
   467.6  
   467.7 -header{*Weak Progress*}
   467.8 +section{*Weak Progress*}
   467.9  
  467.10  theory SubstAx imports WFair Constrains begin
  467.11  
   468.1 --- a/src/HOL/UNITY/Transformers.thy	Sun Nov 02 18:21:14 2014 +0100
   468.2 +++ b/src/HOL/UNITY/Transformers.thy	Sun Nov 02 18:21:45 2014 +0100
   468.3 @@ -13,7 +13,7 @@
   468.4      Swiss Federal Institute of Technology Zurich (1997)
   468.5  *)
   468.6  
   468.7 -header{*Predicate Transformers*}
   468.8 +section{*Predicate Transformers*}
   468.9  
  468.10  theory Transformers imports Comp begin
  468.11  
   469.1 --- a/src/HOL/UNITY/UNITY.thy	Sun Nov 02 18:21:14 2014 +0100
   469.2 +++ b/src/HOL/UNITY/UNITY.thy	Sun Nov 02 18:21:45 2014 +0100
   469.3 @@ -8,7 +8,7 @@
   469.4  From Misra, "A Logic for Concurrent Programming", 1994.
   469.5  *)
   469.6  
   469.7 -header {*The Basic UNITY Theory*}
   469.8 +section {*The Basic UNITY Theory*}
   469.9  
  469.10  theory UNITY imports Main begin
  469.11  
   470.1 --- a/src/HOL/UNITY/UNITY_Main.thy	Sun Nov 02 18:21:14 2014 +0100
   470.2 +++ b/src/HOL/UNITY/UNITY_Main.thy	Sun Nov 02 18:21:45 2014 +0100
   470.3 @@ -3,7 +3,7 @@
   470.4      Copyright   2003  University of Cambridge
   470.5  *)
   470.6  
   470.7 -header{*Comprehensive UNITY Theory*}
   470.8 +section{*Comprehensive UNITY Theory*}
   470.9  
  470.10  theory UNITY_Main
  470.11  imports Detects PPROD Follows ProgressSets
   471.1 --- a/src/HOL/UNITY/Union.thy	Sun Nov 02 18:21:14 2014 +0100
   471.2 +++ b/src/HOL/UNITY/Union.thy	Sun Nov 02 18:21:45 2014 +0100
   471.3 @@ -5,7 +5,7 @@
   471.4  Partly from Misra's Chapter 5: Asynchronous Compositions of Programs.
   471.5  *)
   471.6  
   471.7 -header{*Unions of Programs*}
   471.8 +section{*Unions of Programs*}
   471.9  
  471.10  theory Union imports SubstAx FP begin
  471.11  
   472.1 --- a/src/HOL/UNITY/WFair.thy	Sun Nov 02 18:21:14 2014 +0100
   472.2 +++ b/src/HOL/UNITY/WFair.thy	Sun Nov 02 18:21:45 2014 +0100
   472.3 @@ -7,7 +7,7 @@
   472.4  From Misra, "A Logic for Concurrent Programming", 1994
   472.5  *)
   472.6  
   472.7 -header{*Progress*}
   472.8 +section{*Progress*}
   472.9  
  472.10  theory WFair imports UNITY begin
  472.11  
   473.1 --- a/src/HOL/Unix/Nested_Environment.thy	Sun Nov 02 18:21:14 2014 +0100
   473.2 +++ b/src/HOL/Unix/Nested_Environment.thy	Sun Nov 02 18:21:45 2014 +0100
   473.3 @@ -2,7 +2,7 @@
   473.4      Author:     Markus Wenzel, TU Muenchen
   473.5  *)
   473.6  
   473.7 -header \<open>Nested environments\<close>
   473.8 +section \<open>Nested environments\<close>
   473.9  
  473.10  theory Nested_Environment
  473.11  imports Main
   474.1 --- a/src/HOL/Unix/Unix.thy	Sun Nov 02 18:21:14 2014 +0100
   474.2 +++ b/src/HOL/Unix/Unix.thy	Sun Nov 02 18:21:45 2014 +0100
   474.3 @@ -2,7 +2,7 @@
   474.4      Author:     Markus Wenzel, TU Muenchen
   474.5  *)
   474.6  
   474.7 -header \<open>Unix file-systems \label{sec:unix-file-system}\<close>
   474.8 +section \<open>Unix file-systems \label{sec:unix-file-system}\<close>
   474.9  
  474.10  theory Unix
  474.11  imports
   475.1 --- a/src/HOL/Wellfounded.thy	Sun Nov 02 18:21:14 2014 +0100
   475.2 +++ b/src/HOL/Wellfounded.thy	Sun Nov 02 18:21:45 2014 +0100
   475.3 @@ -6,7 +6,7 @@
   475.4      Author:     Andrei Popescu, TU Muenchen
   475.5  *)
   475.6  
   475.7 -header {*Well-founded Recursion*}
   475.8 +section {*Well-founded Recursion*}
   475.9  
  475.10  theory Wellfounded
  475.11  imports Transitive_Closure
   476.1 --- a/src/HOL/Wfrec.thy	Sun Nov 02 18:21:14 2014 +0100
   476.2 +++ b/src/HOL/Wfrec.thy	Sun Nov 02 18:21:45 2014 +0100
   476.3 @@ -4,7 +4,7 @@
   476.4      Author:     Konrad Slind
   476.5  *)
   476.6  
   476.7 -header {* Well-Founded Recursion Combinator *}
   476.8 +section {* Well-Founded Recursion Combinator *}
   476.9  
  476.10  theory Wfrec
  476.11  imports Wellfounded
   477.1 --- a/src/HOL/Zorn.thy	Sun Nov 02 18:21:14 2014 +0100
   477.2 +++ b/src/HOL/Zorn.thy	Sun Nov 02 18:21:45 2014 +0100
   477.3 @@ -7,7 +7,7 @@
   477.4  The well-ordering theorem.
   477.5  *)
   477.6  
   477.7 -header {* Zorn's Lemma *}
   477.8 +section {* Zorn's Lemma *}
   477.9  
  477.10  theory Zorn
  477.11  imports Order_Relation Hilbert_Choice
   478.1 --- a/src/HOL/ex/Abstract_NAT.thy	Sun Nov 02 18:21:14 2014 +0100
   478.2 +++ b/src/HOL/ex/Abstract_NAT.thy	Sun Nov 02 18:21:45 2014 +0100
   478.3 @@ -2,7 +2,7 @@
   478.4      Author:     Makarius
   478.5  *)
   478.6  
   478.7 -header {* Abstract Natural Numbers primitive recursion *}
   478.8 +section {* Abstract Natural Numbers primitive recursion *}
   478.9  
  478.10  theory Abstract_NAT
  478.11  imports Main
   479.1 --- a/src/HOL/ex/Adhoc_Overloading_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   479.2 +++ b/src/HOL/ex/Adhoc_Overloading_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   479.3 @@ -2,7 +2,7 @@
   479.4      Author:     Christian Sternagel
   479.5  *)
   479.6  
   479.7 -header {* Ad Hoc Overloading *}
   479.8 +section {* Ad Hoc Overloading *}
   479.9  
  479.10  theory Adhoc_Overloading_Examples
  479.11  imports
   480.1 --- a/src/HOL/ex/Antiquote.thy	Sun Nov 02 18:21:14 2014 +0100
   480.2 +++ b/src/HOL/ex/Antiquote.thy	Sun Nov 02 18:21:45 2014 +0100
   480.3 @@ -2,7 +2,7 @@
   480.4      Author:     Markus Wenzel, TU Muenchen
   480.5  *)
   480.6  
   480.7 -header {* Antiquotations *}
   480.8 +section {* Antiquotations *}
   480.9  
  480.10  theory Antiquote
  480.11  imports Main
   481.1 --- a/src/HOL/ex/Arith_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   481.2 +++ b/src/HOL/ex/Arith_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   481.3 @@ -2,7 +2,7 @@
   481.4      Author: Tjark Weber
   481.5  *)
   481.6  
   481.7 -header {* Arithmetic *}
   481.8 +section {* Arithmetic *}
   481.9  
  481.10  theory Arith_Examples
  481.11  imports Main
   482.1 --- a/src/HOL/ex/BT.thy	Sun Nov 02 18:21:14 2014 +0100
   482.2 +++ b/src/HOL/ex/BT.thy	Sun Nov 02 18:21:45 2014 +0100
   482.3 @@ -5,7 +5,7 @@
   482.4  Binary trees
   482.5  *)
   482.6  
   482.7 -header {* Binary trees *}
   482.8 +section {* Binary trees *}
   482.9  
  482.10  theory BT imports Main begin
  482.11  
   483.1 --- a/src/HOL/ex/BinEx.thy	Sun Nov 02 18:21:14 2014 +0100
   483.2 +++ b/src/HOL/ex/BinEx.thy	Sun Nov 02 18:21:45 2014 +0100
   483.3 @@ -3,7 +3,7 @@
   483.4      Copyright   1998  University of Cambridge
   483.5  *)
   483.6  
   483.7 -header {* Binary arithmetic examples *}
   483.8 +section {* Binary arithmetic examples *}
   483.9  
  483.10  theory BinEx
  483.11  imports Complex_Main
   484.1 --- a/src/HOL/ex/Birthday_Paradox.thy	Sun Nov 02 18:21:14 2014 +0100
   484.2 +++ b/src/HOL/ex/Birthday_Paradox.thy	Sun Nov 02 18:21:45 2014 +0100
   484.3 @@ -2,7 +2,7 @@
   484.4      Author: Lukas Bulwahn, TU Muenchen, 2007
   484.5  *)
   484.6  
   484.7 -header {* A Formulation of the Birthday Paradox *}
   484.8 +section {* A Formulation of the Birthday Paradox *}
   484.9  
  484.10  theory Birthday_Paradox
  484.11  imports Main "~~/src/HOL/Fact" "~~/src/HOL/Library/FuncSet"
   485.1 --- a/src/HOL/ex/Bubblesort.thy	Sun Nov 02 18:21:14 2014 +0100
   485.2 +++ b/src/HOL/ex/Bubblesort.thy	Sun Nov 02 18:21:45 2014 +0100
   485.3 @@ -1,6 +1,6 @@
   485.4  (* Author: Tobias Nipkow *)
   485.5  
   485.6 -header {* Bubblesort *}
   485.7 +section {* Bubblesort *}
   485.8  
   485.9  theory Bubblesort
  485.10  imports "~~/src/HOL/Library/Multiset"
   486.1 --- a/src/HOL/ex/CTL.thy	Sun Nov 02 18:21:14 2014 +0100
   486.2 +++ b/src/HOL/ex/CTL.thy	Sun Nov 02 18:21:45 2014 +0100
   486.3 @@ -2,7 +2,7 @@
   486.4      Author:     Gertrud Bauer
   486.5  *)
   486.6  
   486.7 -header {* CTL formulae *}
   486.8 +section {* CTL formulae *}
   486.9  
  486.10  theory CTL
  486.11  imports Main
   487.1 --- a/src/HOL/ex/Cartouche_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   487.2 +++ b/src/HOL/ex/Cartouche_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   487.3 @@ -1,4 +1,4 @@
   487.4 -header {* Some examples with text cartouches *}
   487.5 +section {* Some examples with text cartouches *}
   487.6  
   487.7  theory Cartouche_Examples
   487.8  imports Main
   488.1 --- a/src/HOL/ex/Case_Product.thy	Sun Nov 02 18:21:14 2014 +0100
   488.2 +++ b/src/HOL/ex/Case_Product.thy	Sun Nov 02 18:21:45 2014 +0100
   488.3 @@ -3,7 +3,7 @@
   488.4      Copyright   2011 TU Muenchen
   488.5  *)
   488.6  
   488.7 -header {* Examples for the 'case_product' attribute *}
   488.8 +section {* Examples for the 'case_product' attribute *}
   488.9  
  488.10  theory Case_Product
  488.11  imports Main
   489.1 --- a/src/HOL/ex/Chinese.thy	Sun Nov 02 18:21:14 2014 +0100
   489.2 +++ b/src/HOL/ex/Chinese.thy	Sun Nov 02 18:21:45 2014 +0100
   489.3 @@ -4,7 +4,7 @@
   489.4  formal and informal ones.
   489.5  *)
   489.6  
   489.7 -header {* A Chinese theory *}
   489.8 +section {* A Chinese theory *}
   489.9  
  489.10  theory Chinese imports Main begin
  489.11  
   490.1 --- a/src/HOL/ex/Classical.thy	Sun Nov 02 18:21:14 2014 +0100
   490.2 +++ b/src/HOL/ex/Classical.thy	Sun Nov 02 18:21:45 2014 +0100
   490.3 @@ -3,7 +3,7 @@
   490.4      Copyright   1994  University of Cambridge
   490.5  *)
   490.6  
   490.7 -header{*Classical Predicate Calculus Problems*}
   490.8 +section{*Classical Predicate Calculus Problems*}
   490.9  
  490.10  theory Classical imports Main begin
  490.11  
   491.1 --- a/src/HOL/ex/Code_Binary_Nat_examples.thy	Sun Nov 02 18:21:14 2014 +0100
   491.2 +++ b/src/HOL/ex/Code_Binary_Nat_examples.thy	Sun Nov 02 18:21:45 2014 +0100
   491.3 @@ -2,7 +2,7 @@
   491.4      Author:     Florian Haftmann, TU Muenchen
   491.5  *)
   491.6  
   491.7 -header {* Simple examples for natural numbers implemented in binary representation. *}
   491.8 +section {* Simple examples for natural numbers implemented in binary representation. *}
   491.9  
  491.10  theory Code_Binary_Nat_examples
  491.11  imports Complex_Main "~~/src/HOL/Library/Code_Binary_Nat"
   492.1 --- a/src/HOL/ex/Coherent.thy	Sun Nov 02 18:21:14 2014 +0100
   492.2 +++ b/src/HOL/ex/Coherent.thy	Sun Nov 02 18:21:45 2014 +0100
   492.3 @@ -3,7 +3,7 @@
   492.4      Author:     Marc Bezem, Institutt for Informatikk, Universitetet i Bergen 
   492.5  *)
   492.6  
   492.7 -header {* Coherent Logic Problems *}
   492.8 +section {* Coherent Logic Problems *}
   492.9  
  492.10  theory Coherent
  492.11  imports Main
   493.1 --- a/src/HOL/ex/Eval_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   493.2 +++ b/src/HOL/ex/Eval_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   493.3 @@ -1,6 +1,6 @@
   493.4  (* Author: Florian Haftmann, TU Muenchen *)
   493.5  
   493.6 -header {* Small examples for evaluation mechanisms *}
   493.7 +section {* Small examples for evaluation mechanisms *}
   493.8  
   493.9  theory Eval_Examples
  493.10  imports Complex_Main
   494.1 --- a/src/HOL/ex/Execute_Choice.thy	Sun Nov 02 18:21:14 2014 +0100
   494.2 +++ b/src/HOL/ex/Execute_Choice.thy	Sun Nov 02 18:21:45 2014 +0100
   494.3 @@ -1,6 +1,6 @@
   494.4  (* Author: Florian Haftmann, TU Muenchen *)
   494.5  
   494.6 -header {* A simple cookbook example how to eliminate choice in programs. *}
   494.7 +section {* A simple cookbook example how to eliminate choice in programs. *}
   494.8  
   494.9  theory Execute_Choice
  494.10  imports Main "~~/src/HOL/Library/AList_Mapping"
   495.1 --- a/src/HOL/ex/FinFunPred.thy	Sun Nov 02 18:21:14 2014 +0100
   495.2 +++ b/src/HOL/ex/FinFunPred.thy	Sun Nov 02 18:21:45 2014 +0100
   495.3 @@ -1,6 +1,6 @@
   495.4  (*  Author:     Andreas Lochbihler *)
   495.5  
   495.6 -header {*
   495.7 +section {*
   495.8    Predicates modelled as FinFuns
   495.9  *}
  495.10  
   496.1 --- a/src/HOL/ex/Fundefs.thy	Sun Nov 02 18:21:14 2014 +0100
   496.2 +++ b/src/HOL/ex/Fundefs.thy	Sun Nov 02 18:21:45 2014 +0100
   496.3 @@ -2,7 +2,7 @@
   496.4      Author:     Alexander Krauss, TU Muenchen
   496.5  *)
   496.6  
   496.7 -header {* Examples of function definitions *}
   496.8 +section {* Examples of function definitions *}
   496.9  
  496.10  theory Fundefs 
  496.11  imports Main "~~/src/HOL/Library/Monad_Syntax"
   497.1 --- a/src/HOL/ex/Gauge_Integration.thy	Sun Nov 02 18:21:14 2014 +0100
   497.2 +++ b/src/HOL/ex/Gauge_Integration.thy	Sun Nov 02 18:21:45 2014 +0100
   497.3 @@ -4,7 +4,7 @@
   497.4      Replaced by ~~/src/HOL/Multivariate_Analysis/Real_Integral.thy .
   497.5  *)
   497.6  
   497.7 -header{*Theory of Integration on real intervals*}
   497.8 +section{*Theory of Integration on real intervals*}
   497.9  
  497.10  theory Gauge_Integration
  497.11  imports Complex_Main
   498.1 --- a/src/HOL/ex/Groebner_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   498.2 +++ b/src/HOL/ex/Groebner_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   498.3 @@ -2,7 +2,7 @@
   498.4      Author:     Amine Chaieb, TU Muenchen
   498.5  *)
   498.6  
   498.7 -header {* Groebner Basis Examples *}
   498.8 +section {* Groebner Basis Examples *}
   498.9  
  498.10  theory Groebner_Examples
  498.11  imports Groebner_Basis
   499.1 --- a/src/HOL/ex/Guess.thy	Sun Nov 02 18:21:14 2014 +0100
   499.2 +++ b/src/HOL/ex/Guess.thy	Sun Nov 02 18:21:45 2014 +0100
   499.3 @@ -2,7 +2,7 @@
   499.4      Author:     Makarius
   499.5  *)
   499.6  
   499.7 -header {* Proof by guessing *}
   499.8 +section {* Proof by guessing *}
   499.9  
  499.10  theory Guess
  499.11  imports Main
   500.1 --- a/src/HOL/ex/HarmonicSeries.thy	Sun Nov 02 18:21:14 2014 +0100
   500.2 +++ b/src/HOL/ex/HarmonicSeries.thy	Sun Nov 02 18:21:45 2014 +0100
   500.3 @@ -2,7 +2,7 @@
   500.4      Author:     Benjamin Porter, 2006
   500.5  *)
   500.6  
   500.7 -header {* Divergence of the Harmonic Series *}
   500.8 +section {* Divergence of the Harmonic Series *}
   500.9  
  500.10  theory HarmonicSeries
  500.11  imports Complex_Main
   501.1 --- a/src/HOL/ex/Hebrew.thy	Sun Nov 02 18:21:14 2014 +0100
   501.2 +++ b/src/HOL/ex/Hebrew.thy	Sun Nov 02 18:21:45 2014 +0100
   501.3 @@ -4,7 +4,7 @@
   501.4  formal and informal ones.
   501.5  *)
   501.6  
   501.7 -header {* A Hebrew theory *}
   501.8 +section {* A Hebrew theory *}
   501.9  
  501.10  theory Hebrew
  501.11  imports Main
   502.1 --- a/src/HOL/ex/Hex_Bin_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   502.2 +++ b/src/HOL/ex/Hex_Bin_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   502.3 @@ -2,7 +2,7 @@
   502.4      Author:     Gerwin Klein, NICTA
   502.5  *)
   502.6  
   502.7 -header {* Examples for hexadecimal and binary numerals *}
   502.8 +section {* Examples for hexadecimal and binary numerals *}
   502.9  
  502.10  theory Hex_Bin_Examples imports Main 
  502.11  begin
   503.1 --- a/src/HOL/ex/Higher_Order_Logic.thy	Sun Nov 02 18:21:14 2014 +0100
   503.2 +++ b/src/HOL/ex/Higher_Order_Logic.thy	Sun Nov 02 18:21:45 2014 +0100
   503.3 @@ -2,7 +2,7 @@
   503.4      Author:     Gertrud Bauer and Markus Wenzel, TU Muenchen
   503.5  *)
   503.6  
   503.7 -header {* Foundations of HOL *}
   503.8 +section {* Foundations of HOL *}
   503.9  
  503.10  theory Higher_Order_Logic imports Pure begin
  503.11  
   504.1 --- a/src/HOL/ex/Iff_Oracle.thy	Sun Nov 02 18:21:14 2014 +0100
   504.2 +++ b/src/HOL/ex/Iff_Oracle.thy	Sun Nov 02 18:21:45 2014 +0100
   504.3 @@ -3,7 +3,7 @@
   504.4      Author:     Makarius
   504.5  *)
   504.6  
   504.7 -header {* Example of Declaring an Oracle *}
   504.8 +section {* Example of Declaring an Oracle *}
   504.9  
  504.10  theory Iff_Oracle
  504.11  imports Main
   505.1 --- a/src/HOL/ex/Induction_Schema.thy	Sun Nov 02 18:21:14 2014 +0100
   505.2 +++ b/src/HOL/ex/Induction_Schema.thy	Sun Nov 02 18:21:45 2014 +0100
   505.3 @@ -2,7 +2,7 @@
   505.4      Author:     Alexander Krauss, TU Muenchen
   505.5  *)
   505.6  
   505.7 -header {* Examples of automatically derived induction rules *}
   505.8 +section {* Examples of automatically derived induction rules *}
   505.9  
  505.10  theory Induction_Schema
  505.11  imports Main
   506.1 --- a/src/HOL/ex/Intuitionistic.thy	Sun Nov 02 18:21:14 2014 +0100
   506.2 +++ b/src/HOL/ex/Intuitionistic.thy	Sun Nov 02 18:21:45 2014 +0100
   506.3 @@ -5,7 +5,7 @@
   506.4  Taken from FOL/ex/int.ML
   506.5  *)
   506.6  
   506.7 -header {* Higher-Order Logic: Intuitionistic predicate calculus problems *}
   506.8 +section {* Higher-Order Logic: Intuitionistic predicate calculus problems *}
   506.9  
  506.10  theory Intuitionistic imports Main begin
  506.11  
   507.1 --- a/src/HOL/ex/Lagrange.thy	Sun Nov 02 18:21:14 2014 +0100
   507.2 +++ b/src/HOL/ex/Lagrange.thy	Sun Nov 02 18:21:45 2014 +0100
   507.3 @@ -3,7 +3,7 @@
   507.4      Copyright   1996 TU Muenchen
   507.5  *)
   507.6  
   507.7 -header {* A lemma for Lagrange's theorem *}
   507.8 +section {* A lemma for Lagrange's theorem *}
   507.9  
  507.10  theory Lagrange imports Main begin
  507.11  
   508.1 --- a/src/HOL/ex/List_to_Set_Comprehension_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   508.2 +++ b/src/HOL/ex/List_to_Set_Comprehension_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   508.3 @@ -3,7 +3,7 @@
   508.4      Copyright   2011 TU Muenchen
   508.5  *)
   508.6  
   508.7 -header {* Examples for the list comprehension to set comprehension simproc *}
   508.8 +section {* Examples for the list comprehension to set comprehension simproc *}
   508.9  
  508.10  theory List_to_Set_Comprehension_Examples
  508.11  imports Main
   509.1 --- a/src/HOL/ex/LocaleTest2.thy	Sun Nov 02 18:21:14 2014 +0100
   509.2 +++ b/src/HOL/ex/LocaleTest2.thy	Sun Nov 02 18:21:45 2014 +0100
   509.3 @@ -8,7 +8,7 @@
   509.4  which is FOL/ex/LocaleTest.thy
   509.5  *)
   509.6  
   509.7 -header {* Test of Locale Interpretation *}
   509.8 +section {* Test of Locale Interpretation *}
   509.9  
  509.10  theory LocaleTest2
  509.11  imports Main GCD
   510.1 --- a/src/HOL/ex/ML.thy	Sun Nov 02 18:21:14 2014 +0100
   510.2 +++ b/src/HOL/ex/ML.thy	Sun Nov 02 18:21:45 2014 +0100
   510.3 @@ -2,7 +2,7 @@
   510.4      Author:     Makarius
   510.5  *)
   510.6  
   510.7 -header \<open>Isabelle/ML basics\<close>
   510.8 +section \<open>Isabelle/ML basics\<close>
   510.9  
  510.10  theory "ML"
  510.11  imports Main
   511.1 --- a/src/HOL/ex/MT.thy	Sun Nov 02 18:21:14 2014 +0100
   511.2 +++ b/src/HOL/ex/MT.thy	Sun Nov 02 18:21:45 2014 +0100
   511.3 @@ -12,7 +12,7 @@
   511.4      Report 308, Computer Lab, University of Cambridge (1993).
   511.5  *)
   511.6  
   511.7 -header {* Milner-Tofte: Co-induction in Relational Semantics *}
   511.8 +section {* Milner-Tofte: Co-induction in Relational Semantics *}
   511.9  
  511.10  theory MT
  511.11  imports Main
   512.1 --- a/src/HOL/ex/MergeSort.thy	Sun Nov 02 18:21:14 2014 +0100
   512.2 +++ b/src/HOL/ex/MergeSort.thy	Sun Nov 02 18:21:45 2014 +0100
   512.3 @@ -3,7 +3,7 @@
   512.4      Copyright   2002 TU Muenchen
   512.5  *)
   512.6  
   512.7 -header{*Merge Sort*}
   512.8 +section{*Merge Sort*}
   512.9  
  512.10  theory MergeSort
  512.11  imports "~~/src/HOL/Library/Multiset"
   513.1 --- a/src/HOL/ex/Meson_Test.thy	Sun Nov 02 18:21:14 2014 +0100
   513.2 +++ b/src/HOL/ex/Meson_Test.thy	Sun Nov 02 18:21:45 2014 +0100
   513.3 @@ -1,5 +1,5 @@
   513.4  
   513.5 -header {* Meson test cases *}
   513.6 +section {* Meson test cases *}
   513.7  
   513.8  theory Meson_Test
   513.9  imports Main
   514.1 --- a/src/HOL/ex/MonoidGroup.thy	Sun Nov 02 18:21:14 2014 +0100
   514.2 +++ b/src/HOL/ex/MonoidGroup.thy	Sun Nov 02 18:21:45 2014 +0100
   514.3 @@ -2,7 +2,7 @@
   514.4      Author:     Markus Wenzel
   514.5  *)
   514.6  
   514.7 -header {* Monoids and Groups as predicates over record schemes *}
   514.8 +section {* Monoids and Groups as predicates over record schemes *}
   514.9  
  514.10  theory MonoidGroup imports Main begin
  514.11  
   515.1 --- a/src/HOL/ex/Multiquote.thy	Sun Nov 02 18:21:14 2014 +0100
   515.2 +++ b/src/HOL/ex/Multiquote.thy	Sun Nov 02 18:21:45 2014 +0100
   515.3 @@ -2,7 +2,7 @@
   515.4      Author:     Markus Wenzel, TU Muenchen
   515.5  *)
   515.6  
   515.7 -header {* Multiple nested quotations and anti-quotations *}
   515.8 +section {* Multiple nested quotations and anti-quotations *}
   515.9  
  515.10  theory Multiquote
  515.11  imports Main
   516.1 --- a/src/HOL/ex/NatSum.thy	Sun Nov 02 18:21:14 2014 +0100
   516.2 +++ b/src/HOL/ex/NatSum.thy	Sun Nov 02 18:21:45 2014 +0100
   516.3 @@ -2,7 +2,7 @@
   516.4      Author: Tobias Nipkow
   516.5  *)
   516.6  
   516.7 -header {* Summing natural numbers *}
   516.8 +section {* Summing natural numbers *}
   516.9  
  516.10  theory NatSum imports Main begin
  516.11  
   517.1 --- a/src/HOL/ex/Normalization_by_Evaluation.thy	Sun Nov 02 18:21:14 2014 +0100
   517.2 +++ b/src/HOL/ex/Normalization_by_Evaluation.thy	Sun Nov 02 18:21:45 2014 +0100
   517.3 @@ -1,6 +1,6 @@
   517.4  (*  Authors:  Klaus Aehlig, Tobias Nipkow *)
   517.5  
   517.6 -header {* Testing implementation of normalization by evaluation *}
   517.7 +section {* Testing implementation of normalization by evaluation *}
   517.8  
   517.9  theory Normalization_by_Evaluation
  517.10  imports Complex_Main
   518.1 --- a/src/HOL/ex/PER.thy	Sun Nov 02 18:21:14 2014 +0100
   518.2 +++ b/src/HOL/ex/PER.thy	Sun Nov 02 18:21:45 2014 +0100
   518.3 @@ -2,7 +2,7 @@
   518.4      Author:     Oscar Slotosch and Markus Wenzel, TU Muenchen
   518.5  *)
   518.6  
   518.7 -header {* Partial equivalence relations *}
   518.8 +section {* Partial equivalence relations *}
   518.9  
  518.10  theory PER imports Main begin
  518.11  
   519.1 --- a/src/HOL/ex/Parallel_Example.thy	Sun Nov 02 18:21:14 2014 +0100
   519.2 +++ b/src/HOL/ex/Parallel_Example.thy	Sun Nov 02 18:21:45 2014 +0100
   519.3 @@ -1,4 +1,4 @@
   519.4 -header {* A simple example demonstrating parallelism for code generated towards Isabelle/ML *}
   519.5 +section {* A simple example demonstrating parallelism for code generated towards Isabelle/ML *}
   519.6  
   519.7  theory Parallel_Example
   519.8  imports Complex_Main "~~/src/HOL/Library/Parallel" "~~/src/HOL/Library/Debug"
   520.1 --- a/src/HOL/ex/PresburgerEx.thy	Sun Nov 02 18:21:14 2014 +0100
   520.2 +++ b/src/HOL/ex/PresburgerEx.thy	Sun Nov 02 18:21:45 2014 +0100
   520.3 @@ -2,7 +2,7 @@
   520.4      Author:     Amine Chaieb, TU Muenchen
   520.5  *)
   520.6  
   520.7 -header {* Some examples for Presburger Arithmetic *}
   520.8 +section {* Some examples for Presburger Arithmetic *}
   520.9  
  520.10  theory PresburgerEx
  520.11  imports Presburger
   521.1 --- a/src/HOL/ex/Primrec.thy	Sun Nov 02 18:21:14 2014 +0100
   521.2 +++ b/src/HOL/ex/Primrec.thy	Sun Nov 02 18:21:45 2014 +0100
   521.3 @@ -6,7 +6,7 @@
   521.4  Primitive Recursive Functions.
   521.5  *)
   521.6  
   521.7 -header {* Primitive Recursive Functions *}
   521.8 +section {* Primitive Recursive Functions *}
   521.9  
  521.10  theory Primrec imports Main begin
  521.11  
   522.1 --- a/src/HOL/ex/Quicksort.thy	Sun Nov 02 18:21:14 2014 +0100
   522.2 +++ b/src/HOL/ex/Quicksort.thy	Sun Nov 02 18:21:45 2014 +0100
   522.3 @@ -2,7 +2,7 @@
   522.4      Copyright   1994 TU Muenchen
   522.5  *)
   522.6  
   522.7 -header {* Quicksort with function package *}
   522.8 +section {* Quicksort with function package *}
   522.9  
  522.10  theory Quicksort
  522.11  imports "~~/src/HOL/Library/Multiset"
   523.1 --- a/src/HOL/ex/Records.thy	Sun Nov 02 18:21:14 2014 +0100
   523.2 +++ b/src/HOL/ex/Records.thy	Sun Nov 02 18:21:45 2014 +0100
   523.3 @@ -3,7 +3,7 @@
   523.4                  TU Muenchen
   523.5  *)
   523.6  
   523.7 -header {* Using extensible records in HOL -- points and coloured points *}
   523.8 +section {* Using extensible records in HOL -- points and coloured points *}
   523.9  
  523.10  theory Records
  523.11  imports Main
   524.1 --- a/src/HOL/ex/Reflection_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   524.2 +++ b/src/HOL/ex/Reflection_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   524.3 @@ -2,7 +2,7 @@
   524.4      Author:     Amine Chaieb, TU Muenchen
   524.5  *)
   524.6  
   524.7 -header {* Examples for generic reflection and reification *}
   524.8 +section {* Examples for generic reflection and reification *}
   524.9  
  524.10  theory Reflection_Examples
  524.11  imports Complex_Main "~~/src/HOL/Library/Reflection"
   525.1 --- a/src/HOL/ex/Refute_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   525.2 +++ b/src/HOL/ex/Refute_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   525.3 @@ -5,7 +5,7 @@
   525.4  See HOL/Refute.thy for help.
   525.5  *)
   525.6  
   525.7 -header {* Examples for the 'refute' command *}
   525.8 +section {* Examples for the 'refute' command *}
   525.9  
  525.10  theory Refute_Examples
  525.11  imports "~~/src/HOL/Library/Refute"
   526.1 --- a/src/HOL/ex/SAT_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   526.2 +++ b/src/HOL/ex/SAT_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   526.3 @@ -3,7 +3,7 @@
   526.4      Copyright   2005-2009
   526.5  *)
   526.6  
   526.7 -header {* Examples for proof methods "sat" and "satx" *}
   526.8 +section {* Examples for proof methods "sat" and "satx" *}
   526.9  
  526.10  theory SAT_Examples
  526.11  imports Main
   527.1 --- a/src/HOL/ex/SVC_Oracle.thy	Sun Nov 02 18:21:14 2014 +0100
   527.2 +++ b/src/HOL/ex/SVC_Oracle.thy	Sun Nov 02 18:21:45 2014 +0100
   527.3 @@ -5,7 +5,7 @@
   527.4  Based upon the work of Søren T. Heilmann.
   527.5  *)
   527.6  
   527.7 -header {* Installing an oracle for SVC (Stanford Validity Checker) *}
   527.8 +section {* Installing an oracle for SVC (Stanford Validity Checker) *}
   527.9  
  527.10  theory SVC_Oracle
  527.11  imports Main
   528.1 --- a/src/HOL/ex/Seq.thy	Sun Nov 02 18:21:14 2014 +0100
   528.2 +++ b/src/HOL/ex/Seq.thy	Sun Nov 02 18:21:45 2014 +0100
   528.3 @@ -2,7 +2,7 @@
   528.4      Author:     Makarius
   528.5  *)
   528.6  
   528.7 -header \<open>Finite sequences\<close>
   528.8 +section \<open>Finite sequences\<close>
   528.9  
  528.10  theory Seq
  528.11  imports Main
   529.1 --- a/src/HOL/ex/Serbian.thy	Sun Nov 02 18:21:14 2014 +0100
   529.2 +++ b/src/HOL/ex/Serbian.thy	Sun Nov 02 18:21:45 2014 +0100
   529.3 @@ -4,7 +4,7 @@
   529.4  Conversion between Serbian cyrillic and latin letters (српска ћирилица и латиница)
   529.5  *)
   529.6  
   529.7 -header {* A Serbian theory *}
   529.8 +section {* A Serbian theory *}
   529.9  
  529.10  theory Serbian
  529.11  imports Main
   530.1 --- a/src/HOL/ex/Set_Comprehension_Pointfree_Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   530.2 +++ b/src/HOL/ex/Set_Comprehension_Pointfree_Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   530.3 @@ -3,7 +3,7 @@
   530.4      Copyright   2012 TU Muenchen
   530.5  *)
   530.6  
   530.7 -header {* Examples for the set comprehension to pointfree simproc *}
   530.8 +section {* Examples for the set comprehension to pointfree simproc *}
   530.9  
  530.10  theory Set_Comprehension_Pointfree_Examples
  530.11  imports Main
   531.1 --- a/src/HOL/ex/Set_Theory.thy	Sun Nov 02 18:21:14 2014 +0100
   531.2 +++ b/src/HOL/ex/Set_Theory.thy	Sun Nov 02 18:21:45 2014 +0100
   531.3 @@ -3,7 +3,7 @@
   531.4      Copyright   1991  University of Cambridge
   531.5  *)
   531.6  
   531.7 -header {* Set Theory examples: Cantor's Theorem, Schröder-Bernstein Theorem, etc. *}
   531.8 +section {* Set Theory examples: Cantor's Theorem, Schröder-Bernstein Theorem, etc. *}
   531.9  
  531.10  theory Set_Theory
  531.11  imports Main
   532.1 --- a/src/HOL/ex/Simproc_Tests.thy	Sun Nov 02 18:21:14 2014 +0100
   532.2 +++ b/src/HOL/ex/Simproc_Tests.thy	Sun Nov 02 18:21:45 2014 +0100
   532.3 @@ -2,7 +2,7 @@
   532.4      Author:     Brian Huffman
   532.5  *)
   532.6  
   532.7 -header {* Testing of arithmetic simprocs *}
   532.8 +section {* Testing of arithmetic simprocs *}
   532.9  
  532.10  theory Simproc_Tests
  532.11  imports Main
   533.1 --- a/src/HOL/ex/Sqrt.thy	Sun Nov 02 18:21:14 2014 +0100
   533.2 +++ b/src/HOL/ex/Sqrt.thy	Sun Nov 02 18:21:45 2014 +0100
   533.3 @@ -2,7 +2,7 @@
   533.4      Author:     Markus Wenzel, Tobias Nipkow, TU Muenchen
   533.5  *)
   533.6  
   533.7 -header {*  Square roots of primes are irrational *}
   533.8 +section {*  Square roots of primes are irrational *}
   533.9  
  533.10  theory Sqrt
  533.11  imports Complex_Main "~~/src/HOL/Number_Theory/Primes"
   534.1 --- a/src/HOL/ex/Sqrt_Script.thy	Sun Nov 02 18:21:14 2014 +0100
   534.2 +++ b/src/HOL/ex/Sqrt_Script.thy	Sun Nov 02 18:21:45 2014 +0100
   534.3 @@ -3,7 +3,7 @@
   534.4      Copyright   2001  University of Cambridge
   534.5  *)
   534.6  
   534.7 -header {* Square roots of primes are irrational (script version) *}
   534.8 +section {* Square roots of primes are irrational (script version) *}
   534.9  
  534.10  theory Sqrt_Script
  534.11  imports Complex_Main "~~/src/HOL/Number_Theory/Primes"
   535.1 --- a/src/HOL/ex/Sudoku.thy	Sun Nov 02 18:21:14 2014 +0100
   535.2 +++ b/src/HOL/ex/Sudoku.thy	Sun Nov 02 18:21:45 2014 +0100
   535.3 @@ -3,7 +3,7 @@
   535.4      Copyright   2005-2014
   535.5  *)
   535.6  
   535.7 -header {* A SAT-based Sudoku Solver *}
   535.8 +section {* A SAT-based Sudoku Solver *}
   535.9  
  535.10  theory Sudoku
  535.11  imports Main
   536.1 --- a/src/HOL/ex/Tarski.thy	Sun Nov 02 18:21:14 2014 +0100
   536.2 +++ b/src/HOL/ex/Tarski.thy	Sun Nov 02 18:21:45 2014 +0100
   536.3 @@ -2,7 +2,7 @@
   536.4      Author:     Florian Kammüller, Cambridge University Computer Laboratory
   536.5  *)
   536.6  
   536.7 -header {* The Full Theorem of Tarski *}
   536.8 +section {* The Full Theorem of Tarski *}
   536.9  
  536.10  theory Tarski
  536.11  imports Main "~~/src/HOL/Library/FuncSet"
   537.1 --- a/src/HOL/ex/Termination.thy	Sun Nov 02 18:21:14 2014 +0100
   537.2 +++ b/src/HOL/ex/Termination.thy	Sun Nov 02 18:21:45 2014 +0100
   537.3 @@ -3,7 +3,7 @@
   537.4     Author:      Alexander Krauss, TU Muenchen
   537.5  *)
   537.6  
   537.7 -header {* Examples and regression tests for automated termination proofs *}
   537.8 +section {* Examples and regression tests for automated termination proofs *}
   537.9   
  537.10  theory Termination
  537.11  imports Main "~~/src/HOL/Library/Multiset"
   538.1 --- a/src/HOL/ex/ThreeDivides.thy	Sun Nov 02 18:21:14 2014 +0100
   538.2 +++ b/src/HOL/ex/ThreeDivides.thy	Sun Nov 02 18:21:45 2014 +0100
   538.3 @@ -2,7 +2,7 @@
   538.4      Author:     Benjamin Porter, 2005
   538.5  *)
   538.6  
   538.7 -header {* Three Divides Theorem *}
   538.8 +section {* Three Divides Theorem *}
   538.9  
  538.10  theory ThreeDivides
  538.11  imports Main "~~/src/HOL/Library/LaTeXsugar"
   539.1 --- a/src/HOL/ex/Transfer_Ex.thy	Sun Nov 02 18:21:14 2014 +0100
   539.2 +++ b/src/HOL/ex/Transfer_Ex.thy	Sun Nov 02 18:21:45 2014 +0100
   539.3 @@ -1,5 +1,5 @@
   539.4  
   539.5 -header {* Various examples for transfer procedure *}
   539.6 +section {* Various examples for transfer procedure *}
   539.7  
   539.8  theory Transfer_Ex
   539.9  imports Main Transfer_Int_Nat
   540.1 --- a/src/HOL/ex/Transfer_Int_Nat.thy	Sun Nov 02 18:21:14 2014 +0100
   540.2 +++ b/src/HOL/ex/Transfer_Int_Nat.thy	Sun Nov 02 18:21:45 2014 +0100
   540.3 @@ -2,7 +2,7 @@
   540.4      Author:     Brian Huffman, TU Muenchen
   540.5  *)
   540.6  
   540.7 -header {* Using the transfer method between nat and int *}
   540.8 +section {* Using the transfer method between nat and int *}
   540.9  
  540.10  theory Transfer_Int_Nat
  540.11  imports GCD
   541.1 --- a/src/HOL/ex/Transitive_Closure_Table_Ex.thy	Sun Nov 02 18:21:14 2014 +0100
   541.2 +++ b/src/HOL/ex/Transitive_Closure_Table_Ex.thy	Sun Nov 02 18:21:45 2014 +0100
   541.3 @@ -1,6 +1,6 @@
   541.4  (* Author: Stefan Berghofer, Lukas Bulwahn, TU Muenchen *)
   541.5  
   541.6 -header {* Simple example for table-based implementation of the reflexive transitive closure *}
   541.7 +section {* Simple example for table-based implementation of the reflexive transitive closure *}
   541.8  
   541.9  theory Transitive_Closure_Table_Ex
  541.10  imports "~~/src/HOL/Library/Transitive_Closure_Table"
   542.1 --- a/src/HOL/ex/Tree23.thy	Sun Nov 02 18:21:14 2014 +0100
   542.2 +++ b/src/HOL/ex/Tree23.thy	Sun Nov 02 18:21:45 2014 +0100
   542.3 @@ -2,7 +2,7 @@
   542.4      Author:     Tobias Nipkow, TU Muenchen
   542.5  *)
   542.6  
   542.7 -header {* 2-3 Trees *}
   542.8 +section {* 2-3 Trees *}
   542.9  
  542.10  theory Tree23
  542.11  imports Main
   543.1 --- a/src/HOL/ex/Unification.thy	Sun Nov 02 18:21:14 2014 +0100
   543.2 +++ b/src/HOL/ex/Unification.thy	Sun Nov 02 18:21:45 2014 +0100
   543.3 @@ -4,7 +4,7 @@
   543.4      Author:     Alexander Krauss, TUM
   543.5  *)
   543.6  
   543.7 -header {* Substitution and Unification *}
   543.8 +section {* Substitution and Unification *}
   543.9  
  543.10  theory Unification
  543.11  imports Main
   544.1 --- a/src/HOL/ex/While_Combinator_Example.thy	Sun Nov 02 18:21:14 2014 +0100
   544.2 +++ b/src/HOL/ex/While_Combinator_Example.thy	Sun Nov 02 18:21:45 2014 +0100
   544.3 @@ -3,7 +3,7 @@
   544.4      Copyright   2000 TU Muenchen
   544.5  *)
   544.6  
   544.7 -header {* An application of the While combinator *}
   544.8 +section {* An application of the While combinator *}
   544.9  
  544.10  theory While_Combinator_Example
  544.11  imports "~~/src/HOL/Library/While_Combinator"
   545.1 --- a/src/HOL/ex/svc_test.thy	Sun Nov 02 18:21:14 2014 +0100
   545.2 +++ b/src/HOL/ex/svc_test.thy	Sun Nov 02 18:21:45 2014 +0100
   545.3 @@ -1,4 +1,4 @@
   545.4 -header {* Demonstrating the interface SVC *}
   545.5 +section {* Demonstrating the interface SVC *}
   545.6  
   545.7  theory svc_test
   545.8  imports SVC_Oracle
   546.1 --- a/src/LCF/LCF.thy	Sun Nov 02 18:21:14 2014 +0100
   546.2 +++ b/src/LCF/LCF.thy	Sun Nov 02 18:21:45 2014 +0100
   546.3 @@ -3,7 +3,7 @@
   546.4      Copyright   1992  University of Cambridge
   546.5  *)
   546.6  
   546.7 -header {* LCF on top of First-Order Logic *}
   546.8 +section {* LCF on top of First-Order Logic *}
   546.9  
  546.10  theory LCF
  546.11  imports "~~/src/FOL/FOL"
   547.1 --- a/src/LCF/ex/Ex1.thy	Sun Nov 02 18:21:14 2014 +0100
   547.2 +++ b/src/LCF/ex/Ex1.thy	Sun Nov 02 18:21:45 2014 +0100
   547.3 @@ -1,4 +1,4 @@
   547.4 -header {*  Section 10.4 *}
   547.5 +section {*  Section 10.4 *}
   547.6  
   547.7  theory Ex1
   547.8  imports LCF
   548.1 --- a/src/LCF/ex/Ex2.thy	Sun Nov 02 18:21:14 2014 +0100
   548.2 +++ b/src/LCF/ex/Ex2.thy	Sun Nov 02 18:21:45 2014 +0100
   548.3 @@ -1,4 +1,4 @@
   548.4 -header {* Example 3.8 *}
   548.5 +section {* Example 3.8 *}
   548.6  
   548.7  theory Ex2
   548.8  imports LCF
   549.1 --- a/src/LCF/ex/Ex3.thy	Sun Nov 02 18:21:14 2014 +0100
   549.2 +++ b/src/LCF/ex/Ex3.thy	Sun Nov 02 18:21:45 2014 +0100
   549.3 @@ -1,4 +1,4 @@
   549.4 -header {* Addition with fixpoint of successor *}
   549.5 +section {* Addition with fixpoint of successor *}
   549.6  
   549.7  theory Ex3
   549.8  imports LCF
   550.1 --- a/src/LCF/ex/Ex4.thy	Sun Nov 02 18:21:14 2014 +0100
   550.2 +++ b/src/LCF/ex/Ex4.thy	Sun Nov 02 18:21:45 2014 +0100
   550.3 @@ -1,5 +1,5 @@
   550.4  
   550.5 -header {* Prefixpoints *}
   550.6 +section {* Prefixpoints *}
   550.7  
   550.8  theory Ex4
   550.9  imports LCF
   551.1 --- a/src/Sequents/LK/Nat.thy	Sun Nov 02 18:21:14 2014 +0100
   551.2 +++ b/src/Sequents/LK/Nat.thy	Sun Nov 02 18:21:45 2014 +0100
   551.3 @@ -3,7 +3,7 @@
   551.4      Copyright   1999  University of Cambridge
   551.5  *)
   551.6  
   551.7 -header {* Theory of the natural numbers: Peano's axioms, primitive recursion *}
   551.8 +section {* Theory of the natural numbers: Peano's axioms, primitive recursion *}
   551.9  
  551.10  theory Nat
  551.11  imports "../LK"
   552.1 --- a/src/Sequents/LK/Propositional.thy	Sun Nov 02 18:21:14 2014 +0100
   552.2 +++ b/src/Sequents/LK/Propositional.thy	Sun Nov 02 18:21:45 2014 +0100
   552.3 @@ -3,7 +3,7 @@
   552.4      Copyright   1992  University of Cambridge
   552.5  *)
   552.6  
   552.7 -header {* Classical sequent calculus: examples with propositional connectives *}
   552.8 +section {* Classical sequent calculus: examples with propositional connectives *}
   552.9  
  552.10  theory Propositional
  552.11  imports "../LK"
   553.1 --- a/src/Sequents/LK0.thy	Sun Nov 02 18:21:14 2014 +0100
   553.2 +++ b/src/Sequents/LK0.thy	Sun Nov 02 18:21:45 2014 +0100
   553.3 @@ -6,7 +6,7 @@
   553.4  (eta-expanded, beta-contracted).
   553.5  *)
   553.6  
   553.7 -header {* Classical First-Order Sequent Calculus *}
   553.8 +section {* Classical First-Order Sequent Calculus *}
   553.9  
  553.10  theory LK0
  553.11  imports Sequents
   554.1 --- a/src/Sequents/Sequents.thy	Sun Nov 02 18:21:14 2014 +0100
   554.2 +++ b/src/Sequents/Sequents.thy	Sun Nov 02 18:21:45 2014 +0100
   554.3 @@ -3,7 +3,7 @@
   554.4      Copyright   1993  University of Cambridge
   554.5  *)
   554.6  
   554.7 -header {* Parsing and pretty-printing of sequences *}
   554.8 +section {* Parsing and pretty-printing of sequences *}
   554.9  
  554.10  theory Sequents
  554.11  imports Pure
   555.1 --- a/src/Tools/Adhoc_Overloading.thy	Sun Nov 02 18:21:14 2014 +0100
   555.2 +++ b/src/Tools/Adhoc_Overloading.thy	Sun Nov 02 18:21:45 2014 +0100
   555.3 @@ -2,7 +2,7 @@
   555.4     Author: Christian Sternagel, University of Innsbruck
   555.5  *)
   555.6  
   555.7 -header {* Adhoc overloading of constants based on their types *}
   555.8 +section {* Adhoc overloading of constants based on their types *}
   555.9  
  555.10  theory Adhoc_Overloading
  555.11  imports Pure
   556.1 --- a/src/Tools/Code_Generator.thy	Sun Nov 02 18:21:14 2014 +0100
   556.2 +++ b/src/Tools/Code_Generator.thy	Sun Nov 02 18:21:45 2014 +0100
   556.3 @@ -2,7 +2,7 @@
   556.4      Author:  Florian Haftmann, TU Muenchen
   556.5  *)
   556.6  
   556.7 -header {* Loading the code generator and related modules *}
   556.8 +section {* Loading the code generator and related modules *}
   556.9  
  556.10  theory Code_Generator
  556.11  imports Pure
   557.1 --- a/src/Tools/Permanent_Interpretation.thy	Sun Nov 02 18:21:14 2014 +0100
   557.2 +++ b/src/Tools/Permanent_Interpretation.thy	Sun Nov 02 18:21:45 2014 +0100
   557.3 @@ -2,7 +2,7 @@
   557.4      Author:  Florian Haftmann, TU Muenchen
   557.5  *)
   557.6  
   557.7 -header {* Permanent interpretation accompanied with mixin definitions. *}
   557.8 +section {* Permanent interpretation accompanied with mixin definitions. *}
   557.9  
  557.10  theory Permanent_Interpretation
  557.11  imports Pure
   558.1 --- a/src/Tools/SML/Examples.thy	Sun Nov 02 18:21:14 2014 +0100
   558.2 +++ b/src/Tools/SML/Examples.thy	Sun Nov 02 18:21:45 2014 +0100
   558.3 @@ -2,7 +2,7 @@
   558.4      Author:     Makarius
   558.5  *)
   558.6  
   558.7 -header \<open>Standard ML within the Isabelle environment\<close>
   558.8 +section \<open>Standard ML within the Isabelle environment\<close>
   558.9  
  558.10  theory Examples
  558.11  imports Pure