Georges Gonthier, Martin Abadi, and Jean-Jacques Levy. Linear logic without boxes. 1992 IEEE Symposium on Logic in Computer Science, pp. 223-234. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) (Correct)
....almost all the work is carried out by structural rules. In fact, a reinterpretation of the main theorem gives bounds on the complexity of cut elimination in multiplicative exponential linear logic (mell) and in particular, an understanding of the linear logic without boxes formalism in [GAL92b], since that logic is a close analogue of simply typed lambda calculus. The lower bound characterizes the work that must be done by any technology which implements L evy s notion of optimal reduction. However, in the signi cant case of Lamping s solution, we can also make some important remarks ....
.... b = 3 p ) In [LM96] a set of terms was constructed where b = 1 2 p ) We remark also that the Main Theorem gives bounds on the complexity of cut elimination in multiplicativeexponential linear logic (mell) and in particular, an understanding of the linear logic without boxes formalism in [GAL92b]. In proof nets for linear logic (see, for example, Laf95, AG98] the times and par connectives of linear logic play essentially the same role as apply and nodes in calculus; the programming synchronization implemented by the closure has its counterpart in proof net boxes. Just as Lamping s ....
Georges Gonthier, Martin Abadi, and Jean-Jacques Levy. Linear logic without boxes. 1992 IEEE Symposium on Logic in Computer Science, pp. 223-234.
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) (Correct)
....that transcends the particularities of his implementation technology. A reinterpretation of the main theorem gives bounds on the complexity of cut elimination in multiplicativeexponential linear logic (mell) and in particular, an understanding of the linear logic without boxes formalism in [GAL92b], since that logic is a close analogue of simply typed lambda calculus. In the significant case of Lamping s solution, we can also make some important remarks addressing how work done by fi reduction is translated into equivalent work carried out by his bookkeeping nodes. We identify the ....
.... p ) In [LM96] a set of terms was constructed where b = Omega Gamma1 2 p ) The Main Theorem also gives bounds on the complexity of cut elimination in multiplicative exponential linear logic (mell) and in particular, an understanding of the linear logic without boxes formalism in [GAL92b]. In proof nets for linear logic (see, for example, Laf95, AG97] the times and par connectives of linear logic play essentially the same role as apply and nodes in calculus; the programming synchronization implemented by the closure has its counterpart in proof net boxes. Just as Lamping s ....
Georges Gonthier, Martin Abadi, and Jean-Jacques L'evy. Linear logic without boxes. 1992 IEEE Symposium on Logic in Computer Science, pp. 223--234.
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) (Correct)
....almost all the work is carried out by structural rules. In fact, a reinterpretation of the main theorem gives bounds on the complexity of cut elimination in multiplicative exponential linear logic (mell) and in particular, an understanding of the linear logic without boxes formalism in [GAL92b], since that logic is a close analogue of simply typed lambda calculus. The lower bound characterizes the work that must be done by any technology which implements L evy s notion of optimal reduction. However, in the significant case of Lamping s solution, we can also make some important remarks ....
.... In [LM96] a set of terms was constructed where b = Omega Gamma1 2 p ) We remark also that the Main Theorem gives bounds on the complexity of cut elimination in multiplicativeexponential linear logic (mell) and in particular, an understanding of the linear logic without boxes formalism in [GAL92b]. In proof nets for linear logic (see, for example, Laf95, AG97] the times and par connectives of linear logic play essentially the same role as apply and nodes in calculus; the programming synchronization implemented by the closure has its counterpart in proof net boxes. Just as Lamping s ....
Georges Gonthier, Martin Abadi, and Jean-Jacques L'evy. Linear logic without boxes. 1992 IEEE Symposium on Logic in Computer Science, pp. 223--234.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC