Coherence completions of categories

Theoretical Computer Science

Volumn 227, Issue 1-2, 1999, Pages 153-184

  Hu, Hongde ^a   Joyal, Andre ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Coherence completions; Coherence spaces; Free bicompletions; Softness

Indexed keywords

EID: 0008310390     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00051-1     Document Type: Article

References (37)

1. S. Abramsky, R. Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic 59 (1994) 543-574.
2. S. Abramsky, S. Gay, R. Nagarajan, Interaction categories and the foundations of typed concurrent programming, Proc. 1994 Marktoberdorf summer school, Springer, Berlin.
3. M. Barr, *-autonomous categories and linear logic, Math. Struct. Comput. Sci. 1 (1991) 159-179.
4. G. Berry, Stable models of typed lambda-calculi, Lecture Notes in Computer Science, vol. 62, Springer, Berlin, 1978.
5. A. Blass, A game semantics for linear logic, Ann. Pure Appl. Logic 56 (1992) 183-220.
6. J.R.B. Cockett, R.A.G. Seely, Weakly distributive categories, London Math. Soc. Lecture Notes 177 (1992) 45-65.
7. V. de Paiva, The dialectica categories, Conf. on Categories in Computer Sci. and Logic, AMS Contemp. Math 92 (1989) 47-62.
8. T. Ehrhard, Hypercoherences: a strongly stable model of linear logic, Math. Struct. Comput. Sci. 3 (1993) 365-385.
9. R. Freese, J. Jezek, J.B. Nation, Free Lattices, Math. Surveys and Monographs, vol. 42, AMS, Providence, RI, 1995.
10. P. Freyd, Several new concepts: lucid and concordant functors, pre-limits, pre-completeness, the continuous and concordant completions, Springer Lecture Notes in Mathematics, vol. 99, 1969.
11. J.-Y. Girard, Linear logic, Theor. Comput. Sci. 50 (1987) 1-102.
12. J.-Y. Girard, A new constructive logic: classical logic, Math. Struct. Comput. Sci. 1 (1991) 255-296.
13. J.-Y. Girard, Linear Logic: its syntax and semantics, LMS Lecture Note, vol. 222, 1995, pp. 1-42.
14. J.-Y. Girard, On denotational completeness (extended abstract), Electronic Notes in Theoretical Computer Sci., vol. 3, 1996.
15. J.-Y. Girard, Coherent Banach Spaces: a continuous denotational semantics (extended abstract), Electronic Notes in Theoretical Computer Sci., vol. 3, 1996.
16. V.N. Grishin, On a generalization of the Ajdukiewicz-Lambek system, in: Studies in Nonclassical Logics and Formal System, Nauka, Moscow, 1983, pp. 315-241.
17. H. Hu, Dualities for accessible categories, Canadian Math. Soc. Conference Proceedings, vol. 13, AMS providence, RI, 1992, pp. 211-242.
18. H. Hu, W. Tholen, Limits in free coproduct completions, J. Pure and Appl. Algebra 105 (1995) 277-291.
19. M. Hyland, V. de Paiva, Full intuitionistic linear logic (extended abstract), Ann. Pure Appl. Logic 64, (1993) 273-291.
20. A. Joyal, Remarques sur la théorie des jeux a deux personnes, Gazette des sci. math. du Québec 1 (4) (1977) 46-52.
21. A. Joyal, Free bicomplete categories, Math. Rep. XVII (1995) 219-225.
22. A. Joyal, Free bicompletion of enriched categories, Math. Rep. XVII (1995) 213-218.
23. A. Joyal, Free lattices, money games and communication, Proc. 10th Internet. Congress of Logic, Methodology and Philosophy of Sci., Firenze, August 1995.
24. G.M. Kelly, Concepts of Enriched Category Theory, London Math. Soc. Lecture Notes, vol. 64, 1982.
25. Y. Lafont, T. Streicher, Games semantics for linear logic, Proceedings of LICS, vol. 91, pp. 43-50.
26. F. Lamarche, Generalizing coherent domains and hypercoherences, Elcetronic Notes in Theoretical Computer Sci., vol. 1, 1995.
27. J. Lambek, From categorical grammar to bilinear logic, In, Substructural Logics, Oxford Sci. Publications, 1993, pp. 207-237.
28. S. Mac Lane, Categories for the Working Mathematician GTM, vol. 5, Springer, Berlin, 1971.
29. M. Makkai, R. Paré, Accessible Categories, AMS, Comtemp. Math. 104 (1990).
30. G. Plotkin, LCF considered as a programming language, Theor. Comput. Sci. 5 (1977) 223-255.
31. R.A.G. Seely, Linear logic, *-autonoumous categories and cofree coalgebras, Proc. AMS Conf. in Logic and Comp. Sci., 1987, Contemp. Math. 92 (1989) AMS.
32. R.A.G. Seely, Linear logic, *-autonoumous categories and cofree coalgebras, Proc. AMS Conf. in Logic and Comp. Sci., 1987, Contemp. Math. 92 (1989) AMS.
33. A. Scedrov, Linear logic and computation: a survey, Proc. Marktoberdorf Summer School 1993, NATO Adv. Sci. Inst., Series F, Springer, Berlin, 1994, pp. 281-298.
34. D. Scott, Outline of a mathematical theory of computation, Oxford Univ. Programming Research Group, Monograph, vol. 2, 1969.
35. D. Scott, Domains for denotational semantics, Springer Lecture Notes in Computer Sci., vol. 140, 1982.
36. A.S. Troelstra, Lectures on Linear Logic, CSCI Lecture Notes, vol. 29, Center fo the Study of Language and Information, Stanford Univ., 1992.
37. P.M. Whitman, Free lattices, Ann. Math. 42 (1941) 325-330.