Fix nondeterminism in getM
Annotate and uncomment lens definitions that failed in test run
Add new test functions and adjust tests according to domains.

The new test functions correspond to `PutDet` and `PutStab`, two laws that are formulated on the `put` definition of a lens only. Additionally, adjust the original test functions to only consider valid domains, i.e. if a `put` or `get` functions is not defined for the generated values, we do not check the law, but generate new values instead.
Refactore test generation and add new test functions.

The refactorisation covers an additional config file that determines the verbosity level and which functions are included in an optional  main function. The new test functions for the `PutDet` and `PutStab` law are added and additionally, the whole module  is restructured and commented.
Update test environment
Update notes and roadmap
First draft for parsing with lenses
Add first draft for parser/printer pair with lenses
Add parser for expressions with right precedences (that does indeed terminate)
Add parser/printer pair for expressions with right precedences (that does indeed terminate)
Restructure and clean up code
Add comments for non-terminating put-definitions
Add module "RegExp.curry" for regular expression matching in strings based on lenses

Three kinds of lens defintions for regular expressions are definied:

`type LensReg   = RegExp -> Lens String String`

This lens definition replaces a substring in a given string for all matched index positions according to the given regular expression. The missing list type is compensated in sake of a nondeterministic result. The `get` direction is also nondeterministic and yields all matches according to the regular expression for a given string.

`type LensReg1  = RegExp -> Lens String (Int,String)`

This version replaces only valid matches for the given index position, i.e. fails if the index position does not match the regular expression.

`type LensReg1M = RegExp -> Lens (Maybe String) (Int,String)`
The third type of lens for regular expressions is neither nondeterministicly nor partially defined, it yields `Nothing` if the given index position and string do not match according to the regular expression.

In this first version, the type for regular expression is defined as
`type RegExp = String -> (Bool,String)`,
where `Bool` indicates if the string matches successfully and the second component is the matched substring.
Clean up examples
Add get/put functions to handle nondeterminstic lenses and formulate correspdoning lens laws that can be checked
Clean up code and add printer version with precendences (does not work sufficient yet) as well as parser version of Parser/Printer-Lens (which seems weird)
Add LaTeX files to .gitignore
Add proposal presentation
Add a new parser/printer with replacement strategy

In order not to ignore the first argument as in the first implementation of a printer/parser with lenses, the layout of given string is preserved in the put-direction.
Add function