Sciweavers

11397 search results - page 64 / 2280
» A Relational Abstraction for Functions
Sort
View
ENTCS
2007
86views more  ENTCS 2007»
14 years 9 months ago
Simulations Up-to and Canonical Preorders: (Extended Abstract)
d abstract) David de Frutos Escrig1 ,3 Departamento de Sistemas Inform´aticos y Computaci´on Universidad Complutense de Madrid Madrid, Spain Carlos Gregorio Rodr´ıguez2 ,4 Depa...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...
HASKELL
2006
ACM
15 years 3 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
CORR
2007
Springer
124views Education» more  CORR 2007»
14 years 9 months ago
Neutrosophic Relational Data Model
In this paper, we present a generalization of the relational data model based on interval neutrosophic set [1]. Our data model is capable of manipulating incomplete as well as inc...
Haibin Wang, Rajshekhar Sunderraman, Florentin Sma...
IANDC
2006
78views more  IANDC 2006»
14 years 9 months ago
A stable programming language
It is well-known that stable models (as dI-domains, qualitative domains and coherence are not fully abstract for the language PCF. This fact is related to the existence of stable ...
Luca Paolini
RTSS
2002
IEEE
15 years 2 months ago
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults
abstractions + algorithms For Robustness to Timing Faults A new optimality criterion + algorithms
John Regehr