Skip Navigation

Journal of Logic and Computation 2002 12(6):1061-1104; doi:10.1093/logcom/12.6.1061
© 2002 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ishtiaq, S.
Right arrow Articles by Pym, D. J.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?


Original Article

Kripke Resource Models of a Dependently-typed, Bunched {lambda}-calculus

Samin Ishtiaq1 and David J. Pym2

1 ARM Ltd., Cambridge, England, UK. E-mail: samin.ishtiaq{at}arm.com 2 University of Bath, Claverton Down, Bath BA2 7AY, England, UK. E-mail: d.j.pym{at}bath.ac.uk

The {lambda}{Lambda}-calculus is a dependent type theory with both linear and intuitionistic dependent function spaces. It can be seen to arise in two ways. Firstly, in logical frameworks, where it is the language of the RLF logical framework and can uniformly represent linear and other relevant logics. Secondly, it is a presentation of the proof-objects of a structural variation, with Dereliction, of a fragment of BI, the logic of bunched implications. As such, it is also closely related to linear logic. BI is a logic which directly combines linear and intuitionistic implication and, in its predicate version, has both linear and intuitionistic quantifiers. The {lambda}{Lambda}-calculus is the dependent type theory which generalizes both implications and quantifiers. In this paper, we study the categorical semantics of the {lambda}{Lambda}-calculus, gives a theory of ‘Kripke resource models’, i.e. monoid-indexed sets of functorial Kripke models, in which the monoid gives an account of resource consumption. A class of concrete, set-theoretic models is given by the category of families of sets parametrized over a small monoidal category, in which the intuitionistic dependent function space is described in the established way, but the linear dependent function space is described using Day's tensor product.

Keywords: Dependent type theory; categorical semantics; Kripke models; logical frameworks; sub-structural logics


Received 12 December 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.