M^ considered as a programming language

DOI10.1016/S0168-0072(99)80002-5MaRDI QIDQ1304541zbMATH OpenFDO

Authors Karl-Heinz Niggl

Publication date 13 March 2000

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

Full work available at URL https://doi.org/10.1016/S0168-0072(99)80002-5

zbMATH Keywords

\(\lambda\)-calculus with sequential searchcomputing partial continuous functionalsdenotational semanticsoperational semanticsprimitive recursive concept of parallelismScott domainssimply typed term systemstrong normalization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 873331
• Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms
• General recursive functions in a very simply interpretable typed -calculus

Cites work

• A new recursion-theoretic characterization of the polytime functions
• A restricted computation model on Scott domains and its partial primitive recursive functionals
• scientific article; zbMATH DE number 3664931 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 65741 (Why is no real title available?)
• scientific article; zbMATH DE number 806754 (Why is no real title available?)
• scientific article; zbMATH DE number 873331 (Why is no real title available?)
• scientific article; zbMATH DE number 1390026 (Why is no real title available?)
• Intensional interpretations of functionals of finite type I
• LCF considered as a programming language
• 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'
• Rekursionszahlen und die Grzegorczyk-Hierarchie
• Shorter Notes: A Note on the Failure of the Relativized Enumeration Theorem in Recursive Function Theory
• Subrecursive hierarchies on Scott domains
• Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms

Cited in

(2)

• Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms
• The computational power of \({\mathcal M}^\omega\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304541)