mb.dvi
csee.umbc.edu · 1,518 words · saved by 1 readers
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
- A Gentle Introduction to Graph Neural Networksdistill.pub
- how I think when I think about programming - alice mazalicemaz.com
- Neural Networks, Types, and Functional Programming -- colah's blogcolah.github.io
- Closures - The Rust Programming Languagedoc.rust-lang.org
- What the fuck is a closure? ・ Dan’s JavaScript Glossarywhatthefuck.is
- Structure and Interpretation of Computer Programsmitp-content-server.mit.edu
- Understanding Convolutions on Graphsdistill.pub
- From Hermeneutics to Data to Networks: Data Extraction and Network Visualization of Historical Sources | Programming Historianprogramminghistorian.org
- Object-Oriented Design and Data Structuresandrewcmyers.github.io
- Crosscut: Drawing Dynamic Modelsinkandswitch.com
- You have to know about persistent data structures (August Lilleaas' blog)augustl.com