Bunched polymorphism

Mathematical Structures in Computer Science

Volumn 18, Issue 6, 2008, Pages 1091-1132

  Collinson, Matthew ^a   Pym, David ^a   Robinson, Edmund ^b  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL MECHANICS; INFORMATION THEORY; MATHEMATICAL TECHNIQUES; POLYMORPHISM; SET THEORY;

CATEGORICAL SEMANTICS; EXISTENTIAL QUANTIFIERS; FIRST ORDERS; LAMBDA CALCULUSES; PARTIAL EQUIVALENCE RELATIONS; TYPE VARIABLES; TYPED LAMBDA CALCULUSES; UNIVERSAL QUANTIFIERS;

DIFFERENTIATION (CALCULUS);

EID: 56049118466     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129508007159     Document Type: Article

References (39)

1. Abadi, M. and Plotkin, G. D. (1990) A per model of polymorphism and recursive types. In: Logic in Computer Science, LICS'90, IEEE Press 31-46.
2. Atkey, R. (2004) A λ-Calculus for Resource Separation. In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004. Springer-Verlag Lecture Notes in Computer Science 3142 158-170.
3. Berdine, J. and O'Hearn, P. (2006) Strong update, disposal and encapsulation in bunched typing. In: Mathematical Foundations of Programming Semantics, MFPS'06. Electronic Notes in Theoretical Computer Science 158,
4. Biering, B., Birkedal, L. and Torp-Smith, N. (2007) BI-hyperdoetrines, higher-order separation logic, and abstraction. To appear in ACM Transactions on Programming Languages and Systems. (An earlier version appeared in 2005 in Proceedings of European Symposium on Programming (ESOP'05) 233-247.)
5. Bierman, G. M., Pitts, A. M. and Russo, C. V. (2000) Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion. In: Proceedings, Fourth International Workshop on Higher Order Operational Techniques in Semantics (HOOTS 2000). Electronic Notes in Theoretical Computer Science 41 70-88.
6. Birkedal, L., Møgelberg, R. E. and Petersen, R. L. (2006) Linear Abadi & Plotkin logic. Logical Methods in Computer Science 5 (2) 1-48.
7. Birkedal, L. and Yang, H. (2007) Relational parametricity and separation logic. To appear in Logical Methods in Computer Science.
8. Cardelli, L. and Longo, G. (1990) A semantic basis for quest. Technical Report 55, Systems Research Center, Digital Equipment Corporation.
9. Collinson, M. and Pym, D. (2006) Bunching for regions and locations. In: Mathematical Foundations of Programming Semantics, MFPS'06. Electronic Notes in Theoretical Computer Science 158 171-197.
10. Collinson, M., Pym, D. and Robinson, E. (2005) On Bunched Polymorphism (Extended Abstract). In: Computer Science Logic, CSL'05. Springer-Verlag Lecture Notes in Computer Science 3634 36-50.
11. Day, B. J. (1970) On closed categories of functors. In: Proceedings of the Midwest Category Seminar. Springer-Verlag Lecture Notes in Mathematics 137.
12. Day, B.J. (1973) An embedding theorem for closed categories. In: Proceedings of the Sydney Category Seminar 1972/73. Springer-Verlag Lecture Notes in Mathematics 420.
13. Gabbay, M. J. and Pitts, A. M. (2002) A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13 341-363.
14. Girard, J.-Y. (1971) Une extension de l'interprétation de Gödel à l'analyse et son application à l'élimination des coupres dans l'analyse et la théorie des types. In: Fenstad, J. E. (ed.) Proceedings of the 2nd Scandinavian Logic Symposium, North-Holland 63-92.
15. Girard, J.-Y. (1972) Interprétation fonctionelle et élimination des coupures dans I'arithmétique d'ordre supérieur, Ph.D. thesis, Université Paris VII.
16. Girard, J.-Y. (1987) Linear logic. Theoretical Computer Science 50 (1) 1-102.
17. Girard, J-Y, Lafont, Y and Taylor, P. (1989) Proofs and Types, Cambridge University Press.
18. Hyland, J. M. E. (1988) A small complete category. Annals of Pure and Applied Logic 40 135-165.
19. Jacobs, B. (1999) Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics 141, Elsevier.
20. Lawvere, F. W. (1969) Adjointness in foundations. Dialectics 23 281-296.
21. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer. (Second edition 1998.)
22. Mac Lane, S. and Moerdijk, I. (1992) Sheaves in Geometry and Logic: A First Introduction to Topos Theory, Springer.
23. MacQueen, D. B., Plotkin, G. and Sethi, R. (1986) An ideal model for recursive polymorphic types. Information and Control 71 95-130.
24. Maneggia, P. (2004) Models of linear polymorphism, Ph.D. thesis, School of Computer Science, The University of Birmingham.
25. Mitchell, J. C. and Moggi, E. (1991) Kripke style models for typed lambda calculus. Ann. Pure and Appl. Logic 51 (1) 99-124.
26. Mitchell, J. C. and Plotkin, G. D. (1988) Abstract types have existential type. ACM Transactions on Programming Languages and Systems 10 470-502.
27. O'Hearn, P. (2003) On bunched typing. Journal of Functional Programming 13 747-796.
28. O'Hearn, P. and Pym, D. (1999) The logic of bunched implications. Bulletin of Symbolic Logic 5 (2) 215-244.
29. Oles, F. J. (1982) A Category-Theoretic Approach to the Semantics of Programming Languages, Ph.D. thesis, Syracuse University, Syracuse, U.S.A.
30. Pierce, B. C. (2002) Types and Programming Languages, M.I.T. Press.
31. Plotkin, G. D. (1993) Type theory and recursion. In: Logic in Computer Science, LICS'93, IEEE Press 374.
32. Prawitz, D. (1978) Proofs and the meaning and completeness of logical constants. In: Hintikka, J., Niiniluoto, I. and Saarinen, E. (eds.) Essays on mathematical and philosophical logic, D. Reidel 25-40.
33. Pym, D., O'Hearn, P. and Yang, H. (2004) Possible worlds and resources: The semantics of BI. Theoretical Computer Science 315 (1) 257-305.
34. Pym, D. J. (2002) The Semantics and Proof Theory of the Logic of Bunched Implications. Applied Logic Series 26, Kluwer Academic Publishers. (Errata at: http://www.cs.bath.ac.uk/pym/BI-monograph-errata.pdf.)
35. Reynolds, J. C. (1974) Towards a theory of type structure. In: Programming Symposium. Springer-Verlag Lecture Notes in Computer Science 19 408-425.
36. Reynolds, J. C. (1981) The essence of algol. In: de Bakker, J.W. and van Vliet, J. C. (eds.) Algorithmic Languages, North-Holland 345-372.
37. Reynolds, J. C. (2002) Separation logic: a logic for shared mutable data structures. In: Logic in Computer Science, LICS'02, IEEE Press 55-74.
38. Seely, R. A. G. (1987) Categorical semantics for higher order polymorphic lambda calculus. Journal of Symbolic Logic 52 969-989.
39. Tofte, M. (1998) A brief introduction to regions. In: International Symposium on Memory Management'88, ACM Press 186-195.