46 citations found. Retrieving documents...
Gavin M. Bierman, On intuitionistic linear logic, Ph.D. thesis, University of Cambridge, 1994.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents

About Translations of Classical Logic into Polarized Linear.. - Laurent, Regnier   (Correct)

....will also denote der A : A A and dig A : A A the dual natural transformations associated to the comonad . The property that U C has a left adjoint makes C a Lafont category [14] A detailed proof that Lafont s categories are sound models of linear logic has been produced by Bierman (see [3, 4]) It uses some interesting consequences of the existence of an adjunction among which: for any pair of objects A and B we have (A B) A P B. Any P monoid N is a algebra and any P morphism is a algebra morphism, that is, there is a P morphism alg N : N , natural in N and ....

G. Bierman. On Intuitionistic Linear Logic. PhD thesis, University of Cambridge, Computer Laboratory, 1993.


A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models.. - Benton (1994)   (1 citation)  (Correct)

....Taking the previous lemmas together, we have shown Corollary 8 Any LNL model is a linear category. 2 2.2.2 Linear Category Implies LNL model In this section we sketch the proof of the converse to Corollary 8. Whilst this is largely a matter of recalling results which were proved in [BBHdP92] and [Bie94a], by doing this carefully we obtain a slightly better understanding of the situation. Assume that L is a linear category as in De nition 10. We need to show that this gives rise to a CCC C and a symmetric monoidal adjunction between L and C as in De nition 9. Recall that the comonad on L gives ....

....why the Eilenberg Moore category should be cartesian closed, since there is no reason why it should have an internal hom for arbitrary pairs of coalgebras. There are extra conditions which are sucient to ensure that this does happen, such as requiring that L have equalisers of core exive pairs [Bie94a] or simply all equalisers [Jac93] Although there are non trivial examples in which such conditions hold, we shall not consider them further since we can nd an appropriate CCC without them. Lemma 10 In L , all the free coalgebras are exponentiable. That is, there is an internal hom into any free ....

[Article contains additional citation context not shown here]

G. M. Bierman. On intuitionistic linear logic (revised version of PhD thesis) . Technical Report 346, Computer Laboratory, University of Cambridge, August 1994.


A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003)   (1 citation)  (Correct)

....computation has an asymmetry between a function s arguments and the value it returns. Logic programming maintains an asymmetry between the program and the goal. Intuitionistic versions of linear logic have been used to explore interesting phenomena in functional computation (see, for example, [18, 1, 6, 28, 15, 2, 5]) logic programming [14] and logical frameworks [9] In this paper, we analyze linear logic in an inherently asymmetric natural deduction formulation following Martin L of s methodology of separating judgments from propositions [19] We require minimal judgmental notions linear hypothetical ....

G. Bierman. On Intuitionistic Linear Logic. PhD thesis, University of Cambridge, 1994.


A judgmental analysis of linear logic - Bor-Yuh Evan Chang   (Correct)

No context found.

Gavin M. Bierman, On intuitionistic linear logic, Ph.D. thesis, University of Cambridge, 1994.


A Judgmental Analysis of Linear Logic - Bor-Yuh Evan Chang (2003)   (1 citation)  (Correct)

No context found.

Gavin M. Bierman, On intuitionistic linear logic, Ph.D. thesis, University of Cambridge, 1994.


A Judgmental Analysis Of Linear Logic - Bor-Yuh Evan Chang (2003)   (1 citation)  (Correct)

No context found.

Gavin M. Bierman, On intuitionistic linear logic, Ph.D. thesis, University of Cambridge, 1994.


Electronic Notes in Computer Science 1 (1995) - On Modal Calculus (1995)   (4 citations)  (Correct)

No context found.

Gavin Bierman. On Intuitionistic Linear Logic. PhD thesis, University of Cambridge Computer Laboratory, December 1993.


Categorical Models Of Linear Logic Revisited - Mellies (2002)   (7 citations)  (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. PhD thesis. University of Cambridge, August 1994.


A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003)   (1 citation)  (Correct)

No context found.

Gavin M. Bierman, On intuitionistic linear logic, Ph.D. thesis, University of Cambridge, 1994.


Unknown - Linear Logic Programming   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


Termination - As The Example   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


Unknown - Linear Type Theory   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


For the Completness Direction We Need to Generalize the.. - Theorem Completeness Of   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


Unknown - Linear Calculus In   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


Call-by-Name, Call-by-Value, Call-by-Need, and the Linear.. - Maraist, Odersky, al. (1995)   (1 citation)  (Correct)

No context found.

G. Bierman, On Intuitionistic Linear Logic. Technical report 346, Computing Laboratory, University of Cambridge, August 1994.


Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole (2001)   (Correct)

No context found.

G. M. Bierman. On Intuitionistic Linear Logic. PhD thesis, University of Cambridge Computer Laboratory, 1993.


Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole   (Correct)

No context found.

G. M. Bierman. On Intuitionistic Linear Logic. PhD thesis, University of Cambridge Computer Laboratory, 1993.


A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003)   (1 citation)  (Correct)

No context found.

Gavin M. Bierman, On intuitionistic linear logic, Ph.D. thesis, University of Cambridge, 1994.


Unknown - Linear Logic Programming   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


Unknown - Linear Type Theory   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


A Judgmental Analysis of Linear Logic - Chang, Chaudhuri, Pfenning (2003)   (1 citation)  (Correct)

No context found.

Gavin M. Bierman, On intuitionistic linear logic, Ph.D. thesis, University of Cambridge, 1994.


Unknown - Linear Calculus In   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


For the Completness Direction We Need to Generalize the.. - Theorem Completeness Of   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


Linear Type Checking - The Typing Rules   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.


Termination - As The Example   (Correct)

No context found.

G. Bierman. On intuitionistic linear logic. Technical Report 346, University of Cambridge, Computer Laboratory, August 1994. Revised version of PhD thesis.

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