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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Curien, PL. (1993). Sequential Algorithms. In: Categorical Combinators, Sequential Algorithms, and Functional Programming. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0317-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0317-9_2
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6704-1
Online ISBN: 978-1-4612-0317-9
eBook Packages: Springer Book Archive