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.KeywordsRepresentation TheoremStable FunctionSequential AlgorithmSequential FunctionComplete IdealThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
