The Combinator Approach to Programming Domain Specific Languages with F#

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:

• Art and Neural Network with F# - Audience Level: Beginner (SkillsCast recorded in April 2017)
• Haskell eXchange 2022: Novice Track (Online Conference on 7th December 2022)
• Haskell eXchange 2022: Online Conference (Online Conference on 8th - 9th December 2022)
• Haskell: Why and How the External STG Interpreter is Useful (SkillsCast recorded in December 2021)
• Keynote — Haskell: What To Do When Success Can't Be Avoided (SkillsCast recorded in November 2021)