39 search results - page 4 / 8 » Polymorphic Type Inference for the Relational Algebra |
LICS
2010
IEEE
13 years 4 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
ICDT
2010
ACM
13 years 10 months ago
2010
ACM
We examine schema mappings from a type-theoretic perspective and aim to facilitate and formalize the reuse of mappings. Starting with the mapping language of Clio, we present a ty...
JACM
2007
13 years 5 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
SIGMOD
1993
ACM
13 years 9 months ago
1993
ACM
Abstract: We propose a framework for the specification of extensible database systems. A particular goal is to implement a software component for parsing and rule-based optimizatio...
TLDI
2010
ACM
14 years 2 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...