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

CSC 151 - Basic types

eikmeier.sites.grinnell.edu · 989 words · saved by 1 readers

In the reading, we introduced a score of new functions for processing the basic types of Scheme. Think of them as an essential vocabulary for expressing basic computation in Scheme, similar to the new vocabulary you might encounter when learning a foreign language. However, unlike a foreign language, there isn’t an expectation that you get a deck of flash cards and memorize these function names. Instead, the expectation is that you will eventually memorize these functions by consistently building programs that use these functions, i.e., practice. To this end, we’ll try to provide concise references to the functions that we introduce in the reading to aid you in your task. Feel free to note the location of these sections and use them to quickly look up the appropriate functions when needed. (Also feel free to write them down on flash cards for easy reference.) Basic numeric operations: +, -, *, /, quotient, remainder, expt. Numeric conversion: floor, ceiling, round, truncate. Numeric ty

CSC 151 - Basic types Lab: Basic types Assigned Monday, 8 September 2025 Writeup due Wednesday, 10 September 2025 --> Summary We explore some of the basic types that many implementations of Scheme, including Scheme, support. These include a variety of numeric types, characters, and strings. Useful functions and notation In the reading, we introduced a score of new functions for processing the basic types of Scheme. Think of them as an essential vocabulary for expressing basic computation in Scheme, similar to the new vocabulary you might encounter when learning a foreign language. However, unl

Explore this link on the map →

related reading