Abstract
We present an abstract construction for building differential categories useful to model resource sensitive calculi, and we apply it to categories of games. In one instance, we recover a category previously used to give a fully abstract model of a nondeterministic imperative language. The construction exposes the differential structure already present in this model. A second instance corresponds to a new Cartesian differential category of games. We give a model of a Resource PCF in this category and show that it enjoys the finite definability property. Comparison with a relational semantics reveals that the latter also possesses this property and is fully abstract.
This is a preview of subscription content, log in via an institution to check access.
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
Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In: O’Hearn, P.W., Tennent, R.D. (eds.) Algol-like Languages, vol. 2, pp. 297–329. Birkhaüser, Basel (1997)
Baillot, P., Danos, V., Ehrhard, T., Regnier, L.: Timeless games. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 56–77. Springer, Heidelberg (1999)
Blute, R.F., Cockett, J.R.B., Seely, R.A.G.: Differential categories. Mathematical Structures in Comp. Sci. 16, 1049–1083 (2006)
Blute, R.F., Cockett, J.R.B., Seely, R.A.G.: Cartesian differential categories. Theory and Applications of Categories 22(23), 622–672 (2009)
Bucciarelli, A., Ehrhard, T., Manzonetto, G.: Categorical models for simply typed resource calculi. ENTCS 265, 213–230 (2010); Proc. of MFPS 2010
Ehrhard, T., Regnier, L.: The differential lambda-calculus. Theor. Comput. Sci. 309, 1–41 (2003)
Harmer, R.: Games and full abstraction for nondeterministic languages. PhD thesis, University of London (1999)
Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: LICS 1999, pp. 422–430 (1999)
Mac Lane, S.: Categories for the working mathematician. Springer, Berlin (1971)
McCusker, G.: Games and full abstraction for a functional metalanguage with recursive types. Distinguished Dissertations in Comp. Sci. Springer, Heidelberg (1998)
Melliès, P.-A., Tabareau, N., Tasson, C.: An explicit formula for the free exponential modality of linear logic. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 247–260. Springer, Heidelberg (2009)
Melliès, P.-A.: Asynchronous games 2: the true concurrency of innocence. Theor. Comput. Sci. 358, 200–228 (2006)
Pagani, M., Tranquilli, P.: Parallel reduction in resource lambda-calculus. In: Hu, Z. (ed.) APLAS 2009. LNCS, vol. 5904, pp. 226–242. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laird, J., Manzonetto, G., McCusker, G. (2011). Constructing Differential Categories and Deconstructing Categories of Games. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-22012-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22011-1
Online ISBN: 978-3-642-22012-8
eBook Packages: Computer ScienceComputer Science (R0)