Control structures in programs and computational complexity

Bibliographic Details
Title: Control structures in programs and computational complexity
Authors: Karl-Heinz Niggl
Source: Annals of Pure and Applied Logic. 133:247-273
Publisher Information: Elsevier BV, 2005.
Publication Year: 2005
Subject Terms: Implicit computational complexity, Higher-type recursion, Logic, Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.), Theory of programming languages, 0102 computer and information sciences, 01 natural sciences, Recursive functions and relations, subrecursive hierarchies, Imperative programming languages, Polynomial time, Complexity classes (hierarchies, relations among complexity classes, etc.), 0101 mathematics, Functional programming and lambda calculus, Grzegorczyk hierarchy, Lambda calculus
Description: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Document Type: Article
File Description: application/xml
Language: English
ISSN: 0168-0072
DOI: 10.1016/j.apal.2004.10.011
Access URL: https://zbmath.org/2160249
https://doi.org/10.1016/j.apal.2004.10.011
Rights: Elsevier Non-Commercial
Accession Number: edsair.doi.dedup.....614c86ecece6ea08b16eda773fb8b51a
Database: OpenAIRE
Description
ISSN:01680072
DOI:10.1016/j.apal.2004.10.011