3994 search results - page 39 / 799 » A Linear Logical Framework |
116
Voted
STACS
1999
Springer
15 years 4 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
111
Voted
TCS
2010
14 years 10 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
95
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we present a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
93
Voted
LICS
1994
IEEE
15 years 4 months ago
1994
IEEE
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
CSL
2010
Springer
15 years 1 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...