Coherence completions of categories and their enriched softness

Electronic Notes in Theoretical Computer Science

Volumn 6, Issue , 1997, Pages 174-190

  Hu, Hongde ^a   Joyal, André ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; LOGIC PROGRAMMING; MATHEMATICAL MODELS; SEMANTICS; TENSORS; THEOREM PROVING;

COHERENCE COMPLETIONS; GIRARD'S COHERENCE SPACES; LINEAR LOGIC; WHITMAN'S CONDITION;

LINEAR PROGRAMMING;

EID: 0002434399     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80162-8     Document Type: Conference Paper

References (36)

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