Functional Swift Conference 2017 — Brooklyn

Summary

Kickstarter hosted the fourth Functional Swift Conference on April 15th, marking the third time the event had been held at its office. The all-day gathering brought together 10 speakers, including four Kickstarter engineers, and 90 attendees to discuss what functional programming can contribute to better Swift code. Sessions covered recursive enums and KD-trees, testing side-effects, domain-specific languages with GraphQL, algebraic laws, monoids, predicates, sorting functions, applicative functors, parsing, and type inference. Examples included using value types and recursive data structures to describe complicated objects and live-coding an applicative parsing API that generates its own documentation. The closing type-system talk examined why inference is hard and described the Swift compiler team’s use of graph theory to address inference problems practically.

Takeaways

1. 1

   Konrad Feiler applied value types and recursive data structures to KD-trees, using them to describe complicated objects and demonstrate their performance properties.

2. 2

   Matt Diephouse argued that describing side-effects instead of performing them can provide greater testability and understandability than relying on test doubles.

3. 3

   Chris Eidhof live-coded an applicative parsing API that generates its own documentation, while Robert Widmann discussed graph theory as a practical tool for type-inference problems.