Suciu, Dan2023-05-222023-05-221993-04-212007-07-13https://repository.upenn.edu/handle/20.500.14332/7172This report contains an overview of concrete data structures, sequential functions and sequential algorithms. We define the notions of concrete data structures and prove the representation theorem. Next, we present the notions of sequential functions and of sequential algorithms, and show how the latter can serve as a model for PCF. Finally, we present the language CDS0, designed as a syntax for concrete data structures and sequential algorithms.Report