I remember the day like it was yesterday. Pac Man had finally arrived on the Atari 2600.  It was a clear and sunny day, but it was slightly brisk. My dad drove us down to the video store about three miles from our Michigan house. If I remember correctly, the price for the game was $24.99.  It was quite expensive for the day, probably equaling a $70 game in today’s market, but it was mine. There *was* no question about it. If you purchase a game, it’s your game… right?

You couldn’t be more wrong.  With all the licensing agreements in games today, you only purchase the right to play it. You don’t actually “own” the game. 

Today, game designers want total control over the money that comes in for a game. They add in clauses that keep the game from being resold, rented, borrowed, copied, etc. All of the content in the game, including the items you find that are specifically for you, are owned by the software developer. Why, you ask, do they do this? It’s all about the money.

This need for greed started years ago, when people started modifying current games on the market. One of the first games like this was Doom. There were so many third part mods made, but because of licensing agreement, none of these versions were available for resale. The end user, or you, had to purchase Doom before they could even install the mod.  None of these “modders” were allowed to make any money off their creation.

A business rule is the basic unit of rule processing in a Business Rule Management System (BRMS) and, as such, requires a fundamental understanding. Rules consist of a set of actions and a set of conditions whereby actions are the consequences of each condition statement being satisfied or true. With rare exception, conditions test the property values of objects taken from an object model which itself is gleaned from a Data Dictionary and UML diagrams. See my article on Data Dictionaries for a better understanding on this subject matter.

A simple rule takes the form:

if condition(s)

then actions.

An alternative form includes an else statement where alternate actions are executed in the event that the conditions in the if statement are not satisfied:

if condition(s)

then actions

else alternate_actions

It is not considered a best prectice to write rules via nested if-then-else statements as they tend to be difficult to understand, hard to maintain and even harder to extend as the depth of these statements increases; in other words, adding if statements within a then clause makes it especially hard to determine which if statement was executed when looking at a bucket of rules. Moreoever, how can we determine whether the if or the else statement was satisfied without having to read the rule itself. Rules such as these are often organized into simple rule statements and provided with a name so that when reviewing rule execution logs one can determine which rule fired and not worry about whether the if or else statement was satisfied. Another limitation of this type of rule processing is that it does not take full advantage of rule inferencing and may have a negative performance impact on the Rete engine execution. Take a class with HSG and find out why.

Rule Conditions

F# is excellent for specialties such as scientific computing and data analysis. It is an excellent choice for enterprise development as well. There are a few great reasons why you should consider using F# for your next project.

Concise

F# is not cluttered up with coding noise;  no pesky semicolons, curly brackets, and so on. You almost never have to specify the kind of object you're referencing because of its powerful type inference system. It usually takes fewer lines of code to solve the same issue.

Convenient

Common programming tasks are much easier in F#. These include generating and using state machines, comparison and equality, list processing, as well as complex type definitions. It is very easy to generate powerful and reusable code because functions are first class objects. This is done by creating functions that have other functions as parameters or that combine existing functions to generate a new functionality.

Correctness

F# has a strong type system, and, therefore, prevents many common errors such as null reference exceptions. Valuables are immutable by default which, too, prevents a huge class of errors. You can also encode business logic by utilizing the type system. When done correctly, it is impossible to mix up units of measure or to write incorrect code thereby decresing the need of unit tests.

Concurrency

F# has number of built-in libraries. These libraries help when more than one thing at a time is occurring. Parallelism and asynchronous programming are very simple. There is also a built-in actor model as well as excellent support for event handling and functional reactive programming. Sharing state and avoiding locks are much easier because data structures are immutable by default.

Completeness

F# also supports other styles that are not 100 percent pure. This makes it easier to interact with the non-pure world of databases, websites, other applications, and so on. It is actually designed as a hybrid functional/OO language. F# is also part of the .NET ecosystem. This gives you seamless access to all the third party .NET tools and libraries. It operates on most platforms. These platforms include Linux and smartphones via mono. Visual Studio is integrates with F# as well. This means you get many plug-ins for unit tests, a debugger, a IDE with IntelliSense support, other development tasks. You can use MonoDevelop IDE on Linux.

Related:

F# - Marching Towards Top 10 Programming Languages

What Are the Advantages of Python Over Ruby?

Top 10 Programming Languages Expected To Be In Demand in 2014

I suspect that many of you are familiar with the term "hard coding a value" whereby the age of an individual or their location is written into the condition (or action) of a business rule (in this case) as shown below:

if customer.age > 21 and customer.city == 'denver'

then ...

Such coding practices are perfectly expectable provided that the conditional values, age and city, never change. They become entirely unacceptable if a need for different values could be anticipated. A classic example of where this practice occurred that caused considerable heartache in the IT industry was the Y2K issue where dates were updated using only the last 2 digits of a four digit number because the first 2 digits were hard-coded to 19 i.e. 1998, 1999. All was well provided that the date did not advance to a time beyond the 1900’s since no one could be certain of what would happen when the millennia arrived (2000). A considerably amount of work (albeit boring) and money, approximately $200 billion, went into revising systems by way of software rewrites and computer chip replacements in order to thwart any detrimental outcomes. It is obvious how a simple change or an assumption can have sweeping consequences.

You may wonder what Y2K has to do with Business Rule Management Systems (BRMS). Well, what if we considered rules themselves to be hard-coded. If we were to write 100s of rules in Java, .NET or whatever language that only worked for a given scenario or assumption, would that not constitute hard-coded logic? By hard-coded, we obviously mean compiled. For example, if a credit card company has a variety of bonus campaigns, each with their own unique list of rules that may change within a week’s time, what would be the most effective way of writing software to deal with these responsibilities?