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 (nk) and the superexponential classes DTIMEF (kn).
A hierarchy of imperative languages for the feasible classes DTIMEF(n(k)) and for the superexponential classes DTIMEF((k)n)
Cozza, Vittoria;
2007-01-01
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 (nk) and the superexponential classes DTIMEF (kn).
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
