Skip to main content
Article thumbnail
Location of Repository

A Hierarchy of Imperative Languages for the Feasible Classes DTIMEF(n k) and for the Superexponential Classes DTIMEF ( k n)

By Salvatore Caporaso, Universit√† Di Bari, Paolo Gissi, Emanuele Covino and Giovanni Pani


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)

Topics: 1 Statement of the result
Year: 2014
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.