scientific article; zbMATH DE number 873331

zbMath0855.03023MaRDI QIDQ4876432

Karl-Heinz Niggl

Publication date: 5 May 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmcomputational complexityoperational semanticsparallelismfunctional programming languagecomplexity classesstructural complexitycomplete partial ordersScott domainspartial primitive recursive functionalsimply typed term systempartial continuous functionalsparallel typed while program-computable functionalsreduction relation between terms

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (2)

Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms ⋮ \({\mathcal M}^\omega\) considered as a programming language

This page was built for publication: