The largest cartesian closed category of domains
- 31 December 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 27 (1-2) , 109-119
- https://doi.org/10.1016/0304-3975(83)90095-6
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Full abstraction for a simple parallel programming languagePublished by Springer Nature ,1979
- Effectively given domainsTheoretical Computer Science, 1977
- A Powerdomain ConstructionSIAM Journal on Computing, 1976
- Bases for Chain-complete PosetsIBM Journal of Research and Development, 1976