Computability on dl-domains

DOI10.1006/INCO.1996.0002MaRDI QIDQ1908351zbMATH OpenOpenAlexFDO

Authors Andreas Gruchalski

Publication date 27 March 1996

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1996.0002

zbMATH Keywords

Berry-computable function

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Stability and computability in coherent domains
• Computability and totality in domains
• Real number computability and domain theory
• On stable domains
• scientific article; zbMATH DE number 1333613

Cited in

(4)

• Effective λ-models versus recursively enumerable λ-theories
• Construction of bi-Scott domains via ideal completion
• Stability and computability in coherent domains
• A stable programming language

This page was built for publication: Computability on dl-domains

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