has anybody seen https://www.mm-adt.org/ and https://www.mm-adt.org/vm/ ? (by one of the creators of https://en.wikipedia.org/wiki/Gremlin_(query_language)). I don't fully understand the concept but maybe someone here does?
π mm-ADT
query language developers can create languages irrespective of the underlying storage system that will ultimately be manipulated by the language.
processing engine developers can have their processors programmed by any query language for data stored in any storage system.
storage systems (such as databases) immediately support any all mm-ADT compliant query languages and processors in support of the multifarious requirements of their end users' data processing requirements.
sounds like some sort of universal runtime (something like wasm?) but also including a specification for data storage and querying
there's an economic aspect too: https://www.slideshare.net/slidarko/mmadt-a-virtual-machinean-economic-machine
Yeah, he is crazy. I donβt understand what he has done either. Waiting to finish a course of abstract algebra before trying to understand the trade offs done in his stream ring theory.
The project looks like an attempt to create the encoding-independent layer Shalabh Chaturvedi and I were talking about in this thread: https://futureofcoding.slack.com/archives/C5T9GPWFL/p1606359276136400?thread_ts=1606359276.136400&cid=C5T9GPWFL
[November 25th, 2020 6:54 PM] ak: An old thread I wish I could link to:
> Consider the powerful, time-honored environment that gives us many βsmall programs, each doing one thing wellβ, the Unix shell. There is a
cut
command, asort
command, and many more. A versatile collection of blocks that I can snap together in different ways (yay pipes!). There isnβt much duplication of commands and the environment seems to have nice composition properties. > > But it only goes so far. > > If I write a program in Unix using Java or Python, can I reuse the Unixsort
to sort an array of items inside my program? Of course not, what an improper question! The decent choice is to reimplement sorting in my program (or use the standard library where someone else has already re-implemented it). > > The computer already knows how to sort things, why do I need to tell it again? -- <@U8A5MS6R1> (https://shalabh.com/programmable-systems/on-composition.html)From the inventor of shells:
> I felt that commands should be usable as library subroutines, or vice versa. This stemmed from my practice of writing CTSS [OS] commands in MAD, a simplified Algol-like language. It was much faster and the code was more maintainable than IBM 7094 assembly code. Since I needed MAD-friendly subroutine calls to access CTSS primitives, I wrote in assembly code a battery of interface subroutines, which very often mimicked CTSS basic command functions. I felt it was an awkward duplication of effort. However, I did not go further in the context of CTSS. -- Louis Pouzin (https://multicians.org/shell.html)
Interesting - thanks @Andrew F this looks interesting. Will be looking deeper into this later.
Andrew F Pretty much. I would love to know if you guys can make an assessment to what degree this project has succeeded. Its a darn interesting take on databases, especially given his background and the math heavy lifting he has done.