Game semantics for quantum programming
暂无分享,去创建一个
[1] Edmund Robinson,et al. Premonoidal categories and notions of computation , 1997, Mathematical Structures in Computer Science.
[2] Claudia Faggian,et al. Partial Orders, Event Structures and Linear Strategies , 2009, TLCA.
[3] C.-H. Luke Ong,et al. On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..
[4] Octavio Malherbe,et al. Categorical models of computation: partially traced categories and presheaf models of quantum computation , 2013, 1301.5087.
[5] Glynn Winskel,et al. Event Structures with Symmetry , 2007, Computation, Meaning, and Logic.
[6] Patrick Lincoln,et al. Linear logic , 1992, SIGA.
[7] Giulio Manzonetto,et al. Weighted Relational Models of Typed Lambda-Calculi , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.
[8] J GaySimon,et al. Quantum programming languages: survey and bibliography , 2006 .
[9] Jean-Yves Girard,et al. Geometry of Interaction 1: Interpretation of System F , 1989 .
[10] Hayo Thielecke,et al. Closed Freyd- and kappa-categories , 1999, ICALP.
[11] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[12] Dominic R. Verity,et al. Traced monoidal categories , 1996, Mathematical Proceedings of the Cambridge Philosophical Society.
[13] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[14] Michele Pagani,et al. Applying quantitative semantics to higher-order quantum computing , 2013, POPL.
[15] Benoît Valiron,et al. On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract) , 2008, QPL.
[16] Glynn Winskel. Deterministic concurrent strategies , 2012, Formal Aspects of Computing.
[17] Carsten Führmann,et al. Direct Models for the Computational Lambda Calculus , 1999, MFPS.
[18] Glynn Winskel,et al. Concurrent Hyland-Ong games , 2019, Log. Methods Comput. Sci..
[19] Samson Abramsky,et al. Call-by-Value Games , 1997, CSL.
[20] Paul-André Melliès,et al. Game Semantics in String Diagrams , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.
[21] Yannick Delbecque,et al. Game Semantics for Quantum Data , 2011, QPL/DCM@ICALP.
[22] Peter Selinger,et al. Presheaf Models of Quantum Computation: An Outline , 2013, Computation, Logic, Games, and Quantum Foundations.
[23] Simon J. Gay,et al. Quantum Programming Languages Survey and Bibliography , 2006 .
[24] Martin Hyland,et al. Glueing and orthogonality for models of linear logic , 2003, Theor. Comput. Sci..
[25] Benoît Valiron,et al. A Lambda Calculus for Quantum Computation with Classical Control , 2005, TLCA.
[26] Glynn Winskel,et al. The Winning Ways of Concurrent Games , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.
[27] Nobuko Yoshida,et al. Game-Theoretic Analysis of Call-by-Value Computation , 1997, Theor. Comput. Sci..
[28] Peter Selinger,et al. Towards a quantum programming language , 2004, Mathematical Structures in Computer Science.
[29] Glynn Winskel,et al. Distributed Probabilistic and Quantum Strategies , 2013, MFPS.
[30] Pierre Clairambault,et al. Causality vs. Interleavings in Concurrent Game Semantics , 2016, CONCUR.
[31] Glynn Winskel,et al. Games and Strategies as Event Structures , 2017, Log. Methods Comput. Sci..
[32] Glynn Winskel,et al. The Parallel Intensionally Fully Abstract Games Model of PCF , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.
[33] Ugo Dal Lago,et al. The geometry of parallelism: classical, probabilistic, and quantum effects , 2016, POPL.
[34] Radha Jagadeesan,et al. Full Abstraction for PCF , 1994, Inf. Comput..
[35] Samson Abramsky,et al. Concurrent games and full completeness , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[36] Gilles Brassard,et al. Quantum Cryptography , 2005, Encyclopedia of Cryptography and Security.
[37] Glynn Winskel,et al. Symmetry in concurrent games , 2014, CSL-LICS.
[38] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[39] Samuel Mimram,et al. Asynchronous Games: Innocence Without Alternation , 2007, CONCUR.
[40] Glynn Winskel,et al. The concurrent game semantics of Probabilistic PCF , 2018, LICS.
[41] Paul-André Melliès. Asynchronous games 4: a fully complete model of propositional linear logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[42] Ichiro Hasuo,et al. Semantics of Higher-Order Quantum Computation via Geometry of Interaction , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.
[43] Russell Harmer,et al. A fully abstract game semantics for finite nondeterminism , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).
[44] Glynn Winskel,et al. Event Structures , 1986, Advances in Petri Nets.
[45] Glynn Winskel,et al. Concurrent Strategies , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.