By dotCore
via blog.thezerobit.com
Published: Jul 24 2012 / 08:00
Clojure, Scala, and Haskell (and other languages) have recently brought the idea of immutable (and persistent) data structures into some amount of popularity. This is not a new idea, by any means, as Lisp has always supported this with its list structure, which is essentially a linked list. In Common Lisp and Scheme, lists are actually mutable but in practice, this is rarely a problem because it is generally considered bad form to go around mutating lists except under certain circumstances. Most Lisp books, tutorials and references encourage using lists in a functional style (that is, assuming and treating them as immutable structures).
-
Point-Click Deployment of Neo4J to Windows Azure
-
5 Tips for Mainframe Modernization: Transitioning to a GUI
-
Grids, Direction and Rotation | Creative Coding with Processing.js for Windows 8 JavaScript applications
-
Setting up a full Ruby on Rails development environment in the browser in less than 5 minutes with Nitrous.io
-
How To Loop ArrayList In Java
-
Excel Vlookup Function - A complete Tutorial
Add your comment
