Fri, 06 Jan 2012 17:44:42 +0100 |
wenzelm |
improved list comprehension syntax: more careful treatment of position constraints, which enables PIDE markup;
|
changeset |
files
|
Fri, 06 Jan 2012 16:45:19 +0100 |
wenzelm |
tuned -- more direct @{type_name set} (NB: binder_tr' retains the original non-syntax type for the bound/free variable);
|
changeset |
files
|
Fri, 06 Jan 2012 16:42:15 +0100 |
wenzelm |
recovered case syntax for of_int, also with source positions (appears to be unused nonetheless);
|
changeset |
files
|
Fri, 06 Jan 2012 15:19:17 +0100 |
wenzelm |
more careful treatment of outermost constraints, e.g. constructors without arguments (despite loss of positions for catch-all variables);
|
changeset |
files
|
Fri, 06 Jan 2012 11:27:49 +0100 |
wenzelm |
proper refs;
|
changeset |
files
|
Fri, 06 Jan 2012 10:19:49 +0100 |
haftmann |
incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r)
|
changeset |
files
|
Fri, 06 Jan 2012 10:19:49 +0100 |
haftmann |
incorporated canonical fold combinator on lists into body of List theory; refactored passages on List.fold(l/r); tuned quotes
|
changeset |
files
|
Fri, 06 Jan 2012 10:19:48 +0100 |
haftmann |
prefer listsum over foldl plus 0
|
changeset |
files
|
Fri, 06 Jan 2012 10:19:48 +0100 |
haftmann |
prefer concat over foldl append []
|
changeset |
files
|
Fri, 06 Jan 2012 10:19:47 +0100 |
haftmann |
tuned proofs
|
changeset |
files
|
Sun, 01 Jan 2012 15:44:15 +0100 |
haftmann |
interaction of set operations for execution and membership predicate
|
changeset |
files
|
Sun, 01 Jan 2012 11:28:45 +0100 |
haftmann |
cleanup of code declarations
|
changeset |
files
|
Thu, 05 Jan 2012 20:26:01 +0100 |
wenzelm |
discontinued Syntax.positions -- atomic parse trees are always annotated;
|
changeset |
files
|
Thu, 05 Jan 2012 18:18:39 +0100 |
wenzelm |
improved case syntax: more careful treatment of position constraints, which enables PIDE markup;
|
changeset |
files
|