Sciweavers

699 search results - page 4 / 140
» Strong types for relational databases
Sort
View
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
13 years 8 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
DASFAA
1993
IEEE
127views Database» more  DASFAA 1993»
13 years 8 months ago
An Object-Centered Data Model for Engineering Design Databases
: Entities in engineering design databases need to evolve in both structure and behavior. Such a need is not well addressed by object-oriented data models based on the class concep...
Huibin Zhao, Alexandros Biliris
TLCA
2001
Springer
13 years 9 months ago
Strong Normalization of Classical Natural Deduction with Disjunction
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
Philippe de Groote
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 4 months ago
Join Bayes Nets: A new type of Bayes net for relational data
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
Oliver Schulte, Hassan Khosravi, Flavia Moser, Mar...
JCSS
2002
114views more  JCSS 2002»
13 years 4 months ago
Polymorphic Type Inference for the Relational Algebra
A database programming language is a programming language extended with database operations. In this paper we extend a core functional language with explicitly labeled tuples and ...
Jan Van den Bussche, Emmanuel Waller