Mathematical theory of domains
Mathematical theory of domains
A hierarchy of domains with totality, but without density
Computability, enumerability, unsolvability
Domains and lambda-calculi
Developing theories of types and computability via realizability
Developing theories of types and computability via realizability
Topological and limit-space subcategories of countably-based equilogical spaces
Mathematical Structures in Computer Science
Full abstraction, totality and PCF
Mathematical Structures in Computer Science
Hi-index | 0.00 |
We show that dependent sums and dependent products of continuous parametrizations on domains with dense, codense, and natural totalities agree with dependent sums and dependent products in equilogical spaces, and thus also in the realizability topos RT(Pω).