Reading 17: Recursive Data Types

In this reading we’ll look at recursively-defined types, how to specify operations on such types, and how to implement them. Our main example will be immutable lists.

Reading 17: Recursive Data Types Reading 17: Recursive Data Types Software in 6.031 Safe from bugs Easy to understand Ready for change Correct today and correct in the unknown future. Communicating clearly with future programmers, including future you. Designed to accommodate change without rewriting. Objectives Understand recursive data types Read and write data type definitions Understand and implement functions over recursive data types Understand immutable lists and know the standard operations on immutable lists Know and follow a recipe for writing programs with ADTs Introduction In this

related reading

• Reading 11: Recursive Data Typesweb.mit.edu
• Reading 17: Recursive Data Typesweb.mit.edu
• CSC 151 - Recursion Over Listseikmeier.sites.grinnell.edu
• CSC 151 - Recursion over Numberseikmeier.sites.grinnell.edu
• CSC 151 - Higher-order design, recursive and othereikmeier.sites.grinnell.edu
• Reading 16: Mutual Exclusionweb.mit.edu
• Reading 19: Little Languagesweb.mit.edu
• Reading 13: Map, Filter, Reduceweb.mit.edu
• CSC 151 - Pattern matchingeikmeier.sites.grinnell.edu
• CSC 151 - Tail Recursioneikmeier.sites.grinnell.edu
• Reading 14: Recursionweb.mit.edu
• Reading 10: Abstract Data Typesweb.mit.edu