Programming Language for Implementing Data Structures and Algorithms

Abstract

Existing programming languages used in Data Structures courses have drawbacks, as they were designed for general-purpose or professional use rather than for education. The goal of this thesis is to design a programming language to be used in a Data Structures course and in which data structures and algorithms can be implemented in a straightforward way. We identify the data structures and algorithms typically covered in a Data Structures course and derive the language constructs. The language design is guided by a set of principles, including the domain-specific principle of enabling straightforward implementations of data structures and algorithms, as well as principles of educational programming language design. We also provide an implementation of the front end of our language. Our analysis with respect to the design principles indicates that the goal is achieved to a large extent.