In this weeks episode we are lucky to be joined by Jimmy Burrell for a long over-due ‘geek out’.
We start off discussion around his recent functional programming exploration, and how you can take many of these principles into your day-to-day OOP language.
Following this we chat about what drew Jimmy to F#, the REPL, making illegal states unrepresentable and reasoning about immutable data-structures.
From here we highlight some of F# capabilities including, pattern matching, computational expressions, type providers, currying and concurrency paradigms.
Finally, we wrap up the show discussing our experiences learning about monads, the continuation passing style, and thinking in terms of data transformations.
Show Links
F# Software FoundationOCamlF# Acknowledgements - Microsoft ResearchDon Syme - Researcher at Microsoft ResearchThe Racket LanguageScripting in F#FAKE - F# Make - A DSL for build tasksDesigning with types: Making illegal states unrepresentable - F# for fun and profitImmutability - F# for fun and profitDiscriminated Unions - F# for fun and profitSuave.IOF Sharp Programming - Computation ExpressionsContinuation-passing styleIdris - A Language with Dependent TypesType ProvidersF# Data: Library for Data AccessRailway Oriented Programming - F# for fun and profitLearning Elixir’s with - Learning ElixirConcurrency - F# for fun and profitFunctional reactive programming - Wikipedia, the free encyclopediaIonide - Crossplatform F# EditorVisual Studio Code - Code Editing. RedefinedMobile App Development & App Creation Software - XamarinScala comes to .NetGitHub - clojure/clojure-clrGitHub - Microsoft/dotnetEmbrace, extend and extinguishFunctional Geekery Episode 08 - Jessica KerrCurrying