159 search results - page 11 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
Parallel computing is becoming increasing central and mainstream, driven both by the widespread availability of commodity SMP and high-performance cluster platforms, as well as th...
81
Voted
ACL
2001
14 years 11 months ago
2001
The standard pipeline approach to semantic processing, in which sentences are morphologically and syntactically resolved to a single tree before they are interpreted, is a poor fi...
RP
2010
Springer
14 years 7 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
105
Voted
FLOPS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
178
Voted
POPL
2006
ACM
15 years 9 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...