6.001 Structure and Interpretation of Computer Programs. Copyright o 2004 by Massachusetts Institute of Technology 6.001 Notes: Section 30.1 Slide 30l1 In this lecture, we are going to go back to several themes that 6.001: Structure and Interpretation of we have been exploring over the past few weeks, and stitch Computer Programs using the tools we have been building for dealing with stea.see them together into a single demonstration. We are going to see Today how quickly we can describe and control a complex system, by Building a new language using data and procedure abstractions abstractions 8n003 60015e Slide 30.1.2 Themes to be integrated The themes we are going to utilize include the following We are going to build on the idea of data abstraction, especially arate use of data structure from details of data the idea of separating the use of a data structure from the details Procedural abstraction of its implementation. We are going to see how that abstraction apture common patterns of behavior and treat as black barrier enables us to quickly describe complex structures box for generating new patterns Means of combination without getting lost in their details, and how to focus on the use Create complex combinations, then treat as primitives of such structures as entire units, while being assured that the interior details will be handled correctly Use modularity of components to create new language for particular problem domain We are going to also build on the idea of procedural abstraction d 8n/403 l especially the idea of capturing common patterns inside a black box, and using such abstractions to capture more complex And we are going to build on the idea of means of combination, that is, the idea that we can create simple methods for combining primitive objects into complex things, then treating the result as a primitive within a still more don plex thing. This will allow us to control complexity by utilizing a modular decomposition of the problem So our goal is to pull these pieces together to build a new language, one that is specifically designed for a particular problem domain6.001 Structure and Interpretation of Computer Programs. Copyright © 2004 by Massachusetts Institute of Technology. 6.001 Notes: Section 30.1 Slide 30.1.1 In this lecture, we are going to go back to several themes that we have been exploring over the past few weeks, and stitch them together into a single demonstration. We are going to see how quickly we can describe and control a complex system, by using the tools we have been building for dealing with abstractions. Slide 30.1.2 The themes we are going to utilize include the following. We are going to build on the idea of data abstraction, especially the idea of separating the use of a data structure from the details of its implementation. We are going to see how that abstraction barrier enables us to quickly describe complex structures without getting lost in their details, and how to focus on the use of such structures as entire units, while being assured that the interior details will be handled correctly. We are going to also build on the idea of procedural abstraction, especially the idea of capturing common patterns inside a black box, and using such abstractions to capture more complex patterns. And we are going to build on the idea of means of combination, that is, the idea that we can create simple methods for combining primitive objects into complex things, then treating the result as a primitive within a still more complex thing. This will allow us to control complexity by utilizing a modular decomposition of the problem domain. So our goal is to pull these pieces together to build a new language, one that is specifically designed for a particular problem domain