Name
Abstract | ||
|---|---|---|
Semantic data fuels many different applications, but is still lacking proper integration into programming languages. Untyped access is error-prone. Mapping approaches cannot fully capture the conceptualization of semantic data. In this paper, we present $$\\lambda _{DL}$$, a typed $$\\lambda $$-calculus with constructs for operating on semantic data. This is achieved by the integration of description logics into the $$\\lambda $$-calculus for both typing and data access or querying. The language is centered around several key design principles, in particular: 1 the usage of semantic conceptualizations as types, 2 subtype inference for these types, and 3 type-checked query access to the data by both ensuring the satisfiability of queries as well as typing query results precisely. The paper motivates the use of a designated type system for semantic data and it provides the theoretic foundation for the integration of description logics as well as the core formal definition of $$\\lambda _{DL}$$ including a proof of type safety. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-662-54434-1_28 | ESOP |
Field | DocType | Citations |
Programming language,Functional programming,Computer science,Inference,Satisfiability,Description logic,Theoretical computer science,Type safety,Data access,Semantic computing,Semantic data model | Conference | 3 |
PageRank | References | Authors |
0.51 | 32 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Leinberger | 1 | 23 | 5.94 |
| Ralf Lämmel | 2 | 1579 | 109.70 |
| Steffen Staab | 3 | 6658 | 593.89 |