A descriptive type foundation for RDF Schema
A descriptive type foundation for RDF Schema
This paper provides a type theoretic foundation for descriptive types that appear in Linked Data. Linked Data is data published on the Web according to principles and standards supported by the W3C. Such Linked Data is inherently messy: this is due to the fact that instead of being assigned a strict a priori schema, the schema is inferred a posteriori. Moreover, such a posteriori schema consists of opaque names that guide programmers, without prescribing structure. We employ what we call a descriptive type system for Linked Data. This descriptive type system differs from a traditional type system in that it provides hints or warnings rather than errors and evolves to describe the data while Linked Data is discovered at runtime. We explain how our descriptive type system allows RDF Schema inference mechanisms to be tightly coupled with domain specific scripting languages for Linked Data, enabling an interactive feedback to Web developers
681-706
Ciobanu, Gabriel
c021fafa-11fe-48dd-a7a6-44d09ade3641
Horne, Ross
13eea4bd-0040-4638-9463-9db459611373
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7
Ciobanu, Gabriel
c021fafa-11fe-48dd-a7a6-44d09ade3641
Horne, Ross
13eea4bd-0040-4638-9463-9db459611373
Sassone, Vladimiro
df7d3c83-2aa0-4571-be94-9473b07b03e7
Ciobanu, Gabriel, Horne, Ross and Sassone, Vladimiro
(2016)
A descriptive type foundation for RDF Schema.
Journal of Logical and Algebraic Methods in Programming, 85 (5), .
(doi:10.1016/j.jlamp.2016.02.006).
Abstract
This paper provides a type theoretic foundation for descriptive types that appear in Linked Data. Linked Data is data published on the Web according to principles and standards supported by the W3C. Such Linked Data is inherently messy: this is due to the fact that instead of being assigned a strict a priori schema, the schema is inferred a posteriori. Moreover, such a posteriori schema consists of opaque names that guide programmers, without prescribing structure. We employ what we call a descriptive type system for Linked Data. This descriptive type system differs from a traditional type system in that it provides hints or warnings rather than errors and evolves to describe the data while Linked Data is discovered at runtime. We explain how our descriptive type system allows RDF Schema inference mechanisms to be tightly coupled with domain specific scripting languages for Linked Data, enabling an interactive feedback to Web developers
Text
__filestore.soton.ac.uk_users_skr1c15_mydocuments_eprints_ECS_Sassone_A Descriptive.pdf
- Accepted Manuscript
More information
Accepted/In Press date: 26 February 2016
e-pub ahead of print date: 2 March 2016
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 401251
URI: http://eprints.soton.ac.uk/id/eprint/401251
ISSN: 2352-2208
PURE UUID: fd109a53-51d7-492b-afb4-a8aeef345f84
Catalogue record
Date deposited: 10 Oct 2016 11:28
Last modified: 10 Sep 2024 01:40
Export record
Altmetrics
Contributors
Author:
Gabriel Ciobanu
Author:
Ross Horne
Author:
Vladimiro Sassone
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics