A Type-theoretic Approach to Cloud Data Integration

@inproceedings{Shapkin2015ATA,
  title={A Type-theoretic Approach to Cloud Data Integration},
  author={Pavel A. Shapkin and Gregory Pomadchin},
  booktitle={International Conference on Web Information Systems and Technologies},
  year={2015}
}
We propose an architecture that helps to integrate data accessible via cloud application APIs. The central part of the platform is the domain ontology which is based on type theory. Typing is used to automate the building of integration solutions as well as for automatic verification of program code and compatibility between 
View PDF
4 Citations
Background Citations
1

Figures from this paper

4 Citations

A Dynamic Editor of Typed Data Transformations

Type-theoretic Means for Querying Heterogeneous Data Sources Available via Cloud APIs

Adding agility to Enterprise Process and Data Engineering

An appropriate general architecture pattern is discussed and insights how dynamic process management environment could be made and a special component called a process knowledge base is introduced to justify its crucial role in achieving agility within the enterprise.

Automation of Configuration, Initialization and Deployment of Applications Based on an Algebraic Approach

6 References

A translation approach to portable ontology specifications

This paper describes a mechanism for defining ontologies that are portable over representation systems, basing Ontolingua itself on an ontology of domain-independent, representational idioms.

An Overview of the Scala Programming Language

This paper gives an overview of the Scala language for readers who are familar with programming methods and programming language design.

A Survey of Extract-Transform-Load Technology

This survey covers the conceptual and logical modeling of ETL processes, along with some design methods, and visits each stage of the E-T-L triplet, and examines problems that fall within each of these stages.

Coercive Subtyping

This approach, subtyping with speciied implicit coercions is treated as a feature at the level of the logical framework; in particular, the meaning of an object being in a supertype is given by coercive deenition rules for the deenitional equality.

Introduction to Functional Programming

Combinatory logic in programming

  • 2003