Complexity theory and the operational structure of algebraic programming systems
DOI10.1007/BF00264163zbMath0489.68005MaRDI QIDQ1166916
Publication date: 1982
Published in: Acta Informatica (Search for Journal in Brave)
operational semantics; growth function; algebraic data type; term algebra; classification of programming systems; deterministic and nondeterministic control constructs and assignments; deterministic polynomial space bounded computations; nondeterministic polynomial space bounded computations; polynomial space enumerable data types; polynomial time bounded computation; polynomial time implementable data types; space and time resources; speed of growth of a data type
68Q25: Analysis of algorithms and problem complexity
68Q60: Specification and verification (program logics, model checking, etc.)
68P05: Data structures
68N01: General topics in the theory of software
Related Items