76 search results - page 15 / 16 » Recursive Polymorphic Types and Parametricity in an Operatio... |
153
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, w...
145
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
130
Voted
ENTCS
2010
15 years 3 months ago
2010
The theory of nominal sets is a theory for names, freshness and binders. It has recently been suggested as a framework for modelling local store because it allows for a more eleme...
129
Voted
AMAI
2008
Springer
15 years 3 months ago
2008
Springer
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
177
Voted
SDB
1995
15 years 7 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...