Paper Info
Title
Domain Algebras
Abstract
This paper proposes a way of relating domain-theoretic and algebraic interpretations of data types. It is different from Smyth, Plotkin, and Lehmann's T-algebra approach, and in particular the notion of homomorphism between higher-order algebras is not restricted in the same way, so that the usual initiality theorems of algebraic semantics, including one for inequational varieties, hold. Domain algebras are defined in terms of concepts from elementary category theory using Lambek's connection between cartesian closed categories and the typed -calculus. To this end axioms and inference rules for a theory of domain categories are given. Models of these are the standard categories of domains, such as Scott's information systems and Berry and Curien's sequential algorithms on concrete data structures. The set of axioms and inference rules are discussed and compared to the PP-logic of the LCF-system.
Year
DOI
Venue
1984
10.1007/3-540-13345-3_13
ICALP
Keywords
DocType
ISBN
Domain Algebras
Conference
3-540-13345-3
Citations 
PageRank 
References 
2
0.95
13
Authors
1
Name
Order
Citations
PageRank
Peter Dybjer154076.99