ALL COVERED TOPICS

NoSQL Benchmarks NoSQL use cases NoSQL Videos NoSQL Hybrid Solutions NoSQL Presentations Big Data Hadoop MapReduce Pig Hive Flume Oozie Sqoop HDFS ZooKeeper Cascading Cascalog BigTable Cassandra HBase Hypertable Couchbase CouchDB MongoDB OrientDB RavenDB Jackrabbit Terrastore Amazon DynamoDB Redis Riak Project Voldemort Tokyo Cabinet Kyoto Cabinet memcached Amazon SimpleDB Datomic MemcacheDB M/DB GT.M Amazon Dynamo Dynomite Mnesia Yahoo! PNUTS/Sherpa Neo4j InfoGrid Sones GraphDB InfiniteGraph AllegroGraph MarkLogic Clustrix CouchDB Case Studies MongoDB Case Studies NoSQL at Adobe NoSQL at Facebook NoSQL at Twitter

NAVIGATE MAIN CATEGORIES

Close

With Concatenative Programming, a Parallel Compiler Is a Plain Old Map-Reduce

I’m still digesting Jon Purdy’s post:

A compiler for a statically typed concatenative language could literally:

  1. Divide the program into arbitrary segments
  2. Compile every segment in parallel
  3. Compose all the segments at the end

This is impossible to do with any other type of language. With concatenative programming, a parallel compiler is a plain old map-reduce!

Original title and link: With Concatenative Programming, a Parallel Compiler Is a Plain Old Map-Reduce (NoSQL database©myNoSQL)

via: http://evincarofautumn.blogspot.com.au/2012/02/why-concatenative-programming-matters.html