\({\mathcal M}^\omega\) considered as a programming language

DOI10.1016/S0168-0072(99)80002-5zbMath0932.03030MaRDI QIDQ1304541

Karl-Heinz Niggl

Publication date: 13 March 2000

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

operational semanticsdenotational semanticsstrong normalizationScott domains\(\lambda\)-calculus with sequential searchcomputing partial continuous functionalsprimitive recursive concept of parallelismsimply typed term system

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Logic programming (68N17) Recursive functions and relations, subrecursive hierarchies (03D20) Combinatory logic and lambda calculus (03B40)

Cites Work

• Subrecursive hierarchies on Scott domains
• A new recursion-theoretic characterization of the polytime functions
• LCF considered as a programming language
• A restricted computation model on Scott domains and its partial primitive recursive functionals
• Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• On theories with a combinatorial definition of 'equivalence'
• Intensional interpretations of functionals of finite type I
• Shorter Notes: A Note on the Failure of the Relativized Enumeration Theorem in Recursive Function Theory
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \({\mathcal M}^\omega\) considered as a programming language