Barber, A., Dual intuitionistic linear logic, Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University of Edinburgh (1996). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Explicit Substitutions for Linear Logical Frameworks.. - Cervesato, de Paiva.. (1999) (Correct)
....authors of this paper have separately explored this possibility in two distinct settings: In [6] Ghani, de Paiva, and Ritter have designed the language xDILL, geared towards the implementation of functional languages. It is based on Barber and Plotkin s DILL (Dual Intuitionistic Linear Logic) [2], and is characterized, among other things, by variables of two di erent kinds: linear variables are used exactly once, and intuitionistic variables can be accessed arbitrarily many times. The extra information about usage of linear variables makes it possible to apply various optimizations like ....
....addressing these issues more satisfactorily (Section 5) 2 LLF The calculus LLF , that we use as our starting point, enriches the simply typed fragment of the language of the linear logical framework LLF [4] with multiplicative pairs and unit. On the other hand, it extends the language DILL [2, 6] with additives and with intuitionistic functions, but sacri ces its full edged exponential . LLF is de ned as follows: Types: A : a j j A 1 A 2 j 1 j A 1 A 2 j A 1 A 2 j A 1 A 2 Terms: M : x j hi j hM 1 ; M 2 i j fst M j snd M j j let M 1 be in M 2 j M 1 M 2 j ....
Andrew Barber. Linear Type Theories, Semantics and Action Calculi. PhD thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1997.
Call-by-Need Splits the Mode! - Maraist (1993) (Correct)
....reduction and standard reduction. Related Work. Several approaches to the integration of concepts from linear logic and the original Girard translations into the lambda calculus have been presented, including comments in Girard s original paper on linear logic (1987) the work of Abramsky (1993) Barber (1996), Benton, Bierman, de Paiva and Hyland (1992; 1995; 1994a; 1994b) Brauner (1996) della Rocca and Roversi (1994) and Wadler (1990; 1993) and our previous work (Maraist et al. in press; Maraist, 1997) which is the specific framework we extend here. In a study of the proof theory of the ....
....not occur, from intuitionistic assumptions, which allow both, by marking groups of assumptions with I l and I i , respectively. The elegance of such a duality of assumptions has been noted for full linear logic in general by Girard (1993) and for the intuitionistic fragment in particular by Barber (1996). Then the implicit occurrences of weakening and contraction are allowed only for assumptions tagged I i : in the axioms no unused I l tagged assumptions are allowed; in the Elimination rules separate groups of assumptions binding different variables must be used in the two judgements above ....
A. Barber, Dual intuitionistic linear logic (Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Science, University of Edinburgh, 1996).
A Linear Spine Calculus - Cervesato, Pfenning (2001) (1 citation) Self-citation (Linear) (Correct)
No context found.
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, 1996.
A Linear Spine Calculus - Iliano Cervesato Advanced Self-citation (Linear) (Correct)
No context found.
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, 1996.
Linear Higher-Order Pre-Unification - Iliano Cervesato And Self-citation (Linear) (Correct)
No context found.
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, 1996.
The Logical Meeting Point of Multiset Rewriting and Process.. - Cervesato (2004) (3 citations) Self-citation (Report) (Correct)
No context found.
A. Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University of Edinburgh, 1996.
Linear Higher-Order Pre-Unification - Cervesato, Pfenning (1997) (2 citations) Self-citation (Linear) (Correct)
No context found.
A. Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, Sept. 1996.
A Linear Spine Calculus - Iliano Cervesato Advanced (2003) (1 citation) Self-citation (Linear) (Correct)
No context found.
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, 1996.
Linear Higher-Order Pre-Unification - Iliano Cervesato And (1997) (2 citations) Self-citation (Linear) (Correct)
No context found.
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, September 1996.
A Linear Spine Calculus - Iliano Cervesato And (2003) (1 citation) Self-citation (Linear) (Correct)
No context found.
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, 1996.
A Linear Spine Calculus - Cervesato, Pfenning (2003) (1 citation) Self-citation (Linear) (Correct)
No context found.
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, 1996.
A Linear Spine Calculus - Cervesato, Pfenning (2003) (1 citation) Self-citation (Linear) (Correct)
....linear logical framework LLF [Cer96, CP96] is also the simply typed variant of the term language of LLF. Its theoretical relevance derives from the fact that it is the biggest linear calculus that admits unique long normal forms. shares similarities with the calculus proposed in [Bar96] and with the term language of the system RLF [IP98] The implementation of a language based on linear type theories such as LLF and RLF raises new challenges that do not emerge neither for non linear languages such as Twelf [PS99] nor in linear logic programming languages featuring plain ....
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, 1996.
A Linear Spine Calculus - Cervesato, Pfenning (2003) (1 citation) Self-citation (Linear) (Correct)
....logical framework LLF [Cer96, CP96] is also the simply typed variant of the term language of LLF. Its theoretical relevance derives from the fact that it is the biggest linear calculus that admits unique long normal forms. shares similarities with the calculus proposed in [Bar96] and with the term language of the system RLF [IP98] The implementation of a language based on linear type theories such as LLF and RLF raises new challenges that do not emerge neither for non linear languages such as Twelf [PS99] nor in linear logic programming languages featuring plain ....
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, 1996.
Separating Weakening and Contraction in a Linear Lambda Calculus - Maraist (1996) (1 citation) Self-citation (Linear) (Correct)
....Related work. Several approaches to the integration of concepts from linear logic and the original Girard translations into the lambda calculus have been presented, including (but not exhaustively) comments in Girard s original paper on linear logic [13] the work of Abramsky [1] Barber [4], Benton, Bierman, de Paiva and Hyland [6 9] Brauner [10] della Rocca and Roversi [26] and Wadler [28, 29] and our previous work [20, 22] which is the basis for the present work. All of these approaches have used a single mode for enabling both weakening and contraction. In the three ....
....abstractions and applications, can be prefixed, or be an eliminator to access the body of such a prefixed subterm. This system is discussed in detail by Wadler [29] and in our previous work [22] although we have used a simpler formulation of the typing rules in the manner of Barber s DILL system [4], and adapted Jacobs notation for typing assumptions [16] We distinguish linear typing assumptions, on which weakening and contraction may not occur, from intuitionistic assumptions, which allow both, by marking groups of assumptions with I l and I i , respectively. The elegance of such a ....
[Article contains additional citation context not shown here]
A. Barber, Dual intuitionistic linear logic (Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Science, University of Edinburgh, 1996).
Linear Higher-Order Pre-Unification - Iliano Cervesato, Frank Pfenning (1997) (2 citations) Self-citation (Linear) (Correct)
.... of intuitionistic linear logic freely generated from the connectives , Gammaffi, and , which constitutes the propositional core of Lolli [HM94] and LLF [CP96] Gammaffi is also the simply typed variant of the term language of LLF and shares similarities with the calculus proposed in [Bar96]. Its theoretical relevance derives from the fact that it is the largest linear calculus that admits unique long fij normal forms. The principal contributions of this work are: 1) a first solution to the problem of linear higher order unification, currently a major obstacle to the implementation ....
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, September 1996.
Linear Higher-Order Pre-Unification - Iliano Cervesato, Frank Pfenning (1997) (2 citations) Self-citation (Linear) (Correct)
.... of intuitionistic linear logic freely generated from the connectives , Gammaffi, and , which constitutes the propositional core of Lolli [15] and LLF [4] Gammaffi is also the simply typed variant of the term language of LLF and shares similarities with the calculus proposed in [1]. Its theoretical relevance derives from the fact that it is the largest linear calculus that admits unique long fij normal forms. The principal contributions of this work are: 1) a first solution to the problem of linear higher order unification, currently a major obstacle to the implementation ....
A. Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, Sept. 1996.
A Linear Spine Calculus - Iliano Cervesato, Frank Pfenning (1997) (1 citation) Self-citation (Linear) (Correct)
....LLF [Cer96, CP96] Gammaffi is also the simply typed variant of the term language of LLF . Its theoretical relevance derives from the fact that it is the biggest linear calculus that admits unique long fij normal forms. Gammaffi shares similarities with the calculus proposed in [Bar96] and with the term language of the system RLF [IP96] The implementation of a language based on a linear type theories such as LLF and RLF raises new challenges that do not emerge neither for intuitionistic languages such as Elf [Pfe94] nor in linear logic programming languages featuring plain ....
Andrew Barber. Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University if Edinburgh, 1996.
Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006) (Correct)
No context found.
Barber, A., Dual intuitionistic linear logic, Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University of Edinburgh (1996).
Grail: A Functional Form for Imperative Mobile Code - Beringer, MacKenzie, Stark (2003) (1 citation) (Correct)
No context found.
Barber, A., Dual intuitionistic linear logic, Technical Report ECS-LFCS-96347, Laboratory for Foundations of Computer Science, University of Edinburgh (1996).
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