author | Christian Urban <urbanc@in.tum.de> |
Fri, 17 Dec 2010 01:01:44 +0000 | |
changeset 2613 | 1803104d76c9 |
parent 2452 | 39f8d405d7a2 |
child 2719 | dd5b60bccfd4 |
permissions | -rw-r--r-- |
1555
73992021c8f0
Described automatically created funs.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1527
diff
changeset
|
1 |
|
1987
72bed4519c86
Some of the exceptions that the parser should check in TODO.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1808
diff
changeset
|
2 |
Parser should check that: |
2452 | 3 |
|
1987
72bed4519c86
Some of the exceptions that the parser should check in TODO.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1808
diff
changeset
|
4 |
- types of bindings match types of binding functions |
72bed4519c86
Some of the exceptions that the parser should check in TODO.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1808
diff
changeset
|
5 |
- fsets are not bound in lst bindings |
72bed4519c86
Some of the exceptions that the parser should check in TODO.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1808
diff
changeset
|
6 |
- bound arguments are not datatypes |
2045
6800fcaafa2a
Separate Term8, as it may work soon.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1987
diff
changeset
|
7 |
- binder is referred to by name and not by type |
1987
72bed4519c86
Some of the exceptions that the parser should check in TODO.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1808
diff
changeset
|
8 |
|
1501 | 9 |
Smaller things: |
10 |
||
1510
be911e869fde
Added fv,bn,distinct,perm to the simplifier.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1504
diff
changeset
|
11 |
- maybe <type>_perm whould be called permute_<type>.simps; |
1501 | 12 |
that would conform with the terminology in Nominal2 |
13 |
||
14 |
||
2452 | 15 |
Other: |
1808
d7a2c45b447a
added TODO item about parser creating syntax for the wrong type
Christian Urban <urbanc@in.tum.de>
parents:
1802
diff
changeset
|
16 |
|
1501 | 17 |
- nested recursion, like types "trm list" in a constructor |
18 |
||
1649 | 19 |
- define permute_bn automatically and prove properties of it |
20 |
||
21 |
- prove renaming-of-binders lemmas |
|
22 |
||
1501 | 23 |
- strong induction rules |
24 |
||
1503 | 25 |
- store information about defined nominal datatypes, so that |
26 |
it can be used to define new types that depend on these |
|
27 |