We present a framework for analyzing the complexity and expressive power of many existing languages for manipulating information in bulk data types. The framework is based on four dimensions: the \cardinality measure " of the underlying data model � procedural vs. declarative� the presence of iteration � and the presence of \invention". Several languages from the literature which correspond to various combinations of these dimensions are categorized into ve families of queries, ranging from QLOGSPACE to a family which is more expressive than the computable queries.
We investigate the properties of a simple programming language whose main computational engine is st...
technical reportWe contribute to the state of the art in static analysis of declarative languages wi...
We present Quantitative Type Theory, a Type Theory that records usage information for each variable ...
A database programming language can model application domains most naturally if it supports several ...
AbstractIn a strongly typed system supporting user-defined data abstractions, the designer of a data...
part : TC 1: Foundations of Computer ScienceInternational audienceDescriptional complexity has histo...
We introduce an imperative programming language equipped with variables of higher types. Fragments o...
AbstractIn this paper we study a generalization of datalog, the language of function-free definite c...
Bulk data operations such as map and reduce are an elegant medium for expressing repetitive computat...
This article surveys various complexity and expressiveness results on different forms of logic progr...
The thesis investigates several aspects of the expressive power of declarative programming languages...
This paper explains how the high-level treatment of datatypes in functional languages—using features...
Our objective is to understand the notion of type in programming languages, present a model of typed...
In this extended abstract we provide a unifying framework that can be used to char-acterize and comp...
Typestate systems ensure many desirable properties of imperativeprograms, including initialization o...
We investigate the properties of a simple programming language whose main computational engine is st...
technical reportWe contribute to the state of the art in static analysis of declarative languages wi...
We present Quantitative Type Theory, a Type Theory that records usage information for each variable ...
A database programming language can model application domains most naturally if it supports several ...
AbstractIn a strongly typed system supporting user-defined data abstractions, the designer of a data...
part : TC 1: Foundations of Computer ScienceInternational audienceDescriptional complexity has histo...
We introduce an imperative programming language equipped with variables of higher types. Fragments o...
AbstractIn this paper we study a generalization of datalog, the language of function-free definite c...
Bulk data operations such as map and reduce are an elegant medium for expressing repetitive computat...
This article surveys various complexity and expressiveness results on different forms of logic progr...
The thesis investigates several aspects of the expressive power of declarative programming languages...
This paper explains how the high-level treatment of datatypes in functional languages—using features...
Our objective is to understand the notion of type in programming languages, present a model of typed...
In this extended abstract we provide a unifying framework that can be used to char-acterize and comp...
Typestate systems ensure many desirable properties of imperativeprograms, including initialization o...
We investigate the properties of a simple programming language whose main computational engine is st...
technical reportWe contribute to the state of the art in static analysis of declarative languages wi...
We present Quantitative Type Theory, a Type Theory that records usage information for each variable ...