Constructing differential categories and deconstructing categories of games
| Autor: | Laird, J., Manzonetto, G., McCusker, G., Aceto, L., Henzinger, M., Sgall, J. |
|---|---|
| Přispěvatelé: | Aceto, Luca, Henzinger, Monika, Sgall, Jiri, Aceto, L., Henzinger, M., Sgall, J. |
| Jazyk: | angličtina |
| Rok vydání: | 2011 |
| Předmět: |
Theoretical computer science
Property (philosophy) Computer science business.industry Data Science Differential structure Nondeterministic algorithm Imperative programming Resource (project management) Mathematics::Category Theory Computer Science::Programming Languages Kripke semantics Lecture Notes in Computer Science Artificial intelligence Differential (infinitesimal) business |
| Zdroj: | Laird, J, Manzonetto, G & McCusker, G 2011, Constructing differential categories and deconstructing categories of games . in L Aceto, M Henzinger & J Sgall (eds), Automata, Languages and Programming-38th International Colloquium, ICALP 2011, Proceedings . Lecture Notes in Computer Science, vol. 6756, Springer, Heidelberg, Germany, pp. 186-197 . https://doi.org/10.1007/978-3-642-22012-8_14 Lecture Notes in Computer Science ; 6756, 186-197. Berlin : Springer STARTPAGE=186;ENDPAGE=197;TITLE=Lecture Notes in Computer Science ; 6756 Automata, Languages and Programming ISBN: 9783642220111 ICALP (2) Aceto, L.; Henzinger, M.; Sgall, J. (ed.), Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, pp. 186-197 |
| DOI: | 10.1007/978-3-642-22012-8_14 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|