InfoQ Homepage Strange Loop 2012 Content on InfoQ
-
Scaling Software with Akka
Jonas Bonér explains solving scalability issues, including adaptive automatic load-balancing, cluster rebalancing, replication and partitioning, with Akka 2.
/presentations/Scalability-Akka/en/smallimage/Jonas.JPG)
-
Engineering Elegance: The Secrets of Square's Stack
Bob Lee presents persistence queues, the technology stack, the publish-subscribe pattern and dependency injection as used by Square.com.
/presentations/Square/en/smallimage/Bob.JPG)
-
ClojureScript - Better Semantics at Low Low Prices!
David Nolen unveils optimization techniques behind ClojureScript: code size, expression-oriented semantics, numerics, operations on JS primitive types, persistent data structures, etc.
/presentations/ClojureScript-Optimizations/en/smallimage/David.JPG)
-
Types vs. Tests: An Epic Battle?
Amanda Laucher and Paul Snively debate solving problems through types and tests using different approaches.
/presentations/Types-Tests/en/smallimage/ap.JPG)
-
Eventually-Consistent Data Structures
Sean Cribbs discusses Convergent Replicated Data Types, data structures that tolerate eventual consistency.
/presentations/CRDT/en/smallimage/Sean.JPG)
-
Making the Web Faster at Google and Beyond
Ilya Grigorik shares details on Google’s project to make the web faster: some of their findings on what slows down the web experience and how they improved it in Chrome and services.
/presentations/Web-Fast-Google/en/smallimage/Grig.JPG)
-
Behind the Mirror
Chris Granger discusses the need for enhancing the learning tools starting from his own experience watching through a mirror people trying to solve problems at Microsoft.
/presentations/Learn-Tools/en/smallimage/Chris.JPG)
-
Julia: A Fast Dynamic Language For Technical Computing
Stefan Karpinski and Jeff Bezanson introduce Julia, a Mathlab-like dynamic language with a sophisticated parametric type system supporting multiple dispatch.
/presentations/Julia/en/smallimage/xy.JPG)
-
Understanding Indexing Without Needing to Understand Data Structures
Zardosht Kasheff suggest using 3 rules for indexing SQL databases: Retrieve less data, Avoid point queries, and Avoid sorting.
/presentations/Index-SQL/en/smallimage/Zar.JPG)
-
Y Not? - Adventures in Functional Programming
Jim Weirich uses Y-Combinator as a tool to explain the nature of functional programming.
/presentations/Y-Combinator/en/smallimage/Jim.JPG)
-
Expressing Abstraction - Abstracting Expression
Ola Bini attempts to answer a few questions: Why are new languages still being created, Is it worth choosing languages strategically, and Does language actually matter?
/presentations/Language-Expressiveness/en/smallimage/Ola.JPG)
-
Relational Programming in miniKanren
Daniel P. Friedman and William E. Byrd demonstrate miniKanren, a simplified version of KANREN - a declarative logic programming system with relations embedded in a pure functional subset of Scheme.
/presentations/miniKanren/en/smallimage/13.jpg)