Classical linear logic of implications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2471, Issue , 2002, Pages 458-472

  Hasegawa, Masahito ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; LINEAR ALGEBRA;

AUTONOMOUS CATEGORIES; AXIOMATIZATION; CLASSICAL LINEAR LOGIC; COMONADS; LINEAR IMPLICATIONS; S-SYSTEMS; SOUND AND COMPLETE; THEORETIC MODEL;

COMPUTER CIRCUITS;

EID: 33750693607     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45793-3_31     Document Type: Conference Paper

References (24)

1. [1] Barber, A. (1997) Linear Type Theories, Semantics and Action Calculi. PhD Thesis ECS-LFCS-97-371, University of Edinburgh.
2. [2] Barber, A. and Plotkin, G. (1997) Dual intuitionistic linear logic. Submitted. An earlier version available as Technical Report ECS-LFCS-96-347, LFCS, University of Edinburgh.
3. [3] Barr, M. (1979) ∗-Autonomous Categories. Springer Lecture Notes in Math. 752.
4. [4] Barr, M. (1991) ∗-autonomous categories and linear logic. Math. Struct. Comp. Sci. 1, 159–178.
5. [5] Benton, P.N. (1995) A mixedlin ear and non-linear logic: proofs, terms and models (extended abstract). In Computer Science Logic (CSL’94), Springer Lecture Notes in Comput. Sci. 933, pp. 121–135.
6. [6] Berdine, J., O’Hearn, P.W., Reddy, U. S. and Thielecke, H. (2001) Linearly used continuations. In Proc. ACM SIGPLAN Workshop on Continuations (CW’01), Technical Report No. 545, Computer Science Department, Indiana University, pp. 47–54.
7. [7] Bierman, G.M. (1995) What is a categorical model of intuitionistic linear logic? In Proc. Typed Lambda Calculi and Applications (TLCA’95), Springer Lecture Notes in Comput. Sci. 902, pp. 78–93.
8. [8] Bierman, G.M. (1999) A classical linear lambda-calculus. Theoret. Comp. Sci. 227(1-2), 43–78.
9. [9] Filinski, A. (1992) Linear continuations. In Proc. Principles of Programming Languages (POPL’92), pp. 27–38.
10. [10] Girard, J.-Y. (1987) Linear logic. Theoret. Comp. Sci. 50, 1–102.
11. [11] Hasegawa, M. (1999) Logical predicates for intuitionistic linear type theories. In Proc. Typed Lambda Calculi and Applications (TLCA’99), Springer Lecture Notes in Comput. Sci. 1581, pp. 198–213.
12. [12] Hasegawa, M. (2000) Girard translation and logical predicates. J. Funct. Programming 10(1), 77–89.
13. [13] Hasegawa, M. (2002) Linearly used effects: monadic and CPS transformations into the linear lambda calculus. In Proc. Functional and Logic Programming (FLOPS2002), Springer Lecture Notes in Comput. Sci.
14. [14] Hofmann, M., Pavlović, D. and Rosolini, P. (eds.) (1999) Proc. 8th Conf. on Category Theory and Computer Science. Electron. Notes Theor. Comput. Sci. 29.
15. [15] Hyland, M. and Schalk, A. (200x) Glueing and orthogonality for models of linear logic. To appear in Theoret. Comp. Sci.
16. [16] Kelly, G.M. and Mac Lane, S. (1971) Coherence in closed categories. J. Pure Appl. Algebra 1(1):97–140.
17. [17] Koh, T.W. and Ong, C.-H. L. (1999) Explicit substitution internal languages for autonomous and ∗-autonomous categories. In [14].
18. [18] Maietti, M.E., de Paiva, V. and Ritter, E. (2000) Categorical models for intuitionistic and linear type theory. In Foundations of Software Science and Computation Structure (FoSSaCS 2000), Springer Lecture Notes in Comput. Sci. 1784, pp. 223–237.
19. [19] Murawski, A. S. and Ong, C.-H. L. (1999) Exhausting strategies, Joker games andIM LL with units. In [14].
20. [20] Nishizaki, S. (1993) Programs with continuations and linear logic. Science of Computer Programming 21(2), 165–190.
21. [21] Parigot, M. (1992) λμ-calculus: an algorithmic interpretation of classical natural deduction. In Proc. Logic Programming and Automated Reasoning, Springer Lecture Notes in Comput. Sci. 624, pp. 190–201.
22. [22] Plotkin, G. (1993) Type theory and recursion (extended abstract). In Proc. Logic in Computer Science (LICS’93), pp. 374.
23. [23] Streicher, T. (1999) Denotational completeness revisited. In [14].
24. [24] Wadler, P. (1990) Linear types can change the world! In Proc. Programming Concepts and Methods, North-Holland, pp. 561–581.