mb.dvi

N/A

6 Functions as Representation Generally, data structures are used to represent. An array could represent a geometric transformation; a tree could represent a hierarchy of command; a graph could represent a rail network. In Lisp we can sometimes use closures as a representation. Within a closure, variable bindings can store information, and can also play the role that pointers play in constructing complex data structures. By making a group of closures which share bindings, or can refer to one another, we can create hybrid objects which combine the advantages of data structures and programs.…

saved by

• 靜樺 施

related reading

• Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
• Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
• Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
• Closures - The Rust Programming Languagedoc.rust-lang.org
• Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
• Reading 19: Little Languagesweb.mit.edu
• Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
• Language, trees, and geometry in neural networkspair-code.github.io
• CSC 151 - Anonymous procedureseikmeier.sites.grinnell.edu
• Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
• interaction netswiki.xxiivv.com
• CSC 151 - Naming values with local bindingseikmeier.sites.grinnell.edu