flâneur — a map of the web's best reading

CSC 151 - Expressions and types

eikmeier.sites.grinnell.edu · 1,164 words · saved by 1 readers

From our exploration so far. we know that Scheme programs are composed primarily of expressions, program fragments that evaluate to values. What are the different kinds of values that expressions can evaluate to? In other words, what kinds of data can our Scheme programs manipulate? We’ve seen some examples already, e.g., Numbers: Strings: But are there others? What are the different categories of data we might operate over and how are they organized? In computer programming, we can categorize the wide-range of data into two sorts: For example, consider representing a student in a computer program. A student has many potential pieces of data associated with them, e.g., In this sense, students are examples of compound data. An individual student, from the perspective of a computer program, is made up of these parts. In contrast, consider just the student’s age. The student’s age compromises of a single number, usually just a natural number, zero or a positive integer (non-fractional) qu

CSC 151 - Expressions and types Expressions and types Due Monday, 8 September 2025 --> Summary We have learned that a Scheme program consists of a collection of expressions, program fragments that evaluate to values. In this reading, we focus on the different kinds of primitive values that we can manipulate in our Scheme programs. From our exploration so far. we know that Scheme programs are composed primarily of expressions , program fragments that evaluate to values. What are the different kinds of values that expressions can evaluate to? In other words, what kinds of data can our Scheme pro

Explore this link on the map →

related reading