default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGlynn Winskel
Person information
- affiliation: University of Cambridge, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c95]Yoàv Montacute
, Glynn Winskel:
Concurrent Games over Relational Structures: The Origin of Game Comonads. LICS 2024: 58:1-58:14- [i10]Sacha Huriot-Tattegrain, Glynn Winskel:
Concurrent Strategies on Games with Algebras. CoRR abs/2402.04590 (2024) - [i9]Yoàv Montacute, Glynn Winskel:
Concurrent Games over Relational Structures: The Origin of Game Comonads. CoRR abs/2405.11267 (2024) - 2023
- [j32]Marc de Visme, Glynn Winskel:
Causal Unfoldings and Disjunctive Causes. Log. Methods Comput. Sci. 19(2) (2023) - [c94]Glynn Winskel:
Making Concurrency Functional. LICS 2023: 1-14 - 2022
- [i8]Glynn Winskel:
Making Concurrency Functional. CoRR abs/2202.13910 (2022) - 2021
- [i7]Simon Castellan, Pierre Clairambault, Glynn Winskel:
The Mays and Musts of Concurrent Strategies. CoRR abs/2108.10558 (2021) - 2020
- [i6]Marc de Visme, Glynn Winskel:
Causal Unfoldings and Disjunctive Causes. CoRR abs/2003.06267 (2020)
2010 – 2019
- 2019
- [j31]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Thin Games with Symmetry and Concurrent Hyland-Ong Games. Log. Methods Comput. Sci. 15(1) (2019) - [j30]Pierre Clairambault, Marc de Visme, Glynn Winskel:
Game semantics for quantum programming. Proc. ACM Program. Lang. 3(POPL): 32:1-32:29 (2019) - [c93]Marc de Visme, Glynn Winskel:
Causal Unfoldings. CALCO 2019: 9:1-9:18 - [c92]Pierre Clairambault, Marc de Visme, Glynn Winskel:
Concurrent Quantum Strategies. RC 2019: 3-19 - 2018
- [c91]Aurore Alcolei, Pierre Clairambault, Martin Hyland, Glynn Winskel:
The True Concurrency of Herbrand's Theorem. CSL 2018: 5:1-5:22 - [c90]Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel:
Non-angelic Concurrent Game Semantics. FoSSaCS 2018: 3-19 - [c89]Simon Castellan, Pierre Clairambault, Hugo Paquet, Glynn Winskel:
The concurrent game semantics of Probabilistic PCF. LICS 2018: 215-224 - [c88]Hugo Paquet, Glynn Winskel:
Continuous Probability Distributions in Concurrent Games. MFPS 2018: 321-344 - 2017
- [j29]Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel:
Games and Strategies as Event Structures. Log. Methods Comput. Sci. 13(3) (2017) - [c87]Marc de Visme, Glynn Winskel:
Strategies with Parallel Causes. CSL 2017: 41:1-41:21 - [c86]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Distributed Strategies Made Easy. MFCS 2017: 81:1-81:13 - [c85]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Observably Deterministic Concurrent Strategies and Intensional Full Abstraction for Parallel-or. FSCD 2017: 12:1-12:16 - 2016
- [i5]Simon Castellan, Pierre Clairambault, Silvain Rideau, Glynn Winskel:
Concurrent Games. CoRR abs/1604.04390 (2016) - [i4]Marc de Visme, Glynn Winskel:
Strategies with Parallel Causes. CoRR abs/1607.03747 (2016) - [i3]Glynn Winskel:
Distributed Games and Strategies. CoRR abs/1607.03760 (2016) - 2015
- [c84]Glynn Winskel:
On Probabilistic Distributed Strategies. ICTAC 2015: 69-88 - [c83]Simon Castellan, Pierre Clairambault, Glynn Winskel:
The Parallel Intensionally Fully Abstract Games Model of PCF. LICS 2015: 232-243 - 2014
- [j28]Julian Gutierrez, Glynn Winskel:
On the determinacy of concurrent games on event structures with infinite winning sets. J. Comput. Syst. Sci. 80(6): 1119-1137 (2014) - [c82]Glynn Winskel:
Probabilistic and Quantum Event Structures. Horizons of the Mind 2014: 476-497 - [c81]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Symmetry in concurrent games. CSL-LICS 2014: 28:1-28:10 - [c80]Simon Castellan, Jonathan Hayman, Marc Lasson, Glynn Winskel:
Strategies as Concurrent Processes. MFPS 2014: 87-107 - [e4]Benedikt Löwe, Glynn Winskel:
Proceedings 8th International Workshop on Developments in Computational Models, DCM 2012, Cambridge, United Kingdom, 17 June 2012. EPTCS 143, 2014 [contents] - [i2]Simon Castellan, Pierre Clairambault, Glynn Winskel:
Concurrent Hyland-Ong games. CoRR abs/1409.7542 (2014) - 2013
- [j27]Vincent Danos, Russell Harmer, Glynn Winskel:
Constraining rule-based dynamics with types. Math. Struct. Comput. Sci. 23(2): 272-289 (2013) - [c79]Pierre Clairambault, Julian Gutierrez, Glynn Winskel:
Imperfect Information in Logic and Concurrent Games. Computation, Logic, Games, and Quantum Foundations 2013: 7-20 - [c78]Julian Gutierrez, Glynn Winskel:
Borel Determinacy of Concurrent Games. CONCUR 2013: 516-530 - [c77]Glynn Winskel:
Strategies as Profunctors. FoSSaCS 2013: 418-433 - [c76]Pierre Clairambault, Glynn Winskel:
On Concurrent Games with Payoff. MFPS 2013: 71-92 - [c75]Glynn Winskel:
Distributed Probabilistic and Quantum Strategies. MFPS 2013: 403-425 - 2012
- [j26]Glynn Winskel:
Deterministic concurrent strategies. Formal Aspects Comput. 24(4-6): 647-660 (2012) - [c74]Glynn Winskel:
Winning, Losing and Drawing in Concurrent Games with Perfect or Imperfect Information. Logic and Program Semantics 2012: 298-317 - [c73]Glynn Winskel:
Bicategories of Concurrent Games - (Invited Paper). FoSSaCS 2012: 26-41 - [c72]Vincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jonathan Hayman, Jean Krivine, Christopher D. Thompson-Walsh, Glynn Winskel:
Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models. FSTTCS 2012: 276-288 - [c71]Pierre Clairambault, Julian Gutierrez, Glynn Winskel:
The Winning Ways of Concurrent Games. LICS 2012: 235-244 - 2011
- [j25]Glynn Winskel:
Events, Causality and Symmetry. Comput. J. 54(1): 42-57 (2011) - [c70]Silvain Rideau, Glynn Winskel:
Concurrent Strategies. LICS 2011: 409-418 - [c69]Christopher D. Thompson-Walsh, Jonathan Hayman, Glynn Winskel:
Containment in Rule-Based Models. SASB 2011: 125-137 - 2010
- [c68]Sam Staton, Glynn Winskel:
On the Expressivity of Symmetry in Event Structures. LICS 2010: 392-401
2000 – 2009
- 2009
- [j24]Glynn Winskel:
Prime algebraicity. Theor. Comput. Sci. 410(41): 4160-4168 (2009) - [c67]David Turner, Glynn Winskel:
Nominal Domain Theory for Concurrency. CSL 2009: 546-560 - 2008
- [j23]Jonathan Hayman, Glynn Winskel:
Independence and Concurrent Separation Logic. Log. Methods Comput. Sci. 4(1) (2008) - [c66]Glynn Winskel:
Events, Causality and Symmetry. BCS Int. Acad. Conf. 2008: 111-127 - [c65]Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel:
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. Concurrency, Graphs and Models 2008: 757-777 - [c64]Jonathan Hayman, Glynn Winskel:
The unfolding of general Petri nets. FSTTCS 2008: 223-234 - [i1]Jonathan Hayman, Glynn Winskel:
Independence and Concurrent Separation Logic. CoRR abs/0802.0820 (2008) - 2007
- [c63]Glynn Winskel:
Symmetry and Concurrency. CALCO 2007: 40-64 - [c62]Luca Cardelli, Marcelo P. Fiore, Glynn Winskel:
Preface. Computation, Meaning, and Logic 2007: 1-4 - [c61]Glynn Winskel:
Event Structures with Symmetry. Computation, Meaning, and Logic 2007: 611-652 - [e3]Luca Cardelli, Marcelo Fiore, Glynn Winskel:
Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin. Electronic Notes in Theoretical Computer Science 172, Elsevier 2007 [contents] - 2006
- [j22]Daniele Varacca, Glynn Winskel:
Distributing probability over non-determinism. Math. Struct. Comput. Sci. 16(1): 87-113 (2006) - [j21]Daniele Varacca, Hagen Völzer, Glynn Winskel:
Probabilistic event structures and domains. Theor. Comput. Sci. 358(2-3): 173-199 (2006) - [c60]Jonathan Hayman, Glynn Winskel:
Independence and Concurrent Separation Logic. LICS 2006: 147-156 - [c59]Lucy Saunders-Evans, Glynn Winskel:
Event Structure Spans for Nondeterministic Dataflow. EXPRESS 2006: 109-129 - 2005
- [j20]Gian Luca Cattani, Glynn Winskel:
Profunctors, open maps and bisimulation. Math. Struct. Comput. Sci. 15(3): 553-614 (2005) - [c58]Glynn Winskel:
Relations in Concurrency. LICS 2005: 2-11 - [c57]Glynn Winskel:
Name Generation and Linearity. LICS 2005: 301-310 - 2004
- [j19]Thomas T. Hildebrandt, Prakash Panangaden, Glynn Winskel:
A relational model of non-deterministic dataflow. Math. Struct. Comput. Sci. 14(5): 613-649 (2004) - [j18]Mikkel Nygaard, Glynn Winskel:
Domain theory for concurrency. Theor. Comput. Sci. 316(1): 153-190 (2004) - [c56]Daniele Varacca, Hagen Völzer, Glynn Winskel:
Probabilistic Event Structures and Domains. CONCUR 2004: 481-496 - [c55]Glynn Winskel, Francesco Zappa Nardelli:
New-HOPLA: A Higher-order Process Language with Name Generation. IFIP TCS 2004: 521-534 - [c54]Mario Cáccamo, Glynn Winskel:
Limit Preservation from Naturality. CTCS 2004: 3-22 - [c53]Federico Crazzolara, Glynn Winskel:
Petri Nets With Persistence. WISP@ICATPN 2004: 143-155 - 2003
- [j17]Gian Luca Cattani, Glynn Winskel:
Presheaf models for CCS-like languages. Theor. Comput. Sci. 300(1-3): 47-89 (2003) - [c52]Mikkel Nygaard, Glynn Winskel:
Full Abstraction for HOPLA. CONCUR 2003: 378-392 - 2002
- [j16]Glynn Winskel:
Guest Editorial. Inf. Comput. 179(2): 151 (2002) - [c51]Mikkel Nygaard, Glynn Winskel:
HOPLA-A Higher-Order Process Language. CONCUR 2002: 434-448 - [c50]Glynn Winskel:
Calculus for categories. FICS 2002: 1 - [c49]Federico Crazzolara, Glynn Winskel:
Composing Strand Spaces. FSTTCS 2002: 97-108 - [c48]Mikkel Nygaard, Glynn Winskel:
Linearity in Process Languages. LICS 2002: 433- - 2001
- [c47]Federico Crazzolara, Glynn Winskel:
Events in security protocols. CCS 2001: 96-105 - [c46]Federico Crazzolara, Glynn Winskel:
Petri nets in cryptographic protocols. IPDPS 2001: 149 - [c45]Mario Cáccamo, Glynn Winskel:
A Higher-Order Calculus for Categories. TPHOLs 2001: 136-153 - 2000
- [j15]Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel:
Preface. Ann. Pure Appl. Log. 104(1-3): 1-2 (2000) - [c44]Pierre-Louis Curien, Gordon D. Plotkin, Glynn Winskel:
Bistructures, bidomains, and linear logic. Proof, Language, and Interaction 2000: 21-54
1990 – 1999
- 1999
- [c43]Glynn Winskel:
Event Structures as Presheaves -Two Representation Theorems. CONCUR 1999: 541-556 - [c42]Marcelo P. Fiore, Gian Luca Cattani, Glynn Winskel:
Weak Bisimulation and Open Maps. LICS 1999: 67-76 - 1998
- [c41]Glynn Winskel:
A Linear Metalanguage for Concurrency. AMAST 1998: 42-58 - [c40]Gian Luca Cattani, John Power, Glynn Winskel:
A Categorical Axiomatics for Bisimulation. CONCUR 1998: 581-596 - [c39]Thomas T. Hildebrandt, Prakash Panangaden, Glynn Winskel:
A Relational Model of Non-deterministic Dataflow. CONCUR 1998: 613-628 - [c38]Gian Luca Cattani, Marcelo P. Fiore, Glynn Winskel:
A Theory of Recursive Domains with Applications to Concurrency. LICS 1998: 214-225 - [e2]Kim Guldstrand Larsen, Sven Skyum, Glynn Winskel:
Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings. Lecture Notes in Computer Science 1443, Springer 1998, ISBN 3-540-64781-3 [contents] - 1997
- [j14]Uffe Engberg, Glynn Winskel:
Completeness Results for Linear Logic on Petri Nets. Ann. Pure Appl. Log. 86(2): 101-135 (1997) - [c37]Gian Luca Cattani, Ian Stark, Glynn Winskel:
Presheaf Models for the pi-Calculus. Category Theory and Computer Science 1997: 106-126 - [c36]Glynn Winskel:
An Operational Understanding of Bisimulation from Open Maps. HOOTS 1997: 50 - 1996
- [j13]André Joyal, Mogens Nielsen, Glynn Winskel:
Bisimulation from Open Maps. Inf. Comput. 127(2): 164-185 (1996) - [j12]Mogens Nielsen, Glynn Winskel:
Petri Nets and Bisimulation. Theor. Comput. Sci. 153(1&2): 211-244 (1996) - [j11]Vladimiro Sassone, Mogens Nielsen, Glynn Winskel:
Models for Concurrency: Towards a Classification. Theor. Comput. Sci. 170(1-2): 297-348 (1996) - [c35]Glynn Winskel:
A Presheaf Semantics of Value-Passing Processes. CONCUR 1996: 98-114 - [c34]Gian Luca Cattani, Glynn Winskel:
Presheaf Models for Concurrency. CSL 1996: 58-75 - [c33]Glynn Winskel, Mogens Nielsen:
Presheaves as transition systems. Partial Order Methods in Verification 1996: 129-140 - 1995
- [j10]Juanito Camilleri, Glynn Winskel:
CCS with Priority Choice. Inf. Comput. 116(1): 26-37 (1995) - [p1]Mogens Nielsen, Glynn Winskel:
Trace Structures and other Models for Concurrency. The Book of Traces 1995: 271-305 - 1994
- [c32]Gordon D. Plotkin, Glynn Winskel:
Bistructures, Bidomains and Linear Logic. ICALP 1994: 352-363 - [c31]Henrik Reif Andersen, Colin Stirling, Glynn Winskel:
A Compositional Proof System for the Modal mu-Calculus. LICS 1994: 144-153 - [c30]Glynn Winskel:
Stable Bistructure Models of PCF. MFCS 1994: 177-197 - 1993
- [b1]Glynn Winskel:
The formal semantics of programming languages - an introduction. Foundation of computing series, MIT Press 1993, ISBN 978-0-262-23169-5, pp. I-XVIII, 1-361 - [c29]Vladimiro Sassone, Mogens Nielsen, Glynn Winskel:
A Classification of Models for Concurrency. CONCUR 1993: 82-96 - [c28]André Joyal, Mogens Nielsen, Glynn Winskel:
Bisimulation and open maps. LICS 1993: 418-427 - [c27]Uffe Engberg, Glynn Winskel:
Completeness Results for Linear Logic on Petri Nets. MFCS 1993: 442-452 - [c26]Vladimiro Sassone, Mogens Nielsen, Glynn Winskel:
Deterministic Behavioural Models for Concurrency. MFCS 1993: 682-692 - [c25]Uffe Engberg, Glynn Winskel:
Linear Logic on Petri Nets. REX School/Symposium 1993: 176-229 - [c24]Mogens Nielsen, Vladimiro Sassone, Glynn Winskel:
Relationships Between Models of Concurrency. REX School/Symposium 1993: 425-476 - 1992
- [j9]Henrik Reif Andersen, Glynn Winskel:
Compositional Checking of Satsfaction. Formal Methods Syst. Des. 1(4): 323-354 (1992) - 1991
- [j8]Kim Guldstrand Larsen, Glynn Winskel:
Using Information Systems to Solve Recursive Domain Equations. Inf. Comput. 91(2): 232-258 (1991) - [j7]Glynn Winskel:
A Note on Model Checking the Modal nu-Calculus. Theor. Comput. Sci. 83(1): 157-167 (1991) - [c23]Henrik Reif Andersen, Glynn Winskel:
Compositional Checking of Satisfaction. CAV 1991: 24-36 - [c22]Glynn Winskel:
Petri Nets and Transition Systems (Abstract for an invited talk). FSTTCS 1991: 420 - [c21]Juanito Camilleri, Glynn Winskel:
CCS with Priority Choice. LICS 1991: 246-255 - 1990
- [j6]Glynn Winskel:
A Compositional Proof System on a Category of Labelled Transition Systems. Inf. Comput. 87(1/2): 2-57 (1990) - [c20]Uffe Engberg, Glynn Winskel:
Petri Nets as Models of Linear Logic. CAAP 1990: 147-161 - [c19]Glynn Winskel:
On the Compositional Checking of Validity (Extended Abstract). CONCUR 1990: 481-501
1980 – 1989
- 1989
- [j5]Thierry Coquand, Carl A. Gunter, Glynn Winskel:
Domain Theoretic Models of Polymorphism. Inf. Comput. 81(2): 123-167 (1989) - [c18]Glynn Winskel:
A Note on Model Checking the Modal nu-Calculus. ICALP 1989: 761-772 - 1988
- [c17]Glynn Winskel:
A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract). LICS 1988: 142-154 - [c16]Glynn Winskel:
An introduction to event structures. REX Workshop 1988: 364-397 - 1987
- [j4]Glynn Winskel:
Petri Nets, Algebras, Morphisms, and Compositionality. Inf. Comput. 72(3): 197-238 (1987) - [c15]Glynn Winskel:
Relating Two Models of Hardware. Category Theory and Computer Science 1987: 98-113 - [c14]Thierry Coquand, Carl A. Gunter, Glynn Winskel:
DI-Domains as a Model of Polymorphism. MFPS 1987: 344-363 - 1986
- [c13]Glynn Winskel:
Event Structures. Advances in Petri Nets 1986: 325-392 - 1985
- [j3]Glynn Winskel:
On Powerdomains and Modality. Theor. Comput. Sci. 36: 127-137 (1985) - [c12]Glynn Winskel:
Petri nets, morphisms and compositionality. Applications and Theory in Petri Nets 1985: 453-477 - [c11]Glynn Winskel:
Category Theory and Models for Parallel Computation. CTCS 1985: 266-281 - [c10]Glynn Winskel:
A Complete System for SCCS with Modal Assertions. FSTTCS 1985: 392-410 - [e1]Stephen D. Brookes, A. W. Roscoe, Glynn Winskel:
Seminar on Concurrency, Carnegie-Mellon University, Pittsburg, PA, USA, July 9-11, 1984. Lecture Notes in Computer Science 197, Springer 1985, ISBN 3-540-15670-4 [contents] - 1984
- [j2]Glynn Winskel:
Synchronization Trees. Theor. Comput. Sci. 34: 33-82 (1984) - [c9]Glynn Winskel:
On the Composition and Decomposition of Assertions. Seminar on Concurrency 1984: 62-75 - [c8]Glynn Winskel:
Categories of Models for Concurrency. Seminar on Concurrency 1984: 246-267 - [c7]Glynn Winskel, Kim Guldstrand Larsen:
Using Information Systems to Solve Recursive Domain Equations Effectively. Semantics of Data Types 1984: 109-129 - [c6]Glynn Winskel:
A New Definition of Morphism on Petri Nets. STACS 1984: 140-150 - 1983
- [c5]Glynn Winskel:
A Note on Powerdomains and Modalitiy. FCT 1983: 505-514 - [c4]Glynn Winskel:
Synchronisation Trees. ICALP 1983: 695-711 - 1982
- [c3]Glynn Winskel:
Event Structure Semantics for CCS and Related Languages. ICALP 1982: 561-576 - 1981
- [j1]Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel:
Petri Nets, Event Structures and Domains, Part I. Theor. Comput. Sci. 13: 85-108 (1981) - [c2]Glynn Winskel:
An Exercise in Processes with Infinite Pasts. Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets 1981: 88-95
1970 – 1979
- 1979
- [c1]Mogens Nielsen, Gordon D. Plotkin, Glynn Winskel:
Petri Nets, Event Structures and Domains. Semantics of Concurrent Computation 1979: 266-284
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-26 18:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
