author | Cezary Kaliszyk <kaliszyk@in.tum.de> |
Thu, 18 Mar 2010 10:15:57 +0100 | |
changeset 1503 | 8639077e0f43 |
parent 1502 | cc0dcf248da3 |
child 1504 | f685be70a464 |
permissions | -rw-r--r-- |
1501 | 1 |
Smaller things: |
2 |
||
3 |
- case names for "weak" induction rules (names of the |
|
4 |
constructors); see page 61/62 and 170 in Tutorial |
|
5 |
||
6 |
- <type>_perm rules should be added to the simplifier; |
|
7 |
maybe <type>_perm whould be called permute_<type>.simps; |
|
8 |
that would conform with the terminology in Nominal2 |
|
9 |
||
10 |
- <type>_fv / <type>_bn / <type>_distinct should also be |
|
11 |
added to the simplifier |
|
12 |
||
13 |
||
14 |
Bigger things: |
|
15 |
||
16 |
- nested recursion, like types "trm list" in a constructor |
|
17 |
||
18 |
- strong induction rules |
|
19 |
||
1502
cc0dcf248da3
Which proofs need a 'sorry'.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1501
diff
changeset
|
20 |
- show support equations |
1501 | 21 |
|
1502
cc0dcf248da3
Which proofs need a 'sorry'.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1501
diff
changeset
|
22 |
- automate the proofs that are currently proved with sorry: |
cc0dcf248da3
Which proofs need a 'sorry'.
Cezary Kaliszyk <kaliszyk@in.tum.de>
parents:
1501
diff
changeset
|
23 |
alpha_equivp, fv_rsp, alpha_bn_rsp, alpha_bn_reflp |
1503 | 24 |
|
25 |
- store information about defined nominal datatypes, so that |
|
26 |
it can be used to define new types that depend on these |
|
27 |
||
28 |
- make 3 versions of Abs |
|
29 |
||
30 |
- make parser aware of recursive and of different versions of abs |