Results 11  20
of
296,198
On the Semantic Readings of ProofNets
, 1996
"... . The goal of this paper is to demonstrate how the very rich notion of proofnet may be used, in the framework of categorial grammars, as a unique structure that allows the syntactic and semantic aspects of sentence analysis to be uniøed. We ørst explain how the intuitionistic multiplicative proofne ..."
Abstract
 Add to MetaCart
. The goal of this paper is to demonstrate how the very rich notion of proofnet may be used, in the framework of categorial grammars, as a unique structure that allows the syntactic and semantic aspects of sentence analysis to be uniøed. We ørst explain how the intuitionistic multiplicative proofnets
Proof nets, Garbage, and Computations
, 1997
"... We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty isin a complete set of rewriting rules for cutelimination in presence of weakening (which requires garbage collection). The proposed reduction s ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty isin a complete set of rewriting rules for cutelimination in presence of weakening (which requires garbage collection). The proposed reduction
PROOF NET EDITOR
"... Abstract: Linear logic (LL) [9], [10](see Appendix A, B) is the logical foundation of some typetheoretic languages and also of environments for specification and theorem proving. In this paper, we consider the Multiplicative fragment of Linear Logic (MLL) from an automated deduction point of view. W ..."
Abstract
 Add to MetaCart
. We propose an automated deduction (Automatic Proof Nets Construction and its implementation) based on the notation of Proof net [Gir1995b], that is a semantic structure from which one can give a counterpart of natural deduction in linear logic. Proof nets can be also seen as a multiple conclusion
ProofNets And Dependencies
, 1992
"... ProofNets (Roorda 1990) are a good device for processing with categorial grantmars. mainly because they avoid spurious ambiguities. Nevertheless, they do not provide easily readable structures and they hide the true proximity between Cate8orial Grammars and Dependency Graramars. We give here an oth ..."
Abstract
 Add to MetaCart
ProofNets (Roorda 1990) are a good device for processing with categorial grantmars. mainly because they avoid spurious ambiguities. Nevertheless, they do not provide easily readable structures and they hide the true proximity between Cate8orial Grammars and Dependency Graramars. We give here
Proof Nets for Structured Resources
, 1998
"... In this paper we present proof nets for the pure residuation logic NL#, the nonassociative Lambek calculus augmented with a pair of unary multiplicatives #, #. The system NL# occupies a central place in the categorial landscape in that systems like L, NLP, LP (=MLL) are reachable from it in term ..."
Abstract
 Add to MetaCart
In this paper we present proof nets for the pure residuation logic NL#, the nonassociative Lambek calculus augmented with a pair of unary multiplicatives #, #. The system NL# occupies a central place in the categorial landscape in that systems like L, NLP, LP (=MLL) are reachable from
ProofNets And Dependencies
 In Proc. of COLING92
, 1992
"... ProofNets (Roorda 1990) are a good device for processing with categorial grammars, mainly because they avoid spurious ambiguities. Nevertheless, they do not provide easily readable structures and they hide the true proximity between Categorial Grammars and Dependency Grammars. We give here an other ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
ProofNets (Roorda 1990) are a good device for processing with categorial grammars, mainly because they avoid spurious ambiguities. Nevertheless, they do not provide easily readable structures and they hide the true proximity between Categorial Grammars and Dependency Grammars. We give here
Concurrent Construction of ProofNets
, 2003
"... The functional paradigm of computation has been widely investigated and given a solid mathematical foundation, initiated with the CurryHoward isomorphism, then elaborated and extended in multiple ways. However, this paradigm is inadequate to capture many useful programming intuitions, arising in pa ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
proofnet construction in Linear Logic, offers the adequate basis for our purpose. We outline the relation, which is of the same nature as the CurryHoward isomorphism, between transactional concepts and mechanisms on one hand, and proofnet construction on the other. Finally, we describe an algorithm
Proofnets and the Hilbert space
 Advances in Linear Logic
, 1995
"... Girard's execution formula (given in [Gir88a]) is a decomposition of usual fireduction (or cutelimination) in reversible, local and asynchronous elementary moves. It can easily be presented, when applied to a term or a net, as the sum of maximal paths on the term/net that are not cancelled ..."
Abstract

Cited by 68 (3 self)
 Add to MetaCart
by the algebra L (as was done in [Dan90, Reg92]). It is then natural to ask for a characterization of those paths, that would be only of geometric nature. We prove here that they are exactly those paths that have residuals in any reduct of the term/net. Remarkably, the proof puts to use for the first time
Focusing and ProofNets in Linear . . .
 PROCEEDINGS OF 6TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING AND AUTOMATED REASONING
, 1999
"... Linear Logic [4] has raised a lot of interest in computer research, especially because of its resource sensitive nature. One line of research studies proof construction procedures and their interpretation as computational models, in the "Logic Programming" tradition. An efficient proof s ..."
Abstract
 Add to MetaCart
search procedure, based on a proof normalization result called "Focusing", has been described in [2]. Focusing is described in terms of the sequent system of commutative Linear Logic, which it refines in two steps. It is shown here that Focusing can also be interpreted in the proofnet
Proof Nets and the Identity of Proofs
, 2006
"... These are the notes for a 5lecturecourse given at ESSLLI 2006 in Malaga, Spain. The URL ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
These are the notes for a 5lecturecourse given at ESSLLI 2006 in Malaga, Spain. The URL
Results 11  20
of
296,198