diff --git a/notes/deep_merge_exploration.org b/notes/deep_merge_exploration.org
index f35cf5f0..77ec0e16 100644
--- a/notes/deep_merge_exploration.org
+++ b/notes/deep_merge_exploration.org
@@ -12,4 +12,16 @@ Depending on the programming language you use, you have a different set of
 root structures.
 
 But in most languages you have roughly the same concepts.
-First
+Base types, like chars, numbers, often strings
+Storage types, typically, arrays, list, associative array (map, hash-map).
+
+So let's restrict ourselves to this common denominator of data structure.
+Say, base types could be: char, number, string
+Construction types could be map (associative array) or arrays.
+Sounds simple enough.
+
+So a common task is to "merge" such structure.
+In Haskell this kind of operation would be repugnant for most programmer.
+But, even in Haskell this could be useful.
+
+So