30 search results - page 1 / 6 » From Proof Nets to the Free *-Autonomous Category |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
CICLING
2004
Springer
13 years 10 months ago
2004
Springer
: Syntactic disambiguation frequently requires knowledge of the semantic categories of nouns, especially in languages with free word order. For example, in Spanish the phrases pint...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
TLCA
2009
Springer
13 years 11 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...
IACR
2011
12 years 4 months ago
2011
The contribution of this paper is twofold. First we present a new simple electronic voting scheme having standard re-encryption mix net back-end, which allows to cast a ballot and ...