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. © 2011 Springer-Verlag.
CITATION STYLE
Laird, J., Manzonetto, G., & McCusker, G. (2011). Constructing differential categories and deconstructing categories of games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6756 LNCS, pp. 186–197). https://doi.org/10.1007/978-3-642-22012-8_14
Mendeley helps you to discover research relevant for your work.