Robert Martin walks through some of the history of programming languages, and then prognosticates on the future of languages.
Scott Hickey works through a solution to the Bank OCR kata, using Groovy and functional programming techniques. The code uses recursion plus Groovy methods that support functional programming.
Paul King presents examples of Groovy and its application: DSL, dynamic typing, extensible static type system, Android programming, concurrency, functional, frameworks and tools.
Brad Urani explores the basics of FP, higher-order functions, partial function application, lazy evaluation and persistent data structures, showing how FP style avoids certain classes of bugs.
Jordan Day introduces the Elixir language, its syntax and the semantics of an Elixir application, highlighting differences that make Elixir apps more reliable than those written in other languages.
Tom Henricksen covers Design Patterns in Groovy, compilation configuration, mixing Java and Groovy, and calling other languages from Groovy. He shows how to call Scala and Clojure from Groovy.
Anil Madhavapeddy introduces the Irmin library by means of a functional queue, shows how the Git mirroring works, and then demonstrates some more complex applications.
Jessica Kerr covers some of the concurrency tools existing in JVM languages including ExecutorService, Futures, Akka actors, and core.async coroutines, providing advice on writing deadlock-free code.
Irina Guberman discusses maximizing throughput on multicore systems with Erlang and the Jobs framework by Ulf Wiger.
Tom Stuart takes a look at some modern examples of declarative programming and explores how it can help with the applications built today.
Natalia Chechina outlines features of actor and functional programming models, and the reason these models attract so much interest in parallel, concurrent, and scaling world.
Joseph Blomstedt presents ongoing work to build a new set of high performance data structures for Erlang, including both single process data structures as well as various concurrent data structures.