All decks
  • Recursion Schemes

  • Voting Systems

  • A Gentle Introduction to Recursion Schemes

    Recursion Schemes, popularized by the notorious paper Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire, is an very elegant technique for expressing recursive algorithms on arbitrarily nested data structures. This talk will offer a gentle introduction to the subject. We will begin by motivating its use and then follow through with some intuition for the concepts and finally walktrough some concrete examples. Only basic familiarity with functional programming abstractions will be assumed. The audience can expect to leave with a burning desire to write all their recursive data types in fixed point style.

  • Expressions - Scala By the Bay 2015

  • Computation Expressions - Scala By the Bay 2015

  • Computation Expressions

  • Expressions