Stability and computability in coherent domains

DOI10.1016/0890-5401(90)90050-RMaRDI QIDQ752707zbMATH OpenFDO

Authors Andrea Asperti

Publication date 1990

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

zbMATH Keywords

stable functionscomputable functionscomputabilityregular setsScott domainscoherent domainsGirard's coherent domainsrecursive enumerabilityrelativized computability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Semantics in the theory of computing (68Q55) Higher-type and set recursion theory (03D65)

Recommendations

• Computability on dl-domains
• Computability and totality in domains
• An algebraic approach to stable domains
• scientific article; zbMATH DE number 1296793
• Stable neighbourhoods

Cites work

• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3875232 (Why is no real title available?)
• scientific article; zbMATH DE number 4048997 (Why is no real title available?)
• scientific article; zbMATH DE number 3556029 (Why is no real title available?)
• scientific article; zbMATH DE number 3594646 (Why is no real title available?)
• scientific article; zbMATH DE number 1531363 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Effectively given domains and lambda-calculus models
• The theory of A-spaces
• \(\mathbb{T}^\omega\) as a universal domain

Cited in

(3)

• A stable programming language
• Coherence spaces and uniform continuity
• Computability on dl-domains

This page was built for publication: Stability and computability in coherent domains

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