The logic of bunched implications

Bulletin of Symbolic Logic

Volumn 5, Issue 2, 1999, Pages 215-244

  O'Hearn, Peter W ^a   Pym, David J ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033420437     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2307/421090     Document Type: Article

References (44)

1. S. ABRAMSKY, Computational interpretations of linear logic, Theoretical Computer Science, vol. 111 (1993), no. 1-2, pp. 3-57.
2. S. AMBLER, First order linear logic in symmetric monoidal closed categories, Ph.D. thesis, University of Edinburgh, 1992.
3. A. R. ANDERSON and N. D. BELNAP, Entailment: the logic of relevance and necessity, volume I, Princeton University Press, 1975.
4. A. R. ANDERSON, J. M. DUNN, and N. D. BELNAP, Entailment: the logic of relevance and necessity, vol. II, Princeton University Press, 1992.
5. A. BARBER and G. D. PLOTKIN, Dual intuitionistic linear logic, submitted, October 1997.
6. N. D. BELNAP, Display logic, Journal of Philosophical Logic, vol. 11 (1982), pp. 375-414.
7. _, Life in the undistributed middle, Substructural logics (K. Došen and P. Schroeder-Heister, editors), Oxford University Press, 1993, pp. 31-42.
8. P. N. BENTON, A mixed linear and non-linear logic: proofs, terms and models, Proceedings of computer science logic '94, Kazimierz, Poland, Lecture Notes in Computer Science, no. 933, Springer-Verlag, Berlin, 1995.
9. S. Brookes, M. Main, A. Melton, and M. Mislove (editors), Mathematical foundations of programming semantics, eleventh annual conference, Electronic Notes in Theoretical Computer Science, vol. 1, Elsevier Science, 1995, Tulane University, New Orleans, Louisiana.
10. B. J. DAY, On closed categories of functors, Reports of the midwest category seminar (S. Mac Lane, editor), Lecture Notes in Mathematics, vol. 137, Springer-Verlag, Berlin-New York, 1970, pp. 1-38.
11. _, An embedding theorem for closed categories, Category seminar, Sydney (G. M. Kelly, editor), Lecture Notes in Mathematics, no. 420, Springer-Verlag, Berlin-New York, 1974, pp. 55-64.
12. K. DOŠEN, A historical introduction to substructural logics, Substructural logics (K. Došen and P. Schroeder-Heister, editors), Oxford University Press, 1993, pp. 1-30.
13. J. M. DUNN, Conseqution formulation of positive R with co-tenability and t, in [3].
14. _, Relevant logic and entailment, Handbook of philosophical logic (D. Gabbay and F. Guenthner, editors), vol. III: Alternatives in Classical Logic, Synthese Library, no. 166, D. Reidel, Dordrecht, Holland, 1986, pp. 117-224.
15. J.-Y. GIRARD, Linear logic, Theoretical Computer Science, vol. ? (1987), pp. 1-102.
16. _, On the unity of logic, Annals of Pure and Applied Logic, vol. 59 (1993), pp. 201-217.
17. J. A. HARLAND, D. J. PYM, and M. WINIKOFF, Programming in Lygon: an overview, Proceedings of AMAST '96 (Berlin) (M. Wirsing and M. Nivat, editors), Lecture Notes in Computer Science, no. 1101, Springer-Verlag, 1996, pp. 391-405.
18. J. S. HODAS and D. MILLER, Logic programming in a fragment of intuitionistic linear logic, Information and Computation, vol. 110 (1994), no. 2, pp. 327-365.
19. S. S. ISHTIAQ and D. J. PYM, Kripke resource models of a dependently-typed, bunched λ-calculus, in preparation, available at http://www.dcs.qmw.ac.uk/~pym.
20. _, A relevant analysis of natural deduction, Journal of Logic and Computation, vol. 8 (1998), no. 6, pp. 809-838.
21. S. C. KLEENE, Mathematical logic, Wiley and Sons, 1968.
22. S. A. KRIPKE, Semantical analysis of intuitionistic logic I, Formal systems and recursive functions (J. N. Crossley and M. A. E. Dummett, editors), North-Holland, Amsterdam, 1965, pp. 92-130.
23. Y. LAFONT, The linear abstract machine, Theoretical Computer Science, vol. 59 (1988), pp. 157-180.
24. J. LAMBEK and P. J. SCOTT, Introduction to higher-order categorical logic, Cambridge University Press, Cambridge, England, 1986.
25. P. MARTIN-LÖF, On the meanings of the logical constants and the justifications of the logical laws, Technical Report 2, Scuola di Specializziazione in Logica Matematica, Università di Siena, 1982.
26. D. MILLER, A logical analysis of modules in logic programming, Journal of Logic Programming, vol. 6 (1989), no. 1 and 2, pp. 79-108.
27. D. MILLER, G. NADATHUR, F. PFENNING, and A. ŠČEDROV, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic, vol. 51 (1991), pp. 125-157.
28. P. W. O'HEARN, Resource interpretations, bunched implications and the αλ-calculus, in preparation, preliminary version to appear in Typed λ-calculus and applications, Lecture Notes in Computer Science, 1999.
29. P. W. O'HEARN, A. J. POWER, M. TAKEYAMA, and R. D. TENNENT, Syntactic control of interference revisited, to appear in Theoretical Computer Science, preliminary version in [9] and in [30].
30. P. W. O'Hearn and R. D. Tennent (editors), Algol-like languages, Birkhäuser, Boston, 1997, two volumes.
31. G. D. PLOTKIN, Type theory and recursion, slides for Scottfest talk, 1993.
32. D. J. PYM, Logic programming with bunched implications, Electronic Notes in Theoretical Computer Science, vol. 17 (1998), extended abstract, 24 pp.
33. _, The semantics and proof theory of the logic of bunched implications, II: predicate BI, available on the web at http://www.dcs.qmw.ac.uk/~pym, 1998.
34. _, The semantics and proof theory of the logic of bunched implications, I: Propositional BI, available on the web at http://wwu.dcs.qmw.ac.uk/~pym, 1998.
35. D. J. PYM and J. A. HARLAND, A uniform proof-theoretic investigation of linear logic programming, Journal of Logic and Computation, vol. 4 (1994), pp. 175-207.
36. S. READ, Relevant logic: a philosophical examination of inference, Basil Blackwell, 1987.
37. J. C. REYNOLDS, Syntactic control of interference, Conference record of the fifth annual acm symposium on principles of programming languages (New York), ACM, January 1978, also in [30], pp. 39-46.
38. _, The essence of Algol, Algorithmic languages: Proceedings of the international symposium on algorithmic languages (Amsterdam) (J. W. de Bakker and J. C. van Vliet, editors), North-Holland, October 1981, also in [30], pp. 345-372.
39. P. RUET and F. FAGES, Concurrent constraint programming and mixed non-commutative linear logic, Proceedings of CSL '97 (Berlin), Lecture Notes in Computer Science, no. 1414, Springer-Verlag, 1997.
40. E. D. SACERDOTI, A structure for plans and behaviour, Elsevier North Holland, 1977.
41. P. SCHROEDER-HEISTER, Structural frameworks, substructural logics and the role of elimination inferences, Logical frameworks (G. Huet and G. Plotkin, editors), Cambridge University Press, 1991, pp. 385-403.
42. R. A. G. SEELY, Linear logic, *-autonomous categories and cofree coalgebras, Categories in computer science and logic (Providence, Rhode Island) (J. W. Gray and A. Scedrov, editors), Contemporary Mathematics, no. 92. American Mathematical Society. 1989. pp. 371-382.
43. A. S. TROELSTRA, Tutorial on linear logic, Substructural logics (K. Došen and P. Schroeder-Heister, editors), Oxford University Press, 1993, pp. 327-355.
44. A. URQUHART, Semantics for relevant logics, this JOURNAL, vol. 49 (1972), pp. 1059-1073.