Sciweavers

672 search results - page 25 / 135
» On the Expressive Power of the Loop Language
Sort
View
CONCUR
2007
Springer
15 years 8 months ago
Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
Abstract. We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular i...
Martin Lange
ICDE
2006
IEEE
189views Database» more  ICDE 2006»
16 years 3 months ago
Algebraic Optimization of Nested XPath Expressions
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
Matthias Brantner, Carl-Christian Kanne, Guido Moe...
CSL
2003
Springer
15 years 7 months ago
Comparing the Succinctness of Monadic Query Languages over Finite Trees
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
Martin Grohe, Nicole Schweikardt
DOCENG
2007
ACM
15 years 5 months ago
Declarative extensions of XML languages
We present a set of XML language extensions that bring notions from functional programming to web authors, extending the power of declarative modelling for the web. Our previous w...
Simon J. Thompson, Peter R. King, Patrick Schmitz
HASKELL
2007
ACM
15 years 5 months ago
Comprehensive comprehensions
We propose an extension to list comprehensions that makes it easy to express the kind of queries one would write in SQL using ORDER BY, GROUP BY, and LIMIT. Our extension adds exp...
Simon L. Peyton Jones, Philip Wadler