LambdaDL: Syntax and Semantics (Preliminary Report)
@article{Leinberger2016LambdaDLSA, title={LambdaDL: Syntax and Semantics (Preliminary Report)}, author={Martin Leinberger and Ralf L{\"a}mmel and Steffen Staab}, journal={ArXiv}, year={2016}, volume={abs/1610.07033} }
Semantic data fuels many different applications, but is still lacking proper integration into programming languages. Untyped access is error-prone while mapping approaches cannot fully capture the conceptualization of semantic data. In this paper, we present $\lambda_{DL}$,a $\lambda$-calculus with a modified type system to provide type-safe integration of semantic data. This is achieved by the integration of description logics into the $\lambda$-calculus for typing and data access. It is…
Figures and Tables from this paper
References
SHOWING 1-10 OF 44 REFERENCES
Gradual Typing for Objects
- Computer ScienceECOOP
- 2007
This paper develops a gradual type system for object-based languages, extending the Ob < : calculus of Abadi and Cardelli, and shows that gradual typing and subtyping are orthogonal and can be combined in a principled fashion.
Minimal type inference for Linked Data consumers
- Computer ScienceJ. Log. Algebraic Methods Program.
- 2015
Types and programming languages
- Computer Science
- 2002
This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages, with a variety of approaches to modeling the features of object-oriented languages.
SWOBE - embedding the semantic web languages RDF, SPARQL and SPARUL into java for guaranteeing type safety, for checking the satisfiability of queries and for the determination of query result types
- Computer ScienceSAC '09
- 2009
This paper proposes an embedding ofSemantic Web languages into the java programming language, such that Semantic Web data and queries can be transparently used, type safety is guaranteed, and already at compile time, syntax errors of Semantic web data and query are reported, unsatisfiable queries are detected and the types of query results are determined.
Intensional polymorphism in type-erasure semantics
- Computer ScienceICFP '98
- 1998
This work presents a type-theoretic framework that supports intensional polymorphism, but avoids many of the disadvantages of type passing, and allows unknown types to be refined in place thereby avoiding certain beta-expansions required by other frameworks.
Featherweight Java: a minimal core calculus for Java and GJ
- Computer ScienceTOPL
- 2001
This work extends Featherweight Java with generic classes in the style of GJ and gives a detailed proof of type safety, which formalizes for the first time some of the key features ofGJ.
Zhi# - OWL Aware Compilation
- Computer ScienceESWC
- 2011
The Zhi# programming language is the first solution of its kind to make XSD data types and OWL class descriptions first-class citizens of a widely-used programming language.
Description logics for semantic query optimization in object-oriented database systems
- Computer ScienceTODS
- 2003
A general method for semantic query optimization in the framework of Object-Oriented Database Systems, providing an ODMG-compliant interface that allows a full interaction with OQL queries, wrapping underlying Description Logic representation and techniques to the user.
Gradual Typing for Functional Languages
- Computer Science
- 2006
The static and dynamic semantics of a λ-calculus with optional type annotations are defined and it is proved that this calculus is type safe and that the cost of dynamism is “pay-as-you-go”.
Descriptive Types for Linked Data Resources
- Computer ScienceErshov Memorial Conference
- 2014
This work introduces the notion of descriptive typing, a subtype system, algorithmic type system and operational semantics that work together to characterise how descriptive types are used in Linked Data.