141
click to vote
DBPL
15 years 7 months ago
1991 Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
120
click to vote
DBPL
15 years 7 months ago
1991 Springer
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
118
click to vote
DBPL
15 years 7 months ago
1991 Springer
Persistent languages and systems provide the ability to create and manipulate all data in a uniform manner regardless of how long it persists. Such systems are usually implemented...
|