Type substitution for object-oriented programming

Object-oriented programming in dependent type theory

We introduce basic concepts from object-oriented programming into dependent type theory based on the idea of modelling objects as interactive programs. We consider methods, interfaces, and the interaction between a fixed number of objects, including self-referential method calls. We introduce a monad like syntax for developing objects in dependent type theory.

Object-oriented Reactive Programming is Not Reactive Object-oriented Programming

According to chapter 3 of Abelson & Sussman [1], there are two fundamentally different ways to organise large systems: according to the objects that live in the system, or according to the streams of values that flow through the system. Even though the notions of “object” and “stream” have meanwhile taken many incarnations, the dichotomy still exists in modern programming languages. Marrying re...

On Type Systems for Object-Oriented Database Programming Languages

Simple Type-Theoretic Foundations for Object-Oriented Programming

We develop a formal, type-theoretic account of the basic mechanisms of object-oriented programming: encapsulation, message passing, subtyping, and inheritance. By modeling object encapsulation in terms of existential types instead of the recursive records used in other recent studies, we obtain a substantial simpliication both in the model of objects and in the underlying typed-calculus.

Logical Foundations for Declarative Object-oriented Programming Logical Foundations for Declarative Object-oriented Programming ?

We present a formalism for reasoning about declarative object-oriented programs. Classes are represented as rst-order theories that contain logic programs as methods. Inheritance, genericity and related concepts are represented by operations on such theories which preserve the consistency of these theories as well as the correctness of the programs speciied by their axioms. Our approach provide...