272 search results - page 14 / 55 » Programming languages capturing complexity classes |
ISCI
2008
13 years 8 months ago
2008
This paper considers the theory of database queries on the complex value data model with external functions. Motivated by concerns regarding query evaluation, we first identify re...
ICALP
1995
Springer
14 years 2 days ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
OOPSLA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
ICFP
2004
ACM
14 years 8 months ago
2004
ACM
We present a process logic for the -calculus with the linear/affine type discipline (Berger et al. 2001; Berger et al. 2003; Honda and Yoshida 2002; Honda and Yoshida 2003; Honda ...
EACL
1993
ACL Anthology
13 years 9 months ago
1993
ACL Anthology
The paper shows how the verbal lexicon can be formalised in a way that captures and exploits generalisations about the alternation behaviour of verb classes. An alternation is a p...