Abstract
The λΛ-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 BI, the logic of bunched implications. BI is a logic which directly combines linear and intuitionistic implication and, in its predicate version, has both linear and intuitionistic quantifiers. The λΛ-calculus is the dependent type theory which generalizes both implications and quantifiers. In this paper, we describe the categorical semantics of the λΛ-calculus. This is given by Kripke resource models, which are monoid-indexed sets of functorial Kripke models, the monoid giving an account of resource consumption. We describe a class of concrete, set-theoretic models. The models are 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A Barber. Linear Type Theories, Semantics and Action Calculi. PhD thesis, University of Edinburgh, 1997.
HP Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, 1984.
PN Benton. A mixed linear and non-linear logic: Proofs, terms and models (preliminary report). Technical Report 352, Computer Laboratory, University of Cambridge, 1994.
J Cartmell. Generalised algebraic theories and contextual categories. Ann. Pure Appl. Logic, 32:209–243, 1986.
I Cervesato and F Pfenning. A linear logical framework. In E Clarke, editor, 11th LICS, New Brunswick, NJ, pages 264–275. IEEE Computer Society Press, 1996.
T Coquand. An algorithm for testing conversion in type theory. In G Huet and G Plotkin, editors, Logical Frameworks, pages 255–279. Cambridge University Press, 1991.
BJ Day. On closed categories of functors. In S Mac Lane, editor, Reports of the Midwest Category Seminar, volume 137 of Lecture Notes in Mathematics, pages 1–38. Springer-Verlag, 1970.
J-Y Girard. Linear logic. Theoret. Comput. Sci., 50(1):1–102, 1987.
R Harper, F Honsell, and G Plotkin. A framework for defining logics. JACM 40(1):143–184, January 1993.
R Harper, D Sannella, and A Tarlecki. Structured theory representations and logic representations. Ann. Pure Appl Logic, 67:113–160, 1994.
JS Hodas and D Miller. Logic programming in a fragment of intuitionistic linear logic. Informat. Computat., 110(2):327–365, 1994.
S Ishtiaq. A Relevant Analysis of Natural Deduction. PhD thesis, Queen Mary & Westfield College, University of London, 1999.
SS Ishtiaq and DJ Pym. A Relevant Analysis of Natural Deduction. J. Logic Computat., 8(6):809–838, 1998.
S Kripke. Semantic analysis of intuitionistic logic I. In JN Crossley and MAE Dummett, editors, Formal Systems and Recursive Functions, pages 92–130. North-Holland, 1965.
PW O’Hearn and DJ Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215–244, 1999.
A Pitts. Categorical logic. In S Abramsky, D Gabbay, and TSE Maibaum, editors, Handbook of Logic in Computer Science, volume 6. Oxford, 1992.
DJ Pym. A relevant analysis of natural deduction. Lecture at Workshop, EU Espirit Basic Research Action 3245, Logical Frameworks: Design, Implementation and Experiment, Båstad, Sweden, May 1992.
DJ Pym. A note on representation and semantics in logical frameworks. In Proc. CADE-13Workshop on Proof-search in type-theoretic languages, Rutgers University, New Brunswick, NJ, D. Galmiche, ed., 1996. (Also available as Technical Report 725, Department of Computer Science, Queen Mary andWestfield College, University of London.)
DJ Pym. On Bunched Predicate Logic. In Proc. LICS’ 99, Trento, Italy. IEEE Computer Society Press, 1999.
A Salvesen. A proof of the Church-Rosser property for the Edinburgh LF with ?-conversion. Lecture given at the FirstWorkshop on Logical Frameworks, Sophia-Antipolis, France, May 1990.
T Streicher. Correctness and Completeness of a Categorical Semantics of the Calculus of Constructions. PhD thesis, Universität Passau, 1988.
A Urquhart. Semantics for relevant logics. J. Symb. Logic, 37(1):159–169, March 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishtiaq, S., Pym, D.J. (1999). Kripke Resource Models of a Dependently-Typed, Bunched λ-Calculus (Extended Abstract). In: Flum, J., Rodriguez-Artalejo, M. (eds) Computer Science Logic. CSL 1999. Lecture Notes in Computer Science, vol 1683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48168-0_17
Download citation
DOI: https://doi.org/10.1007/3-540-48168-0_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66536-6
Online ISBN: 978-3-540-48168-3
eBook Packages: Springer Book Archive