Zobrazeno 1 - 10
of 178
pro vyhledávání: '"Glynn Winskel"'
Autor:
Marc de Visme, Glynn Winskel
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 2 (2023)
In the simplest form of event structure, a prime event structure, an event is associated with a unique causal history, its prime cause. However, it is quite common for an event to have disjunctive causes in that it can be enabled by any one of multip
Externí odkaz:
https://doaj.org/article/bd2210f601d049049c64d0900ec26520
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 1 (2019)
We build a cartesian closed category, called Cho, based on event structures. It allows an interpretation of higher-order stateful concurrent programs that is refined and precise: on the one hand it is conservative with respect to standard Hyland-Ong
Externí odkaz:
https://doaj.org/article/8ccbe1c5463140a581b1b301367a57df
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 3 (2017)
In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games. In this paper we give a detailed, self-contained and slightly-updated account of the results of Ridea
Externí odkaz:
https://doaj.org/article/98a4f8ac3e354590b83690c0b79d5367
Autor:
Jonathan Hayman, Glynn Winskel
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 1 (2008)
A compositional Petri net-based semantics is given to a simple language allowing pointer manipulation and parallelism. The model is then applied to give a notion of validity to the judgements made by concurrent separation logic that emphasizes the pr
Externí odkaz:
https://doaj.org/article/9e112ea36d064f0da20390b41b2e0313
Publikováno v:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, 2019, 3 (POPL), pp.1-29. ⟨10.1145/3290345⟩
Proceedings of the ACM on Programming Languages, ACM, 2019, 3 (POPL), pp.1-29. ⟨10.1145/3290345⟩
Proceedings of the ACM on Programming Languages, 2019, 3 (POPL), pp.1-29. ⟨10.1145/3290345⟩
Proceedings of the ACM on Programming Languages, ACM, 2019, 3 (POPL), pp.1-29. ⟨10.1145/3290345⟩
Quantum programming languages permit a hardware independent, high-level description of quantum algo rithms. In particular, the quantum lambda-calculus is a higher-order programming language with quantum primitives, mixing quantum data and classical c
Publikováno v:
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018)
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018), Jul 2018, Oxford, France. ⟨10.1145/3209108.3209187⟩
LICS
Symposium on Logic in Computer Science (LCIS 2018)
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018), Jul 2018, Oxford, France. ⟨10.1145/3209108.3209187⟩
LICS
Symposium on Logic in Computer Science (LCIS 2018)
We define a new games model of Probabilistic PCF (PPCF) by enriching thin concurrent games with symmetry, recently introduced by Castellan et al, with probability. This model supports two interpretations of PPCF, one sequential and one parallel. We m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::013f7e7cd115a9486537579553befe74
https://hal.science/hal-01886965
https://hal.science/hal-01886965
Publikováno v:
21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2018)
21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2018), Apr 2018, Thessaloniki, Greece. ⟨10.1007/978-3-319-89366-2_1⟩
FoSSaCS 2018 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)
Lecture Notes in Computer Science ISBN: 9783319893655
FoSSaCS
21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2018), Apr 2018, Thessaloniki, Greece. ⟨10.1007/978-3-319-89366-2_1⟩
FoSSaCS 2018 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)
Lecture Notes in Computer Science ISBN: 9783319893655
FoSSaCS
International audience; The hiding operation, crucial in the compositional aspect of game semantics, removes computation paths not leading to observable results. Accordingly, games models are usually biased towards angelic non-determinism: diverging
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::386799472f9729af3bd716cc367c3dfa
https://hal.archives-ouvertes.fr/hal-01886951
https://hal.archives-ouvertes.fr/hal-01886951
Autor:
Hugo Paquet, Glynn Winskel
Publikováno v:
MFPS
We present a model of concurrent games in which strategies are probabilistic and support both discrete and continuous distributions. This is a generalisation of the probabilistic concurrent strategies of Winskel, based on event structures. We first i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c3840c556c9ff1b21ec0b507f31716b
https://www.repository.cam.ac.uk/handle/1810/298058
https://www.repository.cam.ac.uk/handle/1810/298058
We introduce the notion of a relative pseudomonad, which generalises the notion of a pseudomonad, and define the Kleisli bicategory associated to a relative pseudomonad. We then present an efficient method to define pseudomonas on the Kleisli bicateg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4b367b5b233f840f3b21ec9173f6aca
https://www.repository.cam.ac.uk/handle/1810/269555
https://www.repository.cam.ac.uk/handle/1810/269555
Publikováno v:
MFPS
MFPS 2014
MFPS 2014, Jun 2014, Ithaca, United States. pp.87-107, ⟨10.1016/j.entcs.2014.10.006⟩
MFPS 2014
MFPS 2014, Jun 2014, Ithaca, United States. pp.87-107, ⟨10.1016/j.entcs.2014.10.006⟩
International audience; Concurrent strategies are shown to support operations yielding an economic yet rich higher-order con-current process language, which shares features both with process calculi and nondeterministic dataflow. Its operational sema