# Domain Theory for Modeling OOP: A Summary

@article{AbdelGawad2014DomainTF, title={Domain Theory for Modeling OOP: A Summary}, author={Moez A. AbdelGawad}, journal={ArXiv}, year={2014}, volume={abs/1406.7497} }

Domain theory is `a mathematical theory that serves as a foundation for the semantics of programming languages'. Domains form the basis of a theory of partial information, which extends the familiar notion of partial function to encompass a whole spectrum of "degrees of definedness", so as to model incremental higher-order computation (i.e., computing with infinite data values, such as functions defined over an infinite domain like the domain of integers, infinite trees, and such as objects of… Expand

#### Topics from this paper

#### 9 Citations

NOOP: A Domain-Theoretic Model of Nominally-Typed OOP

- Computer Science
- ArXiv
- 2018

The construction of NOOP is presented as the first domain-theoretic model of OOP that includes full class/type names information found in nominally-typed OOP, proving that type inheritance and subtyping are completely identified in these languages. Expand

A Comparison of NOOP to Structural Domain-Theoretic Models of OOP

- Computer Science
- 2016

This paper compares NOOP to the most widely known domain-theoretic models of OOP, namely, the models developed by Cardelli and Cook, which were structurally-typed models. Expand

A Comparison of NOOP to Structural Domain-Theoretic Models of Object-Oriented Programming

- Computer Science
- ArXiv
- 2016

This paper compares NOOP to the most widely known domain-theoretic models of OOP, namely, the models developed by Cardelli and Cook, which were structurally-typed models. Expand

2 9 M ar 2 01 6 A Comparison of NOOP to Structural Domain-Theoretic Models of Object-Oriented Programming

- 2016

Mainstream object-oriented programming (OOP) languages such as Java, C#, C++ and Scala are all almost entirely nominally-typed. NOOP is a recently developed domain-theoretic model of OOP that was… Expand

Novel Uses of Category Theory in Modeling OOP

- Computer Science
- 2017

Four new potential applications of category theory to OOP research are presented and the use of operads to model Java subtyping, Yoneda's lemma, representable functors and adjoint functors are used. Expand

Towards Understanding Generics in Mainstream OOP

- Computer Science
- 2016

This article reports on steps towards building a simple and accurate domain-theoretic model of generic nominally-typed OOP.

Towards Understanding Generics

- Computer Science
- ArXiv
- 2016

This article reports on steps towards building a simple and accurate domain-theoretic model of generic nominally-typed OOP.

A topology on lattice-ordered groups

- Physics
- 2018

We introduce the concept of the strong-positive cone in a lattice-ordered group (G,6, ·) and define the continuous latticeordered group. We also investigate the C-topology and bi-C-topology given on… Expand

Category Theory for Modeling OOP

- Computer Science, Mathematics
- ArXiv
- 2017

An outline and summary of four new applications of category theory to OOP research are presented.

#### References

SHOWING 1-10 OF 47 REFERENCES

A Domain-Theoretic Model Of Nominally-Typed Object-Oriented Programming

- Computer Science
- ISDT
- 2013

The construction of NOOP is summarized, in full agreement with intuitions of OO developers using these languages, and contrary to the belief that ''inheritance is not subtyping'', which came from assuming non-nominal structural models ofOO type systems. Expand

NOOP: A Nominal Mathematical Model of Object-Oriented Programming

- Computer Science
- 2013

The construction of NOOP is presented as the first domain-theoretic model of OOP to include nominal information found in nominally-typed mainstream OO software, proving that inheritance and subtyping are completely identified in these languages. Expand

Domain theory

- Computer Science
- LICS 1995
- 1995

bases were introduced in [Smy77] where they are called “R-structures”. Examples of abstract bases are concrete bases of continuous domains, of course, where the relation≺ is the restriction of the… Expand

Concrete Domains

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1993

This paper introduces the theory of a particular kind of computation domains called concrete domains, a satisfactory framework for the notions of coroutine computation and sequentiality of evaluation, and follows Scott's approach in general. Expand

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

- Computer Science
- 1981

Treats various kinds of languages, beginning with the pure-lambda-calculus and progressing through languages with states, commands, jumps, and assignments. Expand

Design Concepts in Programming Languages

- Computer Science
- 2008

This comprehensive text uses a simple and concise framework to teach key ideas in programming language design and implementation, based on a family of syntactically simple pedagogical languages that allow students to explore programming language concepts systematically. Expand

Lectures on a Mathematical Theory of Computation

- Computer Science
- 1982

These notes were originally written for lectures on the semantics of programming languages delivered at Oxford during Michaelmas Term 1980 to provide the foundations needed for the method of denotational semantics. Expand

Tω as a Universal Domain

- Mathematics
- 1978

Abstract In mathematical semantics, in the sense of Scott, the question arises of what domains of interpretation should be chosen. It has been felt by the author, and others, that lattices are the… Expand

Elements of Set Theory

In the words of GeorgC antor (1845-1918) ,t he creator of Set Theory and the modern theory of the Infinite, a set (or class) is " a collection into a whole, of definite, well-distinguished objects of… Expand