Functional Programming.
show that there exists veri able byteode that annot be statially typed. Further, we show that, without transforming the program, the stati typing problem is NP-hard. In order to get a pratial approah we have developed an algorithm that works eÆiently for the usual ases and then applies eÆient