A typed functional programming language with static time complexity guarantees.

TiML is a Standard-ML-like language whose types contain time complexity annotations. Its type checker will guarantee that the time complexity of the program is bounded by these specifications. Using TiML, your program's time complexity will be explicit in its type, and you won't mistakenly call a library function with the wrong complexity.

Members