Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the Fourth International Conference on Typed Lambda Calculi and Applications (TLCA'99), l'Aquila, Italy, April 1999. Springer-Verlag LNCS. To appear. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
There and Back Again - Danvy, Goldberg (2001) (Correct)
....them (in the sense of John Reynolds [6, 14] readily shows that in e#ect both solutions construct an intermediate copy of the reversed words, as in the traditional solution. It would take an optimizing compiler to detect that the list constructors and the continuations are ordered linearly [7, 13, 17] and thus that they can be allocated LIFO. In contrast, the direct style version only uses cons to construct the result, and all its intermediate results are held on the control stack if one uses Chez Scheme (http: www.scheme.com) OCaml (http: caml.inria.fr) or another derivative of ALGOL 60. ....
Je# Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In Jean-Yves Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications, number 1581 in Lecture Notes in Computer Science, pages 295--309, L'Aquila, Italy, April 1999. Springer-Verlag.
Natural Deduction for Intuitionistic Non-Commutative Linear.. - Polakow, Pfenning (1999) (18 citations) Self-citation (Polakow Pfenning) (Correct)
No context found.
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the Fourth International Conference on Typed Lambda Calculi and Applications (TLCA'99), l'Aquila, Italy, April 1999. Springer-Verlag LNCS. To appear.
Relating Natural Deduction and Sequent Calculus for.. - Polakow, Pfenning (1999) (10 citations) Self-citation (Polakow Pfenning) (Correct)
No context found.
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the Fourth International Conference on Typed Lambda Calculi and Applications (TLCA'99), l'Aquila, Italy, April 1999. Springer-Verlag LNCS. To appear.
Ordered Linear Logic Programming - Jeff Polakow And Self-citation (Polakow Pfenning) (Correct)
No context found.
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 295--309, L'Aquila, Italy, April 1999. Springer-Verlag LNCS 1581.
Properties of Terms in Continuation-Passing Style - In An Ordered Self-citation (Polakow Pfenning) (Correct)
No context found.
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 295--309, L'Aquila, Italy, April 1999. Springer-Verlag LNCS 1581.
On Equivalence and Canonical Forms - In The Lf (1999) Self-citation (Pfenning) (Correct)
No context found.
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 295--309, L'Aquila, Italy, April 1999. Springer-Verlag LNCS 1581.
On Equivalence and Canonical Forms - In The Lf Self-citation (Pfenning) (Correct)
No context found.
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 295--309, L'Aquila, Italy, April 1999. Springer-Verlag LNCS 1581.
Ordered Linear Logic Programming - Polakow, Pfenning (1998) (2 citations) Self-citation (Polakow Pfenning) (Correct)
No context found.
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the Fourth International Conference on Typed Lambda Calculi and Applications (TLCA'99), l'Aquila, Italy, April 1999. Springer-Verlag LNCS. To appear.
Properties of Terms in Continuation-Passing Style in an.. - Polakow, Pfenning (2000) (16 citations) Self-citation (Polakow Pfenning) (Correct)
No context found.
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 295--309, L'Aquila, Italy, April 1999. Springer-Verlag LNCS 1581.
Linearity Constraints as Bounded Intervals in Linear Logic.. - Polakow Self-citation (Polakow) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the Fourth International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 295--309, l'Aquila, Italy, Apr. 1999. Springer-Verlag LNCS 1581.
A Type Theory for Memory Allocation and Data Layout - Leaf Petersen Robert (2003) (8 citations) Self-citation (Pfenning) (Correct)
No context found.
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 295--309, L'Aquila, Italy, April 1999. Springer-Verlag LNCS 1581.
A Type Theory for Memory Allocation and Data Layout - Petersen, Harper, Crary.. (2003) (8 citations) Self-citation (Pfenning) (Correct)
....of the frontier can persist across the evaluation of any term that might reserve or allocate memory. 3 Ordered linear type theory Ordered (or non commutative) linear logic is a variant of standard linear logic in which hypotheses must not only be used exactly once, but must also be used in order [17, 16, 18, 15]. The corresponding proof terms make up an ordered lambda calculus that is characterized by the lack of an exchange property for the ordered context in addition to the usual linearity restrictions. We present a small fragment of the ordered lambda calculus by way of introduction to the these ....
.... an object into the heap before we can initialize other objects with a pointer to it, which prevents some useful optimizations such as the destination passing style optimization [8] 7 Related work Ordered logic and ordered type theory have been explored extensively by Pfenning and Polakow [16, 15]. There is a significant amount of previous work applying ordinary linear type theory to memory management [1, 22, 5, 7] but none of it addresses (nor is intended to address) the question of separating out allocation and initialization, and of giving a foundational account of data layout. The ....
Jeff Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 295--309, L'Aquila, Italy, April 1999. Springer-Verlag LNCS 1581.
A Type Theory for Memory Allocation and Data Layout.. - Petersen, Harper.. (2002) (8 citations) Self-citation (Pfenning) (Correct)
....of the frontier can persist across the evaluation of any term that might reserve or allocate memory. 3 Ordered linear type theory Ordered (or non commutative) linear logic is a variant of standard linear logic in which hypotheses must not only be used exactly once, but must also be used in order [18, 17, 19, 16]. The corresponding proof terms make up an ordered lambda calculus that is characterized by the lack of an exchange property for the ordered context in addition to the usual linearity restrictions. We present a small fragment of the ordered lambda calculus by way of introduction to the these ....
.... an object into the heap before we can initialize other objects with a pointer to it, which prevents some useful optimizations such as the destination passing style optimization [10] 7 Related work Ordered logic and ordered type theory have been explored extensively by Pfenning and Polakow [18, 17, 16]. Among their results include an account of various implementation properties of CPS terms [19] given in terms of a linear logical framework. However, to the best of our knowledge, no previous work has been done using ordered type theory for the purposes discussed here. There is a significant ....
Je# Polakow and Frank Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 295--309, L'Aquila, Italy, April 1999. Springer-Verlag LNCS 1581.
The Logical Approach to Stack Typing - Ahmed, Walker (2003) (7 citations) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Typed Lambda Calculi and Applications, volume 1581 of Lecture Notes in Computer Science, pages 295--309, Berlin, 1999. Springer-Verlag.
Reasoning about Hierarchical Storage - Amal Ahmed Limin (2003) (4 citations) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Typed Lambda Calculi and Applications, volume 1581 of Lecture Notes in Computer Science, pages 295--309, Berlin, 1999. Springer-Verlag.
Selective Memoization - Umut Acar Guy (2003) (1 citation) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 130-- 144. Springer-Verlag LNCS 1581, 1999.
Some Theory and Applications of Linear Logic - Cs Project Report (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In Typed Lambda Calculi and Applications, pages 295-309, 1999.
Selective Memoization - Acar, Blelloch, Harper (2003) (1 citation) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 130-- 144. Springer-Verlag LNCS 1581, 1999.
Constraint Based Proof Construction in Non-Commutative Logic - Jean-Marc Andreoli Roberto (2001) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In Proc. TLCA'99, Springer LNCS 1581, 1999.
Proof Construction and Non-Commutativity: a Cluster Calculus - Faggian (2000) (5 citations) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In Proc. TLCA'99, Springer LNCS 1581, 1999.
Reasoning about Hierarchical Storage - Amal Ahmed Limin (2003) (4 citations) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Typed Lambda Calculi and Applications, volume 1581 of Lecture Notes in Computer Science, pages 295--309, Berlin, 1999. Springer-Verlag.
On Bunched Typing - Peter Hearn Department (2002) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic noncommutative linear logic. In Typed -calculus and Applications , J-Y Girard editor, LNCS 1581., 1999.
The Logical Approach to Stack Typing - Ahmed, Walker (2003) (7 citations) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Typed Lambda Calculi and Applications, volume 1581 of Lecture Notes in Computer Science, pages 295--309, Berlin, 1999. Springer-Verlag.
Selective Memoization - Umut Acar Guy (2003) (1 citation) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 130-- 144. Springer-Verlag LNCS 1581, 1999.
Selective Memoization - Acar, Blelloch, Harper (2003) (1 citation) (Correct)
No context found.
J. Polakow and F. Pfenning. Natural deduction for intuitionistic non-commutative linear logic. In J.-Y. Girard, editor, Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications (TLCA'99), pages 130-- 144. Springer-Verlag LNCS 1581, 1999.
First 50 documents
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