Possible worlds and resources: The semantics of BI

Theoretical Computer Science

Volumn 315, Issue 1, 2004, Pages 257-305

  Pym, David J ^a   O'Hearn, Peter W ^b   Yang, Hongseok ^c  

^a UNIVERSITY OF BATH   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER OPERATING SYSTEMS; COMPUTER SCIENCE; DATA STORAGE EQUIPMENT; LOGIC PROGRAMMING;

INTUITIONISTIC LOGIC; PROPOSITIONAL LINEAR LOGIC; RESOURCE MODELING; SUBSTRUCTURAL SYSTEMS;

SEMANTICS;

EID: 2042469457     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.11.020     Document Type: Conference Paper

References (53)

1. Apt K.R., van Emden M.H. Contributions to the theory of logic programming. J. Assoc. Comput. Mech. 29(3):1982;841-862.
2. P. Armelín, Logic programming with bunched logic, Ph.D. Thesis, University of London, 2002, forthcoming.
3. P. Armelín, D. Pym, Bunched logic programming (extended abstract), in: Proc. IJCAR 2001, Vol. 2083, Springer, Berlin, 2001, pp. 289-304.
4. P.N. Benton, O.M. Bierman, V.C.V. de Paiva, J.M.E. Hyland. Linear λ -calculus and categorical models revisited, in: E. Börger, et al. (Eds.), Proceedings of the Sixth Workshop on Computer Science Logic, Lecture Notes in Computer Science, Vol. 702, Springer, Berlin, 1992, pp. 61-84.
5. Brinch Hanser P. Operating system principles, Series in Automatic computation. 1973;Prentice-Hall, Englewood Cliffs, NJ.
6. L. Cardelli, P. Gardner, G. Ghelli, A spatial logic for querying graphs, ICALP'02.
7. L. Cardelli, G. Ghelli, A query language for semi structured data based on the ambient logic, Proc. ESOP'01.
8. L. Cardelli, A. Gordon, Anytime, anywhere: modal logics for mobile processes, in: Conference Record of the 27th. Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, New York, Boston, Massachusetts, 2000.
9. Cousineau G., Mauny M. The Functional Approach to Programming. 1998;Cambridge University Press, Cambridge.
10. M.F. Dam, Relevance logic and concurrent computation, Ph.D. Thesis, University of Edinburgh, 1990.
11. Day B.J. On closed categories of functors. Mac Lane S. Reports of the Midwest Category Seminar. Lecture Notes in Mathematics. Vol. 137:1970;1-38 Springer, Berlin, NewYork.
12. Dosen K. A historica introduction to substructural Logics. Dosen K., Schroeder Heister P. Substructural Logics. 1993;1-30 Oxford University Press, Oxford.
13. J.M. Dunn, Relevant logic and entailmen, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, Vol. III: Alternatives to Classical Logic, Synthese Library, Vol. 166, Reidel, Dordrecht, Holland, 1986, pp. 117-224.
14. van Emden M.H., Kowalski R.A. The semantics of predicate logic as a programming language. J. Assoc. Comput. Mech. 24(4):1976;733-742.
15. U. Engberg, G. Winskel, Completeness results for linear logic on Petri nets, in: Proceedings of the Conference on Mathematical Foundations of Computer Science, Vol. 711, Springer, Gdansk, Poland, 1993, pp. 442-452.
16. M.P. Fourman, D.S. Scott, Sheaves and logic, in: M.P. Fourman, C.J. Mulvey, D.S. Scott (Eds.), Applications of Sheaf Theory to Algebra, Analysis, and Topology, Lecture Notes in Mathematics, Springer, Berlin, 1979.
17. Gabbay D. Labelled Deductive Systems; principles and applications. vol 1: Basic Principles. 1996;Oxford University Press, Oxford.
18. Gabbay D.M. Fibring Logics. 1998;Oxford University Press, Oxford.
19. D. Galmiche. D. Méry, D. Pym, Resource Tableaux (extended abstract), in: Proc. CSL 2002, Edinburgh, Lecture Notes in Computer Science, Vol. 2471, Springer, Berlin, 2002, pp. 183-199.
20. Girard J.-Y. Linear logic. Theoret. Comput. Sci. 50:1987;1-102.
21. J.-Y. Girard, Towards a geometry of interaction, in: J.W. Gray, Scedrov (Eds.), Categories in Computer Science and Logic, American Mathematical Society, Providence, RI, 1989, Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference. June 14-20, 1987, Boulder, Colorado; Contemporary Mathematics Volume 92.
22. S.S. Ishtiaq, P.O'Hearn, BI as an assertion language for mutable data structures, in: 28th ACM-SIGPLAN Symposium on Principles of Programming Languages, London, Association for Computing Machinery, New York, 2001, pp. 14-26.
23. Ishtiaq S.S., Pym D.J. A relevant analysis of natural deduction. J. Logic and Comput. 8(6):1998;809-838.
24. Kleene S.C. Mathematical Logic. 1968;Wiley, New York.
25. Kowalski R. Logic for Problem-solving. 1979;North-Holland, Elsevier, Amsterdam.
26. Lafont Y. The finite model property for various fragments of linear logic. J. Symbolic Logic. 62(4):1997;1202-1208.
27. Lambek J. Deductive Systems and Categories I. J. Math. Systems Theory. 2:1968;278-318.
28. Lambek J., Scott P. Introduction to Higher-Order Categorical Logic. 1986;Cambridge University Press, Cambridge.
29. Lincoln P. Deciding provability of linear logic formulas. Lafont Y., Girard J.-Y., Regnier L. Advances in Linear Logic. 1995;109-122 Cambridge University Press, Cambridge.
30. Mac Lane S. Categories for the Working Mathematician. 1971;Springer, New York.
31. Mac Lane S., Moerdijk I. Sheaves in Geometry and Logic. 1992;Springer, New York.
32. Miller D. A logical analysis of modules in logic programming. J. Logic. Programming. 6(1 & 2):1981;431-483.
33. Miller D., Nadathur G., Pfenning F., Ščedrov A. Uniform proofs as a foundation for logic programming. Ann. Pure Appl. Logic. 51:1991;125-157.
34. Milner R. Communication and Concurrency. 1989;Prentice-Hall, New York.
35. H. Niss, Regions are imperative, Ph.D. Thesis, University of Copenhagen, 2002.
36. O'Hearn P.W. On bunched typing. J. Funct. Programming. 13:2003;747-796.
37. P.W. O'Hearn, Resource interpretations, bunched implications and the αλ -calculus (preliminary version), in: J.-Y. Girard (Ed.), Proc TLCA '99. Lecture Notes in Computer Science, Vol. 1581, Springer, Berlin, 1999.
38. O'Hearn P.W., Pym D.J. The logic of bunched implications. Bull. Symbolic Logic. 5(2):1999;215-244.
39. Palmgren E. Constructive sheaf semantics. Math. Logic Quart. 43:1997;225-321.
40. D.J. Pym, Proofs, search and computation in general logic, Ph.D. Thesis, University of Edinburgh, 1990.
41. D.J. Pym, On bunched predicate logic, in: Proc. LICS'99, IEEE Computer Society Press, Silver Spring, MD, 1999, pp. 183-192.
42. Pym D.J. The Semantics and Proof Theory of the Logic of the Logic of Bunched Implications. Applied Logic Series. Vol. 26:2002;Kluwer Academic Publishers, Dordrecht.
43. Read S. Relevant Logic: A Philosophical Examination of Inference. 1998;Basil Blackwell, Oxford.
44. Reisig W. Distributed Algorithms: Modeling and Analysis with Petri Nets. 1998;Springer, Berlin.
45. Restall G. An Introduction to Substructural Logics. 2000;Routledge, London.
46. Reynolds J. Lectures on reasoning about shared mutable data structure. 2000;Tandil, Argentina.
47. J. Reynolds, Separation logic: A logic for shared mutable data structures, in: Proc. LICS '02, IEEE, New York, 2002.
48. Routley R., Meyer R.K. The semantics of entailment, i. Leblanc H. Truth, Syntax and Modality. 1973;199-243 North-Holland, Amsterdam.
49. A. Simpson. The proof theory and semantics of intuitionistic modal logic, Ph.D. Thesis, University of Edinburgh. 1994.
50. Tofte M., Talpin J. Region-based memory management. Inform. and Comput. 132(2):1997;109-176.
51. A.S. Trolestra, Lectures on Linear Logic, Vol. 29, Lecture Notes, CSLI, Stanford, 1992.
52. Urquhart A. Semantics for relevant logics. J. Symbolic Logic. 37:1972;1059-1073.
53. Vickers S. Topology via Logic. 1989;Cambridge University Press, Cambridge.