Aarhus University Seal / Aarhus Universitets segl

Higher-order contexts via games and the Int-construction

Research output: Working paper/Preprint Working paperResearchpeer-review

Standard

Higher-order contexts via games and the Int-construction. / Birkedal, Lars; Bundgaard, Mikkel ; Debois, Søren ; Grohmann, Davide ; Hildebrandt, Thomas.

IT University of Copenhagen, 2009. p. 32.

Research output: Working paper/Preprint Working paperResearchpeer-review

Harvard

Birkedal, L, Bundgaard, M, Debois, S, Grohmann, D & Hildebrandt, T 2009 'Higher-order contexts via games and the Int-construction' IT University of Copenhagen, pp. 32.

APA

Birkedal, L., Bundgaard, M., Debois, S., Grohmann, D., & Hildebrandt, T. (2009). Higher-order contexts via games and the Int-construction. (pp. 32). IT University of Copenhagen. I T University. Technical Report Series Vol. TR-2009-117

CBE

Birkedal L, Bundgaard M, Debois S, Grohmann D, Hildebrandt T. 2009. Higher-order contexts via games and the Int-construction. IT University of Copenhagen. pp. 32.

MLA

Birkedal, Lars et al. Higher-order contexts via games and the Int-construction. 32. IT University of Copenhagen. (I T University. Technical Report Series, Vol. TR-2009-117). 2009,

Vancouver

Birkedal L, Bundgaard M, Debois S, Grohmann D, Hildebrandt T. Higher-order contexts via games and the Int-construction. IT University of Copenhagen. 2009, p. 32.

Author

Birkedal, Lars ; Bundgaard, Mikkel ; Debois, Søren ; Grohmann, Davide ; Hildebrandt, Thomas. / Higher-order contexts via games and the Int-construction. IT University of Copenhagen, 2009. pp. 32 (I T University. Technical Report Series, Vol. TR-2009-117).

Bibtex

@techreport{25351c5f601c4e01b57b93f73b90bc7e,
title = "Higher-order contexts via games and the Int-construction",
abstract = "Monoidal categories of acyclic graphs capture the notion of multi-hole context, pervasive in syntax and semantics. Milner{\textquoteright}s bigraphs isa recent example. We give a method for generalising such categories to monoidal closed categories of acyclic graphs. The method combinens the Int-construction, lifting traced monoidal categories to compact closed ones; the recent formulation of sortings for reactive systems; and games for multiplicative linear logic. The closed categories obtained by our construction captures a notion of higher-order contexts. These encompass extensions to the traditional notion of context found in recent work on Milner{\textquoteright}s reactive systems and bigraphs. We demonstrate how technical devices employed in these extensions are in fact intrinsic to higher-order contexts. Finally, we use the method to construct higher-order bigraphs, recovering directed bigraphs as a limited instance.",
author = "Lars Birkedal and Mikkel Bundgaard and S{\o}ren Debois and Davide Grohmann and Thomas Hildebrandt",
year = "2009",
language = "English",
series = "I T University. Technical Report Series",
pages = "32",
publisher = "IT University of Copenhagen",
type = "WorkingPaper",
institution = "IT University of Copenhagen",

}

RIS

TY - UNPB

T1 - Higher-order contexts via games and the Int-construction

AU - Birkedal, Lars

AU - Bundgaard, Mikkel

AU - Debois, Søren

AU - Grohmann, Davide

AU - Hildebrandt, Thomas

PY - 2009

Y1 - 2009

N2 - Monoidal categories of acyclic graphs capture the notion of multi-hole context, pervasive in syntax and semantics. Milner’s bigraphs isa recent example. We give a method for generalising such categories to monoidal closed categories of acyclic graphs. The method combinens the Int-construction, lifting traced monoidal categories to compact closed ones; the recent formulation of sortings for reactive systems; and games for multiplicative linear logic. The closed categories obtained by our construction captures a notion of higher-order contexts. These encompass extensions to the traditional notion of context found in recent work on Milner’s reactive systems and bigraphs. We demonstrate how technical devices employed in these extensions are in fact intrinsic to higher-order contexts. Finally, we use the method to construct higher-order bigraphs, recovering directed bigraphs as a limited instance.

AB - Monoidal categories of acyclic graphs capture the notion of multi-hole context, pervasive in syntax and semantics. Milner’s bigraphs isa recent example. We give a method for generalising such categories to monoidal closed categories of acyclic graphs. The method combinens the Int-construction, lifting traced monoidal categories to compact closed ones; the recent formulation of sortings for reactive systems; and games for multiplicative linear logic. The closed categories obtained by our construction captures a notion of higher-order contexts. These encompass extensions to the traditional notion of context found in recent work on Milner’s reactive systems and bigraphs. We demonstrate how technical devices employed in these extensions are in fact intrinsic to higher-order contexts. Finally, we use the method to construct higher-order bigraphs, recovering directed bigraphs as a limited instance.

M3 - Working paper

T3 - I T University. Technical Report Series

SP - 32

BT - Higher-order contexts via games and the Int-construction

PB - IT University of Copenhagen

ER -