NOTES for version 1-0-2

This version of analyzer uses Prolog database to store the program and
the abstract semantics, and the new task table, the program
graph. These become implicit input to relevant predicates in the
analyser. 


NOTES for version 1-0-1.

Monomorphic type analysis and polymorphic type analysis have been
modified by changing representation of parameters in type
rules. Previously, a parameter Beta in a type rule is encoded by a
ground term para(beta,[]). Now it is represented by a Prolog variable
Beta. 

Instead of defining 

       type([],list(para(beta,[]))).
       type([H|L],list(para(beta,[]))) :- type(H,para(beta,[])),
                                          type(L,list(para(beta,[]))).
The user defines 

       type([],list(Beta)).
       type([H|L],list(Beta)) :- type(H,Beta),
                                 type(L,list(Beta)).
