We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Metamagical programming with expression trees

Formale Metadaten

Titel
Metamagical programming with expression trees
Serientitel
Anzahl der Teile
170
Autor
Lizenz
CC-Namensnennung - keine kommerzielle Nutzung - Weitergabe unter gleichen Bedingungen 3.0 Unported:
Sie dürfen das Werk bzw. den Inhalt zu jedem legalen und nicht-kommerziellen Zweck nutzen, verändern und in unveränderter oder veränderter Form vervielfältigen, verbreiten und öffentlich zugänglich machen, sofern Sie den Namen des Autors/Rechteinhabers in der von ihm festgelegten Weise nennen und das Werk bzw. diesen Inhalt auch in veränderter Form nur unter den Bedingungen dieser Lizenz weitergeben
Identifikatoren
Herausgeber
Erscheinungsjahr
Sprache

Inhaltliche Metadaten

Fachgebiet
Genre
Abstract
If the world of fantasy has taught us anything, it is that the oldest magic is the most powerful magic. In the realm of computing, no magic is more ancient than the one that arises from the duality of code and data. The ability to treat code as data and data as code is at the core of LISPs legendary meta-programming capabilities, but the idea is even older than that - it echoes the spectre of von Neumann himself! With expression trees, the enabling technology behind LINQ and the dynamic language runtime, .NET programmers have access to a beautiful programming model to control this ancient magic. In this demo-driven session, we will start with some simple examples to explain the basics of working with expression trees. However, we will quickly progress to something more useful and powerful, as we consider how to build a DSL for expressing rules to be compiled and evaluated at runtime. We will end up with a complete real-world example using data validation in an ASP.NET MVC application that would be infeasible without the capabilities offered by expression trees.