39 search results - page 4 / 8 » Polymorphic Type Inference for the Relational Algebra |
145
Voted
LICS
2010
IEEE
15 years 1 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...
122
click to vote
ICDT
2010
ACM
15 years 8 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...
136
click to vote
JACM
2007
15 years 3 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 ...
148
click to vote
SIGMOD
1993
ACM
15 years 7 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...
134
click to vote
TLDI
2010
ACM
16 years 1 days 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...