Abstract Data Type Analysis
I am interested in possibly performing a program analysis in Cat at compile time which would allow the implementation of an abstract data type (ADT) to be made by the compiler based on the operations chosen. For example if an instance of a collection ADT only uses “at” operations then it might be best implemented as an array, but if it uses “insert” operations then it might be a better candidate for a linked list.
It seems that letting the compiler choose the data type implementation at compile-time should be a pretty straightforward thing to do, but I’d first like to find out more about the success of others using similar approaches in a programming langauge.