HasDB is a DBMS that manages in-memory Graphs those manifesting out-of-core Arrays .
HasDB is implemented on top of GHC , powered by Software Transactional Memory for Atomicity and Isolation (the A and I in ACID ), thus native to Haskell in the first place.
HasDB takes advantage of Edh for easy programming of Consistency (the C in ACID ) and Concurrency as a whole (again thanks to STM ), in both the implementation of the DBMS itself, and implementations of various database applications.
Durability (the D in ACID ) is obtained through Event Sourcing for the Graph, and by Non-Volatile-Storage (practically i.e. clusters of hard disks or SSDs) backed Virtual Memory for the Arrays .
The Magic Supers mechanism from Edh Object System makes the language itself directly viable as both the DDL and DML for database modeling, querying and updating, thus neither an Object-Graph Mapping Layer nor a separate Graph Query Language is needed. While transactional semantics already carried by the object attribute model, intrinsic to Edh the language, the persistence capability is added to a vanilla Edh object, so as to be either an entity object or a relationship object, as unintrusively as wearing an exoskeleton.