Article contents
Computability and totality in domains
Published online by Cambridge University Press: 16 August 2002
Abstract
We survey the main results on computability and totality in Scott–Eršov-domains as well as their applications to the theory of functionals of higher types and the semantics of functional programming languages. A new density theorem is proved and applied to show the equivalence of the hereditarily computable total continuous functionals with the hereditarily effective operations over a large class of base types.
- Type
- Research Article
- Information
- Copyright
- © 2002 Cambridge University Press
- 5
- Cited by