Using Expression Trees for internal DSLs in C# 3.5
Ian Cooper continues his series of 3 talks on domain specific languages DSL. He talks about fluent interfaces and how they can be created using extension methods. Fluent interfaces provide a ‘discoverable’ API which is easier to read...
Ian then gives a demonstration of how fluent interfaces can be created and how discoverable the API really is.
Ian then introduces Closures. Closures are basically a generic name for treating a function as data. It is generally done using a lambda expression. Ian explains how this can be done within DSLs and where it is useful. He also gives a demonstration of it being used. Ian finishes with an introduction to Parse Trees and how all of these features can be used in real world DSLs.
YOU MAY ALSO LIKE:
- Modern Application Development with C# and .NET Core (in London on 4th - 7th December 2018)
- Fast Track to F# with Tomas Petricek & Phil Trelford (in London on 6th - 7th December 2018)
- Functional Concurrency in .NET with C# & F# with Riccardo Terrell (in London on 29th - 30th April 2019)
- ProgNET London 2019 (in London on 11th - 13th September 2019)
Using Expression Trees for internal DSLs in C# 3.5
Ian Cooper
Polyglot Coding Architect in London, founder of #ldnug, speaker, tabletop gamer, geek. Tattooed, pierced, and bearded. The 'guv' on @BrighterCommand
-
About the Speaker
Using Expression Trees for internal DSLs in C# 3.5
Ian Cooper
Polyglot Coding Architect in London, founder of #ldnug, speaker, tabletop gamer, geek. Tattooed, pierced, and bearded. The 'guv' on @BrighterCommand