Remove TABs from examples

holfoot: REPLACE_ELEMENT -> LUPDATE

- adapt to recent renaming of REPLACE_ELEMENT to LUPDATE
- cleaning up generalHelpersScript

bug-fix in Sanity.sml another cleanup of quantHeuristicsLib

extended interface for quantifier heuristics

Now additional context as well as lemmata used for weakening / strengthening can be added to quantifier heuristic parameters.

adaptation of Holfoot to recent quantifier heuristics changes

cleanup of quantifier heuristics library

- more sensible names for guesses
- quantHeuristicsLib renamed to quantHeuristicsLibBase
- quantHeuristicsLibArgs renamed to quantHeuristicsLibParameters
- new shorter signature defined in quantHeuristicsLib
- adaptation of usage of quantHeuristicsLib

Fixed bug related to recent update of quantHeuristicsLib

Remove trailing whitespace in source files.

Fix a bug with respect to handling resources and conditional critical regions. Additional features like nodetermistic-choice, diverge and fail statements lifted to the user-level.

adaptation to changes in quantHeuristicsLib and permLib, rotate example added

support for global specification variables added to the parser

Examples from VSTTE-competition added. For example vscomp4 the parser was modified to support user defined predicates. As part of this change the syntax for trees changed.

rename most occurences of the prefix "FASL" into "ASL"

The prefix ASL (Abstract Separation Logic) was used to indicate definitions related to Abstract Separation Logic. To distinguish definitions that were not aware of the special failiure state (like asl_star) and ones that were (fasl_star) the additional prefix FASL (Abstract Separation Logic with Failiure State) was used as well. However, in the end, most definitions had the FASL prefix which does not make much sense. So, the prefix was replaced by ASL expect for cases where it is really important to distinguish between versions of a definition that are aware of the failiure state and ones that are not.

- fix of the recently broken quicksort-proof-script
- parser detects duplicate function and resource definitions now
- added debugging options to the command line tool

fix problems with mosml-version

extensions of the interface / easier addition of own tactics

- add multiple levels for expansions by holfoot-tactics, there were no_expands and do_expands, now there is full_expands as well. full_expands behaves like the old do_expands. do_expands does just fast expansions now
- fix a bug in the handling of assertions
- example array-inc added
- example quicksort-full-loopspec added

- assertions added
- loop unrolling added
- parser improved
- more examples (fact.dsf / append-unroll.dsf)

Main goal: improve usability of loop-specifications

Added an option to the command-line tool to run interactive proof scripts. The proof scripts have been updated to work with this new feature.

some optimisations on how to use Yices

added a binary-search example that shows the usefulness of Yices

some more work on arrays, especially modifying predicate simpsets

some optimisations for arrays / support for HolSmtLib added

some more support for arrays and a new q uicksort example using arrays

- adaption to the recent changes to listTheory / listSimps / rich_listTheory.
- some support for arrays added

Mayor refactoring of the Holfoot-Parser. The parser now uses the abstract syntax of HOL internally, which allows it to pass typing information between different parts of the input much more efficiently. As a result, most type-annotations could be removed from the input files. Moreover, it's now possible to write HOL terms as expressions inside a program now. These expressions have to return a value of type num and may take program variables as input. For example programs like "x = ``MAX y z``" can be written now, where "x", "y" and "z" are variables of the programming language. A similar extension has been added for conditions of loops and if-then-else statements. Finally, there is a predicate for separating mapping and predicate for queues now.

Added examples "append" and "reverse" as presented in Matthew Parkinsons lecture. The append example with data triggered a problem with the order of case-splitting that got fixed. Moreover, some minor tweaks to the proof of "insertionsort".

getting holfoot working with mosml

Fix compilation error under Moscow ML.

A lot of minor changes:
- introduction of gen_step_tac_opt, i.e. new interface to most holfoot tactics
- stopping simulation at specific points like loops, abstractions etc. added
- renaming of holfoot tactics
- better support for LAST and FIRST in specifications
- holfoot_interactive_verify_spec and similar functions improved
- holfoot_set_goal_preprocess and holfoot_set_goal_procedures added

improvements to the parser (better error reporting, more arithmetic operations) as well as
addition of loop- and block-specifications with corresponding examples

A lot of minor tweaks and additions. The main ones are:

- parser can handle trees better now
- better support for call-by-value arguments by the parser
- inference for splitting of non-empty trees added
- option to turn of expanding specifications added to main tactics
- NUM_TO_BOOL added
- slightly extended treeTheory

some minor fixes and extensions:
- parser allows call-by-value arguments in HOL-expressions now
- fixing pretty printing problem of call-by-reference arguments in abstracted function calls
- some minor changes in the order of inference applications

This is a major refactoring of the separation-logic example. The main changes are:

- the smallfoot case study has been renamed to "holfoot"
- a lot of the results of the smallfoot case study were generalised to the "variables as resource" level of abstraction
- this generalisation allows much shorter and easier proofs for the remaining results
- new methods for handling conditional execution, while-loops and procedure calls implemented
- generalisation of the concept of ghost variables (e.g. limitation on the possible types of ghost variables removed)
- addition of comments that keep track of the current position in the program, thereby giving
useful feedback to the user during interactive proofs or when a proof-attempt fails
- rewritten automation in order to
- make extensions of the programming and specification language easier
- keep track of location comments
- increase speed
- pretty printing uses styles (i.e. colors, bold fonts, etc.) now
- tree predicate of smallfoot generalised to allow data in trees as well as arbitrary n-ary trees
- holfoot command line tool added