some economic applications of scott domains

The present paper is structured around two main constructions, fixed points of functors and fibrations and sections of functors. Fixed points of functors are utilized to resolve problems of infinite regress that have recently appeared in economics. Fibrations and sections are utilized to model solution concepts abstractly, so that we can solve equations whose arguments are solution concepts. Most of the objects (games, solution concepts) that we consider can be obtained as some kind of limit of their finite subobjects. Some of the constructions preserve computability. The paper relies heavily on recent work on the semantics of program- ming languages.scott domains,infinite regress,game theory

A Semantics-Based Approach to Design of Query Languages for Partial Information

Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In this paper a different point of view is advocated. We believe that the semantics of partiality must be clearly understood and it should give us new design principles for languages for databases with partial information. There are different sources of partial information, such as missing information and conflicts that occur when different databases are merged. In this paper, we develop a common semantic framework for them which can be applied in a context more general than the flat relational model. This ordered semantics, which is based on ideas used in the semantics of programming languages, cleanly intergrates all kinds of partial information and serves as a tool to establish connections between them. Analyzing properties of semantic domains of types suitable for representing partial information, we come up with operations that are naturally associated with those types, and we organize programming syntax around these operations. We show how the languages that we obtain can be used to ask typical queries about incomplete information in relational databases, and how they can express some previously proposed languages. Finally, we discuss a few related topics such as mixing traditional constraints with partial information and extending semantics and languages to accommodate bags and recursive types

Comparing categories of domains

Computer Science Departmen