Sciweavers

2218 search results - page 366 / 444
» Testing Expressibility Is Hard
Sort
View
ICFP
2007
ACM
14 years 9 months ago
Ott: effective tool support for the working semanticist
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...
Peter Sewell, Francesco Zappa Nardelli, Scott Owen...
LICS
2002
IEEE
14 years 2 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
DBPL
1993
Springer
141views Database» more  DBPL 1993»
14 years 1 months ago
Some Properties of Query Languages for Bags
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
Leonid Libkin, Limsoon Wong
CIKM
2009
Springer
14 years 1 months ago
Generating SQL/XML query and update statements
The XML support in relational databases and the SQL/XML language are still relatively new as compared to purely relational databases and traditional SQL. Today, most database user...
Matthias Nicola, Tim Kiefer
POPL
2010
ACM
13 years 11 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...