TODO 1.58 KB
Newer Older
POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
1 2 3 4
------------------------------------------------------------------------------

TODO (REALLY):

POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
5 6
Careful:
  avoid reduce, which is not tail recursive
POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
7 8
  use iter in [ba] and [fa]
  should save a constant factor?
POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
9

POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
10 11 12
System F demo:
  add TyExists.
  Test?
POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
13 14
System F-type-term:
  deal with both kinds of variables
POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
15

POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
16
Implement fused copy/subst, fused avoid/subst?
POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
17 18
  Implement a kit that composes two kits, so as to easily implement fused operations.
  Composition of classes? Or composition of kit objects? ...
POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
19

POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
20 21 22 23 24 25
Suppose I want to annotate every abstraction with its fa.
Or, suppose I want to annotate every abstraction with the
  number of uses of the bound name.
Can I easily do it?
Need a map_reduce visitor?

POTTIER Francois's avatar
POTTIER Francois committed
26 27 28 29 30 31 32 33
Check that every module has an .mli file, except where that would be too heavy.

Operations on each kind of environment:
  Entering a binder (and testing for global uniqueness).

Add printers for Atom.Map
and possibly the various kinds of environments that we use.

POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
34
Document the precondition and postcondition of every function.
POTTIER Francois's avatar
POTTIER Francois committed
35 36

Deal with more complex forms of binding.
POTTIER Francois's avatar
TODO.  
POTTIER Francois committed
37 38 39
  How do we deal with forms where a name can have several binding occurrences?
  e.g., or-patterns, join-calculus
  let, let rec, multiple let, multiple let rec, telescopes
40
  What about the distinction between expression types and pattern types?
POTTIER Francois's avatar
POTTIER Francois committed
41 42 43 44 45 46 47 48 49 50 51

Try dealing with binding and hash-consing at the same time.

Try dealing with suspended substitutions.
  (As a distinct construct. Not necessarily at abstractions.)

Look at the visitors in Why3.

------------------------------------------------------------------------------

TODO (POSSIBLY):