In this talk, Robert will ask what is a combinator and show why combinators are a great way of building internal DSLs. It will then go on to show how this programming technique any be applied to many different problem domains, all of which are very relevant to the modern industrial developer.

Using a “combinator” approach to create internal Domain Specific Languages (DSLs) is something that has been popular in Haskell and the ML family of programming languages for quite some time. Much has been written about it in academic circles, yet this approach to creating DSLs has yet to become popular in main stream industrial programming. Now that F#, a member of the ML family of programing languages, is available out of the box in Visual Studio 2010, this means that these techniques are now much more accessible to programmers working in industry.

This talk will start by addressing the question of what is a combinator and show why combinators are a great way of building internal DSLs. It will then go on to show how this programming technique any be applied to many different problem domains, all of which are very relevant to the modern industrial developer. We’ll also look at some of the existing combinator libraries available for F# such as FParsec and FsCheck.

YOU MAY ALSO LIKE:

• Functional Concurrency in .NET with C# & F# with Riccardo Terrell (in London on 4th - 5th December 2017)
• Fast Track to F# with Tomas Petricek & Phil Trelford (in London on 1st - 2nd February 2018)
• Well-Typed's Guide to Haskell Performance and Optimization (in London on 22nd - 23rd February 2018)