211 search results - page 27 / 43 » Reflective Programming in the Relational Algebra |
173
Voted
AC
1992
Springer
15 years 7 months ago
1992
Springer
Logic and databases have gone a long way together since the advent of relational databases. Already the rst basic query languages for relational databases beside relational algebra...
152
Voted
ICALP
1998
Springer
15 years 8 months ago
1998
Springer
This paper investigates the use of a complete metric space framework for providing denotational semantics to a real-time process algebra. The study is carried out in a non-interlea...
145
Voted
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
154
Voted
FOSSACS
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
138
Voted
IJIIDS
2010
14 years 10 months ago
2010
Abstract. This paper presents the semantics of database mappings in the relational database (DB) category, based on the power-view monad T and monadic algebras. The semantics can b...