Simple typed functional programming languages

The paper presents a way of constructing simple functional programming languages that fit to define classes of recursive functions with bounded computational complexity. All processed data in the language are restricted with types, that also can be constructed in the language. The languages can be used both to concern complexity algorithms classes and to be expanded for practical programming use.