Re: Mad idea: Programming language based on RDF

Good observations.

But there are many open issues with what you sketch below and there are a couple of building blocks that all just constitute a beginning, but point to such a future language:



Integration of native access to simple queries into a typed programming language:
Martin Leinberger <http://dblp.uni-trier.de/pers/hd/l/Leinberger:Martin>, Ralf Lämmel <http://dblp.uni-trier.de/pers/hd/l/L=auml=mmel:Ralf>, Steffen Staab:
The Essence of Functional Programming on Semantic Data. ESOP 2017 <http://dblp.uni-trier.de/db/conf/esop/esop2017.html#LeinbergerLS17>: 750-776


Distributed applications:
Felix Leif Keppmann <http://dblp.org/pers/hd/k/Keppmann:Felix_Leif>, Maria Maleshkova <http://dblp.org/pers/hd/m/Maleshkova:Maria>, Andreas Harth:
Towards Optimising the Data Flow in Distributed Applications. WWW (Companion Volume) 2015 <http://dblp.org/db/conf/www/www2015c.html#KeppmannMH15>: 1503-1508

Simon Schenk <http://dblp.uni-trier.de/pers/hd/s/Schenk:Simon>, Steffen Staab:
Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web. WWW 2008 <http://dblp.uni-trier.de/db/conf/www/www2008.html#SchenkS08>: 585-594
(Btw: Whether one uses a textual syntax to specify the connections or an RDF-based one is only a difference in tooling, but my experience is that a graph based syntax for rules is actually quite useless for the developer. SPIN of course provides you a graph-based syntax http://spinrdf.org/ <http://spinrdf.org/>)

Maybe the best ISWC2017 paper by Olaf HArtig et al also fits into this space.


Updates in OWL is an unsolved issue btw:
Albin Ahmeti <http://dblp.uni-trier.de/pers/hd/a/Ahmeti:Albin>, Diego Calvanese <http://dblp.uni-trier.de/pers/hd/c/Calvanese:Diego>, Axel Polleres, Vadim Savenkov <http://dblp.uni-trier.de/pers/hd/s/Savenkov:Vadim>:
Handling Inconsistencies Due to Class Disjointness in SPARQL Updates. ESWC 2016 <http://dblp.uni-trier.de/db/conf/esws/eswc2016.html#AhmetiCPS16>: 387-404

So, while we had master theses on this topic, in general it is way more than a master thesis ;)

> Am 09.11.2017 um 22:01 schrieb John Flynn <jflynn12@verizon.net>:
> 
> There have been previous threads on this basic idea. I sent the following out in 2012 in response to one such discussion.
> 
> "I am somewhat surprised that someone hasn't created a dedicated Semantic Web applications development language by now. I tried, unsuccessfully, to get government funding for this idea shortly after the DAML to OWL transition.
> It seems to me one of the handicaps to the widespread development of Semantic Web based applications is the lack of a specialized computer language that uses OWL ontologies and instance data as native data structures. Such a language would include constructs designed to manipulate and access specified ontologies and data. It shouldn't be particularly difficult to design a language along these lines and to implement it in a compiler. It would probably make for a fairly decent computer science master's thesis."
> 
> So, what I was talking about back in 2012 was developing a procedural language that would use the declarative capabilities of RDF/OWL as it primary native data structure. The language would include all the standard procedural constructs to allow the user to manipulate data in terms of algorithms, heuristics and other data processing capabilities. What it would add is the built-in (native) use of RDF/OWL ontologies as data structures and it would also include new data processing constructs specifically designed to manipulate ontology graphs and associated instance data. This is different from other approaches where an attempt is made to bring the ontology data into object oriented data structures which are already native to the procedural language. The new language would include facilities to handle new (non-declared) instance data generated via ontological reasoning. The core of the procedural language could potentially be any of the current/past procedural languages such as Java, Python, C++, C #, etc., although consideration should be given to which language would provide the best constructs to accomodate the semantic nature of the RDF/OWL data structure (graph). Building off an existing, well known procedural language would facility the learning curve for users. However, it might also turn out that an entirely new procedural language would provide a better fit for manipulating semantic data. I still think this would make a good computer science master's thesis. 
> 
> John Flynn
> http://semanticsimulations.com
> 
> 
> 
> 
>