Result: Possible worlds and resources: the semantics of BI

Title:
Possible worlds and resources: the semantics of BI
Authors:
PYM, David J, O'HEARN, Peter W, HONGSEOK YANG
Source:
Mathematical Foundations of Programming SemanticsTheoretical computer science. 315(1):257-305
Publisher Information:
Amsterdam: Elsevier, 2004.
Publication Year:
2004
Physical Description:
print, 53 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Logique générale, General logic, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Théorie programmation, Programming theory, Divers, Miscellaneous, Complétude, Completeness, Completitud, Informatique théorique, Computer theory, Informática teórica, Logique intuitionniste, Intuitionistic logic, Lógica intuicionista, Monoïde, Monoid, Monoide, Programmation logique, Logical programming, Programación lógica, Réseau Pétri, Petri net, Red Petri, Sémantique, Semantics, Semántica, 68N17
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Bath, Bath, England, United Kingdom
Queen Mary, University of London, London, England, United Kingdom
ROPAS, Korea Advanced Institute of Science and Technology, Daejeon, Korea, Republic of
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15745054
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.15745054
Database:
PASCAL Archive

Further Information

The logic of bunched implications, BI, is a substructural system which freely combines an additive (intuitionistic) and a multiplicative (linear) implication via bunches (contexts with two combining operations, one which admits Weakening and Contraction and one which does not). BI may be seen to arise from two main perspectives. On the one hand, from proof-theoretic or categorical concerns and, on the other, from a possible-worlds semantics based on preordered (commutative) monoids. This semantics may be motivated from a basic model of the notion of resource. We explain BI's proof-theoretic, categorical and semantic origins. We discuss in detail the question of completeness, explaining the essential distinction between BI with and without ⊥ (the unit of V). We give an extensive discussion of BI as a semantically based logic of resources, giving concrete models based on Petri nets, ambients, computer memory, logic programming, and money.