A Verified Algebra for Read-Write Linked Data
The aim of this work is to verify an algebra for high level languages for reading and writing Linked Data. Linked Data is raw data published on the Web and interlinked using a collection of standards. The main innovation is simply to use dereferenceable URIs as global identifiers in data, rather tha...
Saved in:
Main Authors: | Horne, Ross, Sassone, Vladimiro |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Article |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/80958 http://hdl.handle.net/10220/39003 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Minimal type inference for Linked Data consumers
by: Ciobanu, Gabriel, et al.
Published: (2015) -
Tracing where and who provenance in Linked Data: A calculus
by: Dezani-Ciancaglini, Mariangiola, et al.
Published: (2015) -
A descriptive type foundation for RDF Schema
by: Ciobanu, Gabriel, et al.
Published: (2016) -
A characterisation of open bisimilarity using an intuitionistic modal logic
by: Ahrn, Ki Yung, et al.
Published: (2018) -
A simple and efficient approach to unsupervised instance matching and its application to linked data of power plants
by: Eibeck, Andreas, et al.
Published: (2024)