Explore >> Select a destination
|
You are here 
|
blog.thomasheartman.com | ||
| | | | |
sookocheff.com
|
|
| | | | | In a purely functional language - like lambda calculus - programs are expressed as nested function calls. Repetition in such an environment requires that nesting of function calls continues until some condition is met. During the repetition, each function passes its result to the next function in the nested chain and this repetition is completed when a test for some condition passes. The repetitive behaviour I've just described is recursion: | |
| | | | |
hookrace.net
|
|
| | | | | ||
| | | | |
matthew.brecknell.net
|
|
| | | | | ||
| | | | |
vladikk.com
|
|
| | | Let's do a little experiment: try to explain the gist of Domain-Driven Design to someone who has no clue about it. This, especially doing it succinctly, is not easy. Heck, I struggle with it myself. Bounded contexts, entities, domain events, value objects, domains, aggregates, repositories... where do you even start? To find the order in the apparent chaos, I want to analyze the DDD methodology from a rather unusual perspective - by applying Domain-Driven Design to Domain-Driven Design itself. After all, this methodology is intended to deal with complex domains, isn't it? | ||
