Computability and totality in domains

DOI10.1017/S0960129502003638zbMATH Open1005.68040OpenAlexW2165266811MaRDI QIDQ3146243FDOQ3146243

Authors: Ulrich Berger 

Publication date: 31 October 2002

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129502003638

Recommendations

• Total sets and objects in domain theory
• scientific article; zbMATH DE number 1497739
• scientific article
• scientific article; zbMATH DE number 841092
• scientific article; zbMATH DE number 1333613

zbMATH Keywords

functional programming languagesScott-Eršov-domains

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Cited In (17)

• Nonflatness and totality
• Total sets and objects in domain theory
• Computable fields and the bounded Turing reduction
• Title not available (Why is that?)
• Representation theorems for transfinite computability and definability
• Computable one-to-one enumerations of effective domains
• On the ubiquity of certain total type structures
• Real number computability and domain theory
• Logical Approaches to Computational Barriers
• Computability on dl-domains
• On the ubiquity of certain total type structures (extended abstract)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stability and computability in coherent domains
• Towards a formal theory of computability
• Operational domain theory and topology of sequential programming languages

This page was built for publication: Computability and totality in domains

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