| 2013 | ||
|---|---|---|
| i6 | Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron: Quipper: A Scalable Quantum Programming Language. CoRR abs/1304.3390 (2013) | |
| i5 | Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron: An Introduction to Quantum Programming in Quipper. CoRR abs/1304.5485 (2013) | |
| 2012 | ||
| j20 | Peter Selinger: Finite dimensional Hilbert spaces are complete for dagger compact closed categories. Logical Methods in Computer Science 8(3) (2012) | |
| c8 | ||
| i4 | ||
| i3 | Brett Giles, Peter Selinger: Exact synthesis of multi-qubit Clifford+T circuits. CoRR abs/1212.0506 (2012) | |
| 2011 | ||
| j19 | Bob Coecke, Ian Mackie, Prakash Panangaden, Peter Selinger: Preface. Electr. Notes Theor. Comput. Sci. 270(1): 1-2 (2011) | |
| j18 | Peter Selinger: Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract). Electr. Notes Theor. Comput. Sci. 270(1): 113-119 (2011) | |
| j17 | Bob Coecke, Prakash Panangaden, Peter Selinger: Preface. Electr. Notes Theor. Comput. Sci. 270(2): 1-2 (2011) | |
| e1 | Bart Jacobs, Peter Selinger, Bas Spitters (Eds.): Proceedings 8th International Workshop on Quantum Physics and Logic. EPTCS 95, 2011 | |
| 2010 | ||
| j16 | ||
| 2008 | ||
| j15 | ||
| j14 | Peter Selinger: Idempotents in Dagger Categories: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 210: 107-122 (2008) | |
| j13 | Peter Selinger, Benoît Valiron: On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 210: 123-137 (2008) | |
| c7 | Peter Selinger, Benoît Valiron: A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract). FoSSaCS 2008: 81-96 | |
| i2 | Peter Selinger, Benoît Valiron: A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract). CoRR abs/0801.0813 (2008) | |
| i1 | ||
| 2007 | ||
| j12 | ||
| j11 | Peter Selinger: Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 170: 139-163 (2007) | |
| j10 | Massimo Caboara, Sara Faridi, Peter Selinger: Simplicial cycles and the computation of simplicial trees. J. Symb. Comput. 42(1-2): 74-88 (2007) | |
| 2006 | ||
| j9 | Peter Selinger: Special issue on quantum programming languages. Mathematical Structures in Computer Science 16(3): 373-374 (2006) | |
| j8 | Peter Selinger, Benoît Valiron: A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16(3): 527-552 (2006) | |
| c6 | Massimo Caboara, Sara Faridi, Peter Selinger: Tree Checking for Sparse Complexes. ICMS 2006: 110-121 | |
| 2005 | ||
| c5 | Peter Selinger, Benoît Valiron: A Lambda Calculus for Quantum Computation with Classical Control. TLCA 2005: 354-368 | |
| 2004 | ||
| j7 | Peter Selinger: Towards a quantum programming language. Mathematical Structures in Computer Science 14(4): 527-586 (2004) | |
| c4 | ||
| 2003 | ||
| j6 | Peter Selinger: Order-incompleteness and finite lambda reduction models. Theor. Comput. Sci. 309(1-3): 43-63 (2003) | |
| 2002 | ||
| j5 | ||
| j4 | ||
| 2001 | ||
| j3 | Peter Selinger: Models for an adversary-centric protocol logic. Electr. Notes Theor. Comput. Sci. 55(1): 69-84 (2001) | |
| j2 | Peter Selinger: Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science 11(2): 207-260 (2001) | |
| c3 | ||
| 1999 | ||
| j1 | Peter Selinger: Categorical Structure of Asynchrony. Electr. Notes Theor. Comput. Sci. 20: 158-181 (1999) | |
| 1997 | ||
| c2 | ||
| 1996 | ||
| c1 | Peter Selinger: Order-Incompleteness and Finite Lambda Models (Extended Abstract). LICS 1996: 432-439 | |
Colors in the list of coauthors
Last update Mon May 20 01:39:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page