40 search results - page 3 / 8 » Proof Nets, Garbage, and Computations |
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
79
Voted
COLING
2000
14 years 11 months ago
2000
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...
CSR
2008
Springer
14 years 11 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
HPDC
2006
IEEE
15 years 3 months ago
2006
IEEE
High performance application development remains challenging, particularly for scientists making the transition to a Grid environment. In general areas of computing, virtual envir...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...