A hierarchy of imperative languages for the feasible classes DTIMEF(n k ) and for the superexponential classes DTIMEF( k n)
Salvatore Caporaso, Emanuele Covino, Vittoria Cozza, Paolo Gissi, Giovanni Pani · 2007
Abstract: An imperative programming language is defined by closure of a free word-algebra of de/con-structors under two new operators (simultaneous safe recurrence and constructive diagonalization). By assigning ordinals to its programs a transfinite hierarchy of imperative languages is introduced which singles-out the feasible classes DTIMEF(n k) and the superexponential classes DTIMEF ( k n).