Sequential Algorithms

Abstract

In this chapter we develop the theory of concrete data structures and sequential algorithms. As described in the introduction, the aim is to build ``sequential'' models of programming languages. In Section 1 we introduce the concrete data structures. In Section 2 we relate them through a representation theorem to order-theoretic structures: the concrete domains (these notions and results are due to Kahn and Plotkin [KaPlo]). In Section 3 we describe a simple notion of approximation between concrete data structures, which allows us to solve domain equations in a naive way. The notion is connected with that of injection-projection pairs, used classically.