The Garland Measure and Computational Complexity of Stack Programs

Abstract

A key problem in implicit computational complexity is to analyse the impact on program run times of nesting restricted control structures, such as for-do statements in imperative languages. This problem has two aspects. One is whether there are methods of extracting information from the syntax of such programs that give insight as to why some nesting of… (More)
DOI: 10.1016/S1571-0661(03)00003-3

Topics

  • Presentations referencing similar topics