Domains in H

Theoretical Computer Science

Volumn 264, Issue 2, 2001, Pages 171-193

  Fiore, Marcelo P ^a   Rosolini, Giuseppe ^b  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; THEOREM PROVING;

SYNTHETIC DOMAIN THEORY;

SET THEORY;

EID: 0034885075     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00221-8     Document Type: Conference Paper

References (26)

1. Repleteness and the associated sheaf
2. Category Theory '90
3. Logique d'ordre supérieur dans les topos élémentaires
4. An enrichment theorem for an axiomatisation of categories of domains and continuous functions
5. An extension of models of axiomatic domain theory to models of synthetic domain theory
6. Two models of synthetic domain theory
7. Categories of continuous functors I
8. Extensional PERs
9. First steps in synthetic domain theory
10. The S-replete construction
11. A presentation of the initial lift-algebra
12. A uniform approach to domain theory in realizability models
13. Studying repleteness in the category of Cpos
14. Category theory and computer science
15. Categories and effective computations
16. An ExPER model for QUEST
17. The fixed point property in synthetic domain theory