The semantics of BI and resource tableaux

Mathematical Structures in Computer Science

Volumn 15, Issue 6, 2005, Pages 1033-1088

  Galmiche, D ^a   Mery D ^a   Pym, D ^b  

^a LORIA   (France)

^b University of Bath   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750707250     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129505004858     Document Type: Article

References (33)

1. Balat, V. and Galmiche, D. (2000) Labelled Proof Systems for Intuitionistic Provability. In: Labelled Deduction. Applied Logic Series 17, Kluwer Academic Publishers.
2. D'Agostino, M. and Gab bay, D.M. (1994) A Generalization of Analytic Deduction via Labelled Deductive Systems. Part I: Basic substructural logics. Journal of Automated Reasoning 13 243-281.
3. Day, B. (1970) On closed categories of functors. Springer-Verlag Lecture Notes in Computer Science 137 1-38.
4. Dunn, M. (1986) Relevance Logic and Entailment. In: Handbook of Philosophical Logic 3 117-224.
5. Fitting, M. (1990) First-Order Logic and Automated Theorem Proving, Texts and Monographs in Computer Science, Springer-Verlag.
6. Gabbay, D. M. (1996) Labelled Deductive Systems, Volume I - Foundations, Oxford University Press.
7. Galmiche, D. (2000) Connection Methods in Linear Logic and Proof nets Construction. Theoretical Computer Science 232 (1-2) 231-272.
8. Galmiche, D. and Larchey-Wendling, D. (2000) Quantales as completions of ordered monoids: revised semantics for Intuitionistic Linear Logic. Electronic Notes in Theoretical Computer Science 35.
9. Galmiche, D. and Méry, D. (2001) Proof-search and countermodel generation in propositional BI logic (extended abstract). In: 4th Int. Symposium on Theoretical Aspects of Computer Software, Sendai, Japan. Springer-Verlag Lecture Notes in Computer Science 2215 263-282
10. Galmiche, D. and Méry, D. (2002) Connection-based proof-search in propositional BI logic. In: 18th Int. Conference on Automated Deduction, CADE-18, LNAI 2392, Copenhagen, Denmark 111-128.
11. Galmiche, D. and Méry, D. (2003) Semantic labelled tableaux for propositional BI (without bottom). Journal of Logic and Computation 13 (5) 708-753.
12. Galmiche, D., Méry, D. and Pym, D. J. (2002) Resource Tableaux (extended abstract). In: 16th Int. Workshop on Computer Science Logic, Edinburgh, Scotland. Springer-Verlag Lecture Notes in Computer Science 2471 183-199.
13. Girard, J.-Y. (1987) Linear logic. Theoretical Computer Science 50 (1) 1-102.
14. Hähnle, R. and Schmitt, P. (1994) The liberalized δ-rule in free variable semantic tableaux. Journal of Automated Reasoning 13 211-221.
15. Harland, J. and Pym, D. J. (2003) Resource-distribution via Boolean constraints. ACM Transactions on Computational Logic 4 (1) 56-90.
16. Ishtiaq, S. and O'Hearn, P.W. (2001) BI as an assertion language for mutable data structures. In: 28th ACM Symposium on Principles of Programming Languages, London, U.K. 14-26.
17. Kripke, S. A. (1965) Semantical Analysis of Intuitionistic Logic I. In: Crossley, J. N. and Dummett, M. A. E. (eds.) Formal Systems and Recursive Functions, North-Holland 92-130.
18. Lafont, Y. (1997) The finite model property for various fragments of linear logic. Journal of Symbolic Logic 62 (4) 1202-1208.
19. Lambek, J. and Scott, P. (1986) Introduction to higher-order categorical logic, Cambridge University Press.
20. Lincoln, P. D. (1995) Deciding provability in linear logic formulas. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic, Cambridge University Press 109-122.
21. Mac Lane, S. and Moerdijk, I. (1992) Sheaves in Geometry and Logic, Springer-Verlag.
22. O'Hearn, P.W. (1999) Resource interpretations, bunched implications and the αλ-calculus. In: 4th Int. Conference on Typed Lambda Calculi and Applications, L'Aquila, Italy. Springer-Verlag Lecture Notes in Computer Science 1581 258-279.
23. O'Hearn, P.W. and Pym, D. J. (1999) The Logic of Bunched Implications. Bulletin of Symbolic Logic 5 (2) 215-244.
24. O'Hearn, P.W., Reynolds, J. and Yang, H. (2001) Local reasoning about programs that alter data structures. In: 15th Int. Workshop on Computer Science Logic, Paris, France. Springer-Verlag Lecture Notes in Computer Science 2142 1-19.
25. Prawitz, D. (1965) Natural Deduction: A Proof-Theoretical Study, Almquist and Wiksell, Stockholm.
26. Pym, D. J. (1999) On Bunched Predicate Logic. In: 14h Symposium on Logic in Computer Science, Trento, Italy, IEEE Computer Society Press 183-192.
27. Pym, D. J. (2002) The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series 26, Kluwer Academic Publishers. (See Pym (2004) for errata and remarks.)
28. Pym, D. J., O'Hearn, P.W. and Yang, H. (2004) Possible worlds and resources: The semantics of BI. Theoretical Computer Science 315 (1) 257-305. (Erratum: page 285, line -12: ', for some P′,Q ≡ P;P′' should be 'P ⊢ Q'.
29. Pym, D. J. (2004) Errata and Remarks for The Semantics and Proof Theory of the Logic of Bunched Implications (Pym 2002). Available at : http://www.cs.bath.ac.uk/~pym/BI-monograph-errata.pdf.
30. Reynolds, J. C. (2000) Lectures on reasoning about shared mutable data structure, Tandil, Argentina.
31. Reynolds, J.C. (2002) Separation logic: A logic for shared mutable data structures. In: IEEE Symposium on Logic in Computer Science, Copenhagen, Denmark, IEEE Computer Society Press 55-74.
32. Routley, R. and Meyer, R. (1972) The Semantics of Entailment, II-III. Journal of Philosophical Logic 1 53-73, 192-208.
33. Urquhart, A. (1972) Semantics for relevant logics. Journal of Symbolic Logic 49 1059-1073.