Stability and computability in coherent domains

DOI10.1016/0890-5401(90)90050-RzbMath0716.03042MaRDI QIDQ752707

Andrea Asperti

Publication date: 1990

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

zbMATH Keywords

computable functionscomputabilitystable functionsregular setsScott domainscoherent domainsGirard's coherent domainsrecursive enumerabilityrelativized computability

Mathematics Subject Classification ID

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

Related Items (2)

Coherence Spaces and Uniform Continuity ⋮ A stable programming language

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\mathbb{T}^\omega\) as a universal domain
• The theory of A-spaces
• Effectively given domains and lambda-calculus models

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