Samson Abramsky (2010):
From CSP to Game Semantics.
In: Reflections on the Work of C.A.R. Hoare.
Springer,
London,
pp. 33–45,
doi:10.1007/978-1-84882-912-1_2.
Samson Abramsky, Kohei Honda & Guy McCusker (1998):
A Fully Abstract Game Semantics for General References.
In: Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science.
Society Press,
pp. 334–344,
doi:10.1109/LICS.1998.705669.
Samson Abramsky & Radha Jagadeesan (1994):
Games and full completeness for multiplicative linear logic.
The Journal of Symbolic Logic 59(2),
pp. 543–574,
doi:10.2307/2275407.
Samson Abramsky, Radha Jagadeesan & Pasquale Malacaria (2000):
Full Abstraction for PCF.
Information and Computation 163(2),
pp. 409–470,
doi:10.1006/inco.2000.2930.
Samson Abramsky & Achim Jung (1994):
Domain Theory.
In: S. Abramsky, D. Gabbay & T. S. E. Maibaum: Handbook of Logic in Computer Science.
Oxford University Press,
pp. 1–168.
Available at http://www.cs.ox.ac.uk/files/298/handbook.pdf.
Samson Abramsky & Guy McCusker (1997):
Linearity, Sharing and State: A Fully Abstract Game Semantics for Idealized Algol with Active Expressions.
In: Algol-like Languages.
Birkhäuser,
Boston, MA,
pp. 297–329,
doi:10.1007/978-1-4757-3851-3_10.
Samson Abramsky & Guy McCusker (1999):
Game semantics.
In: Computational logic: Proceedings of the 1997 Marktoberdorf Summer School.
Springer,
Berlin, Heidelberg,
pp. 1–55,
doi:10.1007/978-3-642-58622-4_1.
Samson Abramsky & Paul-André Melliès (1999):
Concurrent Games and Full Completeness.
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science,
LICS '99.
IEEE Computer Society,
USA,
pp. 431–442,
doi:10.1109/LICS.1999.782638.
JiříAdámek (1995):
Recursive Data Types in Algebraically ω-Complete Categories.
Information and Computation 118(2),
pp. 181–190,
doi:10.1006/inco.1995.1061.
JiříAdámek (2002):
Final Coalgebras are Ideal Completions of Initial Algebras.
Journal of Logic and Computation 12(2),
pp. 217–242,
doi:10.1093/logcom/12.2.217.
Arthur Azevedo de Amorim, Nathan Collins, André DeHon, Delphine Demange, Cătălin Hriţcu, David Pichardie, Benjamin C Pierce, Randy Pollack & Andrew Tolmach (2014):
A verified information-flow architecture.
In: Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL'14.
ACM,
New York, NY, USA,
pp. 165–178,
doi:10.1145/2535838.2535839.
Andrew W. Appel, Lennart Beringer, Adam Chlipala, Benjamin C Pierce, Zhong Shao, Stephanie Weirich & Steve Zdancewic (2017):
Position paper: the science of deep specification.
Philosophical Transactions of the Royal Society A 375(2104),
pp. 20160331,
doi:10.1098/rsta.2016.0331.
Ingo Battenfeld (2013):
Comparing approaches to free dcpo-algebra constructions.
The Journal of Logic and Algebraic Programming 82(1),
pp. 53–70,
doi:10.1016/j.jlap.2012.10.001.
Gershom Bazerman & Raymond Puzio (2020):
The Topological and Logical Structure of Concurrency and Dependency via Distributive Lattices.
Available at https://arxiv.org/abs/2004.05688.
Andreas Blass (1992):
A game semantics for linear logic.
Annals of Pure and Applied Logic 56(1–3),
pp. 183–220,
doi:10.1016/0168-0072(92)90073-9.
Nathan Bowler, Paul Blain Levy & Gordon Plotkin (2018):
Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies.
Electronic Notes in Theoretical Computer Science 341,
pp. 23–44,
doi:10.1016/j.entcs.2018.11.003.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIV).
Ana C. Calderon & Guy McCusker (2010):
Understanding Game Semantics Through Coherence Spaces.
Electronic Notes in Theoretical Computer Science 265,
pp. 231–244,
doi:10.1016/j.entcs.2010.08.014.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2010).
Simon Castellan, Pierre Clairambault, Jonathan Hayman & Glynn Winskel (2018):
Non-angelic concurrent game semantics.
In: Proceedings of the 21st International Conference on Foundations of Software Science and Computation Structures,
FoSSaCS 2018.
Springer,
Cham, Switzerland,
pp. 3–19,
doi:10.1007/978-3-319-89366-2_1.
Joonwon Choi, Muralidaran Vijayaraghavan, Benjamin Sherman, Adam Chlipala & Arvind (2017):
Kami: A Platform for High-Level Parametric Hardware Specification and Its Modular Verification.
Proceedings of the ACM on Programming Languages 1(ICFP),
doi:10.1145/3110268.
Neil Ghani, Christoph Lüth, Federico de Marchi & John Power (2001):
Algebras, Coalgebras, Monads and Comonads.
Electronic Notes in Theoretical Computer Science 44(1),
pp. 128–145,
doi:10.1016/S1571-0661(04)80905-8.
CMCS 2001, Coalgebraic Methods in Computer Science (a Satellite Event of ETAPS 2001).
Dan R. Ghica & Andrzej S. Murawski (2004):
Angelic Semantics of Fine-Grained Concurrency.
In: Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures,
FoSSaCS 2004.
Springer,
Berlin, Heidelberg,
pp. 211–225,
doi:10.1007/978-3-540-24727-2_16.
W. John Gowers & James D. Laird (2018):
A Fully Abstract Game Semantics for Countable Nondeterminism.
In: Dan Ghica & Achim Jung: 27th EACSL Annual Conference on Computer Science Logic (CSL 2018),
Leibniz International Proceedings in Informatics (LIPIcs) 119.
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik,
Dagstuhl, Germany,
pp. 24:1–24:18,
doi:10.4230/LIPIcs.CSL.2018.24.
Ronghui Gu, Jérémie Koenig, Tahina Ramananandro, Zhong Shao, Xiongnan (Newman) Wu, Shu-Chun Weng, Haozhong Zhang & Yu Guo (2015):
Deep Specifications and Certified Abstraction Layers.
In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '15.
ACM,
New York, NY, USA,
pp. 595–608,
doi:10.1145/2676726.2676975.
Ronghui Gu, Zhong Shao, Hao Chen, Xiongnan Wu, Jieung Kim, Vilhelm Sjöberg & David Costanzo (2016):
CertiKOS: An Extensible Architecture for Building Certified Concurrent OS Kernels.
In: Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation,
OSDI'16.
USENIX Association,
Berkeley, CA, USA,
pp. 653–669,
doi:10.5555/3026877.3026928.
Russell Harmer & Guy McCusker (1999):
A fully abstract game semantics for finite nondeterminism.
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science,
LICS '99.
IEEE Computer Society,
USA,
pp. 422–430,
doi:10.1109/LICS.1999.782637.
Claudio Hermida & Bart Jacobs (1998):
Structural Induction and Coinduction in a Fibrational Setting.
Information and Computation 145(2),
pp. 107–152,
doi:10.1006/inco.1998.2725.
J. M. E. Hyland & C.-H. L. Ong (2000):
On Full Abstraction for PCF: I, II, and III.
Information and Computation 163(2),
pp. 285–408,
doi:10.1006/inco.2000.2917.
Martin Hyland, Gordon Plotkin & John Power (2006):
Combining effects: Sum and tensor.
Theoretical Computer Science 357(1),
pp. 70–99,
doi:10.1016/j.tcs.2006.03.013.
Clifford Lectures and the Mathematical Foundations of Programming Semantics.
Pierre Hyvernat (2013):
A linear category of polynomial functors (extensional part).
Available at https://arxiv.org/abs/1403.0833.
Pierre Hyvernat (2014):
A linear category of polynomial diagrams.
Mathematical Structures in Computer Science 24(1),
doi:10.1017/S0960129512001016.
Gerwin Klein, Kevin Elphinstone, Gernot Heiser, June Andronick, David Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt, Rafal Kolanski & Michael Norrish (2009):
seL4: formal verification of an OS kernel.
In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles,
SOSP '09.
ACM,
New York, NY, USA,
pp. 207–220,
doi:10.1145/1629575.1629596.
Jérémie Koenig & Zhong Shao (2020):
Refinement-Based Game Semantics for Certified Abstraction Layers.
In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,
LICS '20.
ACM,
New York, NY, USA,
pp. 633647,
doi:10.1145/3373718.3394799.
Nicolas Koh, Yao Li, Yishuai Li, Li-yao Xia, Lennart Beringer, Wolf Honoré, William Mansky, Benjamin C Pierce & Steve Zdancewic (2019):
From C to interaction trees: specifying, verifying, and testing a networked server.
In: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs.
ACM,
pp. 234–248,
doi:10.1145/3293880.3294106.
Dexter Kozen (2011):
Realization of Coinductive Types.
In: Michael Mislove & Joël Ouaknine: Proceedings of the 27th Conference on Mathematical Foundations of Programming Semantics,
MFPS XXVII.
Elsevier,
Pittsburgh, PA,
pp. 148–155,
doi:10.1016/j.entcs.2011.09.024.
Ramana Kumar, Magnus Myreen, Michael Norrish & Scott Owens (2014):
CakeML: A Verified Implementation of ML.
In: Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL'14.
ACM,
New York, NY, USA,
pp. 179–191,
doi:10.1145/2578855.2535841.
James Laird (1997):
Full abstraction for functional languages with control.
In: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science,
LICS '97.
IEEE Computer Society,
USA,
pp. 58–67,
doi:10.1109/LICS.1997.614931.
Xavier Leroy (2009):
Formal Verification of a Realistic Compiler.
Communications of the ACM 52(7),
pp. 107–115,
doi:10.1145/1538788.1538814.
Paul Blain Levy & Sam Staton (2014):
Transition Systems over Games.
In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
CSL-LICS '14.
Association for Computing Machinery,
New York, NY, USA,
doi:10.1145/2603088.2603150.
Paul-André Melliès (2004):
Asynchronous games 2: the true concurrency of innocence.
In: Proceedings of the 15th International Conference on Concurrency Theory,
CONCUR 2004.
Springer,
Berlin, Heidelberg,
pp. 448–465,
doi:10.1016/j.tcs.2006.01.016.
Paul-André Melliès (2019):
Categorical combinatorics of scheduling and synchronization in game semantics.
Proceedings of the ACM on Programming Languages 3(POPL),
pp. 1–30,
doi:10.1145/3290336.
Paul-André Melliès & Samuel Mimram (2007):
Asynchronous Games: Innocence Without Alternation.
In: Proceedings of the 18th International Conference on Concurrency Theory,
CONCUR 2007.
Springer,
Berlin, Heidelberg,
pp. 395–411,
doi:10.1007/978-3-540-74407-8_27.
Eugenio Moggi (1991):
Notions of computation and monads.
Information and computation 93(1),
pp. 55–92,
doi:10.1016/0890-5401(91)90052-4.
Andrzej S. Murawski (2008):
Reachability Games and Game Semantics: Comparing Nondeterministic Programs.
In: Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science,
LICS 2008.
IEEE Computer Society,
USA,
pp. 353–363,
doi:10.1109/LICS.2008.24.
Gordon Plotkin & John Power (2001):
Adequacy for Algebraic Effects.
In: Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures,
FoSSaCS 2001.
Springer,
Berlin, Heidelberg,
pp. 1–24,
doi:10.1007/3-540-45315-6_1.
Gordon Plotkin & Matija Pretnar (2009):
Handlers of algebraic effects.
In: Proceedings of the 18th European Symposium on Programming,
ESOP 2009.
Springer,
Berlin, Heidelberg,
pp. 80–94,
doi:10.1007/978-3-642-00590-9_7.
Zhong Shao (2010):
Certified Software.
Communications of the ACM 53(12),
pp. 56–66,
doi:10.1145/1859204.1859226.
David I. Spivak (2020):
Poly: An abundant categorical setting for mode-dependent dynamics.
Available at https://arxiv.org/abs/2005.01894.
Věra Trnková, JiříAdámek, Václav Koubek & Jan Reiterman (1975):
Free algebras, input processes and free monads.
Commentationes Mathematicae Universitatis Carolinae 16(2),
pp. 339–351.
Available at http://hdl.handle.net/10338.dmlcz/105628.
Takeshi Tsukada & C.-H. Luke Ong (2015):
Nondeterminism in game semantics via sheaves.
In: Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science,
LICS 2015.
IEEE Computer Society,
USA,
pp. 220–231,
doi:10.1109/LICS.2015.30.
Jianzhou Zhao, Santosh Nagarakatte, Milo MK Martin & Steve Zdancewic (2012):
Formalizing the LLVM intermediate representation for verified program transformations.
In: Proceedings of the 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL'12.
ACM,
New York, NY, USA,
pp. 427–440,
doi:10.1145/2103621.2103709.
eptcs@eptcs.org