isabelle: NEWS@a74ee84288a0 (annotated)

wenzelm@5363	1	Isabelle NEWS -- history user-relevant changes
wenzelm@5363	2	==============================================
wenzelm@2553	3
wenzelm@30904	4	New in this Isabelle version
wenzelm@30904	5	----------------------------
wenzelm@30904	6
haftmann@30951	7	* Pure *
haftmann@30951	8
haftmann@30951	9	* On instantiation of classes, remaining undefined class parameters are
haftmann@30951	10	formally declared. INCOMPATIBILITY.
haftmann@30951	11
haftmann@30951	12
haftmann@30930	13	* HOL *
haftmann@30930	14
haftmann@30955	15	* Class semiring_div requires superclass no_zero_divisors and proof of div_mult_mult1;
haftmann@30930	16	theorems div_mult_mult1, div_mult_mult2, div_mult_mult1_if, div_mult_mult1 and
haftmann@30930	17	div_mult_mult2 have been generalized to class semiring_div, subsuming former
haftmann@30930	18	theorems zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and zdiv_zmult_zmult2.
haftmann@30930	19	div_mult_mult1 is now [simp] by default. INCOMPATIBILITY.
haftmann@30930	20
haftmann@30971	21	* Power operations on relations and functions are now one dedicate constant compow with
haftmann@30971	22	infix syntax "^^". Power operations on multiplicative monoids retains syntax "^"
haftmann@31001	23	and is now defined generic in class power. INCOMPATIBILITY.
haftmann@30964	24
haftmann@30964	25	* ML antiquotation @{code_datatype} inserts definition of a datatype generated
haftmann@30964	26	by the code generator; see Predicate.thy for an example.
wenzelm@30904	27
haftmann@30949	28
wenzelm@31304	29	* ML *
wenzelm@31304	30
wenzelm@31306	31	* Eliminated old Attrib.add_attributes, Method.add_methods and related
wenzelm@31306	32	cominators for "args". INCOMPATIBILITY, need to use simplified
wenzelm@31306	33	Attrib/Method.setup introduced in Isabelle2009.
wenzelm@31304	34
wenzelm@31304	35
wenzelm@31304	36
wenzelm@30845	37	New in Isabelle2009 (April 2009)
wenzelm@30845	38	--------------------------------
haftmann@27104	39
wenzelm@27599	40	* General *
wenzelm@27599	41
wenzelm@28504	42	* Simplified main Isabelle executables, with less surprises on
wenzelm@28504	43	case-insensitive file-systems (such as Mac OS).
wenzelm@28504	44
wenzelm@28504	45	- The main Isabelle tool wrapper is now called "isabelle" instead of
wenzelm@28504	46	"isatool."
wenzelm@28504	47
wenzelm@28504	48	- The former "isabelle" alias for "isabelle-process" has been
wenzelm@28504	49	removed (should rarely occur to regular users).
wenzelm@28504	50
wenzelm@28915	51	- The former "isabelle-interface" and its alias "Isabelle" have been
wenzelm@28915	52	removed (interfaces are now regular Isabelle tools).
wenzelm@28504	53
wenzelm@28504	54	Within scripts and make files, the Isabelle environment variables
wenzelm@28504	55	ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
wenzelm@28504	56	respectively. (The latter are still available as legacy feature.)
wenzelm@28504	57
wenzelm@28915	58	The old isabelle-interface wrapper could react in confusing ways if
wenzelm@28915	59	the interface was uninstalled or changed otherwise. Individual
wenzelm@28915	60	interface tool configuration is now more explicit, see also the
wenzelm@28915	61	Isabelle system manual. In particular, Proof General is now available
wenzelm@28915	62	via "isabelle emacs".
wenzelm@28504	63
wenzelm@28504	64	INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
wenzelm@28504	65	purge installed copies of Isabelle executables and re-run "isabelle
wenzelm@28504	66	install -p ...", or use symlinks.
wenzelm@28504	67
wenzelm@28914	68	* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
wenzelm@30845	69	old ~/isabelle, which was slightly non-standard and apt to cause
wenzelm@30845	70	surprises on case-insensitive file-systems (such as Mac OS).
wenzelm@28914	71
wenzelm@28914	72	INCOMPATIBILITY, need to move existing ~/isabelle/etc,
wenzelm@28914	73	~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
wenzelm@28914	74	care is required when using older releases of Isabelle. Note that
wenzelm@28914	75	ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
wenzelm@30845	76	Isabelle distribution, in order to use the new ~/.isabelle uniformly.
wenzelm@28914	77
wenzelm@29161	78	* Proofs of fully specified statements are run in parallel on
wenzelm@30845	79	multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
wenzelm@30845	80	a regular 4-core machine, if the initial heap space is made reasonably
wenzelm@30845	81	large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
wenzelm@30845	82
wenzelm@30845	83	* The main reference manuals ("isar-ref", "implementation", and
wenzelm@30845	84	"system") have been updated and extended. Formally checked references
wenzelm@30845	85	as hyperlinks are now available uniformly.
wenzelm@30845	86
wenzelm@30163	87
wenzelm@27599	88	* Pure *
wenzelm@27599	89
wenzelm@30845	90	* Complete re-implementation of locales. INCOMPATIBILITY in several
wenzelm@30845	91	respects. The most important changes are listed below. See the
wenzelm@30845	92	Tutorial on Locales ("locales" manual) for details.
ballarin@29253	93
ballarin@29253	94	- In locale expressions, instantiation replaces renaming. Parameters
ballarin@29253	95	must be declared in a for clause. To aid compatibility with previous
ballarin@29253	96	parameter inheritance, in locale declarations, parameters that are not
ballarin@29253	97	'touched' (instantiation position "_" or omitted) are implicitly added
ballarin@29253	98	with their syntax at the beginning of the for clause.
ballarin@29253	99
ballarin@29253	100	- Syntax from abbreviations and definitions in locales is available in
ballarin@29253	101	locale expressions and context elements. The latter is particularly
ballarin@29253	102	useful in locale declarations.
ballarin@29253	103
ballarin@29253	104	- More flexible mechanisms to qualify names generated by locale
ballarin@29253	105	expressions. Qualifiers (prefixes) may be specified in locale
wenzelm@30728	106	expressions, and can be marked as mandatory (syntax: "name!:") or
wenzelm@30728	107	optional (syntax "name?:"). The default depends for plain "name:"
wenzelm@30728	108	depends on the situation where a locale expression is used: in
wenzelm@30728	109	commands 'locale' and 'sublocale' prefixes are optional, in
wenzelm@30845	110	'interpretation' and 'interpret' prefixes are mandatory. The old
wenzelm@30728	111	implicit qualifiers derived from the parameter names of a locale are
wenzelm@30728	112	no longer generated.
wenzelm@30106	113
wenzelm@30845	114	- Command "sublocale l < e" replaces "interpretation l < e". The
wenzelm@30106	115	instantiation clause in "interpretation" and "interpret" (square
wenzelm@30106	116	brackets) is no longer available. Use locale expressions.
ballarin@29253	117
wenzelm@30845	118	- When converting proof scripts, mandatory qualifiers in
wenzelm@30728	119	'interpretation' and 'interpret' should be retained by default, even
wenzelm@30845	120	if this is an INCOMPATIBILITY compared to former behavior. In the
wenzelm@30845	121	worst case, use the "name?:" form for non-mandatory ones. Qualifiers
wenzelm@30845	122	in locale expressions range over a single locale instance only.
wenzelm@30845	123
wenzelm@30845	124	- Dropped locale element "includes". This is a major INCOMPATIBILITY.
wenzelm@30845	125	In existing theorem specifications replace the includes element by the
wenzelm@30845	126	respective context elements of the included locale, omitting those
wenzelm@30845	127	that are already present in the theorem specification. Multiple
wenzelm@30845	128	assume elements of a locale should be replaced by a single one
wenzelm@30845	129	involving the locale predicate. In the proof body, declarations (most
wenzelm@30845	130	notably theorems) may be regained by interpreting the respective
wenzelm@30845	131	locales in the proof context as required (command "interpret").
wenzelm@30845	132
wenzelm@30845	133	If using "includes" in replacement of a target solely because the
wenzelm@30845	134	parameter types in the theorem are not as general as in the target,
wenzelm@30845	135	consider declaring a new locale with additional type constraints on
wenzelm@30845	136	the parameters (context element "constrains").
wenzelm@30845	137
wenzelm@30845	138	- Discontinued "locale (open)". INCOMPATIBILITY.
wenzelm@30845	139
wenzelm@30845	140	- Locale interpretation commands no longer attempt to simplify goal.
wenzelm@30845	141	INCOMPATIBILITY: in rare situations the generated goal differs. Use
wenzelm@30845	142	methods intro_locales and unfold_locales to clarify.
wenzelm@30845	143
wenzelm@30845	144	- Locale interpretation commands no longer accept interpretation
wenzelm@30845	145	attributes. INCOMPATIBILITY.
wenzelm@30845	146
wenzelm@30845	147	* Class declaration: so-called "base sort" must not be given in import
wenzelm@30845	148	list any longer, but is inferred from the specification. Particularly
wenzelm@30845	149	in HOL, write
wenzelm@30845	150
wenzelm@30845	151	class foo = ...
wenzelm@30845	152
wenzelm@30845	153	instead of
wenzelm@30845	154
wenzelm@30845	155	class foo = type + ...
wenzelm@30845	156
wenzelm@30845	157	* Class target: global versions of theorems stemming do not carry a
wenzelm@30845	158	parameter prefix any longer. INCOMPATIBILITY.
wenzelm@30845	159
wenzelm@30845	160	* Class 'instance' command no longer accepts attached definitions.
wenzelm@30845	161	INCOMPATIBILITY, use proper 'instantiation' target instead.
wenzelm@30845	162
wenzelm@30845	163	* Recovered hiding of consts, which was accidentally broken in
wenzelm@30845	164	Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
wenzelm@30845	165	makes c inaccessible; consider using ``hide (open) const c'' instead.
wenzelm@30845	166
wenzelm@30845	167	* Slightly more coherent Pure syntax, with updated documentation in
wenzelm@30845	168	isar-ref manual. Removed locales meta_term_syntax and
wenzelm@30845	169	meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
wenzelm@30845	170	INCOMPATIBILITY in rare situations. Note that &&& should not be used
wenzelm@30845	171	directly in regular applications.
wenzelm@30845	172
wenzelm@30845	173	* There is a new syntactic category "float_const" for signed decimal
wenzelm@30845	174	fractions (e.g. 123.45 or -123.45).
wenzelm@30845	175
wenzelm@30845	176	* Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
wenzelm@30845	177	interface with 'setup' command instead.
wenzelm@30845	178
wenzelm@30845	179	* Command 'local_setup' is similar to 'setup', but operates on a local
wenzelm@30845	180	theory context.
haftmann@27104	181
wenzelm@28114	182	* The 'axiomatization' command now only works within a global theory
wenzelm@28114	183	context. INCOMPATIBILITY.
wenzelm@28114	184
wenzelm@30845	185	* Goal-directed proof now enforces strict proof irrelevance wrt. sort
wenzelm@30845	186	hypotheses. Sorts required in the course of reasoning need to be
wenzelm@30845	187	covered by the constraints in the initial statement, completed by the
wenzelm@30845	188	type instance information of the background theory. Non-trivial sort
wenzelm@30845	189	hypotheses, which rarely occur in practice, may be specified via
wenzelm@30845	190	vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
wenzelm@30845	191
wenzelm@30845	192	lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
wenzelm@30845	193
wenzelm@30845	194	The result contains an implicit sort hypotheses as before --
wenzelm@30845	195	SORT_CONSTRAINT premises are eliminated as part of the canonical rule
wenzelm@30845	196	normalization.
wenzelm@30845	197
wenzelm@30845	198	* Generalized Isar history, with support for linear undo, direct state
wenzelm@30845	199	addressing etc.
wenzelm@30845	200
wenzelm@30845	201	* Changed defaults for unify configuration options:
wenzelm@30845	202
wenzelm@30845	203	unify_trace_bound = 50 (formerly 25)
wenzelm@30845	204	unify_search_bound = 60 (formerly 30)
wenzelm@30845	205
wenzelm@30845	206	* Different bookkeeping for code equations (INCOMPATIBILITY):
wenzelm@30845	207
wenzelm@30845	208	a) On theory merge, the last set of code equations for a particular
wenzelm@30845	209	constant is taken (in accordance with the policy applied by other
wenzelm@30845	210	parts of the code generator framework).
wenzelm@30845	211
wenzelm@30845	212	b) Code equations stemming from explicit declarations (e.g. code
wenzelm@30845	213	attribute) gain priority over default code equations stemming
wenzelm@30845	214	from definition, primrec, fun etc.
wenzelm@30845	215
wenzelm@30845	216	* Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
wenzelm@30845	217
haftmann@30965	218	* Unified theorem tables for both code generators. Thus [code
wenzelm@30845	219	func] has disappeared and only [code] remains. INCOMPATIBILITY.
wenzelm@30577	220
wenzelm@30577	221	* Command 'find_consts' searches for constants based on type and name
wenzelm@30577	222	patterns, e.g.
kleing@29883	223
kleing@29883	224	find_consts "_ => bool"
kleing@29883	225
wenzelm@30106	226	By default, matching is against subtypes, but it may be restricted to
wenzelm@30728	227	the whole type. Searching by name is possible. Multiple queries are
wenzelm@30106	228	conjunctive and queries may be negated by prefixing them with a
wenzelm@30106	229	hyphen:
kleing@29883	230
kleing@29883	231	find_consts strict: "_ => bool" name: "Int" -"int => int"
kleing@29861	232
wenzelm@30845	233	* New 'find_theorems' criterion "solves" matches theorems that
wenzelm@30845	234	directly solve the current goal (modulo higher-order unification).
wenzelm@30845	235
wenzelm@30845	236	* Auto solve feature for main theorem statements: whenever a new goal
wenzelm@30845	237	is stated, "find_theorems solves" is called; any theorems that could
wenzelm@30845	238	solve the lemma directly are listed as part of the goal state.
wenzelm@30845	239	Cf. associated options in Proof General Isabelle settings menu,
wenzelm@30845	240	enabled by default, with reasonable timeout for pathological cases of
wenzelm@30845	241	higher-order unification.
webertj@30415	242
haftmann@27104	243
wenzelm@27381	244	* Document preparation *
wenzelm@27381	245
wenzelm@27381	246	* Antiquotation @{lemma} now imitates a regular terminal proof,
wenzelm@27392	247	demanding keyword 'by' and supporting the full method expression
wenzelm@27519	248	syntax just like the Isar command 'by'.
wenzelm@27381	249
wenzelm@27381	250
haftmann@27104	251	* HOL *
haftmann@27104	252
wenzelm@30845	253	* Integrated main parts of former image HOL-Complex with HOL. Entry
wenzelm@30845	254	points Main and Complex_Main remain as before.
wenzelm@30845	255
wenzelm@30845	256	* Logic image HOL-Plain provides a minimal HOL with the most important
wenzelm@30845	257	tools available (inductive, datatype, primrec, ...). This facilitates
wenzelm@30845	258	experimentation and tool development. Note that user applications
wenzelm@30845	259	(and library theories) should never refer to anything below theory
wenzelm@30845	260	Main, as before.
wenzelm@30845	261
wenzelm@30845	262	* Logic image HOL-Main stops at theory Main, and thus facilitates
wenzelm@30845	263	experimentation due to shorter build times.
wenzelm@30845	264
wenzelm@30845	265	* Logic image HOL-NSA contains theories of nonstandard analysis which
wenzelm@30845	266	were previously part of former HOL-Complex. Entry point Hyperreal
wenzelm@30845	267	remains valid, but theories formerly using Complex_Main should now use
wenzelm@30845	268	new entry point Hypercomplex.
wenzelm@30845	269
wenzelm@30845	270	* Generic ATP manager for Sledgehammer, based on ML threads instead of
wenzelm@30845	271	Posix processes. Avoids potentially expensive forking of the ML
wenzelm@30845	272	process. New thread-based implementation also works on non-Unix
wenzelm@30845	273	platforms (Cygwin). Provers are no longer hardwired, but defined
wenzelm@30845	274	within the theory via plain ML wrapper functions. Basic Sledgehammer
wenzelm@30845	275	commands are covered in the isar-ref manual.
wenzelm@30845	276
wenzelm@30845	277	* Wrapper scripts for remote SystemOnTPTP service allows to use
wenzelm@30845	278	sledgehammer without local ATP installation (Vampire etc.). Other
wenzelm@30845	279	provers may be included via suitable ML wrappers, see also
wenzelm@30845	280	src/HOL/ATP_Linkup.thy.
wenzelm@30845	281
wenzelm@30845	282	* ATP selection (E/Vampire/Spass) is now via Proof General's settings
wenzelm@30845	283	menu.
wenzelm@30845	284
wenzelm@30845	285	* The metis method no longer fails because the theorem is too trivial
wenzelm@30845	286	(contains the empty clause).
wenzelm@30845	287
wenzelm@30845	288	* The metis method now fails in the usual manner, rather than raising
wenzelm@30845	289	an exception, if it determines that it cannot prove the theorem.
wenzelm@30845	290
wenzelm@30845	291	* Method "coherent" implements a prover for coherent logic (see also
wenzelm@30845	292	src/Tools/coherent.ML).
wenzelm@30845	293
wenzelm@30845	294	* Constants "undefined" and "default" replace "arbitrary". Usually
wenzelm@30845	295	"undefined" is the right choice to replace "arbitrary", though
wenzelm@30845	296	logically there is no difference. INCOMPATIBILITY.
wenzelm@30845	297
wenzelm@30845	298	* Command "value" now integrates different evaluation mechanisms. The
wenzelm@30845	299	result of the first successful evaluation mechanism is printed. In
wenzelm@30845	300	square brackets a particular named evaluation mechanisms may be
wenzelm@30845	301	specified (currently, [SML], [code] or [nbe]). See further
wenzelm@30845	302	src/HOL/ex/Eval_Examples.thy.
wenzelm@30845	303
wenzelm@30845	304	* Normalization by evaluation now allows non-leftlinear equations.
wenzelm@30845	305	Declare with attribute [code nbe].
wenzelm@30845	306
wenzelm@30845	307	* Methods "case_tac" and "induct_tac" now refer to the very same rules
wenzelm@30845	308	as the structured Isar versions "cases" and "induct", cf. the
wenzelm@30845	309	corresponding "cases" and "induct" attributes. Mutual induction rules
wenzelm@30845	310	are now presented as a list of individual projections
wenzelm@30845	311	(e.g. foo_bar.inducts for types foo and bar); the old format with
wenzelm@30845	312	explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
wenzelm@30845	313	rare situations a different rule is selected --- notably nested tuple
wenzelm@30845	314	elimination instead of former prod.exhaust: use explicit (case_tac t
wenzelm@30845	315	rule: prod.exhaust) here.
wenzelm@30845	316
wenzelm@30845	317	* Attributes "cases", "induct", "coinduct" support "del" option.
wenzelm@30845	318
wenzelm@30845	319	* Removed fact "case_split_thm", which duplicates "case_split".
wenzelm@30845	320
wenzelm@30845	321	* The option datatype has been moved to a new theory Option. Renamed
wenzelm@30845	322	option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
wenzelm@30845	323
wenzelm@30845	324	* New predicate "strict_mono" classifies strict functions on partial
wenzelm@30845	325	orders. With strict functions on linear orders, reasoning about
wenzelm@30845	326	(in)equalities is facilitated by theorems "strict_mono_eq",
wenzelm@30845	327	"strict_mono_less_eq" and "strict_mono_less".
wenzelm@30845	328
wenzelm@30845	329	* Some set operations are now proper qualified constants with
wenzelm@30845	330	authentic syntax. INCOMPATIBILITY:
haftmann@30304	331
haftmann@30304	332	op Int ~> Set.Int
haftmann@30304	333	op Un ~> Set.Un
haftmann@30304	334	INTER ~> Set.INTER
haftmann@30304	335	UNION ~> Set.UNION
haftmann@30304	336	Inter ~> Set.Inter
haftmann@30304	337	Union ~> Set.Union
haftmann@30304	338	{} ~> Set.empty
haftmann@30304	339	UNIV ~> Set.UNIV
haftmann@30304	340
wenzelm@30845	341	* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
wenzelm@30845	342	theory Set.
wenzelm@30845	343
wenzelm@30845	344	* Auxiliary class "itself" has disappeared -- classes without any
wenzelm@30845	345	parameter are treated as expected by the 'class' command.
haftmann@29797	346
haftmann@29823	347	* Leibnitz's Series for Pi and the arcus tangens and logarithm series.
haftmann@29823	348
wenzelm@30845	349	* Common decision procedures (Cooper, MIR, Ferrack, Approximation,
wenzelm@30845	350	Dense_Linear_Order) are now in directory HOL/Decision_Procs.
wenzelm@30845	351
wenzelm@30845	352	* Theory src/HOL/Decision_Procs/Approximation provides the new proof
wenzelm@30845	353	method "approximation". It proves formulas on real values by using
wenzelm@30845	354	interval arithmetic. In the formulas are also the transcendental
wenzelm@30845	355	functions sin, cos, tan, atan, ln, exp and the constant pi are
wenzelm@30845	356	allowed. For examples see
wenzelm@30845	357	src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
haftmann@29823	358
haftmann@29823	359	* Theory "Reflection" now resides in HOL/Library.
haftmann@29650	360
wenzelm@30845	361	* Entry point to Word library now simply named "Word".
wenzelm@30845	362	INCOMPATIBILITY.
haftmann@29628	363
haftmann@29197	364	* Made source layout more coherent with logical distribution
haftmann@29197	365	structure:
haftmann@28952	366
haftmann@28952	367	src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
haftmann@28952	368	src/HOL/Library/Code_Message.thy ~> src/HOL/
haftmann@28952	369	src/HOL/Library/GCD.thy ~> src/HOL/
haftmann@28952	370	src/HOL/Library/Order_Relation.thy ~> src/HOL/
haftmann@28952	371	src/HOL/Library/Parity.thy ~> src/HOL/
haftmann@28952	372	src/HOL/Library/Univ_Poly.thy ~> src/HOL/
huffman@30176	373	src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
haftmann@28952	374	src/HOL/Real/Lubs.thy ~> src/HOL/
haftmann@28952	375	src/HOL/Real/PReal.thy ~> src/HOL/
haftmann@28952	376	src/HOL/Real/Rational.thy ~> src/HOL/
haftmann@28952	377	src/HOL/Real/RComplete.thy ~> src/HOL/
haftmann@28952	378	src/HOL/Real/RealDef.thy ~> src/HOL/
haftmann@28952	379	src/HOL/Real/RealPow.thy ~> src/HOL/
haftmann@28952	380	src/HOL/Real/Real.thy ~> src/HOL/
haftmann@28952	381	src/HOL/Complex/Complex_Main.thy ~> src/HOL/
haftmann@28952	382	src/HOL/Complex/Complex.thy ~> src/HOL/
huffman@30176	383	src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
huffman@30176	384	src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
haftmann@28952	385	src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
haftmann@28952	386	src/HOL/Hyperreal/Fact.thy ~> src/HOL/
haftmann@28952	387	src/HOL/Hyperreal/Integration.thy ~> src/HOL/
haftmann@28952	388	src/HOL/Hyperreal/Lim.thy ~> src/HOL/
haftmann@28952	389	src/HOL/Hyperreal/Ln.thy ~> src/HOL/
haftmann@28952	390	src/HOL/Hyperreal/Log.thy ~> src/HOL/
haftmann@28952	391	src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
haftmann@28952	392	src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
haftmann@28952	393	src/HOL/Hyperreal/Series.thy ~> src/HOL/
haftmann@29197	394	src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
haftmann@28952	395	src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
haftmann@28952	396	src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
haftmann@28952	397	src/HOL/Real/Float ~> src/HOL/Library/
haftmann@29197	398	src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
haftmann@29197	399	src/HOL/Real/RealVector.thy ~> src/HOL/
haftmann@28952	400
haftmann@28952	401	src/HOL/arith_data.ML ~> src/HOL/Tools
haftmann@28952	402	src/HOL/hologic.ML ~> src/HOL/Tools
haftmann@28952	403	src/HOL/simpdata.ML ~> src/HOL/Tools
haftmann@28952	404	src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
haftmann@28952	405	src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
haftmann@28952	406	src/HOL/nat_simprocs.ML ~> src/HOL/Tools
haftmann@28952	407	src/HOL/Real/float_arith.ML ~> src/HOL/Tools
haftmann@28952	408	src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
haftmann@28952	409	src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
haftmann@28952	410	src/HOL/Real/real_arith.ML ~> src/HOL/Tools
haftmann@28952	411
haftmann@29398	412	src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
haftmann@29398	413	src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
haftmann@29398	414	src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
haftmann@29398	415	src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
haftmann@29398	416	src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
haftmann@29398	417	src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
haftmann@29398	418
wenzelm@30845	419	* If methods "eval" and "evaluation" encounter a structured proof
wenzelm@30845	420	state with !!/==>, only the conclusion is evaluated to True (if
wenzelm@30845	421	possible), avoiding strange error messages.
wenzelm@30845	422
wenzelm@30845	423	* Method "sizechange" automates termination proofs using (a
wenzelm@30845	424	modification of) the size-change principle. Requires SAT solver. See
wenzelm@30845	425	src/HOL/ex/Termination.thy for examples.
wenzelm@30845	426
wenzelm@30845	427	* Simplifier: simproc for let expressions now unfolds if bound
wenzelm@30845	428	variable occurs at most once in let expression body. INCOMPATIBILITY.
wenzelm@30845	429
wenzelm@30845	430	* Method "arith": Linear arithmetic now ignores all inequalities when
wenzelm@30845	431	fast_arith_neq_limit is exceeded, instead of giving up entirely.
wenzelm@30845	432
wenzelm@30845	433	* New attribute "arith" for facts that should always be used
wenzelm@30845	434	automatically by arithmetic. It is intended to be used locally in
wenzelm@30845	435	proofs, e.g.
wenzelm@30845	436
wenzelm@30845	437	assumes [arith]: "x > 0"
wenzelm@30845	438
nipkow@30706	439	Global usage is discouraged because of possible performance impact.
nipkow@30706	440
wenzelm@30845	441	* New classes "top" and "bot" with corresponding operations "top" and
wenzelm@30845	442	"bot" in theory Orderings; instantiation of class "complete_lattice"
wenzelm@30845	443	requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
wenzelm@30845	444
wenzelm@30845	445	* Changed definition lemma "less_fun_def" in order to provide an
wenzelm@30845	446	instance for preorders on functions; use lemma "less_le" instead.
wenzelm@30845	447	INCOMPATIBILITY.
wenzelm@30845	448
wenzelm@30845	449	* Theory Orderings: class "wellorder" moved here, with explicit
wenzelm@30845	450	induction rule "less_induct" as assumption. For instantiation of
wenzelm@30845	451	"wellorder" by means of predicate "wf", use rule wf_wellorderI.
wenzelm@30845	452	INCOMPATIBILITY.
wenzelm@30845	453
wenzelm@30845	454	* Theory Orderings: added class "preorder" as superclass of "order".
wenzelm@27793	455	INCOMPATIBILITY: Instantiation proofs for order, linorder
wenzelm@27793	456	etc. slightly changed. Some theorems named order_class.* now named
wenzelm@27793	457	preorder_class.*.
wenzelm@27793	458
wenzelm@30845	459	* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
wenzelm@30845	460	"diag" to "Id_on".
wenzelm@30845	461
wenzelm@30845	462	* Theory Finite_Set: added a new fold combinator of type
wenzelm@30845	463
nipkow@28855	464	('a => 'b => 'b) => 'b => 'a set => 'b
wenzelm@30845	465
wenzelm@30845	466	Occasionally this is more convenient than the old fold combinator
wenzelm@30845	467	which is now defined in terms of the new one and renamed to
wenzelm@30845	468	fold_image.
wenzelm@30845	469
wenzelm@30845	470	* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
wenzelm@30845	471	and "ring_simps" have been replaced by "algebra_simps" (which can be
wenzelm@30845	472	extended with further lemmas!). At the moment both still exist but
wenzelm@30845	473	the former will disappear at some point.
wenzelm@30845	474
wenzelm@30845	475	* Theory Power: Lemma power_Suc is now declared as a simp rule in
wenzelm@30845	476	class recpower. Type-specific simp rules for various recpower types
wenzelm@30845	477	have been removed. INCOMPATIBILITY, rename old lemmas as follows:
huffman@30273	478
huffman@30273	479	rat_power_0 -> power_0
huffman@30273	480	rat_power_Suc -> power_Suc
huffman@30273	481	realpow_0 -> power_0
huffman@30273	482	realpow_Suc -> power_Suc
huffman@30273	483	complexpow_0 -> power_0
huffman@30273	484	complexpow_Suc -> power_Suc
huffman@30273	485	power_poly_0 -> power_0
huffman@30273	486	power_poly_Suc -> power_Suc
huffman@30273	487
wenzelm@30845	488	* Theories Ring_and_Field and Divides: Definition of "op dvd" has been
wenzelm@27793	489	moved to separate class dvd in Ring_and_Field; a couple of lemmas on
wenzelm@27793	490	dvd has been generalized to class comm_semiring_1. Likewise a bunch
wenzelm@27793	491	of lemmas from Divides has been generalized from nat to class
wenzelm@27793	492	semiring_div. INCOMPATIBILITY. This involves the following theorem
wenzelm@27793	493	renames resulting from duplicate elimination:
haftmann@27651	494
haftmann@27651	495	dvd_def_mod ~> dvd_eq_mod_eq_0
haftmann@27651	496	zero_dvd_iff ~> dvd_0_left_iff
haftmann@28559	497	dvd_0 ~> dvd_0_right
haftmann@27651	498	DIVISION_BY_ZERO_DIV ~> div_by_0
haftmann@27651	499	DIVISION_BY_ZERO_MOD ~> mod_by_0
haftmann@27651	500	mult_div ~> div_mult_self2_is_id
haftmann@27651	501	mult_mod ~> mod_mult_self2_is_0
haftmann@27651	502
wenzelm@30845	503	* Theory IntDiv: removed many lemmas that are instances of class-based
wenzelm@30845	504	generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
wenzelm@30845	505	rename old lemmas as follows:
nipkow@30044	506
nipkow@30044	507	dvd_diff -> nat_dvd_diff
nipkow@30044	508	dvd_zminus_iff -> dvd_minus_iff
nipkow@30224	509	mod_add1_eq -> mod_add_eq
nipkow@30224	510	mod_mult1_eq -> mod_mult_right_eq
nipkow@30224	511	mod_mult1_eq' -> mod_mult_left_eq
nipkow@30224	512	mod_mult_distrib_mod -> mod_mult_eq
nipkow@30044	513	nat_mod_add_left_eq -> mod_add_left_eq
nipkow@30044	514	nat_mod_add_right_eq -> mod_add_right_eq
nipkow@30044	515	nat_mod_div_trivial -> mod_div_trivial
nipkow@30044	516	nat_mod_mod_trivial -> mod_mod_trivial
nipkow@30044	517	zdiv_zadd_self1 -> div_add_self1
nipkow@30044	518	zdiv_zadd_self2 -> div_add_self2
nipkow@30181	519	zdiv_zmult_self1 -> div_mult_self2_is_id
nipkow@30044	520	zdiv_zmult_self2 -> div_mult_self1_is_id
nipkow@30044	521	zdvd_triv_left -> dvd_triv_left
nipkow@30044	522	zdvd_triv_right -> dvd_triv_right
nipkow@30044	523	zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
nipkow@30085	524	zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
nipkow@30044	525	zmod_zadd_left_eq -> mod_add_left_eq
nipkow@30044	526	zmod_zadd_right_eq -> mod_add_right_eq
nipkow@30044	527	zmod_zadd_self1 -> mod_add_self1
nipkow@30044	528	zmod_zadd_self2 -> mod_add_self2
nipkow@30224	529	zmod_zadd1_eq -> mod_add_eq
nipkow@30044	530	zmod_zdiff1_eq -> mod_diff_eq
nipkow@30044	531	zmod_zdvd_zmod -> mod_mod_cancel
nipkow@30044	532	zmod_zmod_cancel -> mod_mod_cancel
nipkow@30044	533	zmod_zmult_self1 -> mod_mult_self2_is_0
nipkow@30044	534	zmod_zmult_self2 -> mod_mult_self1_is_0
nipkow@30044	535	zmod_1 -> mod_by_1
nipkow@30044	536	zdiv_1 -> div_by_1
nipkow@30044	537	zdvd_abs1 -> abs_dvd_iff
nipkow@30044	538	zdvd_abs2 -> dvd_abs_iff
nipkow@30044	539	zdvd_refl -> dvd_refl
nipkow@30044	540	zdvd_trans -> dvd_trans
nipkow@30044	541	zdvd_zadd -> dvd_add
nipkow@30044	542	zdvd_zdiff -> dvd_diff
nipkow@30044	543	zdvd_zminus_iff -> dvd_minus_iff
nipkow@30044	544	zdvd_zminus2_iff -> minus_dvd_iff
nipkow@30044	545	zdvd_zmultD -> dvd_mult_right
nipkow@30044	546	zdvd_zmultD2 -> dvd_mult_left
nipkow@30044	547	zdvd_zmult_mono -> mult_dvd_mono
nipkow@30044	548	zdvd_0_right -> dvd_0_right
nipkow@30044	549	zdvd_0_left -> dvd_0_left_iff
nipkow@30044	550	zdvd_1_left -> one_dvd
nipkow@30044	551	zminus_dvd_iff -> minus_dvd_iff
nipkow@30044	552
wenzelm@30845	553	* Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
wenzelm@30845	554
wenzelm@30845	555	* The real numbers offer decimal input syntax: 12.34 is translated
wenzelm@30845	556	into 1234/10^2. This translation is not reversed upon output.
wenzelm@30845	557
wenzelm@30845	558	* Theory Library/Polynomial defines an abstract type 'a poly of
wenzelm@30845	559	univariate polynomials with coefficients of type 'a. In addition to
wenzelm@30845	560	the standard ring operations, it also supports div and mod. Code
wenzelm@30845	561	generation is also supported, using list-style constructors.
wenzelm@30845	562
wenzelm@30845	563	* Theory Library/Inner_Product defines a class of real_inner for real
wenzelm@30845	564	inner product spaces, with an overloaded operation inner :: 'a => 'a
wenzelm@30845	565	=> real. Class real_inner is a subclass of real_normed_vector from
wenzelm@30845	566	theory RealVector.
wenzelm@30845	567
wenzelm@30845	568	* Theory Library/Product_Vector provides instances for the product
wenzelm@30845	569	type 'a * 'b of several classes from RealVector and Inner_Product.
wenzelm@30845	570	Definitions of addition, subtraction, scalar multiplication, norms,
wenzelm@30845	571	and inner products are included.
wenzelm@30845	572
wenzelm@30845	573	* Theory Library/Bit defines the field "bit" of integers modulo 2. In
wenzelm@30845	574	addition to the field operations, numerals and case syntax are also
wenzelm@30845	575	supported.
wenzelm@30845	576
wenzelm@30845	577	* Theory Library/Diagonalize provides constructive version of Cantor's
wenzelm@30845	578	first diagonalization argument.
wenzelm@30845	579
wenzelm@30845	580	* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
wenzelm@27599	581	zlcm (for int); carried together from various gcd/lcm developements in
wenzelm@30845	582	the HOL Distribution. Constants zgcd and zlcm replace former igcd and
wenzelm@30845	583	ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
wenzelm@30845	584	may recover tupled syntax as follows:
haftmann@27556	585
haftmann@27556	586	hide (open) const gcd
haftmann@27556	587	abbreviation gcd where
haftmann@27556	588	"gcd == (%(a, b). GCD.gcd a b)"
haftmann@27556	589	notation (output)
haftmann@27556	590	GCD.gcd ("gcd '(_, _')")
haftmann@27556	591
wenzelm@30845	592	The same works for lcm, zgcd, zlcm.
wenzelm@30845	593
wenzelm@30845	594	* Theory Library/Nat_Infinity: added addition, numeral syntax and more
wenzelm@30845	595	instantiations for algebraic structures. Removed some duplicate
wenzelm@30845	596	theorems. Changes in simp rules. INCOMPATIBILITY.
wenzelm@30845	597
wenzelm@30845	598	* ML antiquotation @{code} takes a constant as argument and generates
haftmann@27651	599	corresponding code in background and inserts name of the corresponding
haftmann@27651	600	resulting ML value/function/datatype constructor binding in place.
haftmann@27651	601	All occurrences of @{code} with a single ML block are generated
haftmann@27651	602	simultaneously. Provides a generic and safe interface for
wenzelm@30845	603	instrumentalizing code generation. See
wenzelm@30845	604	src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
wenzelm@30845	605	In future you ought to refrain from ad-hoc compiling generated SML
wenzelm@30845	606	code on the ML toplevel. Note that (for technical reasons) @{code}
wenzelm@30845	607	cannot refer to constants for which user-defined serializations are
wenzelm@30845	608	set. Refer to the corresponding ML counterpart directly in that
wenzelm@30845	609	cases.
wenzelm@27122	610
wenzelm@27122	611	* Command 'rep_datatype': instead of theorem names the command now
wenzelm@27122	612	takes a list of terms denoting the constructors of the type to be
wenzelm@27122	613	represented as datatype. The characteristic theorems have to be
wenzelm@27122	614	proven. INCOMPATIBILITY. Also observe that the following theorems
wenzelm@27122	615	have disappeared in favour of existing ones:
wenzelm@27122	616
haftmann@27104	617	unit_induct ~> unit.induct
haftmann@27104	618	prod_induct ~> prod.induct
haftmann@27104	619	sum_induct ~> sum.induct
haftmann@27104	620	Suc_Suc_eq ~> nat.inject
haftmann@27104	621	Suc_not_Zero Zero_not_Suc ~> nat.distinct
haftmann@27104	622
haftmann@27104	623
ballarin@27696	624	* HOL-Algebra *
ballarin@27696	625
ballarin@27713	626	* New locales for orders and lattices where the equivalence relation
wenzelm@30106	627	is not restricted to equality. INCOMPATIBILITY: all order and lattice
wenzelm@30106	628	locales use a record structure with field eq for the equivalence.
ballarin@27713	629
ballarin@27713	630	* New theory of factorial domains.
ballarin@27713	631
wenzelm@30845	632	* Units_l_inv and Units_r_inv are now simp rules by default.
ballarin@27696	633	INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
ballarin@27696	634	and/or r_inv will now also require deletion of these lemmas.
ballarin@27696	635
wenzelm@30845	636	* Renamed the following theorems, INCOMPATIBILITY:
wenzelm@30845	637
ballarin@27696	638	UpperD ~> Upper_memD
ballarin@27696	639	LowerD ~> Lower_memD
ballarin@27696	640	least_carrier ~> least_closed
ballarin@27696	641	greatest_carrier ~> greatest_closed
ballarin@27696	642	greatest_Lower_above ~> greatest_Lower_below
ballarin@27717	643	one_zero ~> carrier_one_zero
ballarin@27717	644	one_not_zero ~> carrier_one_not_zero (collision with assumption)
ballarin@27696	645
wenzelm@27793	646
wenzelm@30849	647	* HOL-Nominal *
wenzelm@30849	648
wenzelm@30855	649	* Nominal datatypes can now contain type-variables.
wenzelm@30855	650
wenzelm@30855	651	* Commands 'nominal_inductive' and 'equivariance' work with local
wenzelm@30855	652	theory targets.
wenzelm@30855	653
wenzelm@30855	654	* Nominal primrec can now works with local theory targets and its
wenzelm@30855	655	specification syntax now conforms to the general format as seen in
wenzelm@30855	656	'inductive' etc.
wenzelm@30855	657
wenzelm@30855	658	* Method "perm_simp" honours the standard simplifier attributes
wenzelm@30855	659	(no_asm), (no_asm_use) etc.
wenzelm@30855	660
wenzelm@30855	661	* The new predicate #* is defined like freshness, except that on the
wenzelm@30855	662	left hand side can be a set or list of atoms.
wenzelm@30855	663
wenzelm@30855	664	* Experimental command 'nominal_inductive2' derives strong induction
wenzelm@30855	665	principles for inductive definitions. In contrast to
wenzelm@30855	666	'nominal_inductive', which can only deal with a fixed number of
wenzelm@30855	667	binders, it can deal with arbitrary expressions standing for sets of
wenzelm@30855	668	atoms to be avoided. The only inductive definition we have at the
wenzelm@30855	669	moment that needs this generalisation is the typing rule for Lets in
wenzelm@30855	670	the algorithm W:
wenzelm@30855	671
wenzelm@30855	672	Gamma \|- t1 : T1 (x,close Gamma T1)::Gamma \|- t2 : T2 x#Gamma
wenzelm@30855	673	-----------------------------------------------------------------
wenzelm@30855	674	Gamma \|- Let x be t1 in t2 : T2
wenzelm@30855	675
wenzelm@30855	676	In this rule one wants to avoid all the binders that are introduced by
wenzelm@30855	677	"close Gamma T1". We are looking for other examples where this
wenzelm@30855	678	feature might be useful. Please let us know.
wenzelm@30849	679
wenzelm@30849	680
huffman@30176	681	* HOLCF *
huffman@30176	682
huffman@30176	683	* Reimplemented the simplification procedure for proving continuity
huffman@30176	684	subgoals. The new simproc is extensible; users can declare additional
huffman@30176	685	continuity introduction rules with the attribute [cont2cont].
huffman@30176	686
huffman@30176	687	* The continuity simproc now uses a different introduction rule for
huffman@30176	688	solving continuity subgoals on terms with lambda abstractions. In
huffman@30176	689	some rare cases the new simproc may fail to solve subgoals that the
huffman@30176	690	old one could solve, and "simp add: cont2cont_LAM" may be necessary.
huffman@30176	691	Potential INCOMPATIBILITY.
huffman@30176	692
wenzelm@30847	693	* Command 'fixrec': specification syntax now conforms to the general
wenzelm@30855	694	format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@30855	695	examples. INCOMPATIBILITY.
wenzelm@30845	696
wenzelm@30845	697
wenzelm@30845	698	* ZF *
wenzelm@30845	699
wenzelm@30845	700	* Proof of Zorn's Lemma for partial orders.
huffman@30176	701
huffman@30176	702
wenzelm@27246	703	* ML *
wenzelm@28088	704
wenzelm@30845	705	* Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
wenzelm@30845	706	Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
wenzelm@30845	707	depends on multithreading, so timouts will not work before Poly/ML
wenzelm@30845	708	5.2.1!
wenzelm@30845	709
wenzelm@29161	710	* High-level support for concurrent ML programming, see
wenzelm@29161	711	src/Pure/Cuncurrent. The data-oriented model of "future values" is
wenzelm@29161	712	particularly convenient to organize independent functional
wenzelm@29161	713	computations. The concept of "synchronized variables" provides a
wenzelm@29161	714	higher-order interface for components with shared state, avoiding the
wenzelm@30845	715	delicate details of mutexes and condition variables. (Requires
wenzelm@30845	716	Poly/ML 5.2.1 or later.)
wenzelm@30845	717
wenzelm@30845	718	* ML bindings produced via Isar commands are stored within the Isar
wenzelm@30845	719	context (theory or proof). Consequently, commands like 'use' and 'ML'
wenzelm@30845	720	become thread-safe and work with undo as expected (concerning
wenzelm@30845	721	top-level bindings, not side-effects on global references).
wenzelm@30845	722	INCOMPATIBILITY, need to provide proper Isar context when invoking the
wenzelm@30845	723	compiler at runtime; really global bindings need to be given outside a
wenzelm@30845	724	theory. (Requires Poly/ML 5.2 or later.)
wenzelm@30845	725
wenzelm@30845	726	* Command 'ML_prf' is analogous to 'ML' but works within a proof
wenzelm@30845	727	context. Top-level ML bindings are stored within the proof context in
wenzelm@30845	728	a purely sequential fashion, disregarding the nested proof structure.
wenzelm@30845	729	ML bindings introduced by 'ML_prf' are discarded at the end of the
wenzelm@30845	730	proof. (Requires Poly/ML 5.2 or later.)
wenzelm@29161	731
wenzelm@30530	732	* Simplified ML attribute and method setup, cf. functions Attrib.setup
wenzelm@30845	733	and Method.setup, as well as Isar commands 'attribute_setup' and
wenzelm@30547	734	'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
wenzelm@30547	735	existing code accordingly, or use plain 'setup' together with old
wenzelm@30547	736	Method.add_method.
wenzelm@30530	737
wenzelm@28294	738	* Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
wenzelm@28294	739	to 'a -> thm, while results are always tagged with an authentic oracle
wenzelm@28294	740	name. The Isar command 'oracle' is now polymorphic, no argument type
wenzelm@28294	741	is specified. INCOMPATIBILITY, need to simplify existing oracle code
wenzelm@28294	742	accordingly. Note that extra performance may be gained by producing
wenzelm@28294	743	the cterm carefully, avoiding slow Thm.cterm_of.
wenzelm@28294	744
wenzelm@30845	745	* Simplified interface for defining document antiquotations via
wenzelm@30845	746	ThyOutput.antiquotation, ThyOutput.output, and optionally
wenzelm@30845	747	ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
wenzelm@30845	748	antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
wenzelm@30845	749	examples.
wenzelm@28099	750
wenzelm@30395	751	* More systematic treatment of long names, abstract name bindings, and
wenzelm@30395	752	name space operations. Basic operations on qualified names have been
wenzelm@30399	753	move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
wenzelm@30395	754	Long_Name.append. Old type bstring has been mostly replaced by
wenzelm@30395	755	abstract type binding (see structure Binding), which supports precise
wenzelm@30845	756	qualification by packages and local theory targets, as well as proper
wenzelm@30845	757	tracking of source positions. INCOMPATIBILITY, need to wrap old
wenzelm@30845	758	bstring values into Binding.name, or better pass through abstract
wenzelm@30399	759	bindings everywhere. See further src/Pure/General/long_name.ML,
wenzelm@30395	760	src/Pure/General/binding.ML and src/Pure/General/name_space.ML
wenzelm@30395	761
wenzelm@28089	762	* Result facts (from PureThy.note_thms, ProofContext.note_thms,
wenzelm@28089	763	LocalTheory.note etc.) now refer to the full internal name, not the
wenzelm@28089	764	bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
wenzelm@28089	765
wenzelm@27287	766	* Disposed old type and term read functions (Sign.read_def_typ,
wenzelm@27287	767	Sign.read_typ, Sign.read_def_terms, Sign.read_term,
wenzelm@27287	768	Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
wenzelm@27287	769	use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
wenzelm@27269	770	Syntax.read_term_global etc.; see also OldGoals.read_term as last
wenzelm@27269	771	resort for legacy applications.
wenzelm@27269	772
wenzelm@30609	773	* Disposed old declarations, tactics, tactic combinators that refer to
wenzelm@30609	774	the simpset or claset of an implicit theory (such as Addsimps,
wenzelm@30609	775	Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
wenzelm@30609	776	embedded ML text, or local_simpset_of with a proper context passed as
wenzelm@30609	777	explicit runtime argument.
wenzelm@30609	778
wenzelm@30845	779	* Rules and tactics that read instantiations (read_instantiate,
wenzelm@30845	780	res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
wenzelm@30845	781	context, which is required for parsing and type-checking. Moreover,
wenzelm@30845	782	the variables are specified as plain indexnames, not string encodings
wenzelm@30845	783	thereof. INCOMPATIBILITY.
wenzelm@30845	784
wenzelm@30845	785	* Generic Toplevel.add_hook interface allows to analyze the result of
wenzelm@30845	786	transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
wenzelm@30845	787	for theorem dependency output of transactions resulting in a new
wenzelm@30845	788	theory state.
wenzelm@30845	789
wenzelm@30845	790	* ML antiquotations: block-structured compilation context indicated by
wenzelm@27391	791	\<lbrace> ... \<rbrace>; additional antiquotation forms:
wenzelm@27391	792
wenzelm@30845	793	@{binding name} - basic name binding
wenzelm@27519	794	@{let ?pat = term} - term abbreviation (HO matching)
wenzelm@27519	795	@{note name = fact} - fact abbreviation
wenzelm@27519	796	@{thm fact} - singleton fact (with attributes)
wenzelm@27519	797	@{thms fact} - general fact (with attributes)
wenzelm@27519	798	@{lemma prop by method} - singleton goal
wenzelm@27519	799	@{lemma prop by meth1 meth2} - singleton goal
wenzelm@27519	800	@{lemma prop1 ... propN by method} - general goal
wenzelm@27519	801	@{lemma prop1 ... propN by meth1 meth2} - general goal
wenzelm@27519	802	@{lemma (open) ...} - open derivation
wenzelm@27380	803
wenzelm@27246	804
wenzelm@27979	805	* System *
wenzelm@27979	806
wenzelm@28248	807	* The Isabelle "emacs" tool provides a specific interface to invoke
wenzelm@28248	808	Proof General / Emacs, with more explicit failure if that is not
wenzelm@28248	809	installed (the old isabelle-interface script silently falls back on
wenzelm@28248	810	isabelle-process). The PROOFGENERAL_HOME setting determines the
wenzelm@28248	811	installation location of the Proof General distribution.
wenzelm@28248	812
wenzelm@27979	813	* Isabelle/lib/classes/Pure.jar provides basic support to integrate
wenzelm@27979	814	the Isabelle process into a JVM/Scala application. See
wenzelm@27979	815	Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
wenzelm@27979	816	process wrapper has been discontinued.)
wenzelm@27979	817
wenzelm@30845	818	* Added homegrown Isabelle font with unicode layout, see lib/fonts.
wenzelm@30845	819
wenzelm@30845	820	* Various status messages (with exact source position information) are
wenzelm@27979	821	emitted, if proper markup print mode is enabled. This allows
wenzelm@27979	822	user-interface components to provide detailed feedback on internal
wenzelm@27979	823	prover operations.
wenzelm@27979	824
wenzelm@27979	825
wenzelm@27143	826
wenzelm@27008	827	New in Isabelle2008 (June 2008)
wenzelm@27008	828	-------------------------------
wenzelm@25464	829
wenzelm@25522	830	* General *
wenzelm@25522	831
wenzelm@27061	832	* The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
wenzelm@27061	833	and updated, with formally checked references as hyperlinks.
wenzelm@27061	834
wenzelm@25994	835	* Theory loader: use_thy (and similar operations) no longer set the
wenzelm@25994	836	implicit ML context, which was occasionally hard to predict and in
wenzelm@25994	837	conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
wenzelm@25994	838	provides a proper context already.
wenzelm@25994	839
wenzelm@26323	840	* Theory loader: old-style ML proof scripts being attached to a thy
wenzelm@26323	841	file are no longer supported. INCOMPATIBILITY, regular 'uses' and
wenzelm@26323	842	'use' within a theory file will do the job.
wenzelm@26323	843
wenzelm@26650	844	* Name space merge now observes canonical order, i.e. the second space
wenzelm@26650	845	is inserted into the first one, while existing entries in the first
wenzelm@26659	846	space take precedence. INCOMPATIBILITY in rare situations, may try to
wenzelm@26650	847	swap theory imports.
wenzelm@26650	848
wenzelm@27067	849	* Syntax: symbol \<chi> is now considered a letter. Potential
wenzelm@27067	850	INCOMPATIBILITY in identifier syntax etc.
wenzelm@27067	851
wenzelm@27067	852	* Outer syntax: string tokens no longer admit escaped white space,
wenzelm@27067	853	which was an accidental (undocumented) feature. INCOMPATIBILITY, use
wenzelm@27067	854	white space without escapes.
wenzelm@27067	855
wenzelm@27067	856	* Outer syntax: string tokens may contain arbitrary character codes
wenzelm@27067	857	specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
wenzelm@27067	858	"foo_bar".
wenzelm@27067	859
wenzelm@25522	860
haftmann@25502	861	* Pure *
haftmann@25502	862
wenzelm@26718	863	* Context-dependent token translations. Default setup reverts locally
wenzelm@26718	864	fixed variables, and adds hilite markup for undeclared frees.
wenzelm@26718	865
berghofe@26681	866	* Unused theorems can be found using the new command 'unused_thms'.
berghofe@26681	867	There are three ways of invoking it:
berghofe@26681	868
berghofe@26681	869	(1) unused_thms
berghofe@26681	870	Only finds unused theorems in the current theory.
berghofe@26681	871
berghofe@26681	872	(2) unused_thms thy_1 ... thy_n -
berghofe@26681	873	Finds unused theorems in the current theory and all of its ancestors,
berghofe@26681	874	excluding the theories thy_1 ... thy_n and all of their ancestors.
berghofe@26681	875
berghofe@26681	876	(3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
berghofe@26681	877	Finds unused theorems in the theories thy'_1 ... thy'_m and all of
berghofe@26681	878	their ancestors, excluding the theories thy_1 ... thy_n and all of
berghofe@26681	879	their ancestors.
berghofe@26681	880
wenzelm@26718	881	In order to increase the readability of the list produced by
wenzelm@26718	882	unused_thms, theorems that have been created by a particular instance
wenzelm@26874	883	of a theory command such as 'inductive' or 'function' are considered
wenzelm@26874	884	to belong to the same "group", meaning that if at least one theorem in
wenzelm@26718	885	this group is used, the other theorems in the same group are no longer
wenzelm@26718	886	reported as unused. Moreover, if all theorems in the group are
wenzelm@26718	887	unused, only one theorem in the group is displayed.
wenzelm@26718	888
wenzelm@26718	889	Note that proof objects have to be switched on in order for
wenzelm@26718	890	unused_thms to work properly (i.e. !proofs must be >= 1, which is
wenzelm@26874	891	usually the case when using Proof General with the default settings).
berghofe@26681	892
wenzelm@26650	893	* Authentic naming of facts disallows ad-hoc overwriting of previous
wenzelm@26650	894	theorems within the same name space. INCOMPATIBILITY, need to remove
wenzelm@26650	895	duplicate fact bindings, or even accidental fact duplications. Note
wenzelm@26650	896	that tools may maintain dynamically scoped facts systematically, using
wenzelm@26650	897	PureThy.add_thms_dynamic.
wenzelm@26650	898
wenzelm@26660	899	* Command 'hide' now allows to hide from "fact" name space as well.
wenzelm@26660	900
wenzelm@26496	901	* Eliminated destructive theorem database, simpset, claset, and
wenzelm@26496	902	clasimpset. Potential INCOMPATIBILITY, really need to observe linear
wenzelm@26496	903	update of theories within ML code.
wenzelm@26479	904
wenzelm@26955	905	* Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
wenzelm@26955	906	INCOMPATIBILITY, object-logics depending on former Pure require
wenzelm@26955	907	additional setup PureThy.old_appl_syntax_setup; object-logics
wenzelm@26955	908	depending on former CPure need to refer to Pure.
wenzelm@26650	909
wenzelm@26495	910	* Commands 'use' and 'ML' are now purely functional, operating on
wenzelm@26479	911	theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
wenzelm@26479	912	instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
wenzelm@26479	913	INCOMPATIBILITY.
wenzelm@26479	914
wenzelm@26874	915	* Command 'setup': discontinued implicit version with ML reference.
wenzelm@26434	916
wenzelm@25970	917	* Instantiation target allows for simultaneous specification of class
wenzelm@25970	918	instance operations together with an instantiation proof.
wenzelm@25970	919	Type-checking phase allows to refer to class operations uniformly.
wenzelm@27067	920	See src/HOL/Complex/Complex.thy for an Isar example and
wenzelm@27067	921	src/HOL/Library/Eval.thy for an ML example.
haftmann@25502	922
wenzelm@26201	923	* Indexing of literal facts: be more serious about including only
wenzelm@26201	924	facts from the visible specification/proof context, but not the
wenzelm@26201	925	background context (locale etc.). Affects `prop` notation and method
wenzelm@26201	926	"fact". INCOMPATIBILITY: need to name facts explicitly in rare
wenzelm@26201	927	situations.
wenzelm@26201	928
wenzelm@26925	929	* Method "cases", "induct", "coinduct": removed obsolete/undocumented
wenzelm@26925	930	"(open)" option, which used to expose internal bound variables to the
wenzelm@26925	931	proof text.
wenzelm@26925	932
wenzelm@26925	933	* Isar statements: removed obsolete case "rule_context".
wenzelm@26925	934	INCOMPATIBILITY, better use explicit fixes/assumes.
wenzelm@26925	935
wenzelm@26874	936	* Locale proofs: default proof step now includes 'unfold_locales';
wenzelm@26874	937	hence 'proof' without argument may be used to unfold locale
wenzelm@26874	938	predicates.
ballarin@26765	939
ballarin@26765	940
haftmann@26762	941	* Document preparation *
haftmann@26762	942
wenzelm@26914	943	* Simplified pdfsetup.sty: color/hyperref is used unconditionally for
wenzelm@26914	944	both pdf and dvi (hyperlinks usually work in xdvi as well); removed
wenzelm@26914	945	obsolete thumbpdf setup (contemporary PDF viewers do this on the
wenzelm@26914	946	spot); renamed link color from "darkblue" to "linkcolor" (default
wenzelm@26920	947	value unchanged, can be redefined via \definecolor); no longer sets
wenzelm@26920	948	"a4paper" option (unnecessary or even intrusive).
wenzelm@26914	949
wenzelm@27008	950	* Antiquotation @{lemma A method} proves proposition A by the given
wenzelm@27008	951	method (either a method name or a method name plus (optional) method
wenzelm@27008	952	arguments in parentheses) and prints A just like @{prop A}.
haftmann@26762	953
haftmann@26762	954
wenzelm@25464	955	* HOL *
wenzelm@25464	956
wenzelm@27067	957	* New primrec package. Specification syntax conforms in style to
wenzelm@27067	958	definition/function/.... No separate induction rule is provided. The
wenzelm@27067	959	"primrec" command distinguishes old-style and new-style specifications
wenzelm@27067	960	by syntax. The former primrec package is now named OldPrimrecPackage.
wenzelm@27067	961	When adjusting theories, beware: constants stemming from new-style
wenzelm@27067	962	primrec specifications have authentic syntax.
wenzelm@27067	963
wenzelm@27067	964	* Metis prover is now an order of magnitude faster, and also works
wenzelm@27067	965	with multithreading.
wenzelm@27067	966
wenzelm@27067	967	* Metis: the maximum number of clauses that can be produced from a
wenzelm@27067	968	theorem is now given by the attribute max_clauses. Theorems that
wenzelm@27067	969	exceed this number are ignored, with a warning printed.
wenzelm@27067	970
wenzelm@27067	971	* Sledgehammer no longer produces structured proofs by default. To
wenzelm@27067	972	enable, declare [[sledgehammer_full = true]]. Attributes
wenzelm@27067	973	reconstruction_modulus, reconstruction_sorts renamed
wenzelm@27067	974	sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
wenzelm@27067	975
haftmann@27104	976	* Method "induct_scheme" derives user-specified induction rules
wenzelm@27067	977	from well-founded induction and completeness of patterns. This factors
wenzelm@27067	978	out some operations that are done internally by the function package
wenzelm@27067	979	and makes them available separately. See
wenzelm@27067	980	src/HOL/ex/Induction_Scheme.thy for examples.
wenzelm@27067	981
wenzelm@27067	982	* More flexible generation of measure functions for termination
wenzelm@27067	983	proofs: Measure functions can be declared by proving a rule of the
wenzelm@27067	984	form "is_measure f" and giving it the [measure_function] attribute.
wenzelm@27067	985	The "is_measure" predicate is logically meaningless (always true), and
wenzelm@27067	986	just guides the heuristic. To find suitable measure functions, the
wenzelm@27067	987	termination prover sets up the goal "is_measure ?f" of the appropriate
wenzelm@27067	988	type and generates all solutions by prolog-style backwards proof using
wenzelm@27067	989	the declared rules.
wenzelm@27067	990
wenzelm@27067	991	This setup also deals with rules like
wenzelm@27067	992
wenzelm@27067	993	"is_measure f ==> is_measure (list_size f)"
wenzelm@27067	994
wenzelm@27067	995	which accommodates nested datatypes that recurse through lists.
wenzelm@27067	996	Similar rules are predeclared for products and option types.
wenzelm@27067	997
berghofe@26964	998	* Turned the type of sets "'a set" into an abbreviation for "'a => bool"
berghofe@26964	999
berghofe@26964	1000	INCOMPATIBILITIES:
berghofe@26964	1001
wenzelm@27008	1002	- Definitions of overloaded constants on sets have to be replaced by
wenzelm@27008	1003	definitions on => and bool.
berghofe@26964	1004
berghofe@26964	1005	- Some definitions of overloaded operators on sets can now be proved
wenzelm@27008	1006	using the definitions of the operators on => and bool. Therefore,
wenzelm@27008	1007	the following theorems have been renamed:
berghofe@26964	1008
berghofe@26964	1009	subset_def -> subset_eq
berghofe@26964	1010	psubset_def -> psubset_eq
berghofe@26964	1011	set_diff_def -> set_diff_eq
berghofe@26964	1012	Compl_def -> Compl_eq
berghofe@26964	1013	Sup_set_def -> Sup_set_eq
berghofe@26964	1014	Inf_set_def -> Inf_set_eq
berghofe@26964	1015	sup_set_def -> sup_set_eq
berghofe@26964	1016	inf_set_def -> inf_set_eq
berghofe@26964	1017
berghofe@26964	1018	- Due to the incompleteness of the HO unification algorithm, some
berghofe@26964	1019	rules such as subst may require manual instantiation, if some of
berghofe@26964	1020	the unknowns in the rule is a set.
berghofe@26964	1021
berghofe@26964	1022	- Higher order unification and forward proofs:
berghofe@26964	1023	The proof pattern
berghofe@26964	1024
berghofe@26964	1025	have "P (S::'a set)" <...>
berghofe@26964	1026	then have "EX S. P S" ..
berghofe@26964	1027
wenzelm@27008	1028	no longer works (due to the incompleteness of the HO unification
wenzelm@27008	1029	algorithm) and must be replaced by the pattern
berghofe@26964	1030
berghofe@26964	1031	have "EX S. P S"
berghofe@26964	1032	proof
berghofe@26964	1033	show "P S" <...>
berghofe@26964	1034	qed
berghofe@26964	1035
berghofe@26964	1036	- Calculational reasoning with subst (or similar rules):
berghofe@26964	1037	The proof pattern
berghofe@26964	1038
berghofe@26964	1039	have "P (S::'a set)" <...>
berghofe@26964	1040	also have "S = T" <...>
berghofe@26964	1041	finally have "P T" .
berghofe@26964	1042
wenzelm@27008	1043	no longer works (for similar reasons as the previous example) and
wenzelm@27008	1044	must be replaced by something like
berghofe@26964	1045
berghofe@26964	1046	have "P (S::'a set)" <...>
berghofe@26964	1047	moreover have "S = T" <...>
berghofe@26964	1048	ultimately have "P T" by simp
berghofe@26964	1049
berghofe@26964	1050	- Tactics or packages written in ML code:
berghofe@26964	1051	Code performing pattern matching on types via
berghofe@26964	1052
berghofe@26964	1053	Type ("set", [T]) => ...
berghofe@26964	1054
wenzelm@27008	1055	must be rewritten. Moreover, functions like strip_type or
wenzelm@27008	1056	binder_types no longer return the right value when applied to a
wenzelm@27008	1057	type of the form
berghofe@26964	1058
berghofe@26964	1059	T1 => ... => Tn => U => bool
berghofe@26964	1060
berghofe@26964	1061	rather than
berghofe@26964	1062
berghofe@26964	1063	T1 => ... => Tn => U set
berghofe@26964	1064
wenzelm@26874	1065	* Merged theories Wellfounded_Recursion, Accessible_Part and
wenzelm@27067	1066	Wellfounded_Relations to theory Wellfounded.
krauss@26748	1067
haftmann@26513	1068	* Explicit class "eq" for executable equality. INCOMPATIBILITY.
haftmann@26513	1069
wenzelm@26874	1070	* Class finite no longer treats UNIV as class parameter. Use class
wenzelm@26874	1071	enum from theory Library/Enum instead to achieve a similar effect.
haftmann@26445	1072	INCOMPATIBILITY.
haftmann@26445	1073
wenzelm@26874	1074	* Theory List: rule list_induct2 now has explicitly named cases "Nil"
wenzelm@26874	1075	and "Cons". INCOMPATIBILITY.
wenzelm@26874	1076
wenzelm@26422	1077	* HOL (and FOL): renamed variables in rules imp_elim and swap.
wenzelm@26422	1078	Potential INCOMPATIBILITY.
wenzelm@26422	1079
wenzelm@26874	1080	* Theory Product_Type: duplicated lemmas split_Pair_apply and
wenzelm@26874	1081	injective_fst_snd removed, use split_eta and prod_eqI instead.
wenzelm@26874	1082	Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
haftmann@26355	1083
wenzelm@26335	1084	* Theory Nat: removed redundant lemmas that merely duplicate lemmas of
wenzelm@26335	1085	the same name in theory Orderings:
wenzelm@26335	1086
wenzelm@26335	1087	less_trans
wenzelm@26335	1088	less_linear
wenzelm@26335	1089	le_imp_less_or_eq
wenzelm@26335	1090	le_less_trans
wenzelm@26335	1091	less_le_trans
wenzelm@26335	1092	less_not_sym
wenzelm@26335	1093	less_asym
wenzelm@26335	1094
wenzelm@26335	1095	Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
wenzelm@26335	1096	less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
wenzelm@26335	1097	and different variable names.
wenzelm@26315	1098
haftmann@26231	1099	* Library/Option_ord.thy: Canonical order on option type.
haftmann@26231	1100
wenzelm@27008	1101	* Library/RBT.thy: Red-black trees, an efficient implementation of
wenzelm@27008	1102	finite maps.
krauss@26197	1103
haftmann@26231	1104	* Library/Countable.thy: Type class for countable types.
haftmann@26231	1105
wenzelm@26180	1106	* Theory Int: The representation of numerals has changed. The infix
wenzelm@26180	1107	operator BIT and the bit datatype with constructors B0 and B1 have
wenzelm@26180	1108	disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
wenzelm@26180	1109	place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
wenzelm@26180	1110	involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
wenzelm@26180	1111	accordingly.
wenzelm@26180	1112
wenzelm@26180	1113	* Theory Nat: definition of <= and < on natural numbers no longer
wenzelm@26180	1114	depend on well-founded relations. INCOMPATIBILITY. Definitions
wenzelm@26180	1115	le_def and less_def have disappeared. Consider lemmas not_less
wenzelm@26180	1116	[symmetric, where ?'a = nat] and less_eq [symmetric] instead.
wenzelm@26180	1117
wenzelm@26180	1118	* Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
wenzelm@26180	1119	(whose purpose mainly is for various fold_set functionals) have been
wenzelm@26874	1120	abandoned in favor of the existing algebraic classes
wenzelm@26180	1121	ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
wenzelm@26180	1122	lower_semilattice (resp. upper_semilattice) and linorder.
haftmann@26139	1123	INCOMPATIBILITY.
haftmann@26041	1124
wenzelm@26180	1125	* Theory Transitive_Closure: induct and cases rules now declare proper
wenzelm@26180	1126	case_names ("base" and "step"). INCOMPATIBILITY.
wenzelm@26180	1127
wenzelm@26180	1128	* Theorem Inductive.lfp_ordinal_induct generalized to complete
wenzelm@26180	1129	lattices. The form set-specific version is available as
wenzelm@26180	1130	Inductive.lfp_ordinal_induct_set.
haftmann@26013	1131
wenzelm@26874	1132	* Renamed theorems "power.simps" to "power_int.simps".
wenzelm@27067	1133	INCOMPATIBILITY.
haftmann@25961	1134
wenzelm@26180	1135	* Class semiring_div provides basic abstract properties of semirings
haftmann@25942	1136	with division and modulo operations. Subsumes former class dvd_mod.
haftmann@25942	1137
wenzelm@26180	1138	* Merged theories IntDef, Numeral and IntArith into unified theory
wenzelm@26180	1139	Int. INCOMPATIBILITY.
wenzelm@26180	1140
wenzelm@26180	1141	* Theory Library/Code_Index: type "index" now represents natural
wenzelm@26180	1142	numbers rather than integers. INCOMPATIBILITY.
wenzelm@26180	1143
wenzelm@26180	1144	* New class "uminus" with operation "uminus" (split of from class
wenzelm@26180	1145	"minus" which now only has operation "minus", binary).
haftmann@25919	1146	INCOMPATIBILITY.
haftmann@25919	1147
wenzelm@25522	1148	* Constants "card", "internal_split", "option_map" now with authentic
haftmann@25919	1149	syntax. INCOMPATIBILITY.
wenzelm@25522	1150
wenzelm@25522	1151	* Definitions subset_def, psubset_def, set_diff_def, Compl_def,
wenzelm@25522	1152	le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
wenzelm@25522	1153	sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
wenzelm@25522	1154	Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
wenzelm@25522	1155	Sup_set_def, le_def, less_def, option_map_def now with object
haftmann@25919	1156	equality. INCOMPATIBILITY.
wenzelm@25464	1157
schirmer@25705	1158	* Records. Removed K_record, and replaced it by pure lambda term
wenzelm@25726	1159	%x. c. The simplifier setup is now more robust against eta expansion.
schirmer@25705	1160	INCOMPATIBILITY: in cases explicitly referring to K_record.
wenzelm@25464	1161
wenzelm@27067	1162	* Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
wenzelm@27067	1163
wenzelm@27067	1164	* Library/ListVector: new theory of arithmetic vector operations.
wenzelm@27067	1165
wenzelm@27067	1166	* Library/Order_Relation: new theory of various orderings as sets of
wenzelm@27067	1167	pairs. Defines preorders, partial orders, linear orders and
wenzelm@27067	1168	well-orders on sets and on types.
krauss@26877	1169
wenzelm@25726	1170
krauss@26197	1171	* ZF *
krauss@26197	1172
wenzelm@26874	1173	* Renamed some theories to allow to loading both ZF and HOL in the
wenzelm@26874	1174	same session:
wenzelm@26874	1175
wenzelm@26874	1176	Datatype -> Datatype_ZF
wenzelm@26874	1177	Inductive -> Inductive_ZF
wenzelm@26874	1178	Int -> Int_ZF
wenzelm@26874	1179	IntDiv -> IntDiv_ZF
wenzelm@26874	1180	Nat -> Nat_ZF
wenzelm@26874	1181	List -> List_ZF
wenzelm@26874	1182	Main -> Main_ZF
wenzelm@26874	1183
wenzelm@26874	1184	INCOMPATIBILITY: ZF theories that import individual theories below
wenzelm@26874	1185	Main might need to be adapted. Regular theory Main is still
wenzelm@26874	1186	available, as trivial extension of Main_ZF.
krauss@26197	1187
krauss@26197	1188
wenzelm@25737	1189	* ML *
wenzelm@25737	1190
wenzelm@27067	1191	* ML within Isar: antiquotation @{const name} or @{const
wenzelm@27067	1192	name(typargs)} produces statically-checked Const term.
wenzelm@27067	1193
wenzelm@26401	1194	* Functor NamedThmsFun: data is available to the user as dynamic fact
wenzelm@26724	1195	(of the same name). Removed obsolete print command.
wenzelm@26401	1196
wenzelm@27067	1197	* Removed obsolete "use_legacy_bindings" function.
wenzelm@26188	1198
wenzelm@25737	1199	* The ``print mode'' is now a thread-local value derived from a global
wenzelm@25737	1200	template (the former print_mode reference), thus access becomes
wenzelm@25737	1201	non-critical. The global print_mode reference is for session
wenzelm@25737	1202	management only; user-code should use print_mode_value,
wenzelm@25737	1203	print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
wenzelm@25737	1204
wenzelm@26874	1205	* Functions system/system_out provide a robust way to invoke external
wenzelm@29161	1206	shell commands, with propagation of interrupts (requires Poly/ML
wenzelm@29161	1207	5.2.1). Do not use OS.Process.system etc. from the basis library!
wenzelm@26222	1208
wenzelm@25737	1209
wenzelm@25626	1210	* System *
wenzelm@25626	1211
wenzelm@25971	1212	* Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
wenzelm@25971	1213	in accordance with Proof General 3.7, which prefers GNU emacs.
wenzelm@25970	1214
wenzelm@25626	1215	* isatool tty runs Isabelle process with plain tty interaction;
wenzelm@25626	1216	optional line editor may be specified via ISABELLE_LINE_EDITOR
wenzelm@25626	1217	setting, the default settings attempt to locate "ledit" and "rlwrap".
wenzelm@25626	1218
wenzelm@25651	1219	* isatool browser now works with Cygwin as well, using general
wenzelm@25651	1220	"javapath" function defined in Isabelle process environment.
wenzelm@25651	1221
wenzelm@27067	1222	* YXML notation provides a simple and efficient alternative to
wenzelm@27067	1223	standard XML transfer syntax. See src/Pure/General/yxml.ML and
wenzelm@27067	1224	isatool yxml as described in the Isabelle system manual.
wenzelm@25651	1225
wenzelm@25652	1226	* JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
wenzelm@25651	1227	provides general wrapper for managing an Isabelle process in a robust
wenzelm@25651	1228	fashion, with ``cooked'' output from stdin/stderr.
wenzelm@25651	1229
wenzelm@25855	1230	* Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
wenzelm@25855	1231	based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
wenzelm@25855	1232
wenzelm@27067	1233	* Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
wenzelm@27067	1234	way of changing the user's settings is via
wenzelm@27067	1235	ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
wenzelm@27067	1236	script.
wenzelm@27067	1237
wenzelm@27067	1238	* Multithreading.max_threads := 0 refers to the number of actual CPU
wenzelm@27067	1239	cores of the underlying machine, which is a good starting point for
wenzelm@27067	1240	optimal performance tuning. The corresponding usedir option -M allows
wenzelm@27067	1241	"max" as an alias for "0". WARNING: does not work on certain versions
wenzelm@27067	1242	of Mac OS (with Poly/ML 5.1).
wenzelm@27067	1243
wenzelm@27067	1244	* isabelle-process: non-ML sessions are run with "nice", to reduce the
wenzelm@27067	1245	adverse effect of Isabelle flooding interactive front-ends (notably
wenzelm@27067	1246	ProofGeneral / XEmacs).
wenzelm@27067	1247
wenzelm@25626	1248
wenzelm@25464	1249
wenzelm@25429	1250	New in Isabelle2007 (November 2007)
wenzelm@25429	1251	-----------------------------------
wenzelm@17754	1252
wenzelm@17754	1253	* General *
wenzelm@17754	1254
wenzelm@22826	1255	* More uniform information about legacy features, notably a
wenzelm@22826	1256	warning/error of "Legacy feature: ...", depending on the state of the
wenzelm@23367	1257	tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
wenzelm@23367	1258	legacy features will disappear eventually.
wenzelm@22826	1259
wenzelm@17918	1260	* Theory syntax: the header format ``theory A = B + C:'' has been
wenzelm@17918	1261	discontinued in favour of ``theory A imports B C begin''. Use isatool
wenzelm@17918	1262	fixheaders to convert existing theory files. INCOMPATIBILITY.
wenzelm@17918	1263
wenzelm@17918	1264	* Theory syntax: the old non-Isar theory file format has been
wenzelm@17918	1265	discontinued altogether. Note that ML proof scripts may still be used
wenzelm@17918	1266	with Isar theories; migration is usually quite simple with the ML
wenzelm@17918	1267	function use_legacy_bindings. INCOMPATIBILITY.
wenzelm@17918	1268
wenzelm@22871	1269	* Theory syntax: some popular names (e.g. 'class', 'declaration',
wenzelm@22871	1270	'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
wenzelm@22871	1271	quotes.
wenzelm@19814	1272
wenzelm@23888	1273	* Theory loader: be more serious about observing the static theory
wenzelm@23888	1274	header specifications (including optional directories), but not the
wenzelm@24172	1275	accidental file locations of previously successful loads. The strict
wenzelm@24172	1276	update policy of former update_thy is now already performed by
wenzelm@24172	1277	use_thy, so the former has been removed; use_thys updates several
wenzelm@24172	1278	theories simultaneously, just as 'imports' within a theory header
wenzelm@24172	1279	specification, but without merging the results. Potential
wenzelm@24172	1280	INCOMPATIBILITY: may need to refine theory headers and commands
wenzelm@24172	1281	ROOT.ML which depend on load order.
wenzelm@23888	1282
wenzelm@23888	1283	* Theory loader: optional support for content-based file
wenzelm@23888	1284	identification, instead of the traditional scheme of full physical
wenzelm@23889	1285	path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
wenzelm@23888	1286	(cf. the system manual). The new scheme allows to work with
wenzelm@23888	1287	non-finished theories in persistent session images, such that source
wenzelm@23888	1288	files may be moved later on without requiring reloads.
wenzelm@23888	1289
wenzelm@24187	1290	* Theory loader: old-style ML proof scripts being attached to a thy
wenzelm@24187	1291	file (with the same base name as the theory) are considered a legacy
wenzelm@24800	1292	feature, which will disappear eventually. Even now, the theory loader
wenzelm@24800	1293	no longer maintains dependencies on such files.
wenzelm@24800	1294
wenzelm@24800	1295	* Syntax: the scope for resolving ambiguities via type-inference is
wenzelm@24800	1296	now limited to individual terms, instead of whole simultaneous
wenzelm@24234	1297	specifications as before. This greatly reduces the complexity of the
wenzelm@24234	1298	syntax module and improves flexibility by separating parsing and
wenzelm@24234	1299	type-checking. INCOMPATIBILITY: additional type-constraints (explicit
wenzelm@24234	1300	'fixes' etc.) are required in rare situations.
wenzelm@24234	1301
wenzelm@25034	1302	* Syntax: constants introduced by new-style packages ('definition',
wenzelm@25034	1303	'abbreviation' etc.) are passed through the syntax module in
wenzelm@25034	1304	``authentic mode''. This means that associated mixfix annotations
wenzelm@25034	1305	really stick to such constants, independently of potential name space
wenzelm@25034	1306	ambiguities introduced later on. INCOMPATIBILITY: constants in parse
wenzelm@25034	1307	trees are represented slightly differently, may need to adapt syntax
wenzelm@25034	1308	translations accordingly. Use CONST marker in 'translations' and
wenzelm@25034	1309	@{const_syntax} antiquotation in 'parse_translation' etc.
wenzelm@25034	1310
wenzelm@17981	1311	* Legacy goal package: reduced interface to the bare minimum required
wenzelm@17981	1312	to keep existing proof scripts running. Most other user-level
wenzelm@17981	1313	functions are now part of the OldGoals structure, which is not open
wenzelm@17981	1314	by default (consider isatool expandshort before open OldGoals).
wenzelm@17981	1315	Removed top_sg, prin, printyp, pprint_term/typ altogether, because
wenzelm@17981	1316	these tend to cause confusion about the actual goal (!) context being
wenzelm@17981	1317	used here, which is not necessarily the same as the_context().
wenzelm@17918	1318
wenzelm@23379	1319	* Command 'find_theorems': supports "*" wild-card in "name:"
wenzelm@23379	1320	criterion; "with_dups" option. Certain ProofGeneral versions might
wenzelm@23379	1321	support a specific search form (see ProofGeneral/CHANGES).
webertj@22965	1322
wenzelm@20370	1323	* The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
wenzelm@20370	1324	by default, which means that "prems" (and also "fixed variables") are
wenzelm@20370	1325	suppressed from proof state output. Note that the ProofGeneral
wenzelm@20370	1326	settings mechanism allows to change and save options persistently, but
wenzelm@20370	1327	older versions of Isabelle will fail to start up if a negative prems
wenzelm@20370	1328	limit is imposed.
wenzelm@20370	1329
wenzelm@21308	1330	* Local theory targets may be specified by non-nested blocks of
wenzelm@21308	1331	``context/locale/class ... begin'' followed by ``end''. The body may
wenzelm@21308	1332	contain definitions, theorems etc., including any derived mechanism
wenzelm@21308	1333	that has been implemented on top of these primitives. This concept
wenzelm@21308	1334	generalizes the existing ``theorem (in ...)'' towards more versatility
wenzelm@21308	1335	and scalability.
wenzelm@21308	1336
wenzelm@21960	1337	* Proof General interface: proper undo of final 'end' command;
wenzelm@21960	1338	discontinued Isabelle/classic mode (ML proof scripts).
wenzelm@21960	1339
wenzelm@17754	1340
wenzelm@17865	1341	* Document preparation *
wenzelm@17865	1342
wenzelm@21717	1343	* Added antiquotation @{theory name} which prints the given name,
wenzelm@21717	1344	after checking that it refers to a valid ancestor theory in the
wenzelm@21717	1345	current context.
haftmann@21339	1346
wenzelm@17869	1347	* Added antiquotations @{ML_type text} and @{ML_struct text} which
wenzelm@17869	1348	check the given source text as ML type/structure, printing verbatim.
wenzelm@17865	1349
wenzelm@21717	1350	* Added antiquotation @{abbrev "c args"} which prints the abbreviation
wenzelm@21717	1351	"c args == rhs" given in the current context. (Any number of
wenzelm@21735	1352	arguments may be given on the LHS.)
wenzelm@21717	1353
wenzelm@21717	1354
wenzelm@17779	1355	* Pure *
wenzelm@17779	1356
wenzelm@24800	1357	* The 'class' package offers a combination of axclass and locale to
wenzelm@25129	1358	achieve Haskell-like type classes in Isabelle. Definitions and
wenzelm@25129	1359	theorems within a class context produce both relative results (with
wenzelm@25129	1360	implicit parameters according to the locale context), and polymorphic
wenzelm@25129	1361	constants with qualified polymorphism (according to the class
wenzelm@25129	1362	context). Within the body context of a 'class' target, a separate
wenzelm@25129	1363	syntax layer ("user space type system") takes care of converting
wenzelm@25129	1364	between global polymorphic consts and internal locale representation.
wenzelm@25177	1365	See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
haftmann@25184	1366	"isatool doc classes" provides a tutorial.
wenzelm@20807	1367
haftmann@25199	1368	* Generic code generator framework allows to generate executable
wenzelm@24800	1369	code for ML and Haskell (including Isabelle classes). A short usage
wenzelm@24800	1370	sketch:
haftmann@20188	1371
haftmann@20188	1372	internal compilation:
haftmann@25199	1373	export_code <list of constants (term syntax)> in SML
haftmann@20453	1374	writing SML code to a file:
haftmann@25199	1375	export_code <list of constants (term syntax)> in SML <filename>
haftmann@22735	1376	writing OCaml code to a file:
haftmann@25199	1377	export_code <list of constants (term syntax)> in OCaml <filename>
haftmann@20188	1378	writing Haskell code to a bunch of files:
haftmann@25199	1379	export_code <list of constants (term syntax)> in Haskell <filename>
haftmann@25199	1380
haftmann@25199	1381	evaluating closed propositions to True/False using code generation:
haftmann@25184	1382	method ``eval''
haftmann@25184	1383
haftmann@25184	1384	Reasonable default setup of framework in HOL.
haftmann@20453	1385
haftmann@20453	1386	Theorem attributs for selecting and transforming function equations theorems:
haftmann@20453	1387
haftmann@22845	1388	[code fun]: select a theorem as function equation for a specific constant
haftmann@22845	1389	[code fun del]: deselect a theorem as function equation for a specific constant
haftmann@22845	1390	[code inline]: select an equation theorem for unfolding (inlining) in place
haftmann@22845	1391	[code inline del]: deselect an equation theorem for unfolding (inlining) in place
haftmann@20453	1392
haftmann@22735	1393	User-defined serializations (target in {SML, OCaml, Haskell}):
haftmann@20453	1394
haftmann@20453	1395	code_const <and-list of constants (term syntax)>
haftmann@20453	1396	{(target) <and-list of const target syntax>}+
haftmann@20453	1397
haftmann@20453	1398	code_type <and-list of type constructors>
haftmann@20453	1399	{(target) <and-list of type target syntax>}+
haftmann@20453	1400
haftmann@20453	1401	code_instance <and-list of instances>
haftmann@20453	1402	{(target)}+
haftmann@20453	1403	where instance ::= <type constructor> :: <class>
haftmann@20453	1404
haftmann@20453	1405	code_class <and_list of classes>
haftmann@20453	1406	{(target) <and-list of class target syntax>}+
haftmann@20453	1407	where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
haftmann@20453	1408
haftmann@25199	1409	code_instance and code_class only are effective to target Haskell.
haftmann@22735	1410
wenzelm@25177	1411	For example usage see src/HOL/ex/Codegenerator.thy and
wenzelm@25177	1412	src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
wenzelm@24800	1413	generation from Isabelle/HOL theories is available via "isatool doc
wenzelm@24800	1414	codegen".
haftmann@20188	1415
wenzelm@25129	1416	* Code generator: consts in 'consts_code' Isar commands are now
wenzelm@25129	1417	referred to by usual term syntax (including optional type
wenzelm@25129	1418	annotations).
wenzelm@25129	1419
wenzelm@19254	1420	* Command 'no_translations' removes translation rules from theory
wenzelm@19254	1421	syntax.
wenzelm@19254	1422
wenzelm@19625	1423	* Overloaded definitions are now actually checked for acyclic
wenzelm@19714	1424	dependencies. The overloading scheme is slightly more general than
wenzelm@19714	1425	that of Haskell98, although Isabelle does not demand an exact
wenzelm@19714	1426	correspondence to type class and instance declarations.
wenzelm@19714	1427	INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
wenzelm@19714	1428	exotic versions of overloading -- at the discretion of the user!
wenzelm@19711	1429
wenzelm@19711	1430	Polymorphic constants are represented via type arguments, i.e. the
wenzelm@19711	1431	instantiation that matches an instance against the most general
wenzelm@19711	1432	declaration given in the signature. For example, with the declaration
wenzelm@19711	1433	c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
wenzelm@19711	1434	as c(nat). Overloading is essentially simultaneous structural
wenzelm@19711	1435	recursion over such type arguments. Incomplete specification patterns
wenzelm@19714	1436	impose global constraints on all occurrences, e.g. c('a * 'a) on the
wenzelm@19715	1437	LHS means that more general c('a * 'b) will be disallowed on any RHS.
wenzelm@19714	1438	Command 'print_theory' outputs the normalized system of recursive
wenzelm@19714	1439	equations, see section "definitions".
wenzelm@19625	1440
wenzelm@24086	1441	* Configuration options are maintained within the theory or proof
wenzelm@24086	1442	context (with name and type bool/int/string), providing a very simple
wenzelm@24086	1443	interface to a poor-man's version of general context data. Tools may
wenzelm@24110	1444	declare options in ML (e.g. using Attrib.config_int) and then refer to
wenzelm@24110	1445	these values using Config.get etc. Users may change options via an
wenzelm@24110	1446	associated attribute of the same name. This form of context
wenzelm@24110	1447	declaration works particularly well with commands 'declare' or
wenzelm@24110	1448	'using', for example ``declare [[foo = 42]]''. Thus it has become
wenzelm@24110	1449	very easy to avoid global references, which would not observe Isar
wenzelm@24110	1450	toplevel undo/redo and fail to work with multithreading.
wenzelm@24086	1451
wenzelm@24172	1452	Various global ML references of Pure and HOL have been turned into
wenzelm@24172	1453	configuration options:
wenzelm@24172	1454
wenzelm@24172	1455	Unify.search_bound unify_search_bound
wenzelm@24172	1456	Unify.trace_bound unify_trace_bound
wenzelm@24172	1457	Unify.trace_simp unify_trace_simp
wenzelm@24172	1458	Unify.trace_types unify_trace_types
wenzelm@24172	1459	Simplifier.simp_depth_limit simp_depth_limit
wenzelm@24172	1460	Blast.depth_limit blast_depth_limit
wenzelm@24172	1461	DatatypeProp.dtK datatype_distinctness_limit
wenzelm@24172	1462	fast_arith_neq_limit fast_arith_neq_limit
wenzelm@24172	1463	fast_arith_split_limit fast_arith_split_limit
wenzelm@24172	1464
wenzelm@24086	1465	* Named collections of theorems may be easily installed as context
wenzelm@24800	1466	data using the functor NamedThmsFun (see also
wenzelm@24086	1467	src/Pure/Tools/named_thms.ML). The user may add or delete facts via
wenzelm@24110	1468	attributes; there is also a toplevel print command. This facility is
wenzelm@24110	1469	just a common case of general context data, which is the preferred way
wenzelm@24110	1470	for anything more complex than just a list of facts in canonical
wenzelm@24110	1471	order.
wenzelm@24086	1472
wenzelm@24032	1473	* Isar: command 'declaration' augments a local theory by generic
wenzelm@24032	1474	declaration functions written in ML. This enables arbitrary content
wenzelm@24032	1475	being added to the context, depending on a morphism that tells the
wenzelm@24032	1476	difference of the original declaration context wrt. the application
wenzelm@24032	1477	context encountered later on.
wenzelm@24032	1478
wenzelm@24032	1479	* Isar: proper interfaces for simplification procedures. Command
wenzelm@24032	1480	'simproc_setup' declares named simprocs (with match patterns, and body
wenzelm@24032	1481	text in ML). Attribute "simproc" adds/deletes simprocs in the current
wenzelm@24032	1482	context. ML antiquotation @{simproc name} retrieves named simprocs.
wenzelm@24032	1483
wenzelm@24032	1484	* Isar: an extra pair of brackets around attribute declarations
wenzelm@24032	1485	abbreviates a theorem reference involving an internal dummy fact,
wenzelm@24032	1486	which will be ignored later --- only the effect of the attribute on
wenzelm@24032	1487	the background context will persist. This form of in-place
wenzelm@24032	1488	declarations is particularly useful with commands like 'declare' and
wenzelm@24032	1489	'using', for example ``have A using [[simproc a]] by simp''.
wenzelm@24032	1490
wenzelm@23369	1491	* Isar: method "assumption" (and implicit closing of subproofs) now
wenzelm@23369	1492	takes simple non-atomic goal assumptions into account: after applying
wenzelm@23369	1493	an assumption as a rule the resulting subgoals are solved by atomic
wenzelm@23369	1494	assumption steps. This is particularly useful to finish 'obtain'
wenzelm@23369	1495	goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
wenzelm@23369	1496	without referring to the original premise "!!x. P x ==> thesis" in the
wenzelm@23369	1497	Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
wenzelm@23369	1498	more permissive.
wenzelm@23369	1499
wenzelm@23369	1500	* Isar: implicit use of prems from the Isar proof context is
wenzelm@23369	1501	considered a legacy feature. Common applications like ``have A .''
wenzelm@23369	1502	may be replaced by ``have A by fact'' or ``note `A`''. In general,
wenzelm@23369	1503	referencing facts explicitly here improves readability and
wenzelm@23369	1504	maintainability of proof texts.
wenzelm@23369	1505
wenzelm@17865	1506	* Isar: improper proof element 'guess' is like 'obtain', but derives
wenzelm@17865	1507	the obtained context from the course of reasoning! For example:
wenzelm@17865	1508
wenzelm@17865	1509	assume "EX x y. A x & B y" -- "any previous fact"
wenzelm@17865	1510	then guess x and y by clarify
wenzelm@17865	1511
wenzelm@17865	1512	This technique is potentially adventurous, depending on the facts and
wenzelm@17865	1513	proof tools being involved here.
wenzelm@17865	1514
wenzelm@18020	1515	* Isar: known facts from the proof context may be specified as literal
wenzelm@18020	1516	propositions, using ASCII back-quote syntax. This works wherever
wenzelm@18020	1517	named facts used to be allowed so far, in proof commands, proof
wenzelm@18020	1518	methods, attributes etc. Literal facts are retrieved from the context
wenzelm@18020	1519	according to unification of type and term parameters. For example,
wenzelm@18020	1520	provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
wenzelm@18020	1521	theorems in the current context, then these are valid literal facts:
wenzelm@18020	1522	`A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
wenzelm@18020	1523
wenzelm@18020	1524	There is also a proof method "fact" which does the same composition
wenzelm@18044	1525	for explicit goal states, e.g. the following proof texts coincide with
wenzelm@18044	1526	certain special cases of literal facts:
wenzelm@18020	1527
wenzelm@18020	1528	have "A" by fact == note `A`
wenzelm@18020	1529	have "A ==> B" by fact == note `A ==> B`
wenzelm@18020	1530	have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
wenzelm@18020	1531	have "P a ==> Q a" by fact == note `P a ==> Q a`
wenzelm@18020	1532
wenzelm@20118	1533	* Isar: ":" (colon) is no longer a symbolic identifier character in
wenzelm@20118	1534	outer syntax. Thus symbolic identifiers may be used without
wenzelm@20118	1535	additional white space in declarations like this: ``assume *: A''.
wenzelm@20118	1536
wenzelm@20013	1537	* Isar: 'print_facts' prints all local facts of the current context,
wenzelm@20013	1538	both named and unnamed ones.
wenzelm@20013	1539
wenzelm@18308	1540	* Isar: 'def' now admits simultaneous definitions, e.g.:
wenzelm@18308	1541
wenzelm@18308	1542	def x == "t" and y == "u"
wenzelm@18308	1543
wenzelm@18540	1544	* Isar: added command 'unfolding', which is structurally similar to
wenzelm@18540	1545	'using', but affects both the goal state and facts by unfolding given
wenzelm@18815	1546	rewrite rules. Thus many occurrences of the 'unfold' method or
wenzelm@18540	1547	'unfolded' attribute may be replaced by first-class proof text.
wenzelm@18540	1548
wenzelm@18815	1549	* Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
wenzelm@18815	1550	and command 'unfolding' now all support object-level equalities
wenzelm@18815	1551	(potentially conditional). The underlying notion of rewrite rule is
wenzelm@18815	1552	analogous to the 'rule_format' attribute, but not that of the
wenzelm@18815	1553	Simplifier (which is usually more generous).
wenzelm@18815	1554
kleing@24238	1555	* Isar: the new attribute [rotated n] (default n = 1) rotates the
kleing@24238	1556	premises of a theorem by n. Useful in conjunction with drule.
kleing@24238	1557
wenzelm@19220	1558	* Isar: the goal restriction operator [N] (default N = 1) evaluates a
wenzelm@19220	1559	method expression within a sandbox consisting of the first N
wenzelm@19240	1560	sub-goals, which need to exist. For example, ``simp_all [3]''
wenzelm@19240	1561	simplifies the first three sub-goals, while (rule foo, simp_all)[]
wenzelm@19240	1562	simplifies all new goals that emerge from applying rule foo to the
wenzelm@19240	1563	originally first one.
wenzelm@19220	1564
wenzelm@19814	1565	* Isar: schematic goals are no longer restricted to higher-order
wenzelm@19814	1566	patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
wenzelm@19814	1567	expected.
wenzelm@19814	1568
wenzelm@18901	1569	* Isar: the conclusion of a long theorem statement is now either
wenzelm@18901	1570	'shows' (a simultaneous conjunction, as before), or 'obtains'
wenzelm@18901	1571	(essentially a disjunction of cases with local parameters and
wenzelm@18901	1572	assumptions). The latter allows to express general elimination rules
wenzelm@18910	1573	adequately; in this notation common elimination rules look like this:
wenzelm@18901	1574
wenzelm@18901	1575	lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
wenzelm@18901	1576	assumes "EX x. P x"
wenzelm@18901	1577	obtains x where "P x"
wenzelm@18901	1578
wenzelm@18901	1579	lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
wenzelm@18901	1580	assumes "A & B"
wenzelm@18901	1581	obtains A and B
wenzelm@18901	1582
wenzelm@18901	1583	lemma disjE: -- "A \| B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
wenzelm@18901	1584	assumes "A \| B"
wenzelm@18901	1585	obtains
wenzelm@18901	1586	A
wenzelm@18901	1587	\| B
wenzelm@18901	1588
wenzelm@18910	1589	The subsequent classical rules even refer to the formal "thesis"
wenzelm@18901	1590	explicitly:
wenzelm@18901	1591
wenzelm@18901	1592	lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
wenzelm@18901	1593	obtains "~ thesis"
wenzelm@18901	1594
wenzelm@18910	1595	lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
wenzelm@18910	1596	obtains "thesis ==> something"
wenzelm@18901	1597
wenzelm@18901	1598	The actual proof of an 'obtains' statement is analogous to that of the
wenzelm@18910	1599	Isar proof element 'obtain', only that there may be several cases.
wenzelm@18910	1600	Optional case names may be specified in parentheses; these will be
wenzelm@18910	1601	available both in the present proof and as annotations in the
wenzelm@18910	1602	resulting rule, for later use with the 'cases' method (cf. attribute
wenzelm@18910	1603	case_names).
wenzelm@18901	1604
wenzelm@21447	1605	* Isar: the assumptions of a long theorem statement are available as
wenzelm@21447	1606	"assms" fact in the proof context. This is more appropriate than the
wenzelm@21447	1607	(historical) "prems", which refers to all assumptions of the current
wenzelm@21447	1608	context, including those from the target locale, proof body etc.
wenzelm@21447	1609
wenzelm@19263	1610	* Isar: 'print_statement' prints theorems from the current theory or
wenzelm@19263	1611	proof context in long statement form, according to the syntax of a
wenzelm@19263	1612	top-level lemma.
wenzelm@19263	1613
wenzelm@18901	1614	* Isar: 'obtain' takes an optional case name for the local context
wenzelm@18901	1615	introduction rule (default "that").
wenzelm@18901	1616
wenzelm@19587	1617	* Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
wenzelm@19587	1618	explicit (is "_ ==> ?foo") in the rare cases where this still happens
wenzelm@19587	1619	to occur.
wenzelm@19587	1620
wenzelm@19682	1621	* Pure: syntax "CONST name" produces a fully internalized constant
wenzelm@19682	1622	according to the current context. This is particularly useful for
wenzelm@19682	1623	syntax translations that should refer to internal constant
wenzelm@19682	1624	representations independently of name spaces.
wenzelm@19682	1625
wenzelm@21537	1626	* Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
wenzelm@21537	1627	instead of "FOO ". This allows multiple binder declarations to coexist
wenzelm@21537	1628	in the same context. INCOMPATIBILITY.
wenzelm@21537	1629
wenzelm@21209	1630	* Isar/locales: 'notation' provides a robust interface to the 'syntax'
wenzelm@21209	1631	primitive that also works in a locale context (both for constants and
wenzelm@24950	1632	fixed variables). Type declaration and internal syntactic representation
wenzelm@24950	1633	of given constants retrieved from the context. Likewise, the
wenzelm@24950	1634	'no_notation' command allows to remove given syntax annotations from the
wenzelm@24950	1635	current context.
wenzelm@19682	1636
wenzelm@19665	1637	* Isar/locales: new derived specification elements 'axiomatization',
wenzelm@19665	1638	'definition', 'abbreviation', which support type-inference, admit
wenzelm@19083	1639	object-level specifications (equality, equivalence). See also the
wenzelm@19083	1640	isar-ref manual. Examples:
wenzelm@19081	1641
wenzelm@19665	1642	axiomatization
wenzelm@21595	1643	eq (infix "===" 50) where
wenzelm@21595	1644	eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
wenzelm@21595	1645
wenzelm@21595	1646	definition "f x y = x + y + 1"
wenzelm@21595	1647	definition g where "g x = f x x"
wenzelm@19081	1648
wenzelm@19363	1649	abbreviation
wenzelm@21595	1650	neq (infix "=!=" 50) where
wenzelm@19363	1651	"x =!= y == ~ (x === y)"
wenzelm@19081	1652
wenzelm@19083	1653	These specifications may be also used in a locale context. Then the
wenzelm@19083	1654	constants being introduced depend on certain fixed parameters, and the
wenzelm@19083	1655	constant name is qualified by the locale base name. An internal
wenzelm@19083	1656	abbreviation takes care for convenient input and output, making the
wenzelm@19088	1657	parameters implicit and using the original short name. See also
wenzelm@25177	1658	src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
wenzelm@19083	1659	entities from a monomorphic theory.
wenzelm@19083	1660
wenzelm@19083	1661	Presently, abbreviations are only available 'in' a target locale, but
wenzelm@19363	1662	not inherited by general import expressions. Also note that
wenzelm@19363	1663	'abbreviation' may be used as a type-safe replacement for 'syntax' +
wenzelm@24735	1664	'translations' in common applications. The "no_abbrevs" print mode
wenzelm@24735	1665	prevents folding of abbreviations in term output.
wenzelm@19084	1666
wenzelm@19682	1667	Concrete syntax is attached to specified constants in internal form,
wenzelm@19682	1668	independently of name spaces. The parse tree representation is
wenzelm@21209	1669	slightly different -- use 'notation' instead of raw 'syntax', and
wenzelm@19682	1670	'translations' with explicit "CONST" markup to accommodate this.
wenzelm@19665	1671
wenzelm@24800	1672	* Pure/Isar: unified syntax for new-style specification mechanisms
wenzelm@24800	1673	(e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
wenzelm@24800	1674	full type inference and dummy patterns ("_"). For example:
wenzelm@24735	1675
wenzelm@24735	1676	definition "K x _ = x"
wenzelm@24735	1677
wenzelm@24738	1678	inductive conj for A B
wenzelm@24738	1679	where "A ==> B ==> conj A B"
wenzelm@24738	1680
wenzelm@21735	1681	* Pure: command 'print_abbrevs' prints all constant abbreviations of
wenzelm@21735	1682	the current context. Print mode "no_abbrevs" prevents inversion of
wenzelm@21735	1683	abbreviations on output.
wenzelm@21735	1684
wenzelm@24800	1685	* Isar/locales: improved parameter handling: use of locales "var" and
wenzelm@24800	1686	"struct" no longer necessary; - parameter renamings are no longer
wenzelm@24800	1687	required to be injective. For example, this allows to define
wenzelm@24800	1688	endomorphisms as locale endom = homom mult mult h.
ballarin@19783	1689
ballarin@19931	1690	* Isar/locales: changed the way locales with predicates are defined.
ballarin@19931	1691	Instead of accumulating the specification, the imported expression is
wenzelm@22126	1692	now an interpretation. INCOMPATIBILITY: different normal form of
wenzelm@22126	1693	locale expressions. In particular, in interpretations of locales with
wenzelm@22126	1694	predicates, goals repesenting already interpreted fragments are not
wenzelm@22126	1695	removed automatically. Use methods `intro_locales' and
wenzelm@22126	1696	`unfold_locales'; see below.
wenzelm@22126	1697
wenzelm@22126	1698	* Isar/locales: new methods `intro_locales' and `unfold_locales'
wenzelm@22126	1699	provide backward reasoning on locales predicates. The methods are
wenzelm@22126	1700	aware of interpretations and discharge corresponding goals.
wenzelm@22126	1701	`intro_locales' is less aggressive then `unfold_locales' and does not
wenzelm@22126	1702	unfold predicates to assumptions.
ballarin@19931	1703
ballarin@19931	1704	* Isar/locales: the order in which locale fragments are accumulated
wenzelm@22126	1705	has changed. This enables to override declarations from fragments due
wenzelm@22126	1706	to interpretations -- for example, unwanted simp rules.
ballarin@19931	1707
ballarin@23920	1708	* Isar/locales: interpretation in theories and proof contexts has been
ballarin@23920	1709	extended. One may now specify (and prove) equations, which are
ballarin@23920	1710	unfolded in interpreted theorems. This is useful for replacing
ballarin@23920	1711	defined concepts (constants depending on locale parameters) by
ballarin@23920	1712	concepts already existing in the target context. Example:
ballarin@23920	1713
ballarin@23920	1714	interpretation partial_order ["op <= :: [int, int] => bool"]
ballarin@23920	1715	where "partial_order.less (op <=) (x::int) y = (x < y)"
ballarin@23920	1716
wenzelm@24800	1717	Typically, the constant `partial_order.less' is created by a
wenzelm@24800	1718	definition specification element in the context of locale
wenzelm@24800	1719	partial_order.
wenzelm@24800	1720
wenzelm@24859	1721	* Method "induct": improved internal context management to support
wenzelm@24800	1722	local fixes and defines on-the-fly. Thus explicit meta-level
wenzelm@24800	1723	connectives !! and ==> are rarely required anymore in inductive goals
wenzelm@24800	1724	(using object-logic connectives for this purpose has been long
wenzelm@24800	1725	obsolete anyway). Common proof patterns are explained in
wenzelm@25177	1726	src/HOL/Induct/Common_Patterns.thy, see also
wenzelm@25177	1727	src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
wenzelm@25177	1728	examples.
wenzelm@24606	1729
wenzelm@24859	1730	* Method "induct": improved handling of simultaneous goals. Instead of
wenzelm@24606	1731	introducing object-level conjunction, the statement is now split into
wenzelm@24606	1732	several conclusions, while the corresponding symbolic cases are nested
wenzelm@24606	1733	accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
wenzelm@25177	1734	see src/HOL/Induct/Common_Patterns.thy, for example.
wenzelm@24606	1735
wenzelm@24859	1736	* Method "induct": mutual induction rules are now specified as a list
wenzelm@24800	1737	of rule sharing the same induction cases. HOL packages usually provide
wenzelm@24606	1738	foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
wenzelm@24859	1739	predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
wenzelm@24859	1740	mutual induction rules differently, i.e. like this:
wenzelm@18506	1741
wenzelm@18506	1742	(induct rule: foo_bar.inducts)
wenzelm@18506	1743	(induct set: foo bar)
wenzelm@24859	1744	(induct pred: foo bar)
wenzelm@18506	1745	(induct type: foo bar)
wenzelm@18506	1746
wenzelm@18506	1747	The ML function ProjectRule.projections turns old-style rules into the
wenzelm@18506	1748	new format.
wenzelm@18506	1749
wenzelm@24859	1750	* Method "coinduct": dual of induction, see
wenzelm@18399	1751	src/HOL/Library/Coinductive_List.thy for various examples.
wenzelm@18399	1752
wenzelm@24859	1753	* Method "cases", "induct", "coinduct": the ``(open)'' option is
wenzelm@24859	1754	considered a legacy feature.
wenzelm@24859	1755
wenzelm@20919	1756	* Attribute "symmetric" produces result with standardized schematic
wenzelm@20919	1757	variables (index 0). Potential INCOMPATIBILITY.
wenzelm@20919	1758
wenzelm@22126	1759	* Simplifier: by default the simplifier trace only shows top level
wenzelm@22126	1760	rewrites now. That is, trace_simp_depth_limit is set to 1 by
wenzelm@22126	1761	default. Thus there is less danger of being flooded by the trace. The
wenzelm@22126	1762	trace indicates where parts have been suppressed.
nipkow@18674	1763
wenzelm@18536	1764	* Provers/classical: removed obsolete classical version of elim_format
wenzelm@18536	1765	attribute; classical elim/dest rules are now treated uniformly when
wenzelm@18536	1766	manipulating the claset.
wenzelm@18536	1767
wenzelm@18694	1768	* Provers/classical: stricter checks to ensure that supplied intro,
wenzelm@18694	1769	dest and elim rules are well-formed; dest and elim rules must have at
wenzelm@18694	1770	least one premise.
wenzelm@18694	1771
wenzelm@18694	1772	* Provers/classical: attributes dest/elim/intro take an optional
wenzelm@18695	1773	weight argument for the rule (just as the Pure versions). Weights are
wenzelm@18696	1774	ignored by automated tools, but determine the search order of single
wenzelm@18694	1775	rule steps.
paulson@18557	1776
wenzelm@18536	1777	* Syntax: input syntax now supports dummy variable binding "%_. b",
wenzelm@18536	1778	where the body does not mention the bound variable. Note that dummy
wenzelm@18536	1779	patterns implicitly depend on their context of bounds, which makes
wenzelm@18536	1780	"{_. _}" match any set comprehension as expected. Potential
wenzelm@18536	1781	INCOMPATIBILITY -- parse translations need to cope with syntactic
wenzelm@18536	1782	constant "_idtdummy" in the binding position.
wenzelm@18536	1783
wenzelm@18536	1784	* Syntax: removed obsolete syntactic constant "_K" and its associated
wenzelm@18536	1785	parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
wenzelm@18536	1786	for example "A -> B" => "Pi A (%_. B)".
wenzelm@17779	1787
wenzelm@20582	1788	* Pure: 'class_deps' command visualizes the subclass relation, using
wenzelm@20582	1789	the graph browser tool.
wenzelm@20582	1790
wenzelm@24800	1791	* Pure: 'print_theory' now suppresses certain internal declarations by
wenzelm@24800	1792	default; use '!' option for full details.
wenzelm@20620	1793
wenzelm@17865	1794
nipkow@17806	1795	* HOL *
nipkow@17806	1796
wenzelm@25129	1797	* Method "metis" proves goals by applying the Metis general-purpose
wenzelm@25129	1798	resolution prover (see also http://gilith.com/software/metis/).
wenzelm@25129	1799	Examples are in the directory MetisExamples. WARNING: the
wenzelm@25129	1800	Isabelle/HOL-Metis integration does not yet work properly with
wenzelm@25129	1801	multi-threading.
wenzelm@25129	1802
wenzelm@25129	1803	* Command 'sledgehammer' invokes external automatic theorem provers as
wenzelm@25129	1804	background processes. It generates calls to the "metis" method if
wenzelm@25129	1805	successful. These can be pasted into the proof. Users do not have to
wenzelm@25129	1806	wait for the automatic provers to return. WARNING: does not really
wenzelm@25129	1807	work with multi-threading.
wenzelm@25129	1808
wenzelm@24804	1809	* New "auto_quickcheck" feature tests outermost goal statements for
wenzelm@24804	1810	potential counter-examples. Controlled by ML references
wenzelm@24804	1811	auto_quickcheck (default true) and auto_quickcheck_time_limit (default
wenzelm@25129	1812	5000 milliseconds). Fails silently if statements is outside of
wenzelm@25129	1813	executable fragment, or any other codgenerator problem occurs.
wenzelm@24804	1814
haftmann@25184	1815	* New constant "undefined" with axiom "undefined x = undefined".
haftmann@25184	1816
haftmann@25184	1817	* Added class "HOL.eq", allowing for code generation with polymorphic
haftmann@25184	1818	equality.
haftmann@25184	1819
haftmann@25184	1820	* Some renaming of class constants due to canonical name prefixing in
haftmann@25184	1821	the new 'class' package:
haftmann@25184	1822
haftmann@25184	1823	HOL.abs ~> HOL.abs_class.abs
haftmann@25184	1824	HOL.divide ~> HOL.divide_class.divide
haftmann@25184	1825	0 ~> HOL.zero_class.zero
haftmann@25184	1826	1 ~> HOL.one_class.one
haftmann@25184	1827	op + ~> HOL.plus_class.plus
haftmann@25184	1828	op - ~> HOL.minus_class.minus
haftmann@25184	1829	uminus ~> HOL.minus_class.uminus
haftmann@25184	1830	op * ~> HOL.times_class.times
haftmann@25184	1831	op < ~> HOL.ord_class.less
haftmann@25184	1832	op <= > HOL.ord_class.less_eq
haftmann@25184	1833	Nat.power ~> Power.power_class.power
haftmann@25184	1834	Nat.size ~> Nat.size_class.size
haftmann@25184	1835	Numeral.number_of ~> Numeral.number_class.number_of
haftmann@25184	1836	FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
haftmann@25184	1837	FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
haftmann@25184	1838	Orderings.min ~> Orderings.ord_class.min
haftmann@25184	1839	Orderings.max ~> Orderings.ord_class.max
haftmann@25184	1840	Divides.op div ~> Divides.div_class.div
haftmann@25184	1841	Divides.op mod ~> Divides.div_class.mod
haftmann@25184	1842	Divides.op dvd ~> Divides.div_class.dvd
haftmann@25184	1843
haftmann@25184	1844	INCOMPATIBILITY. Adaptions may be required in the following cases:
haftmann@25184	1845
haftmann@25184	1846	a) User-defined constants using any of the names "plus", "minus",
haftmann@25184	1847	"times", "less" or "less_eq". The standard syntax translations for
haftmann@25184	1848	"+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
haftmann@25184	1849	names.
haftmann@25184	1850
haftmann@25184	1851	b) Variables named "plus", "minus", "times", "less", "less_eq"
haftmann@25184	1852	INCOMPATIBILITY: use more specific names.
haftmann@25184	1853
haftmann@25184	1854	c) Permutative equations (e.g. "a + b = b + a")
haftmann@25184	1855	Since the change of names also changes the order of terms, permutative
haftmann@25184	1856	rewrite rules may get applied in a different order. Experience shows
haftmann@25184	1857	that this is rarely the case (only two adaptions in the whole Isabelle
haftmann@25184	1858	distribution). INCOMPATIBILITY: rewrite proofs
haftmann@25184	1859
haftmann@25184	1860	d) ML code directly refering to constant names
haftmann@25184	1861	This in general only affects hand-written proof tactics, simprocs and
haftmann@25184	1862	so on. INCOMPATIBILITY: grep your sourcecode and replace names.
haftmann@25184	1863	Consider using @{const_name} antiquotation.
haftmann@25184	1864
haftmann@25184	1865	* New class "default" with associated constant "default".
haftmann@25184	1866
haftmann@25184	1867	* Function "sgn" is now overloaded and available on int, real, complex
haftmann@25184	1868	(and other numeric types), using class "sgn". Two possible defs of
haftmann@25184	1869	sgn are given as equational assumptions in the classes sgn_if and
haftmann@25184	1870	sgn_div_norm; ordered_idom now also inherits from sgn_if.
haftmann@25184	1871	INCOMPATIBILITY.
haftmann@25184	1872
haftmann@25184	1873	* Locale "partial_order" now unified with class "order" (cf. theory
haftmann@25184	1874	Orderings), added parameter "less". INCOMPATIBILITY.
haftmann@25184	1875
haftmann@25184	1876	* Renamings in classes "order" and "linorder": facts "refl", "trans" and
haftmann@25184	1877	"cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
haftmann@25184	1878	clashes with HOL "refl" and "trans". INCOMPATIBILITY.
haftmann@25184	1879
haftmann@25184	1880	* Classes "order" and "linorder": potential INCOMPATIBILITY due to
haftmann@25184	1881	changed order of proof goals in instance proofs.
haftmann@25184	1882
haftmann@25184	1883	* The transitivity reasoner for partial and linear orders is set up
haftmann@25184	1884	for classes "order" and "linorder". Instances of the reasoner are available
haftmann@25184	1885	in all contexts importing or interpreting the corresponding locales.
haftmann@25184	1886	Method "order" invokes the reasoner separately; the reasoner
haftmann@25184	1887	is also integrated with the Simplifier as a solver. Diagnostic
haftmann@25184	1888	command 'print_orders' shows the available instances of the reasoner
haftmann@25184	1889	in the current context.
haftmann@25184	1890
haftmann@25184	1891	* Localized monotonicity predicate in theory "Orderings"; integrated
haftmann@25184	1892	lemmas max_of_mono and min_of_mono with this predicate.
haftmann@25184	1893	INCOMPATIBILITY.
haftmann@25184	1894
haftmann@25184	1895	* Formulation of theorem "dense" changed slightly due to integration
haftmann@25184	1896	with new class dense_linear_order.
haftmann@25184	1897
haftmann@25184	1898	* Uniform lattice theory development in HOL.
haftmann@25184	1899
haftmann@25184	1900	constants "meet" and "join" now named "inf" and "sup"
haftmann@25184	1901	constant "Meet" now named "Inf"
haftmann@25184	1902
haftmann@25184	1903	classes "meet_semilorder" and "join_semilorder" now named
haftmann@25184	1904	"lower_semilattice" and "upper_semilattice"
haftmann@25184	1905	class "lorder" now named "lattice"
haftmann@25184	1906	class "comp_lat" now named "complete_lattice"
haftmann@25184	1907
haftmann@25184	1908	Instantiation of lattice classes allows explicit definitions
haftmann@25184	1909	for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
haftmann@25184	1910
haftmann@25184	1911	INCOMPATIBILITY. Theorem renames:
haftmann@25184	1912
haftmann@25184	1913	meet_left_le ~> inf_le1
haftmann@25184	1914	meet_right_le ~> inf_le2
haftmann@25184	1915	join_left_le ~> sup_ge1
haftmann@25184	1916	join_right_le ~> sup_ge2
haftmann@25184	1917	meet_join_le ~> inf_sup_ord
haftmann@25184	1918	le_meetI ~> le_infI
haftmann@25184	1919	join_leI ~> le_supI
haftmann@25184	1920	le_meet ~> le_inf_iff
haftmann@25184	1921	le_join ~> ge_sup_conv
haftmann@25184	1922	meet_idempotent ~> inf_idem
haftmann@25184	1923	join_idempotent ~> sup_idem
haftmann@25184	1924	meet_comm ~> inf_commute
haftmann@25184	1925	join_comm ~> sup_commute
haftmann@25184	1926	meet_leI1 ~> le_infI1
haftmann@25184	1927	meet_leI2 ~> le_infI2
haftmann@25184	1928	le_joinI1 ~> le_supI1
haftmann@25184	1929	le_joinI2 ~> le_supI2
haftmann@25184	1930	meet_assoc ~> inf_assoc
haftmann@25184	1931	join_assoc ~> sup_assoc
haftmann@25184	1932	meet_left_comm ~> inf_left_commute
haftmann@25184	1933	meet_left_idempotent ~> inf_left_idem
haftmann@25184	1934	join_left_comm ~> sup_left_commute
haftmann@25184	1935	join_left_idempotent ~> sup_left_idem
haftmann@25184	1936	meet_aci ~> inf_aci
haftmann@25184	1937	join_aci ~> sup_aci
haftmann@25184	1938	le_def_meet ~> le_iff_inf
haftmann@25184	1939	le_def_join ~> le_iff_sup
haftmann@25184	1940	join_absorp2 ~> sup_absorb2
haftmann@25184	1941	join_absorp1 ~> sup_absorb1
haftmann@25184	1942	meet_absorp1 ~> inf_absorb1
haftmann@25184	1943	meet_absorp2 ~> inf_absorb2
haftmann@25184	1944	meet_join_absorp ~> inf_sup_absorb
haftmann@25184	1945	join_meet_absorp ~> sup_inf_absorb
haftmann@25184	1946	distrib_join_le ~> distrib_sup_le
haftmann@25184	1947	distrib_meet_le ~> distrib_inf_le
haftmann@25184	1948
haftmann@25184	1949	add_meet_distrib_left ~> add_inf_distrib_left
haftmann@25184	1950	add_join_distrib_left ~> add_sup_distrib_left
haftmann@25184	1951	is_join_neg_meet ~> is_join_neg_inf
haftmann@25184	1952	is_meet_neg_join ~> is_meet_neg_sup
haftmann@25184	1953	add_meet_distrib_right ~> add_inf_distrib_right
haftmann@25184	1954	add_join_distrib_right ~> add_sup_distrib_right
haftmann@25184	1955	add_meet_join_distribs ~> add_sup_inf_distribs
haftmann@25184	1956	join_eq_neg_meet ~> sup_eq_neg_inf
haftmann@25184	1957	meet_eq_neg_join ~> inf_eq_neg_sup
haftmann@25184	1958	add_eq_meet_join ~> add_eq_inf_sup
haftmann@25184	1959	meet_0_imp_0 ~> inf_0_imp_0
haftmann@25184	1960	join_0_imp_0 ~> sup_0_imp_0
haftmann@25184	1961	meet_0_eq_0 ~> inf_0_eq_0
haftmann@25184	1962	join_0_eq_0 ~> sup_0_eq_0
haftmann@25184	1963	neg_meet_eq_join ~> neg_inf_eq_sup
haftmann@25184	1964	neg_join_eq_meet ~> neg_sup_eq_inf
haftmann@25184	1965	join_eq_if ~> sup_eq_if
haftmann@25184	1966
haftmann@25184	1967	mono_meet ~> mono_inf
haftmann@25184	1968	mono_join ~> mono_sup
haftmann@25184	1969	meet_bool_eq ~> inf_bool_eq
haftmann@25184	1970	join_bool_eq ~> sup_bool_eq
haftmann@25184	1971	meet_fun_eq ~> inf_fun_eq
haftmann@25184	1972	join_fun_eq ~> sup_fun_eq
haftmann@25184	1973	meet_set_eq ~> inf_set_eq
haftmann@25184	1974	join_set_eq ~> sup_set_eq
haftmann@25184	1975	meet1_iff ~> inf1_iff
haftmann@25184	1976	meet2_iff ~> inf2_iff
haftmann@25184	1977	meet1I ~> inf1I
haftmann@25184	1978	meet2I ~> inf2I
haftmann@25184	1979	meet1D1 ~> inf1D1
haftmann@25184	1980	meet2D1 ~> inf2D1
haftmann@25184	1981	meet1D2 ~> inf1D2
haftmann@25184	1982	meet2D2 ~> inf2D2
haftmann@25184	1983	meet1E ~> inf1E
haftmann@25184	1984	meet2E ~> inf2E
haftmann@25184	1985	join1_iff ~> sup1_iff
haftmann@25184	1986	join2_iff ~> sup2_iff
haftmann@25184	1987	join1I1 ~> sup1I1
haftmann@25184	1988	join2I1 ~> sup2I1
haftmann@25184	1989	join1I1 ~> sup1I1
haftmann@25184	1990	join2I2 ~> sup1I2
haftmann@25184	1991	join1CI ~> sup1CI
haftmann@25184	1992	join2CI ~> sup2CI
haftmann@25184	1993	join1E ~> sup1E
haftmann@25184	1994	join2E ~> sup2E
haftmann@25184	1995
haftmann@25184	1996	is_meet_Meet ~> is_meet_Inf
haftmann@25184	1997	Meet_bool_def ~> Inf_bool_def
haftmann@25184	1998	Meet_fun_def ~> Inf_fun_def
haftmann@25184	1999	Meet_greatest ~> Inf_greatest
haftmann@25184	2000	Meet_lower ~> Inf_lower
haftmann@25184	2001	Meet_set_def ~> Inf_set_def
haftmann@25184	2002
haftmann@25184	2003	Sup_def ~> Sup_Inf
haftmann@25184	2004	Sup_bool_eq ~> Sup_bool_def
haftmann@25184	2005	Sup_fun_eq ~> Sup_fun_def
haftmann@25184	2006	Sup_set_eq ~> Sup_set_def
haftmann@25184	2007
haftmann@25184	2008	listsp_meetI ~> listsp_infI
haftmann@25184	2009	listsp_meet_eq ~> listsp_inf_eq
haftmann@25184	2010
haftmann@25184	2011	meet_min ~> inf_min
haftmann@25184	2012	join_max ~> sup_max
haftmann@25184	2013
haftmann@25184	2014	* Added syntactic class "size"; overloaded constant "size" now has
haftmann@25184	2015	type "'a::size ==> bool"
haftmann@25184	2016
wenzelm@24800	2017	* Internal reorganisation of `size' of datatypes: size theorems
wenzelm@24800	2018	"foo.size" are no longer subsumed by "foo.simps" (but are still
wenzelm@24800	2019	simplification rules by default!); theorems "prod.size" now named
haftmann@25184	2020	"*.size".
haftmann@25184	2021
haftmann@25184	2022	* Class "div" now inherits from class "times" rather than "type".
haftmann@25184	2023	INCOMPATIBILITY.
wenzelm@24800	2024
wenzelm@24800	2025	* HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
wenzelm@24800	2026	Linorder etc. have disappeared; operations defined in terms of
wenzelm@24800	2027	fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
wenzelm@24800	2028
wenzelm@25129	2029	* HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
wenzelm@25129	2030
wenzelm@24800	2031	* HOL-Word: New extensive library and type for generic, fixed size
wenzelm@24800	2032	machine words, with arithemtic, bit-wise, shifting and rotating
wenzelm@24800	2033	operations, reflection into int, nat, and bool lists, automation for
wenzelm@24800	2034	linear arithmetic (by automatic reflection into nat or int), including
wenzelm@24800	2035	lemmas on overflow and monotonicity. Instantiated to all appropriate
wenzelm@24800	2036	arithmetic type classes, supporting automatic simplification of
wenzelm@24800	2037	numerals on all operations.
kleing@24333	2038
kleing@24333	2039	* Library/Boolean_Algebra: locales for abstract boolean algebras.
kleing@24333	2040
kleing@24333	2041	* Library/Numeral_Type: numbers as types, e.g. TYPE(32).
kleing@24333	2042
haftmann@23850	2043	* Code generator library theories:
haftmann@24993	2044	- Code_Integer represents HOL integers by big integer literals in target
haftmann@23850	2045	languages.
haftmann@24993	2046	- Code_Char represents HOL characters by character literals in target
haftmann@23850	2047	languages.
haftmann@24993	2048	- Code_Char_chr like Code_Char, but also offers treatment of character
haftmann@24993	2049	codes; includes Code_Integer.
wenzelm@24800	2050	- Executable_Set allows to generate code for finite sets using lists.
wenzelm@24800	2051	- Executable_Rat implements rational numbers as triples (sign, enumerator,
haftmann@23850	2052	denominator).
wenzelm@24800	2053	- Executable_Real implements a subset of real numbers, namly those
haftmann@23850	2054	representable by rational numbers.
wenzelm@24800	2055	- Efficient_Nat implements natural numbers by integers, which in general will
haftmann@23850	2056	result in higher efficency; pattern matching with 0/Suc is eliminated;
haftmann@24993	2057	includes Code_Integer.
haftmann@24993	2058	- Code_Index provides an additional datatype index which is mapped to
haftmann@24993	2059	target-language built-in integers.
haftmann@26355	2060	- Code_Message provides an additional datatype message_string which is isomorphic to
haftmann@24993	2061	strings; messages are mapped to target-language strings.
haftmann@23850	2062
berghofe@23783	2063	* New package for inductive predicates
berghofe@23783	2064
berghofe@23783	2065	An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
berghofe@23783	2066
berghofe@23783	2067	inductive
berghofe@23783	2068	p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783	2069	for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783	2070	where
berghofe@23783	2071	rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783	2072	\| ...
berghofe@23783	2073
wenzelm@24800	2074	with full support for type-inference, rather than
berghofe@23783	2075
berghofe@23783	2076	consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783	2077
berghofe@23783	2078	abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783	2079	where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783	2080
berghofe@23783	2081	inductive "s z_1 ... z_m"
berghofe@23783	2082	intros
berghofe@23783	2083	rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783	2084	...
berghofe@23783	2085
berghofe@23783	2086	For backward compatibility, there is a wrapper allowing inductive
berghofe@23783	2087	sets to be defined with the new package via
berghofe@23783	2088
berghofe@23783	2089	inductive_set
berghofe@23783	2090	s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783	2091	for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783	2092	where
berghofe@23783	2093	rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
berghofe@23783	2094	\| ...
berghofe@23783	2095
berghofe@23783	2096	or
berghofe@23783	2097
berghofe@23783	2098	inductive_set
berghofe@23783	2099	s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
berghofe@23783	2100	and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
berghofe@23783	2101	for z_1 :: U_1 and ... and z_n :: U_m
berghofe@23783	2102	where
berghofe@23783	2103	"p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
berghofe@23783	2104	\| rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
berghofe@23783	2105	\| ...
berghofe@23783	2106
berghofe@23783	2107	if the additional syntax "p ..." is required.
berghofe@23783	2108
wenzelm@25177	2109	Numerous examples can be found in the subdirectories src/HOL/Auth,
wenzelm@25177	2110	src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
berghofe@23783	2111
berghofe@23783	2112	INCOMPATIBILITIES:
berghofe@23783	2113
berghofe@23783	2114	- Since declaration and definition of inductive sets or predicates
wenzelm@24800	2115	is no longer separated, abbreviations involving the newly
wenzelm@24800	2116	introduced sets or predicates must be specified together with the
wenzelm@24800	2117	introduction rules after the 'where' keyword (see above), rather
wenzelm@24800	2118	than before the actual inductive definition.
wenzelm@24800	2119
wenzelm@24800	2120	- The variables in induction and elimination rules are now
wenzelm@24800	2121	quantified in the order of their occurrence in the introduction
wenzelm@24800	2122	rules, rather than in alphabetical order. Since this may break
wenzelm@24800	2123	some proofs, these proofs either have to be repaired, e.g. by
wenzelm@24800	2124	reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
wenzelm@24800	2125	statements of the form
berghofe@23783	2126
berghofe@23783	2127	case (rule_i a_i_1 ... a_i_{k_i})
berghofe@23783	2128
berghofe@23783	2129	or the old order of quantification has to be restored by explicitly adding
berghofe@23783	2130	meta-level quantifiers in the introduction rules, i.e.
berghofe@23783	2131
berghofe@23783	2132	\| rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
berghofe@23783	2133
berghofe@23783	2134	- The format of the elimination rules is now
berghofe@23783	2135
berghofe@23783	2136	p z_1 ... z_m x_1 ... x_n ==>
berghofe@23783	2137	(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
berghofe@23783	2138	==> ... ==> P
berghofe@23783	2139
berghofe@23783	2140	for predicates and
berghofe@23783	2141
berghofe@23783	2142	(x_1, ..., x_n) : s z_1 ... z_m ==>
berghofe@23783	2143	(!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
berghofe@23783	2144	==> ... ==> P
berghofe@23783	2145
berghofe@23783	2146	for sets rather than
berghofe@23783	2147
berghofe@23783	2148	x : s z_1 ... z_m ==>
berghofe@23783	2149	(!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
berghofe@23783	2150	==> ... ==> P
berghofe@23783	2151
wenzelm@24800	2152	This may require terms in goals to be expanded to n-tuples
wenzelm@24800	2153	(e.g. using case_tac or simplification with the split_paired_all
wenzelm@24800	2154	rule) before the above elimination rule is applicable.
wenzelm@24800	2155
wenzelm@24800	2156	- The elimination or case analysis rules for (mutually) inductive
wenzelm@24800	2157	sets or predicates are now called "p_1.cases" ... "p_k.cases". The
wenzelm@24800	2158	list of rules "p_1_..._p_k.elims" is no longer available.
berghofe@23783	2159
krauss@25198	2160	* New package "function"/"fun" for general recursive functions,
krauss@25198	2161	supporting mutual and nested recursion, definitions in local contexts,
krauss@25198	2162	more general pattern matching and partiality. See HOL/ex/Fundefs.thy
krauss@25198	2163	for small examples, and the separate tutorial on the function
krauss@25198	2164	package. The old recdef "package" is still available as before, but
krauss@25198	2165	users are encouraged to use the new package.
krauss@25198	2166
krauss@25198	2167	* Method "lexicographic_order" automatically synthesizes termination
krauss@25198	2168	relations as lexicographic combinations of size measures.
krauss@25198	2169
wenzelm@24800	2170	* Case-expressions allow arbitrary constructor-patterns (including
wenzelm@24800	2171	"_") and take their order into account, like in functional
wenzelm@24800	2172	programming. Internally, this is translated into nested
wenzelm@24800	2173	case-expressions; missing cases are added and mapped to the predefined
wenzelm@24800	2174	constant "undefined". In complicated cases printing may no longer show
wenzelm@24800	2175	the original input but the internal form. Lambda-abstractions allow
wenzelm@24800	2176	the same form of pattern matching: "% pat1 => e1 \| ..." is an
wenzelm@24800	2177	abbreviation for "%x. case x of pat1 => e1 \| ..." where x is a new
wenzelm@24800	2178	variable.
nipkow@23564	2179
huffman@23468	2180	* IntDef: The constant "int :: nat => int" has been removed; now "int"
wenzelm@24800	2181	is an abbreviation for "of_nat :: nat => int". The simplification
wenzelm@24800	2182	rules for "of_nat" have been changed to work like "int" did
wenzelm@24800	2183	previously. Potential INCOMPATIBILITY:
huffman@23468	2184	- "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
huffman@23468	2185	- of_nat_diff and of_nat_mult are no longer default simp rules
huffman@23377	2186
chaieb@23295	2187	* Method "algebra" solves polynomial equations over (semi)rings using
wenzelm@24800	2188	Groebner bases. The (semi)ring structure is defined by locales and the
wenzelm@24800	2189	tool setup depends on that generic context. Installing the method for
wenzelm@24800	2190	a specific type involves instantiating the locale and possibly adding
wenzelm@24800	2191	declarations for computation on the coefficients. The method is
wenzelm@24800	2192	already instantiated for natural numbers and for the axiomatic class
wenzelm@24800	2193	of idoms with numerals. See also the paper by Chaieb and Wenzel at
wenzelm@24800	2194	CALCULEMUS 2007 for the general principles underlying this
wenzelm@24800	2195	architecture of context-aware proof-tools.
wenzelm@24800	2196
wenzelm@25033	2197	* Method "ferrack" implements quantifier elimination over
wenzelm@25033	2198	special-purpose dense linear orders using locales (analogous to
wenzelm@25033	2199	"algebra"). The method is already installed for class
wenzelm@25033	2200	{ordered_field,recpower,number_ring} which subsumes real, hyperreal,
wenzelm@25033	2201	rat, etc.
wenzelm@25033	2202
wenzelm@24800	2203	* Former constant "List.op @" now named "List.append". Use ML
wenzelm@24800	2204	antiquotations @{const_name List.append} or @{term " ... @ ... "} to
wenzelm@24800	2205	circumvent possible incompatibilities when working on ML level.
wenzelm@24800	2206
haftmann@24996	2207	* primrec: missing cases mapped to "undefined" instead of "arbitrary".
haftmann@22845	2208
wenzelm@24800	2209	* New function listsum :: 'a list => 'a for arbitrary monoids.
wenzelm@24800	2210	Special syntax: "SUM x <- xs. f x" (and latex variants)
wenzelm@24800	2211
wenzelm@24800	2212	* New syntax for Haskell-like list comprehension (input only), eg.
wenzelm@25177	2213	[(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
wenzelm@24800	2214
wenzelm@24800	2215	* The special syntax for function "filter" has changed from [x :
wenzelm@24800	2216	xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
wenzelm@24800	2217	comprehension syntax, and for uniformity. INCOMPATIBILITY.
wenzelm@24800	2218
wenzelm@24800	2219	* [a..b] is now defined for arbitrary linear orders. It used to be
wenzelm@24800	2220	defined on nat only, as an abbreviation for [a..<Suc b]
wenzelm@24800	2221	INCOMPATIBILITY.
wenzelm@24800	2222
wenzelm@24800	2223	* Renamed lemma "set_take_whileD" to "set_takeWhileD".
wenzelm@24800	2224
wenzelm@25177	2225	* New functions "sorted" and "sort" in src/HOL/List.thy.
wenzelm@24800	2226
wenzelm@24800	2227	* New lemma collection field_simps (an extension of ring_simps) for
wenzelm@24800	2228	manipulating (in)equations involving division. Multiplies with all
wenzelm@24800	2229	denominators that can be proved to be non-zero (in equations) or
wenzelm@24800	2230	positive/negative (in inequations).
nipkow@23480	2231
nipkow@23480	2232	* Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
wenzelm@24800	2233	have been improved and renamed to ring_simps, group_simps and
wenzelm@24800	2234	ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
wenzelm@24800	2235	because they were subsumed by lemmas xyz. INCOMPATIBILITY.
wenzelm@24800	2236
wenzelm@25177	2237	* Theory Library/Commutative_Ring: switched from recdef to function
wenzelm@24800	2238	package; constants add, mul, pow now curried. Infix syntax for
wenzelm@24800	2239	algebraic operations.
haftmann@22735	2240
wenzelm@24800	2241	* Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
haftmann@22218	2242	INCOMPATIBILITY.
haftmann@22218	2243
wenzelm@24800	2244	* Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
haftmann@22218	2245	INCOMPATIBILITY.
haftmann@22218	2246
wenzelm@22126	2247	* HOL/records: generalised field-update to take a function on the
wenzelm@22126	2248	field rather than the new value: r(\|A := x\|) is translated to A_update
wenzelm@22126	2249	(K x) r The K-combinator that is internally used is called K_record.
schirmer@21226	2250	INCOMPATIBILITY: Usage of the plain update functions has to be
schirmer@21226	2251	adapted.
schirmer@21226	2252
wenzelm@24800	2253	* Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
wenzelm@24800	2254	* x = 0, which are required for a semiring. Richer structures do not
wenzelm@24800	2255	inherit from semiring_0 anymore, because this property is a theorem
wenzelm@24800	2256	there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
wenzelm@24800	2257	there is more to prove, but this is mostly trivial.
wenzelm@24800	2258
wenzelm@24800	2259	* Class "recpower" is generalized to arbitrary monoids, not just
wenzelm@24800	2260	commutative semirings. INCOMPATIBILITY: may need to incorporate
haftmann@25163	2261	commutativity or semiring properties additionally.
haftmann@21215	2262
haftmann@21099	2263	* Constant "List.list_all2" in List.thy now uses authentic syntax.
wenzelm@24800	2264	INCOMPATIBILITY: translations containing list_all2 may go wrong,
wenzelm@24800	2265	better use 'abbreviation'.
wenzelm@24800	2266
wenzelm@24800	2267	* Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
wenzelm@24800	2268
wenzelm@22126	2269	* Numeral syntax: type 'bin' which was a mere type copy of 'int' has
wenzelm@24800	2270	been abandoned in favour of plain 'int'. INCOMPATIBILITY --
wenzelm@22126	2271	significant changes for setting up numeral syntax for types:
wenzelm@24800	2272	- New constants Numeral.pred and Numeral.succ instead
haftmann@20485	2273	of former Numeral.bin_pred and Numeral.bin_succ.
haftmann@20485	2274	- Use integer operations instead of bin_add, bin_mult and so on.
haftmann@20485	2275	- Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
haftmann@20485	2276	- ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
haftmann@20485	2277
wenzelm@25177	2278	See src/HOL/Integ/IntArith.thy for an example setup.
wenzelm@25177	2279
wenzelm@25177	2280	* Command 'normal_form' computes the normal form of a term that may
wenzelm@25177	2281	contain free variables. For example ``normal_form "rev [a, b, c]"''
wenzelm@25177	2282	produces ``[b, c, a]'' (without proof). This command is suitable for
wenzelm@25177	2283	heavy-duty computations because the functions are compiled to ML
wenzelm@25177	2284	first. Correspondingly, a method "normalization" is provided. See
wenzelm@25177	2285	further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
nipkow@19895	2286
wenzelm@17996	2287	* Alternative iff syntax "A <-> B" for equality on bool (with priority
wenzelm@17996	2288	25 like -->); output depends on the "iff" print_mode, the default is
wenzelm@17996	2289	"A = B" (with priority 50).
wenzelm@17996	2290
wenzelm@21265	2291	* Relations less (<) and less_eq (<=) are also available on type bool.
wenzelm@21265	2292	Modified syntax to disallow nesting without explicit parentheses,
wenzelm@24800	2293	e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
wenzelm@24800	2294	INCOMPATIBILITY.
wenzelm@21265	2295
nipkow@18674	2296	* "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
nipkow@18674	2297
krauss@20716	2298	* Relation composition operator "op O" now has precedence 75 and binds
krauss@20716	2299	stronger than union and intersection. INCOMPATIBILITY.
krauss@20716	2300
wenzelm@22126	2301	* The old set interval syntax "{m..n(}" (and relatives) has been
wenzelm@22126	2302	removed. Use "{m..<n}" (and relatives) instead.
nipkow@19377	2303
wenzelm@17865	2304	* In the context of the assumption "~(s = t)" the Simplifier rewrites
wenzelm@24800	2305	"t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
wenzelm@24800	2306	``declare [[simproc del: neq]]''.
wenzelm@24800	2307
wenzelm@24800	2308	* Simplifier: "m dvd n" where m and n are numbers is evaluated to
wenzelm@24800	2309	True/False.
wenzelm@24800	2310
wenzelm@24800	2311	* Theorem Cons_eq_map_conv no longer declared as "simp".
nipkow@19211	2312
ballarin@19279	2313	* Theorem setsum_mult renamed to setsum_right_distrib.
ballarin@19279	2314
nipkow@19211	2315	* Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
wenzelm@22126	2316	``rule'' method.
wenzelm@22126	2317
wenzelm@24800	2318	* Reimplemented methods "sat" and "satx", with several improvements:
wenzelm@24800	2319	goals no longer need to be stated as "<prems> ==> False", equivalences
wenzelm@24800	2320	(i.e. "=" on type bool) are handled, variable names of the form
wenzelm@24800	2321	"lit_<n>" are no longer reserved, significant speedup.
wenzelm@24800	2322
wenzelm@24800	2323	* Methods "sat" and "satx" can now replay MiniSat proof traces.
wenzelm@22126	2324	zChaff is still supported as well.
wenzelm@22126	2325
wenzelm@22126	2326	* 'inductive' and 'datatype': provide projections of mutual rules,
wenzelm@22126	2327	bundled as foo_bar.inducts;
wenzelm@22126	2328
wenzelm@22126	2329	* Library: moved theories Parity, GCD, Binomial, Infinite_Set to
wenzelm@22126	2330	Library.
wenzelm@21256	2331
wenzelm@21256	2332	* Library: moved theory Accessible_Part to main HOL.
wenzelm@19572	2333
wenzelm@18446	2334	* Library: added theory Coinductive_List of potentially infinite lists
wenzelm@18446	2335	as greatest fixed-point.
wenzelm@18399	2336
wenzelm@19254	2337	* Library: added theory AssocList which implements (finite) maps as
schirmer@19252	2338	association lists.
webertj@17809	2339
wenzelm@24800	2340	* Method "evaluation" solves goals (i.e. a boolean expression)
wenzelm@24800	2341	efficiently by compiling it to ML. The goal is "proved" (via an
wenzelm@24800	2342	oracle) if it evaluates to True.
wenzelm@20807	2343
wenzelm@20807	2344	* Linear arithmetic now splits certain operators (e.g. min, max, abs)
wenzelm@24800	2345	also when invoked by the simplifier. This results in the Simplifier
wenzelm@24800	2346	being more powerful on arithmetic goals. INCOMPATIBILITY.
wenzelm@24800	2347	Configuration option fast_arith_split_limit=0 recovers the old
wenzelm@24800	2348	behavior.
webertj@20217	2349
wenzelm@22126	2350	* Support for hex (0x20) and binary (0b1001) numerals.
wenzelm@19254	2351
wenzelm@20807	2352	* New method: reify eqs (t), where eqs are equations for an
wenzelm@20807	2353	interpretation I :: 'a list => 'b => 'c and t::'c is an optional
wenzelm@20807	2354	parameter, computes a term s::'b and a list xs::'a list and proves the
wenzelm@20807	2355	theorem I xs s = t. This is also known as reification or quoting. The
wenzelm@20807	2356	resulting theorem is applied to the subgoal to substitute t with I xs
wenzelm@20807	2357	s. If t is omitted, the subgoal itself is reified.
wenzelm@20807	2358
wenzelm@20807	2359	* New method: reflection corr_thm eqs (t). The parameters eqs and (t)
wenzelm@20807	2360	are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
wenzelm@20807	2361	where f is supposed to be a computable function (in the sense of code
wenzelm@20807	2362	generattion). The method uses reify to compute s and xs as above then
wenzelm@20807	2363	applies corr_thm and uses normalization by evaluation to "prove" f s =
wenzelm@20807	2364	r and finally gets the theorem t = r, which is again applied to the
wenzelm@25177	2365	subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
wenzelm@25177	2366
wenzelm@25177	2367	* Reflection: Automatic reification now handels binding, an example is
wenzelm@25177	2368	available in src/HOL/ex/ReflectionEx.thy
wenzelm@20807	2369
wenzelm@25397	2370	* HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
schirmer@25409	2371	command 'statespace' that is similar to 'record', but introduces an
wenzelm@25397	2372	abstract specification based on the locale infrastructure instead of
wenzelm@25397	2373	HOL types. This leads to extra flexibility in composing state spaces,
wenzelm@25397	2374	in particular multiple inheritance and renaming of components.
wenzelm@25397	2375
wenzelm@25397	2376
wenzelm@19653	2377	* HOL-Complex *
wenzelm@19653	2378
huffman@22971	2379	* Hyperreal: Functions root and sqrt are now defined on negative real
huffman@22971	2380	inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
huffman@22971	2381	Nonnegativity side conditions have been removed from many lemmas, so
huffman@22971	2382	that more subgoals may now be solved by simplification; potential
huffman@22971	2383	INCOMPATIBILITY.
huffman@22971	2384
wenzelm@24800	2385	* Real: new type classes formalize real normed vector spaces and
huffman@21791	2386	algebras, using new overloaded constants scaleR :: real => 'a => 'a
huffman@21791	2387	and norm :: 'a => real.
huffman@21791	2388
wenzelm@24800	2389	* Real: constant of_real :: real => 'a::real_algebra_1 injects from
wenzelm@24800	2390	reals into other types. The overloaded constant Reals :: 'a set is now
wenzelm@24800	2391	defined as range of_real; potential INCOMPATIBILITY.
wenzelm@24800	2392
wenzelm@24800	2393	* Real: proper support for ML code generation, including 'quickcheck'.
nipkow@23013	2394	Reals are implemented as arbitrary precision rationals.
nipkow@23013	2395
wenzelm@22126	2396	* Hyperreal: Several constants that previously worked only for the
wenzelm@22126	2397	reals have been generalized, so they now work over arbitrary vector
wenzelm@22126	2398	spaces. Type annotations may need to be added in some cases; potential
wenzelm@22126	2399	INCOMPATIBILITY.
huffman@21791	2400
huffman@22972	2401	Infinitesimal :: ('a::real_normed_vector) star set
huffman@22972	2402	HFinite :: ('a::real_normed_vector) star set
huffman@22972	2403	HInfinite :: ('a::real_normed_vector) star set
huffman@21791	2404	approx :: ('a::real_normed_vector) star => 'a star => bool
huffman@21791	2405	monad :: ('a::real_normed_vector) star => 'a star set
huffman@21791	2406	galaxy :: ('a::real_normed_vector) star => 'a star set
huffman@22972	2407	(NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
huffman@21791	2408	(NS)convergent :: (nat => 'a::real_normed_vector) => bool
huffman@21791	2409	(NS)Bseq :: (nat => 'a::real_normed_vector) => bool
huffman@21791	2410	(NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
huffman@21791	2411	(NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
huffman@21791	2412	is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
huffman@21791	2413	deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
huffman@22972	2414	sgn :: 'a::real_normed_vector => 'a
huffman@23116	2415	exp :: 'a::{recpower,real_normed_field,banach} => 'a
huffman@21791	2416
huffman@21791	2417	* Complex: Some complex-specific constants are now abbreviations for
wenzelm@22126	2418	overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
wenzelm@22126	2419	hnorm. Other constants have been entirely removed in favor of the
wenzelm@22126	2420	polymorphic versions (INCOMPATIBILITY):
huffman@21791	2421
huffman@21791	2422	approx <-- capprox
huffman@21791	2423	HFinite <-- CFinite
huffman@21791	2424	HInfinite <-- CInfinite
huffman@21791	2425	Infinitesimal <-- CInfinitesimal
huffman@21791	2426	monad <-- cmonad
huffman@21791	2427	galaxy <-- cgalaxy
huffman@21791	2428	(NS)LIM <-- (NS)CLIM, (NS)CRLIM
huffman@21791	2429	is(NS)Cont <-- is(NS)Contc, is(NS)contCR
huffman@21791	2430	(ns)deriv <-- (ns)cderiv
huffman@21791	2431
wenzelm@19653	2432
wenzelm@24801	2433	* HOL-Algebra *
wenzelm@24801	2434
wenzelm@24801	2435	* Formalisation of ideals and the quotient construction over rings.
wenzelm@24801	2436
wenzelm@24801	2437	* Order and lattice theory no longer based on records.
wenzelm@24801	2438	INCOMPATIBILITY.
wenzelm@24801	2439
wenzelm@24801	2440	* Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
wenzelm@24801	2441	greatest_closed. INCOMPATIBILITY.
wenzelm@24801	2442
wenzelm@24801	2443	* Method algebra is now set up via an attribute. For examples see
wenzelm@24801	2444	Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
wenzelm@24801	2445	of algebraic structures.
wenzelm@24801	2446
wenzelm@24801	2447	* Renamed theory CRing to Ring.
wenzelm@24801	2448
wenzelm@24801	2449
wenzelm@24801	2450	* HOL-Nominal *
wenzelm@24801	2451
wenzelm@25148	2452	* Substantial, yet incomplete support for nominal datatypes (binding
wenzelm@25177	2453	structures) based on HOL-Nominal logic. See src/HOL/Nominal and
wenzelm@25177	2454	src/HOL/Nominal/Examples. Prospective users should consult
wenzelm@25148	2455	http://isabelle.in.tum.de/nominal/
wenzelm@25148	2456
wenzelm@24801	2457
wenzelm@17878	2458	* ML *
wenzelm@17878	2459
wenzelm@24643	2460	* ML basics: just one true type int, which coincides with IntInf.int
wenzelm@24643	2461	(even on SML/NJ).
wenzelm@24643	2462
wenzelm@22138	2463	* ML within Isar: antiquotations allow to embed statically-checked
wenzelm@22138	2464	formal entities in the source, referring to the context available at
wenzelm@22138	2465	compile-time. For example:
wenzelm@22138	2466
wenzelm@25142	2467	ML {* @{sort "{zero,one}"} *}
wenzelm@22138	2468	ML {* @{typ "'a => 'b"} *}
wenzelm@22138	2469	ML {* @{term "%x. x"} *}
wenzelm@22138	2470	ML {* @{prop "x == y"} *}
wenzelm@22138	2471	ML {* @{ctyp "'a => 'b"} *}
wenzelm@22138	2472	ML {* @{cterm "%x. x"} *}
wenzelm@22138	2473	ML {* @{cprop "x == y"} *}
wenzelm@22138	2474	ML {* @{thm asm_rl} *}
wenzelm@22138	2475	ML {* @{thms asm_rl} *}
wenzelm@24692	2476	ML {* @{type_name c} *}
wenzelm@25142	2477	ML {* @{type_syntax c} *}
wenzelm@22376	2478	ML {* @{const_name c} *}
wenzelm@22376	2479	ML {* @{const_syntax c} *}
wenzelm@22138	2480	ML {* @{context} *}
wenzelm@22138	2481	ML {* @{theory} *}
wenzelm@22138	2482	ML {* @{theory Pure} *}
wenzelm@24692	2483	ML {* @{theory_ref} *}
wenzelm@24692	2484	ML {* @{theory_ref Pure} *}
wenzelm@22138	2485	ML {* @{simpset} *}
wenzelm@22138	2486	ML {* @{claset} *}
wenzelm@22138	2487	ML {* @{clasimpset} *}
wenzelm@22138	2488
wenzelm@22151	2489	The same works for sources being ``used'' within an Isar context.
wenzelm@22151	2490
wenzelm@22152	2491	* ML in Isar: improved error reporting; extra verbosity with
wenzelm@24706	2492	ML_Context.trace enabled.
wenzelm@22152	2493
wenzelm@19032	2494	* Pure/General/table.ML: the join operations now works via exceptions
wenzelm@24706	2495	DUP/SAME instead of type option. This is simpler in simple cases, and
wenzelm@19081	2496	admits slightly more efficient complex applications.
wenzelm@18446	2497
wenzelm@24800	2498	* Pure: 'advanced' translation functions (parse_translation etc.) now
wenzelm@24800	2499	use Context.generic instead of just theory.
wenzelm@24800	2500
wenzelm@18642	2501	* Pure: datatype Context.generic joins theory/Proof.context and
wenzelm@18644	2502	provides some facilities for code that works in either kind of
wenzelm@18642	2503	context, notably GenericDataFun for uniform theory and proof data.
wenzelm@18642	2504
wenzelm@18737	2505	* Pure: simplified internal attribute type, which is now always
wenzelm@24706	2506	Context.generic * thm -> Context.generic * thm. Global (theory) vs.
wenzelm@24706	2507	local (Proof.context) attributes have been discontinued, while
wenzelm@24706	2508	minimizing code duplication. Thm.rule_attribute and
wenzelm@24706	2509	Thm.declaration_attribute build canonical attributes; see also structure
wenzelm@24706	2510	Context for further operations on Context.generic, notably
wenzelm@24706	2511	GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
wenzelm@19006	2512	declarations and definitions.
wenzelm@19006	2513
wenzelm@24800	2514	* Context data interfaces (Theory/Proof/GenericDataFun): removed
wenzelm@24800	2515	name/print, uninitialized data defaults to ad-hoc copy of empty value,
wenzelm@24800	2516	init only required for impure data. INCOMPATIBILITY: empty really need
wenzelm@24800	2517	to be empty (no dependencies on theory content!)
wenzelm@24800	2518
wenzelm@19508	2519	* Pure/kernel: consts certification ignores sort constraints given in
wenzelm@24800	2520	signature declarations. (This information is not relevant to the
wenzelm@24800	2521	logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
wenzelm@24800	2522	potential INCOMPATIBILITY.
wenzelm@19508	2523
wenzelm@19508	2524	* Pure: axiomatic type classes are now purely definitional, with
wenzelm@19508	2525	explicit proofs of class axioms and super class relations performed
wenzelm@24706	2526	internally. See Pure/axclass.ML for the main internal interfaces --
wenzelm@19508	2527	notably AxClass.define_class supercedes AxClass.add_axclass, and
wenzelm@24706	2528	AxClass.axiomatize_class/classrel/arity supersede
wenzelm@19508	2529	Sign.add_classes/classrel/arities.
wenzelm@19508	2530
wenzelm@19006	2531	* Pure/Isar: Args/Attrib parsers operate on Context.generic --
wenzelm@19006	2532	global/local versions on theory vs. Proof.context have been
wenzelm@19006	2533	discontinued; Attrib.syntax and Method.syntax have been adapted
wenzelm@19006	2534	accordingly. INCOMPATIBILITY, need to adapt parser expressions for
wenzelm@19006	2535	attributes, methods, etc.
wenzelm@18642	2536
wenzelm@18446	2537	* Pure: several functions of signature "... -> theory -> theory * ..."
wenzelm@18446	2538	have been reoriented to "... -> theory -> ... * theory" in order to
wenzelm@18446	2539	allow natural usage in combination with the \|\|>, \|\|>>, \|-> and
wenzelm@18446	2540	fold_map combinators.
haftmann@18051	2541
wenzelm@21647	2542	* Pure: official theorem names (closed derivations) and additional
wenzelm@21647	2543	comments (tags) are now strictly separate. Name hints -- which are
wenzelm@21647	2544	maintained as tags -- may be attached any time without affecting the
wenzelm@21647	2545	derivation.
wenzelm@21647	2546
wenzelm@18020	2547	* Pure: primitive rule lift_rule now takes goal cterm instead of an
wenzelm@18145	2548	actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
wenzelm@18020	2549	achieve the old behaviour.
wenzelm@18020	2550
wenzelm@18020	2551	* Pure: the "Goal" constant is now called "prop", supporting a
wenzelm@18020	2552	slightly more general idea of ``protecting'' meta-level rule
wenzelm@18020	2553	statements.
wenzelm@18020	2554
wenzelm@20040	2555	* Pure: Logic.(un)varify only works in a global context, which is now
wenzelm@20040	2556	enforced instead of silently assumed. INCOMPATIBILITY, may use
wenzelm@20040	2557	Logic.legacy_(un)varify as temporary workaround.
wenzelm@20040	2558
wenzelm@20090	2559	* Pure: structure Name provides scalable operations for generating
wenzelm@20090	2560	internal variable names, notably Name.variants etc. This replaces
wenzelm@20090	2561	some popular functions from term.ML:
wenzelm@20090	2562
wenzelm@20090	2563	Term.variant -> Name.variant
wenzelm@24800	2564	Term.variantlist -> Name.variant_list
wenzelm@20090	2565	Term.invent_names -> Name.invent_list
wenzelm@20090	2566
wenzelm@20090	2567	Note that low-level renaming rarely occurs in new code -- operations
wenzelm@20090	2568	from structure Variable are used instead (see below).
wenzelm@20090	2569
wenzelm@20040	2570	* Pure: structure Variable provides fundamental operations for proper
wenzelm@20040	2571	treatment of fixed/schematic variables in a context. For example,
wenzelm@20040	2572	Variable.import introduces fixes for schematics of given facts and
wenzelm@20040	2573	Variable.export reverses the effect (up to renaming) -- this replaces
wenzelm@20040	2574	various freeze_thaw operations.
wenzelm@20040	2575
wenzelm@18567	2576	* Pure: structure Goal provides simple interfaces for
wenzelm@17981	2577	init/conclude/finish and tactical prove operations (replacing former
wenzelm@20040	2578	Tactic.prove). Goal.prove is the canonical way to prove results
wenzelm@20040	2579	within a given context; Goal.prove_global is a degraded version for
wenzelm@20040	2580	theory level goals, including a global Drule.standard. Note that
wenzelm@20040	2581	OldGoals.prove_goalw_cterm has long been obsolete, since it is
wenzelm@20040	2582	ill-behaved in a local proof context (e.g. with local fixes/assumes or
wenzelm@20040	2583	in a locale context).
wenzelm@17981	2584
wenzelm@24706	2585	* Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
wenzelm@24706	2586	and type checking (Syntax.check_term etc.), with common combinations
wenzelm@24706	2587	(Syntax.read_term etc.). These supersede former Sign.read_term etc.
wenzelm@24706	2588	which are considered legacy and await removal.
wenzelm@24706	2589
wenzelm@24920	2590	* Pure/Syntax: generic interfaces for type unchecking
wenzelm@24920	2591	(Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
wenzelm@24920	2592	with common combinations (Syntax.pretty_term, Syntax.string_of_term
wenzelm@24920	2593	etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
wenzelm@24924	2594	available for convenience, but refer to the very same operations using
wenzelm@24924	2595	a mere theory instead of a full context.
wenzelm@24920	2596
wenzelm@18815	2597	* Isar: simplified treatment of user-level errors, using exception
wenzelm@18687	2598	ERROR of string uniformly. Function error now merely raises ERROR,
wenzelm@18686	2599	without any side effect on output channels. The Isar toplevel takes
wenzelm@18686	2600	care of proper display of ERROR exceptions. ML code may use plain
wenzelm@18686	2601	handle/can/try; cat_error may be used to concatenate errors like this:
wenzelm@18686	2602
wenzelm@18686	2603	... handle ERROR msg => cat_error msg "..."
wenzelm@18686	2604
wenzelm@18686	2605	Toplevel ML code (run directly or through the Isar toplevel) may be
wenzelm@18687	2606	embedded into the Isar toplevel with exception display/debug like
wenzelm@18687	2607	this:
wenzelm@18686	2608
wenzelm@18686	2609	Isar.toplevel (fn () => ...)
wenzelm@18686	2610
wenzelm@18686	2611	INCOMPATIBILITY, removed special transform_error facilities, removed
wenzelm@18686	2612	obsolete variants of user-level exceptions (ERROR_MESSAGE,
wenzelm@18686	2613	Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
wenzelm@18686	2614	-- use plain ERROR instead.
wenzelm@18686	2615
wenzelm@18815	2616	* Isar: theory setup now has type (theory -> theory), instead of a
wenzelm@18722	2617	list. INCOMPATIBILITY, may use #> to compose setup functions.
wenzelm@18722	2618
wenzelm@24706	2619	* Isar: ML toplevel pretty printer for type Proof.context, subject to
wenzelm@24706	2620	ProofContext.debug/verbose flags.
wenzelm@18815	2621
wenzelm@18815	2622	* Isar: Toplevel.theory_to_proof admits transactions that modify the
wenzelm@18815	2623	theory before entering a proof state. Transactions now always see a
wenzelm@18815	2624	quasi-functional intermediate checkpoint, both in interactive and
wenzelm@18590	2625	batch mode.
wenzelm@18567	2626
wenzelm@24867	2627	* Isar: simplified interfaces for outer syntax. Renamed
wenzelm@24867	2628	OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
wenzelm@24867	2629	OuterSyntax.add_parsers -- this functionality is now included in

author	wenzelm
	Sat May 30 15:53:19 2009 +0200 (2009-05-30)
changeset 31306	a74ee84288a0
parent 31304	00a9c674cf40
child 31308	3fd52453ae81
permissions	-rw-r--r--