option_pred characterization

true vs. True in pattern matching

reduced theory dependencies

tuning

moved theorems closer to where they are used

tuning

renamed "Ordinals_and_Cardinals" to "Cardinals"

split basic BNFs into really basic ones and others, and added Andreas Lochbihler's "option" BNF

reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping

tuning

tuning annotations

tuned antiquotations

tuning

tuning

added optional qualifiers for constructors and destructors, similarly to the old package

adapted example

added attributes to theorems

merged

support for sort constraints in new (co)data commands

provide a programmatic interface for FP sugar

some GUI support for color options;

more precise sections;

provide color values via options;

prefer tuning parameters as public methods (again) -- to allow overriding in applications;

updated keywords;

merged

tuned;

more informative tooltip: default value;

more options;

allow defaults for one datatype to involve the constructor of another one in the mutually recursive case

added "defaults" option

removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)

spin off "bnf_def_tactics.ML"

move "bnf_util.ML" to "BNF_Util.thy"

renamed "BNF_Library" to "BNF_Util"

generate all sel theorems

allow default values for selectors in low-level "wrap_data" command

removed needless "infer_types" call

added no_dests option

tuning

finished splitting sum types for corecursors

split sum types in corecursor definition

first step towards splitting corecursor function arguments into (p, g, h) triples

reverted "id" change: The problem is rather that the "%c. f c" argument sometimes gets eta-reduced

replaced jedit_relative_font_size by jedit_font_scale;

need to provide label via some jEdit property;

some support to organize options in sections;

merged

generate "id" rather than (%v. v)

correctly generate sel_coiter and sel_corec theorems

generate "sel_coiters" and friends

sanity check

implemented and use "mk_sum_casesN_balanced"

fixed general case of "mk_sumEN_balanced"

debug

fixed base case of "mk_sumEN_balanced"

prevent inconsistent selector types

minor optimization

allow same selector name for several constructors

removed done TODO

avoid type inference + tuning

use balanced sums for constructors (to gracefully handle 100 constructors or more)

busted -- let's use more neutral names

replacing own dummy value by Haskell's Prelude.undefined

prefer global default font over IsabelleText of jEdit TextArea;

uniform operation on initial delay;

option jedit_load_delay; tuned;

dynamic evaluation of time (e.g. via options); proper setInitialDelay, not setDelay;

proper multi-line tooltip;

more detailed option tooltip; more formal option.load; properties change propagation to Session_Dockable;

more systematic JEdit_Options.make_component; separate module Isabelle_Logic;

manage Isabelle/jEdit options as Isabelle/Scala options (with persistent preferences);

formal markup for @{file} (for hyperlinks etc.) -- interpret path wrt. master directory as usual;

more explicit indication of legacy features;

more explicit indication of legacy features;

simplify "Process" example even further

stabilized generation of parameterized theorem

added snippets

simplify "Process" example further

simplify "Process" example

full name of a type as key in bnf table

fixed bug with one-value codatatype "codata 'a dead_foo = A"

tuning

fixed and reenabled "corecs" theorems

fixed and enabled generation of "coiters" theorems, including the recursive case

generate "fld_unf_corecs" as well

reactivated generation of "coiters" theorems

use map_id, not map_id', to allow better composition

open typedefs everywhere in the package

open typedef for datatypes

fixed and enabled iterator/recursor theorems

renamed for consistency

oops

tuning

for compatiblity with old datatype package: not only "recs" with "s", but also "iters" and their "fld_"/"unf_" variants

fixed bug with one-value types with phantom type arguments

imported patch debugging

repaired "nofail4" example

renamed xxxBNF to pre_xxx

fixed handling of map of "fun"

comment out code that's not ready

tuning

construct the right iterator theorem in the recursive case

some work on coiter tactic

more sugar on codatatypes

define corecursors

define coiterators

TODO

tuning

completed iter/rec proofs

TODOs

implemented "mk_iter_or_rec_tac"

generate iter/rec goals

repaired constant types

some work towards iterator and recursor properties

tuning

correctly curry recursor arguments

added high-level recursor, not yet curried

merged

tuned proofs;

postpone update of text overview panel after incoming session edits, to improve reactivity of editing massive theories like src/HOL/Multivariate_Analysis;

more explicit Delay operations;

tuned proofs;

clearer names for functions in Quickcheck's narrowing engine

merged

tuned latex

lattice instances for option type

combinator Option.these

adjusted examples

countable_datatype method: pre-instantiate induction rule to avoid failure with e.g. datatype a = A "b list" and b = B "a"

handle type constructors not known to be a BNF using the DEADID BNF

respect order of/additional type variables supplied by the user in fixed point constructions;

gracefully handle shadowing case (fourth step of sugar localization)

careful about constructor types w.r.t. fake context (third step of localization)

read the real types off the constant types, rather than using the fake parser types (second step of sugar localization)

tuning

use "add_type" rather than "add_types_global"

don't throw away the context when hacking the theory (first step to localize the sugar code)

tuning

introduced and used "mk_Freesss", and simplified "mk_Freess(')"

construct high-level iterator RHS

option for discarding build results, enabled in particular for Isabelle_makeall

by default, only generate one discriminator for a two-value datatype

eliminated potentially confusing terminology of Scala "layer";

merged

tuned proofs;

discontinued obsolete fork_mono to loosen some brakes -- NB: TTY interaction has Goal.future_proofs disabled due to missing Future.worker_task;

honor mixfix specifications

code indentation

print timing information

adapted example

check type variables on rhs

proper subsexp projection of Isabelle_Markup.Path, in correspondence to 5d0cd770828e;

added tooltip to reveal jEdit platform file name;

commented out slow examples again

fixed (n + 1)st bug in "mk_exhaust_tac" -- arose with uncurried constructors

fixed "mk_exhaust_tac" for the nth time

updated README

ported "Misc_Codata" to new syntax

ported "Misc_Data" to new syntax

error message only in case of an error

do not trivialize important internal theorem in quick_and_dirty mode

merged

made "mk_case_eq_tac" work in the case where the first constructor is an "alternate" constructor (in which case its discriminator paradoxically starts with a negation)

tuning (systematic 1-based indices)

reindented code

added TODO

tell "select_prem_tac" not to thin any further premisses -- the "rotate_tac" otherwise confuses it

fixed "mk_alternate_disc_def_tac" in the case where the constructors are swapped compared with the common Nil/Cons case

don't get confused by extraneous premisses

added a check

NEWS; CONTRIBUTORS

misc tuning;

no need to wait 3h on macbroy30 (unlike former macbroy6, cf. 6e5b994070c1);

more conservative rechecking of processed constraints in subtyping constraint simplification

added comment for Dmitriy

fixed bug in type instantiation of case theorem

use empty binding rather than "*" for default

tuned

fixed bugs in one-constructor case

smoothly handle one-constructor types

fixed some type issues in sugar "exhaust_tac"

optionally provide extra dead variables to the FP constructions

merged

added robustness

added build option -R; more precise build_doc, using build -R -b;

implemented "mk_case_tac" -- and got rid of "cheat_tac"

define "case" constant

renamed low-level (co)iterators and (co)recursors with "fld_"/"unf_" prefix

implemented "mk_half_distinct_tac"

implemented "mk_inject_tac"

implemented "mk_exhaust_tac"

more work on FP sugar

more work on sugar + simplify Trueprop + eq idiom everywhere

renamed "disc_exclus" theorem to "disc_exclude"

more work on FP sugar

smarter "*" syntax -- fallback on "_" if "*" is impossible

more work on FP sugar

renamed theorem

tuned TODO comment

allow pseudo-definition of is_Cons in terms of is_Nil (and similarly for other two-constructor datatypes)

removed oddities

allow "*" to indicate no discriminator

tuned TODOs

started work on sugared "(co)data" commands

export "wrap" function

eliminated obsolete "parallel_proofs = 0" restriction (cf. 0e5b859e1c91)

no more aliases for Local_Theory.note; use Thm.close_derivation in internal theorems;

enable parallel terminal proofs in interaction;

misc tuning;

merged

killed internal output

generate coinductive witnesses for codatatypes

generalized signature

added examples for testing of coinductive witnesses

continue with more robust dummy session after failed startup;

prefer old startup dialog scheme (cf. 514bb82514df);

more permissive handling of plugin startup failure;

bypass slow check for inlined files, where it is not really required;

more direct access to all-important chunks for text painting; clarified line_start offset: physical line start not start(i);

merged

added annotations after condition in if and while

merge, resolving trivial conflict;

forgot to add lemmas

hide newly introduced constant Sublist.sub to allow for name sub in TreeFsetI

reverted (accidentally commited) changes from changeset fd4aef9bc7a9

reverted (accidentally commited) changes from changeset fd4aef9bc7a9

added theory instantiating type class order for list prefixes

Main is implicitly imported via Sublist

added author

List is implicitly imported by Main

introduced "sub" as abbreviation for "emb (op =)"; Sublist_Order is now based on Sublist.sub; simplified and moved most lemmas on sub from Sublist_Order to Sublist; Sublist_Order merely contains ord and order instances for sub plus some lemmas on the strict part of the order

base Sublist_Order on Sublist (using a simplified form of embedding as sublist relation)

dropped ord and bot instance for list prefixes (use locale interpretation instead, which allows users to decide what order to use on lists)

more lemmas on suffixes and embedding

changed arguement order of suffixeq (to facilitate reading "suffixeq xs ys" as "xs is a (possibly empty) suffix of ys)

added embedding for lists (constant emb)

renamed (in Sublist): postfix ~> suffixeq, and dropped infix syntax >>=

renamed (in Sublist): prefix ~> prefixeq, strict_prefix ~> prefix

renamed theory List_Prefix into Sublist (since it is not only about prefixes)