project-m36

In case you weren't aware of TutorialD / Project:M36 already: https://github.com/agentm/project-m36 > Unlike most database management systems (DBMS), Project:M36 is opinionated software which adheres strictly to the mathematics of the relational algebra. The purpose of this adherence is to prove that software which implements mathematically-sound design principles reaps benefits in the form of code clarity, consistency, performance, and future-proofing. > Project:M36 can be used as an in-process or remote DBMS. > Project:M36 is written entirely in the Haskell programming language.

If you are interested in D, Project:M36 [0] has an implementation of TutorialD that I found to be fun to play with. [0] https://github.com/agentm/project-m36

There are: https://github.com/agentm/project-m36

You might be interested in Project M36: https://github.com/agentm/project-m36

If you are into Out of the Tar Pit, check out M36, a relational DB written in Haskell that aims to live up to the paper: https://github.com/agentm/project-m36/blob/master/docs/reach...

Three techniques for sum types in SQL (absorption, separation, and partition): https://www.parsonsmatt.org/2019/03/19/sum_types_in_sql.html Also, here is a relational database system with native support for sum types (and also no "NULL" nonsense, which is also not part of pure relational algebra): https://github.com/agentm/project-m36

Just to say there is "Project:M36 Relational Algebra Engine" [1], which says about itself: Introduction Project:M36 implements a relational algebra engine as inspired by the writings of Chris Date. Description Unlike most database management systems (DBMS), Project:M36 is opinionated software which adheres strictly to the mathematics of the relational algebra. The purpose of this adherence is to prove that software which implements mathematically-sound design principles reaps benefits in the form of code clarity, consistency, performance, and future-proofing. Project:M36 can be used as an in-process or remote DBMS. 1: https://github.com/agentm/project-m36

Project M36 allows for storage of functions: https://github.com/agentm/project-m36/blob/master/docs/atomf...

You can't compare SQL to Haskell like that. There are multiple b-tree implementations for Haskell that of course will not allow you to insert duplicate keys. There is even a real relational database system in Haskell that actually obeys the laws relational algebra, unlike SQL. https://github.com/agentm/project-m36/blob/master/docs/on_nu...

Project:M36 is an implementation of the proposed design from the "Out of the Tarpit" paper. https://github.com/agentm/project-m36

For people interested in Prolog-like DB systems: https://github.com/agentm/project-m36 > Unlike most database management systems (DBMS), Project:M36 is opinionated software which adheres strictly to the mathematics of the relational algebra. The purpose of this adherence is to prove that software which implements mathematically-sound design principles reaps benefits in the form of code clarity, consistency, performance, and future-proofing.

Project M36 is a database that implements a relational model and corresponding query language (TutorialD) based on (among other things) the ideas from Date and Darwen's Third Manifesto. TutorialD solves many of the problems present in SQL, especially around composability. https://github.com/agentm/project-m36