Stability and computability in coherent domains

DOI10.1016/0890-5401(90)90050-RzbMATH Open0716.03042MaRDI QIDQ752707FDOQ752707

Authors: Andrea Asperti 

Publication date: 1990

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• \(\mathbb{T}^\omega\) as a universal domain
• Title not available (Why is that?)
• Title not available (Why is that?)
• The theory of A-spaces
• Title not available (Why is that?)
• Effectively given domains and lambda-calculus models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

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

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)