The rationale behind DBPL

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The DBPL language orthogonally integrates sets and first-order Predicates into a strongly and statically typed Programming language, and the DBPL system supports the language with full Database functionality including Persistence, query optimization and transaction management. The application of modern language technology to Database concepts results in new insights into the relationship between types and schemas, expressions/iterators and queries, selectors and views, or functions and transactions. Furthermore, it allows the exploitation of type theory and formal semantics of Programming languages and thus connects Database application Development with results from Program specification and verification.

Cite

CITATION STYLE

APA

Schmidt, J. W., & Matthes, F. (1991). The rationale behind DBPL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 495 LNCS, pp. 389–395). Springer Verlag. https://doi.org/10.1007/3-540-54009-1_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free