Decision Diagrams are a family of data structures that represents huge data sets using a small amount of memory. These structures can be of fixed size (tuples), or varying size (lists, maps, ...), the DD handling being different for each one. Data Decision Diagrams and Set Decision Diagrams handle varying size data thanks to operations named homomorphisms. However, the definition of a correct operation can be hard because numerous errors hard to identify can happen. This seminar offers a presentation of an algorithms library that gives a more abstract view on handled data. This library contains the algorithms defined in "List" and "Map" modules from the Objective Caml standard library, allowing the user to focus on his specific problem.