23 search results - page 4 / 5 » Join Algorithms for the Theory of Uninterpreted Functions |
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
SIGMOD
1993
ACM
13 years 12 months ago
1993
ACM
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and jo...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...