Some aspects of categories in computer science

Handbook of Algebra

Volumn 2, Issue , 2000, Pages 3-77

  Scott, P J ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 69049108576     PISSN: 15707954     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1570-7954(00)80027-3     Document Type: Article

References (274)

1. Abadi M., Cardelli L., and Curien P.-L. Formal parametric polymorphism. Theoretical Comp. Sci-ence 121 (1993) 9-58
2. Abramsky S. Computational Interpretations of linear logic. Theoretical Comp. Science 111 (1993) 3-57
3. Oxford. Abramsky S., and Jung A. Domain theory. In: Abramsky S., Gabbay D., Gabbay D., and Maibaum T. (Eds). Handbook of Logic in Computer Science Vol. 3 (1994) 1-168
4. Abramsky S. Retracing some paths in process algebra. In: Montanari U., and Sassone V. (Eds). CONCUR '96. Lecture Notes in Computer Science Vol. 1119 (1996) 1-17
5. Abramsky S. Semantics of interaction: An introduction to game semantics. In: Pitts A., and Dybjer P. (Eds). Semantics and Logics of Computation (1997), Publications of the Newton Institute, Camb. Univ. Press 1-31
6. (To appear in. Abramsky S., Blute R., and Panangaden P. Nuclear and trace ideals in tensored *-categories, Preprint. Journal of Pure and Applied Algebra (1997)
7. In: Abramsky S., Gabbay D., Gabbay D., and Maibaum T. (Eds). Handbook of Logic in Computer Science Vol. 3 (1994)
8. Abramsky S., Gay S., and Nagarajan R. A type-theoretic approach to deadlock-freedom of asynchronous systems. In: Abadi M., and Ito T. (Eds). Theoretical Aspects of Computer Software, TACS'97. Lecture Notes in Computer Science Vol. 1281 (1997)
9. Abramsky S., Honda K., and McCusker G. A fully abstract game semantics for general references. 13th Annual IEEE Symp. on Logic in Computer Science (LICS) (1998), IEEE Press 334-344
10. Abramsky S., and Jagadeesan R. New foundations for the geometry of interaction. Information and Computation 111 1 (1994) 53-119
11. 7th Annual IEEE Symp. on Logic in Computer Science (LICS). IEEE Publications (1992) 211-222
12. Abramsky S., and Jagadeesan R. Games and full completeness theorem for multiplicative linear logic. J. Symbolic Logic 59 2 (1994) 543-574
13. S. Abramsky and G. McCusker, Full abstraction for idealized Algol with passive expressions, to appear in Theoretical Computer Science.
14. Abrusci V.M., and semantics P. sequent calculus for pure noncommutative classical linear propositional logic. J. Symbolic Logic 56 (1991) 1403-1456
15. Alimohamed M. A characterization of lambda definability in categorical models of implicit poly-morphism. Theoretical Comp. Science 146 (1995) 5-23
16. T. Altenkirch, M. Hofmann and T. Streicher, Categorical reconstruction of a reduction-free normalisation proof, Proc. CTCS '95, Lecture Notes in Computer Science, Vol. 953, 182-199.
17. Altenkirch T., Hofmann M., and Streicher T. Reduction-free normalisation for a polymorphic system. Proc. of the 11th Annual IEEE Symposium of Logic in Computer Science (1996) 98-106
18. Amadio R.M., and Curien P.-L. Selected Domains and Lambda Calculi (1998), Camb. Univ. Press
19. A. Asperti, Linear logic, comonads, and optimal reductions, to appear in Fund. Informatica.
20. (Currently out of print but publicly available on the Web.). Asperti A., and Longo G. Categories, Types, and Structures (1991), MIT Press
21. Baez J.C. An introduction to n-categories. In: Moggi E., and Rosolini G. (Eds). Category Theory and Computer Science, CTCS'97. Lecture Notes in Computer Science Vol. 1290 (1997)
22. Baillot P., Danos V., Ehrhard T., and Regnier L. Believe it or not: AJM games model is a model of classical linear logic. 12th Annual IEEE Symp. on Logic in Computer Science (LICS) (1997), IEEE Press
23. Bainbridge E.S. A unified minimal realization theory, with duality. Dissertation (1972), Department of Computer & Communication Sciences, University of Michigan
24. Bainbridge E.S. Addressed machines and duality. In: Manes E. (Ed). Category theory applied to computation and control. Lecture Notes in Computer Science Vol. 25 (1975) 93-98
25. Bainbridge E.S. Feedback, generalized logic. Information and Control 31 (1976) 75-96
26. D. Reidel. Bainbridge E.S. The fundamental duality of system theory, Systems: Approaches, Theories, Applications. In: Hartnett W.E. (Ed) (1977) 45-61
27. Bainbridge E.S., Freyd P., Scedrov A., and Scott P.J. Functorial polymorphism. Theoretical Com-puter Science 70 (1990) 35-64
28. Barendregt H.P. The Lambda Calculus, Studies in Logic Vol. 103 (1984), North-Holland
29. Barendregt H.P. Lambda calculus with types. In: Abramsky S., Gabbay D., and Maibaum T. (Eds). Handbook of Logic in Computer Science Vol. 2 (1992), Oxford Univ. Press
30. Barr M. Autonomous Categories. Lecture Notes in Mathematics Vol. 752 (1979)
31. Barr M. Autonomous categories and linear logic. Math. Structures in Computer Science 1 (1991) 159-178
32. Barr M. Non-symmetric *-autonomous categories. Theoretical Comp. Science 139 (1995) 115-130
33. M. Barr, Appendix to [Blu96](1994).
34. Barr M., and Wells C. Category Theory for Computing Science. 2nd ed. (1995), Prentice-Hall
35. Beeson M. Foundations of Constructive Mathematics (1985), Springer, Berlin
36. Bellucci R., Abadi M., and Curien P.-L. A model for formal parametric polymorphism: A PER interpretation for system R. TLCA'95. Lecture Notes in Computer Science Vol. 902 (1995) 32-46
37. Benson D.B. Bialgebras: Some foundations for distributed and concurrent computation. Fundamenta Informaticae 12 (1989) 427-486
38. Benton B.N., Bierman G., de Paiva V., and Hyland M. Term assignment for intuitionistic linear logic. In: Bezem M., and Groote J.F. (Eds). Proceedings of the International Conference on Typed Lambda Calculi and Applications. Lecture Notes in Computer Science Vol. 664 (1992) 75-90
39. Berger U., and Schwichtenberg H. An inverse to the evaluation functional for typed λ-calculus. Proc. of the 6th Annual IEEE Symposium of Logic in Computer Science (1991) 203-211
40. Beylin I., and Dybjer P. Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids. In: Berardi S., and Coppo M. (Eds). Types for Proofs and Programs, TYPES'95. Lecture Notes in Computer Science Vol. 1158 (1995)
41. Bierman G.M. What is a categorical model of intuitionistic linear logic?. In: DezaniCiancaglini M., and Plotkin G. (Eds). TLCA'95 (1995) 78-93
42. Blass A. A game semantics for linear logic. Annals of Pure and Applied Logic 56 (1992) 183-220
43. Bloom S.L., and Ésik Z. Iteration Theories; The Equational Logic of Iterative Processes (1993), Springer, Berlin
44. Bloom S.L., Ésik Z., Labella A., and Manes E. Iteration 2-theories: Extended abstract. In: Johnson M. (Ed). Algebraic Methodology and Software Technology, AMAST'97. Lecture Notes in Computer Science Vol. 1349 (1997) 30-44
45. Blute R. Linear logic, coherence and dinaturality. Theoretical Computer Science 115 (1993) 3-41
46. Blute R. Hopf algebras and linear logic. Math. Structures in Computer Science 6 (1996) 189-217
47. Blute R.F., Cockett J.R.B., and Seely R.A.G. ! and ?: Storage as tensorial strength. Math. Structures in Computer Science 6 (1996) 313-351
48. Blute R.F., Cockett J.R.B., Seely R.A.G., and Trimble T.H. Natural deduction and coherence for weakly distributive categories. J. Pure and Applied Algebra 113 (1996) 229-296
49. Blute R.F., Cockett J.R.B., and Seely R.A.G. Categories for computation in context and unified logic. J. Pure and Applied Algebra 116 (1997) 49-98
50. Preprint. Blute R., Cockett J.R.B., and Seely R.A.G. Feedback for linearly distributive categories: Traces and fixpoints (1998), McGill University
51. Blute R.F., and Scott P.J. Linear Lauchli semantics. Annals of Pure and Applied Logic 77 (1996) 101-142
52. Blute R.F., and Scott P.J. A noncommutative full completeness theorem (Extended abstract). Electronic Notes in Theoretical Computer Science 3 (1996), Elsevier Science B.V.
53. R. Blute and P.J. Scott, The shuffle Hopf algebra and noncommutative full completeness, J. Symbolic Logic, to appear.
54. Borceux F. Handbook of Categorical Algebra (1994), Cambridge University Press
55. V. Breazu-Tannen and J. Gallier, Polymorphic rewriting conserves algebraic normalization, Theoretical Comp. Science 83.
56. A. Carboni, P. Freyd, and A. Scedrov, A categorical approach to reazability and polymorphic types, Lecture Notes in Computer Science, Vol. 298 (Proc. 3rd MFPS), 23-42.
57. Cattani G.L., Stark I., and Winskel G. Presheaf models for the π -calculus. In: Moggi E., and Rosolini G. (Eds). Category Theory and Computer Science, CTCS'97. Lecture Notes in Computer Science Vol. 1290 (1997)
58. Cattani G.L., and Winskel G. Presheaf models for concurrency. In: van Dalen D., and Bezem M. (Eds). Computer Science Logic, CSL'96. Lecture Notes in Computer Science Vol. 1258 (1996)
59. Cobham A. The intrinsic computational difficulty of functions,. Proc. of the 1964 Internations Congress for Logic, Methodology and Philosophy of Science (1964), North-Holland, Amsterdam 24-30
60. Cockett J.R.B. Introduction to distributive categories. Math. Structures in Computer Science 3 (1993) 277-308
61. (Preliminary version in [FJP], pp.45-65.). Cockett J.R.B., and Seely R.A.G. Weakly distributive categories. J. Pure and Applied Algebra 114 (1997) 133-173
62. Preprint. Cockett J.R.B., and Seely R.A.G. Linearly distributive functors (1996), McGill University
63. Cockett J.R.B., and Seely R.A.G. Proof theory for full intuitionistic linear logic, bilinear logic, and MIX categories. Theory and Applications of Categories 3 (1997) 85-131
64. Cockett J.R.B., and Spencer D.L. Strong categorical datatypes I, Category Theory 1991, Montreal. In: Seely R.A.G. (Ed). CMS Conference Proceedings Vol. 13 (1991) 141-169
65. Cook S.A. Feasibly constructive proofs and the propositional calculus. Proc. 7th Annual ACM Symp. on Theory of Computing (1975) 83-97
66. S.A. Cook and B.M. Kapron, Characterizations of the basic feasible functionals of finite type, Feasible Mathematics, S. Buss and P. Scott, eds, Birkhauser, 71-96.
67. Coquand T., and Dybjer P. Intuitionistic model constructions and normalization proofs. Math. Struc-tures in Computer Science 7 (1997) 75-94
68. Coquand T. On the analogy between propositons and types. In: Huet G. (Ed). Logical Foundations of Functional Programming (1990), Addison-Wesley 399-417
69. Cook S.A., and Urquhart A. Functional interpretations of feasibly constructive arithmetic. Ann. Pure & Applied Logic 63 2 (1993) 103-200
70. Corradini A., and Gadducci F. A 2-categorical presentation of term graph rewriting. In: Moggi E., and Rosolini G. (Eds). Category Theory and Computer Science, CTCS'97. Lecture Notes in Computer Science Vol. 1290 (1997)
71. Cambridge Mathematical Textbooks. Crole R. Categories for Types (1993)
72. Cubrić D. Results in categorical proof theory. PhD thesis (1993), Dept. of Mathematics, McGill University
73. Cubric D., Dybjer P., and Scott P.J. Normalization and the Yoneda embedding. Math. Structures in Computer Science 8 2 (1997) 153-192
74. (revised edition, Birkhauser, 1993). Curien P.-L. Categorical Combinators, Sequential Algorithms, and Functional Programming. Pitman (1986)
75. Danos V. La logique linéaire appliquée àl'étude de divers processus de normalisation et principalement du λ-calcul. Thèse de doctorat (1990), Univ. Paris VII, U.F.R. de Mathématiques1990
76. Danos V., and Regnier L. Proof-nets and the Hilbert space. In: Girard J.-Y., Lafont Y., and Regnier L. (Eds). Advances in Linear Logic. London Math. Soc. Series 222 (1995), Camb. Univ. Press 307-328
77. Danos V., and Regnier L. The structure of multiplicatives. Arch. Math. Logic 28 (1989) 181-203
78. Di Cosmo R. Isomorphism of Types: From λ-Calculus to Information Retrieval and Language Design (1995), Birkhauser
79. Feb. Dowek G., et al. The Coq proof assistant user's guide, Version 5.8, Technical Report, INRIA-Rocquencourt (1993)
80. Duval D., and Reynaud J.-C. Sketches and computation I: Basic definitions and static evaluation. Math. Structures in Computer Science 4 2 (1994) 185-238
81. Dybjer P. Internal type theory. In: Berardi S., and Coppo M. (Eds). Types for Proofs and Programs, TYPES'95. Lecture Notes in Computer Science Vol. 1158 (1995)
82. Eilenberg S., and Kelly G.M. A generalization of the functorial calculus. J. Algebra 3 (1966) 366-375
83. Ésik Z., and Labella A. Equational properties of iteration in algebraically complete categories. MFCS'96. Lecture Notes in Computer Science Vol. 1113 (1996)
84. Fages F., Ruet P., and Soliman S. Phase semantics and verification of concurrent constraint programs. 13th Annual IEEE Symp. on Logic in Computer Science (LICS) (1998), IEEE Press 141-152
85. S. Finkelstein, P. Freyd and J. Lipton, A new framework for declarative programming, Th. Comp. Science (to appear).
86. Fiore M.P., and Plotkin G.D. An extension of models of axiomatic domain theory to models of synthetic domain theory. CSL'96. Lecture Notes in Computer Science Vol. 1258 (1996)
87. Fleury A. Thesis, Thèse de doctorat (1996), Univ. Paris VII, U.F.R. de Mathématiques
88. Fleury A., and Rétorè C. The MIX rule. Math. Structures in Computer Science 4 (1994) 273-285
89. In: Fourman M.P., Johnstone P.T., and Pitts A.M. (Eds). Applications of Categories in Computer Science. London Math. Soc. Lecture Notes 177 (1992), Camb. Univ. Press
90. Freyd P. Remarks on algebraically compact categories. In: Fourman M.P., Johnstone P.T., and Pitts A.M. (Eds). Applications of Categories in Computer Science. London Math. Soc. Lecture Notes 177 (1992), Camb. Univ. Press 95-107
91. Freyd P. Structural polymorphism. Theoretical Comp. Science 115 (1993) 107-129
92. Freyd P., Robinson E., and Rosolini G. Dinaturality for free. In: Fourman M.P., Johnstone P.T., and Pitts A.M. (Eds). Applications of Categories in Computer Science. London Math. Soc. Lecture Notes 177 (1992), Camb. Univ. Press 107-118
93. P. Freyd, E. Robinson and G. Rosolini, Functorial parametricity, Manuscript.
94. Freyd P., and Scedrov A. Categories, Allegories (1990), North-Holland 1990
95. Friedman H. Equality between functionals. Logic Colloquium '73. Lecture Notes in Computer Science Vol. 453 (1975) 22-37
96. Gardner P., and Hasegawa M. Types and models for higher-order action calculi. TACS'97. Lecture Notes in Computer Science Vol. 1281 (1997)
97. Geroch R. Mathematical Physics (1985), University of Chicago Press
98. Ghani N. βη-equality for coproducts. TLCA '95. Lecture Notes in Computer Science Vol. 902 (1995) 171-185
99. Girard J.-Y. Une extension de I'interprétation de Gödel a l'analyse, et son application a l'elimination des coupures dans l'analyse et la théorie des types. In: Fenstad J.E. (Ed). Proc. 2nd Scandinavian Logic Symposium (1971), North-Holland 63-92
100. Girard J.-Y. Interprétation fonctionnelle et elimination des coupures dans l'arithmétique d'ordre supérieur. Thèse de doctorat d'état (1972), Univ. Paris VII
101. Girard J.-Y. The system F of variables types, fifteen years later. Theoretical Comp. Science 45 (1986) 159-192
102. Girard J.-Y. Linear logic. Theoretical Comp. Science 50 (1987) 1-102
103. Girard J.-Y. Geometry of interaction I: Interpretation of system F. In: Ferro R., et al. (Ed). Logic Colloquium '88 (1989), North-Holland 221-260
104. Girard J.-Y. Towards a geometry of interaction. In: Gray J.W., and Scedrov A. (Eds). Categories in Computer Science and Logic. Contemp. Math. Vol. 92 (1989), AMS 69-108
105. Girard J.-Y. Geometry of interaction 2: Deadlock-free algorithms. In: Martin-Lof P., and Mints G. (Eds). COLOG-88. Lecture Notes in Computer Science Vol. 417 (1990) 76-93
106. Girard J.-Y. A new constructive logic: Classical logic. Math. Structures in Computer Science 1 (1991) 255-296
107. Girard J.-Y. On the unity of logic. Annals of Pure and Applied Logic 59 (1993) 201-217
108. Girard J.-Y. Linear logic: Its syntax and semantics. In: Girard J.-Y., Lafont Y., and Regnier L. (Eds). Advances in Linear Logic. London Math. Soc. Series 222 (1995), Camb. Univ. Press 1-42
109. Girard J.-Y. Geometry of interaction III: Accommodating the additives. In: Girard J.-Y., Lafont Y., and Regnier L. (Eds). Advances in Linear Logic. London Math. Soc. Series 222 (1995), Camb. Univ. Press 329-389
110. Preprint. Girard J.-Y., and Coherent Banach spaces. April. lectures delived at Keio University, Linear Logic '96 (1996)
111. Preprint. Girard J.-Y. Light linear logic. (revised 1997) (1995). http://lmd.univ.mrs.fr/pub/girard/LL.ps.Z
112. In: Girard J.-Y., Lafont Y., and Regnier L. (Eds). Advances in Linear Logic. London Math. Soc. Series 222 (1995), Camb. Univ. Press
113. Girard J.-Y., Lafont Y., and Taylor P. Proofs and Types. Cambridge Tracts in Theoretical Computer Science Vol. 7 (1989)
114. Also available by anonymous. Girard J.-Y., Scedrov A., and Scott P. Normal forms and cut-free proofs as natural transformations. in: papers/Scott. Logic From Computer Science, Mathematical Science Research Institute Publications Vol. 21 (1991) 217-241. http://theory.doc.ic.ac.uk
115. Girard J.-Y., Scedrov A., and Scott P.J. Bounded linear logic. Theoretical Comp. Science 97 (1992) 1-66
116. Giry M. A categorical approach to probability theory. Proc. of a Conference on Categorical Aspects of Topology. Lecture Notes in Mathematics Vol. 915 (1981) 68-85
117. Gonthier G., Abadi M., and Levy J.J. Linear logic without boxes. 7th Annual IEEE Symp. on Logic in Computer Science (LICS) (1992), IEEE Publications 223-234
118. Gordon R., Power A., and Street R. Coherence for tricategories (1996), Memoirs of the American Mathematical Society
119. In: Gray J., and Scedrov A. (Eds). Categories in Computer Science and Logic (1989), AMS
120. Gunter C. Semantics of Programming Languages (1992), MIT Press
121. Oxford. Gunter C. The semantics of types in programming languages. In: Abramsky S., Gabbay D., Gabbay D., and Maibaum T. (Eds). Handbook of Logic in Computer Science Vol. 3 (1994) 395-475
122. Hagino T. A typed lambda calculus with categorical type constructors. Category Theory and Computer Science, Lecture Notes in Computer Science Vol. 283 (1987) 140-157
123. E. Haghverdi, Unique decomposition categories, geometry of interaction and combinatory logic, Math. Struct, in Comput. Sci. (to appear).
124. M. Hamano, Pontrjagin duality and a full completeness of multiplicative linear logic without MIX, Math. Struct, in Comput. Sci. (to appear).
125. Hardin T. How to get confluence for explicit substitutions. In: Sleep M., Plasmeijer M., and van Eekelen M. (Eds). Term Graph Rewriting (1993), Wiley 31-45
126. Harnik V., and Makkai M. Lambek's categorical proof theory and Lduchli's abstract realizbility. J. Symbolic Logic 57 (1992) 200-230
127. Hasegawa M. Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi. TLCA '97. Lecture Notes in Computer Science Vol. 1210 (1997) 196-213
128. Hasegawa R. Categorical data types in parametric polymorphism. Math. Structures in Computer Science 4 1 (1994) 71-109
129. Hasegawa R. A logical aspect of parametric polymorphism. In: Büning H.K. (Ed). Computer Science Logic, CSL'95. Lecture Notes in Computer Science Vol. 1092 (1995)
130. Hazewinkel M. Introductory recommendations for the study of Hopf algebras in mathematics and physics. 1. CWI Quarterly 4 (1991), Centre for Mathematics and Computer Science, Amsterdam March
131. C. Hermida, B. Jacobs, Fibrations with indeterminate s: Contextual and functional completeness for polymorphic lambda calculi, Math. Structures in Computer Science 5, (4), 501-532.
132. Hermida C., Makkai M., and Power J. Higher dimensional multigraphs. 13th Annual IEEE Symp. on Logic in Computer Science (LICS) (1998), IEEE 199-206
133. Higgs D. Axiomatic Infinite Sums-An Algebraic Approach to Integration Theory. Contemporary Mathematics Vol. 2 (1980)
134. Higgs D.A., and Rowe K.A. Nuclearity in the category of complete semilattices. J. Pure and Applied Algebra 5 (1989) 67-78
135. T. Hildebrandt, P. Panangaden and G. Winskel, A relational model of non-deterministic dataflow, to appear in: Concur 98, Lecture Notes in Computer Science, Vol. ??.
136. Hodas J., and Miller D. Logic programming in a fragment of intuitionistic linear logic. Inf. and Computation 110 2 (1994) 327-365
137. Hofmann M. Syntax and semantics of dependent types. In: Pitts A., and Dybjer P. (Eds). Semantics and Logics of Computation (1997), Publications of the Newton Institute, Camb. Univ. Press 79-130
138. Hofmann M. An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras. Bull. Symb. Logic 3 4 (1997) 469-485
139. Hu H., and Joyal A. Coherence completions of categories and their enriched softness. In: Brookes S., and Mislove M. (Eds). Proceedings, Mathematical Foundations of Programming Semantics, Thirteenth Annual Conference. Electronic Notes in Theoretical Computer Science 6 (1997)
140. In: Huet G. (Ed). Logical Foundations of Functional Programming (1990), Addison-Wesley
141. Hyland M. A small complete category. Ann. Pure and Appl. Logic 40 (1988) 135-165
142. Hyland M. Game semantics. In: Pitts A., and Dybjer P. (Eds). Semantics and Logics of Computation (1997), Publications of the Newton Institute, Camb. Univ. Press 131-184
143. Hyland M., Robinson E., and Rosolini G. The discrete objects in the effective topos. Proc. Lond. Math. Soc. Ser. 60 (1990) 1-36
144. Hyland M., and de Paiva V. Full intuitionistic linear logic (Extended Abstract). Annals of Pure and Applied Logic 64 3 (1993) 273-291
145. Jacobs B., and Rutten J. A tutorial on (Co)Algebras and (Co)Induction. EATCS Bulletin 62 (1997) 222-259
146. Jay C.B. The structure of free closed categories. J. Pure and Applied Algebra 66 (1990) 271-285
147. Jay C.B., and Ghani N. The virtues of eta expansion. Journal of Functional Programing 5 2 (1995) 135-154
148. Joyal A., Nielsen M., and Winskel G. Bisimulation from open maps. Inf. and Computation 127 2 (1996) 164-185
149. Joyal A., and Street R. An introduction to Tannaka duality and quantum groups. In: Carboni A., et al. (Ed). Category Theory, Proceedings, Como 1990. Lecture Notes in Mathematics Vol. 1488 (1991) 411-492
150. Joyal A., and Street R. The geometry of tensor calculus I. Advances in Mathematics 88 (1991) 55-112
151. Joyal A., and Street R. Braided tensor categories. Advances in Mathematics 102 1 (1993) 20-79
152. Joyal A., Street R., and Verity D. Traced monoidal categories. Math. Proc. Camb. Phil. Soc. 119 (1996) 447-468
153. A. Jung, J. Tiuryn, A new characterization of lambda definability, TLCA'93, Lecture Notes in Computer Science, Vol. 664, 230-244.
154. Kanovich M. The direct simulation of Minksky machines in linear logic. In: Girard J.-Y., Lafont Y., and Regnier L. (Eds). Advances in Linear Logic. London Math. Soc. Series 222 (1995), Camb. Univ. Press 123-146
155. Kanovich M., Okada M., and Scedrov A. Phase semantics for light linear logic. In: Brookes S., and Mislove M. (Eds). Proceedings, Mathematical Foundations of Programming Semantics, Thirteenth Annual Conference. Electronic Notes in Theoretical Computer Science 6 (1997)
156. Katis P., Sabadini N., and Walters R.F.C. Bicategories of processes, Manuscript (1995), Dept. of Mathematics, Univ. Sydney
157. Katis P., Sabadini N., and Walters R.F.C. Span(Graph): A categorical algebra of transition systems. AMAST'97. Lecture Notes in Computer Science Vol. 1349 (1997)
158. Kelly G.M. Many-variable functorial calculus. I. Coherence in Categories, Lecture Notes in Mathematics Vol. 281 (1977) 66-105
159. Kelly G.M. Basic Concepts of Enriched Category Theory. London Math. Soc. Lecture Notes. [K82] Vol. 64 (1982), Camb. Univ. Press
160. Kelly G.M., and Mac Lane S. Coherence in closed categories. J. Pure and Applied Algebra 1 (1971) 97-140
161. Kinoshita Y., O'Hearn P.W., Power A.J., Takeyama M., and Tennent R.D. An axiomatic approach to binary logical relations with applications to data refinement. TACS '97. Lecture Notes in Computer Science Vol. 1281 (1997) 191-212
162. Kurosh A.G. Direct decomposition in algebraic categories. Amer. Math. Soc. Transl. Ser. 2 Vol. 27 (1963) 231-255
163. Lack S.G. The algebra of distributive and extensive categories. PhD thesis (1995), University of Cambridge
164. Lafont Y. Logiques, catégories et machines. Thèse de doctorat (1988), Université Paris VII, U.F.R. de Mathématiques
165. Lafont Y. From proof nets to interaction nets. In: Girard J.-Y., Lafont Y., and Regnier L. (Eds). Advances in Linear Logic. London Math. Soc. Series 222 (1995), Camb. Univ. Press 225-247
166. J. Lambek, Deductive systems and categories I, J. Math. Systems Theory 2, 278-318.
167. Lambek J. Deductive systems and categories II. Lecture Notes in Mathematics Vol. 87 (1969), Springer, Berlin
168. J. Lambek, Functional completeness of cartesian catgories, Ann. Math. Logic 6, 259-292.
169. Lambek J. On the unity of algebra and logic. In: Borceux F. (Ed). Categorical Algebra and its Applications. Lecture Notes in Mathematics Vol. 1348 (1988), Springer
170. J. Lambek, Multicategories revisited, Contemp. Math., 92, 217-239.
171. Manuscript. Lambek J. Logic without structural rules (1990), Mcgill University
172. Lambek J. In: Došen K., and Schroeder-Heister P. (Eds). From categorial grammar to bilinear logic, Substructural Logics, Studies in Logic and Computation Vol. 2 (1993), Oxford Science Publications
173. Lambek J. Bilinear logic in algebra and linguistics. In: Girard J.-Y., Lafont Y., and Regnier L. (Eds). Advances in Linear Logic. London Math. Soc. Series 222 (1995), Camb. Univ. Press
174. Lambek J., and Scott P.J. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics Vol. 7 (1986), Cambridge University Press
175. Läuchli H. An abstract notion of reazability for which intuitionistic predicate calculus is complete. Intuitionism and Proof Theory (1970), North-Holland 227-234
176. Lawvere F.W. The category of categories as a foundation for mathematics. In: Eilenberg S., et al. (Ed). Proc. Conf. on Categorical Algebra (1965), Springer
177. F.W. Lawvere, Adjointness in foundations, Dialectica 23, 281-296.
178. Lefschetz S. Algebraic Topology. Amer. Math. Soc. Colloq. Publ. Vol. 27 (1963)
179. Lincoln P. Deciding provability of linear logic formulas. In: Girard J.-Y., Lafont Y., and Regnier L. (Eds). Advances in Linear Logic. London Math. Soc. Series 222 (1995), Camb. Univ. Press 109-122
180. Luo Z. Computation and Reasoning: A Type Theory for Computer Science (1994), Oxford Univ. Press
181. Luo Z., and Pollack R. LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211 (1992), Univ. Edinburgh
182. Part 2. Ma Q., and Reynolds J.C. Types, abstraction, and parametric polymorphism. Lecture Notes in Computer Science Vol. 598 (1991) 1-40
183. Mac Lane S. Categories for the Working Mathematician (1971), Springer
184. Mac Lane S., and commutative diagrams coincide with equivalent proofs W. Contemp. Math. 13 (1982) 387-401
185. Mac Lane S., and Moerdijk I. Sheaves in Geometry and Logic (1992), Springer
186. Malacaria P., and Regnier L. Some results on the interpretation of λ-calculus in operator algebras. 6th Annual IEEE Symp. on Logic in Computer Science (LICS) (1991), IEEE Press 63-72
187. Manes E., and Arbib M. Algebraic Approaches to Program Semantics (1986), Springer
188. E. Manes, Implementing collection classes with monads, Math. Structures in Computer Science 8, 3, 231-276.
189. Martin-Löf P. An intuitionistic theory of types: Predicative part. In: Rose H.E., and Shepherdson J.C. (Eds). Logic Colloquium '73 (1975), North-Holland 73-118
190. Martin-Löf P. Constructive mathematics and computer programming. Proc. Sixth International Congress for Logic, Methodology and Philosophy of Science (1982), North-Holland
191. McCusker G. Games definability for FPC. Bull. Symb. Logic 3 3 (1997) 347-362
192. Mendler N., Panangaden P., Scott P., and Seely R. The logical structure of concurrent constraint languages. Nordic Journal of Computing 2 (1995) 181-220
193. Metayer F. Homology of proof nets. Arch. Math Logic 33 (1994)
194. In: Girard J.-Y., Lafont Y., and Regnier L. (Eds). Advances in Linear Logic. London Math. Soc. Series 222 (1995), Camb. Univ. Press
195. Miller D. Linear logic as logic programming: An abstract. In: Retoré C. (Ed). Logical Aspects of Computational Linguistics, LACL'96. Lecture Notes in Artificial Intelligence Vol. 1328 (1996)
196. Miller D., Nadathur G., Pfenning F., and Scedrov A. Uniform proofs as a foundation for logic programming. Ann. Pure and Applied Logic 511991 (1991) 125-157
197. Milner R. Communication and Concurrency (1989), Prentice-Hall
198. Milner R. Fully abstract models of typed lambda calculi. Theoretical Comp. Science 4 (1977) 1-22
199. Milner R. The polyadic π -calculus: A tutorial, Logic and Algebra of Specification. In: Bauer F.L., Brauer W., and Schwichtenberg H. (Eds) (1993), Springer
200. Milner R. Action calculi, or concrete action structures, Mathematical Foundations of Computer Science. Lecture Notes in Computer Science Vol. 711 (1993) 105-121
201. June. Milner R. Action calculi V: Reflexive molecular forms, Manuscript (1994), University of Edinburgh
202. Mints G.E. Closed Categories, the theory of proofs. J. Soviet Math. 15 (1981) 45-62
203. Mitchell J.C. Foundations for Programming Languages (1996), MIT Press
204. (Formal Models and Semantics),. Mitchell J.C. Type systems for programming languages. In: Van Leeuwen J. (Ed). Handbook of Theoretical Computer Science Vol. B (1990), North-Holland 365-458
205. Mitchell J.C., and Scedrov A. Notes on sconing and relators. CSL'92. Lecture Notes in Computer Science Vol. 702 (1992) 352-378
206. Mitchell J.C., and Scott P.J. Typed lambda models and Cartesian closed categories. In: Gray J., and Scedrov A. (Eds). Categories in Computer Science and Logic (1989), AMS 301-316
207. Mitchell J.C., and Visvanathan R. Effective models of polymorphism, subtyping and recursion (Extended abstract). In: auf der Heide F.M., and Monien B. (Eds). Automata, Languages and Programming, ICALP'96. Lecture Notes in Computer Science Vol. 1099 (1996)
208. Moggi E. Notions of computation monads. Inf. & Computation 93 1 (1991) 55-92
209. Moggi E. Metalanguages and applications. In: Pitts A., and Dybjer P. (Eds). Semantics and Logics of Computation (1997), Publications of the Newton Institute, Camb. Univ. Press 185-239
210. In: Moggi E., and Rosolini G. (Eds). 7th International Conference on Category Theory and Computer Science. Lecture Notes in Computer Science Vol. 1290 (1997)
211. Mulry P. Strong monads, algebras and fixed points. In: Fourman M.P., Johnstone P.T., and Pitts A.M. (Eds). Applications of Categories in Computer Science. London Math. Soc. Lecture Notes 177 (1992), Camb. Univ. Press 202-216
212. O'Hearn P., and Tennent R.D. Semantics of local variables, Applications of Categories in Computer Science. London Math. Soc. Lecture Series Vol. 177 (1992), Camb. Univ. Press 217-236
213. O'Hearn P., and Tennent R.D. Relational parametricity and local variables. 20th Symp. on Principles of Programming Languages, Assoc. Comp. Machinery (1993) 171-184
214. P. O'Hearn and J. Riecke, Kripke logical relations and PCF, to appear in Information and Computation.
215. Oles F.J. Type algebras, functor categories and block structure. In: Nivat M., and Reynolds J. (Eds). Algebraic Methods in Semantics (1985), Camb. Univ. Press
216. Panangaden P., Saraswat V., Scott P.J., and Seely R.A.G. A categorical view of concurrent constraint programming. Proceedings of REX Workshop. Lecture Notes in Computer Science Vol. 666 (1993) 457^76
217. Paré R., and Roman L. Monoidal categories with natural numbers object. Studia Logica 48 (1989) 361-376
218. Pavlovic D. Categorical logic of names, abstraction in action calculi. Math. Structures in Com-puter Science 7 6 (1997) 619-637
219. Pavlovic D., and Abramsky S. Specifying interaction categories. In: Moggi E., and Rosolini G. (Eds). CTCS'97. Lecture Notes in Computer Science Vol. 1290 (1997)
220. Pentus M. Lambek grammars are context free. 8th Annual IEEE Symp. on Logic in Computer Science (LICS). Montreal (1993) 429-433
221. Reprint CMU-CS-89-111. Pierce B., Dietzen S., and Michaylov S. Programming in higher-order typed lambda-calculi (1989), Dept. of Computer Science, Carnegie-Mellon University
222. Pitts A. Polymorphism is set-theoretic, constructively. In: Pitt D.H. (Ed). Category Theory and Computer Science. Lecture Notes in Computer Science Vol. 283 (1987) 12-39
223. Pitts A. Relational properties of domains. Inf. and Computation 127 2 (1996) 66-90
224. Pitts A. Reasoning about local variables with operationally-based logical relations. 1 lth Annual IEEE Symp. on Logic in Computer Science (LICS) (1996), IEEE Press 152-163
225. Pitts A. Operationally-based theories of program equivalence. In: Pitts A., and Dybjer P. (Eds). Semantics and Logics of Computation (1997), Publications of the Newton Institute, Camb. Univ. Press 241-298
226. (to appear). Pitts A.M. Categorical logic. In: Abramsky S., Gabbay D.M., and Maibaum T.S.E. (Eds). Handbook of Logic in Computer Science Vol. 6 (1996), Oxford University Press
227. In: Pitts A., and Dybjer P. (Eds). Semantics and Logics of Computation (1997), Publications of the Newton Institute, Camb. Univ. Press
228. Plotkin G.D. LCF considered as programming language. Theoretical Comp. Science 5 (1977) 223-255
229. Plotkin G.D. Lambda definability in the full type hierarchy. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism (1980), Academic Press 363-373
230. Plotkin G., and Abadi M. A logic for parametric polymorphism. TLCA'93. Lecture Notes in Computer Science Vol. 664 (1993) 361-375
231. Power J. A general coherence result. J. Pure and Applied Algebra 57 (1989) 165-173
232. Power J., and Kinoshita Y. A new foundation for logic programming. Extensions of Logic Programming '96 (1996), Springer
233. Power A.J., and Robinson E.P. Premonoidal categories and notions of computation. Math. Struc-tures in Computer Science 7 5 (1997) 453-468
234. Power J., and Thielecke H. Environments, continuation semantics and indexed categories. TACS'97. Lecture Notes in Computer Science Vol. 1281 (1997) 191-212
235. Pratt V. Chu spaces and their interpretation as concurrent objects. In: van Leeuwen J. (Ed). Computer Science Today. Lecture Notes in Computer Science Vol. 1000 (1995) 392-405
236. Pratt V. Towards full completeness for the linear logic of Chu spaces. Proc. MFPS (MFPS'97). Electronic Notes of Theoretical Computer Science (1997)
237. Prawitz D. Natural Deduction (1965), Almquist & Wilksell, Stockhom
238. Regnier L. Lambda-calcul et réseaux. Thèse de doctorat (1992), Univ. Paris VII, U.F.R. Mathématiques
239. Reus B., and Streicher Th. General synthetic domain theory - A logical approach (Extended abstract). CTCS'97. Lecture Notes in Computer Science Vol. 1290 (1997)
240. Reynolds J. Towards a theory of type structure, Programming Symposium. Lecture Notes in Com-puter Science Vol. 19 (1974) 408-425
241. Reynolds J.C. The essence of Algol. In: de Bakker J.W., and van Vliet J.C. (Eds). Algorithmic Languages (1981), North-Holland 345-372
242. Reynolds J.C. Types, abstraction, and parametric polymorphism. In: Mason R.E.A. (Ed). Information Processing '83 (1983), North-Holand 513-523
243. Reynolds J., and Plotkin G. On functors expressible in the polymorphic typed lambda calculus. In: Huet G. (Ed). Logical Foundations of Functional Programming. Inf. and Computation (1990), Addison-Wesley 127-152
244. Robinson E. How complete is PER?. In: Mason R.E.A. (Ed). 4th Annual IEEE Symp. on Logic in Computer Science (LICS) (1989), IEEE Publications, North-Holland 513-523
245. Robinson E. How complete is PER?. In: Mason R.E.A. (Ed). 4th Annual IEEE Symp. on Logic in Computer Science (LICS) (1983), IEEE Publications, North-Holland 513-523
246. Robinson E., and Rosolini G. Polymorphism, set theory, and call-by-value. 5th Annual IEEE Symp. on Logic in Computer Science (LICS) (1990), IEEE Publications 12-18
247. Roman L. Cartesian categories with natural numbers object. J. Pure and Applied Algebra 58 (1989) 267-278
248. Rosolini G. About modest sets. Int. J. Found. Comp. Sei. 1 (1990) 341-353
249. Scedrov A. A brief guide to linear logic. In: Rozenberg G., and Salomaa A. (Eds). Current Trends in Theoretical Computer Science (1993), World Scientific Publishing Co. 377-394
250. Scedrov A. Linear logic and computation: A survey. In: Schwichtenberg H. (Ed). Proof and Computation. NATO Advanced Science Institutes, Series F Vol. 139 (1995), Springer, Berlin 379-395
251. D. Scott, Continuous lattices, Lecture Notes in Mathematics, Vol. 274, 97-136.
252. Seely R.A.G. Categorical semantics for higher order polymorphic lambda calculus. J. Symb. Logic 52 (1987) 969-989
253. Seely R.A.G. Linear logic, ^-autonomous categories and cofree coalgebras. In: Gray J., and Scedrov A. (Eds). Categories in Computer Science and Logic, Contemporary Mathematics Vol. 92 (1989)
254. Sieber K. Reasoning about sequential functions via logical relations. In: Fourman M.P., Johnstone P.T., and Pitts A.M. (Eds). Applications of Categories in Computer Science. London Math. Soc. Lecture Notes 177 (1992), Camb. Univ. Press 258-269
255. Simpson A.K. A characterization of least-fixed-point operator by dinaturality. Theoretical Comp. Science 118 (1993) 301-314
256. Smyth M.B., and Plotkin G.D. The category-theoretic solution of recursive domain equations. SIAM . J. Computing 11 (1982) 761-783
257. Soloviev S. On natural transformations of distinguished functors, their superpositions in certain closed categories. J. Pure and Applied Algebra 47 (1987) 181-204
258. S. Soloviev, Proof of a S. Mac Lane conjecture (Extended abstract), CTCS'95, Lecture Notes in Computer Science, Vol 953, 59-80.
259. Stärk R.F. Call-by-value, call-by-name and the logic of values. In: van Dalen D., and Bezem M. (Eds). Computer Science Logic, CSL'96. Lecture Notes in Computer Science Vol. 1258 (1996)
260. Statman R. Logical relations, the typed lambda calculus. Inf. and Control 65 (1985) 85-97
261. Statman R. On Cartesian monoids, CSL'96. Lecture Notes in Computer Science Vol. 1258 (1996)
262. Street R. Categorical structures. In: Hazewinkel M. (Ed). Handbook of Algebra Vol. 1 (1996), Elsevier
263. Taylor P. Practical Foundations (1998), Camb. Univ. Press
264. Oxford. Tennent R.D. Denotational semantics. In: Abramsky S., Gabbay D., Gabbay D., and Maibaum T. (Eds). Handbook of Logic in Computer Science Vol. 3 (1994) 169-322
265. Turi D., and Plotkin G. Towards a mathematical operational semantics. 12th Annual IEEE Symp. on Logic in Computer Science (LICS) (1996) 280-291
266. Troelstra A. Lectures on Linear Logic. CSLI Lecture Notes Vol. 29 (1992)
267. Troelstra A.S., and Dalen D.v. Constructivism in Mathematics Vols. I and II (1988), North-Holland
268. P. Wadler, The essence of functional programming, Symp. on Principles of Programming Languages (POPL'92), ACM Press, 1-14.
269. Wadler P. A syntax for linear logic. Lecture Notes in Computer Science Vol. 802 (1994), Springer, Berlin 513-528
270. Wagner K., and Wechsung G. Computational Complexity (1986), D. Reidel
271. Walters R.F.C. Categories and Computer Science (1992), Camb. Univ. Press
272. Winskel G., and Nielsen M. Categories in concurrency. In: Pitts A., and Dybjer P. (Eds). Semantics and Logics of Computation (1997), Publications of the Newton Institute, Camb. Univ. Press 299-354
273. Wraith G. A note on categorical datatypes. Category Theory in Computer Science. Lecture Notes in Computer Science Vol. 389 (1989) 118-127
274. Yetter D. Quantales and (noncommutative) linear logic. Journal of Symbolic Logic 55 (1990) 41-64