Order-Incompleteness and Finite Lambda Models (Extended Abstract). - Peter Selinger (LICS, 1996)

First-Order Axioms for Asynchrony. - Peter Selinger (CONCUR, 1997)

Categorical Structure of Asynchrony. - Peter Selinger (MFPS, 1999)

Categorical Semantics of Control. - Peter Selinger (TLCA, 2001)

Models for an adversary-centric protocol logic. - Peter Selinger (LACPV@CAV, 2001)

Control categories and duality: on the categorical semantics of the lambda-mu calculus. - Peter Selinger (Math. Struct. Comput. Sci., 2001)

Preface. - Richard Blute; Peter Selinger (CTCS, 2002)

The lambda calculus is algebraic. - Peter Selinger (J. Funct. Program., 2002)

Order-incompleteness and finite lambda reduction models. - Peter Selinger (Theor. Comput. Sci., 2003)

A Brief Survey of Quantum Programming Languages. - Peter Selinger (FLOPS, 2004)

Towards a quantum programming language. - Peter Selinger (Math. Struct. Comput. Sci., 2004)

Preface. - Peter Selinger (QPL, 2005)

Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract). - Peter Selinger (QPL, 2005)

Tree Checking for Sparse Complexes. - Massimo Caboara; Sara Faridi; Peter Selinger (ICMS, 2006)

Idempotents in Dagger Categories: (Extended Abstract). - Peter Selinger (QPL, 2006)

On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract). - Peter Selinger; Benoît Valiron (QPL, 2006)

Special issue on quantum programming languages. - Peter Selinger (Math. Struct. Comput. Sci., 2006)

A lambda calculus for quantum computation with classical control. - Peter Selinger; Benoît Valiron (Math. Struct. Comput. Sci., 2006)

Simplicial cycles and the computation of simplicial trees. - Massimo Caboara; Sara Faridi; Peter Selinger (J. Symb. Comput., 2007)

A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract). - Peter Selinger; Benoît Valiron (FoSSaCS, 2008)

Lecture notes on the lambda calculus - Peter Selinger (CoRR, 2008)

Preface. - Bob Coecke; Ian Mackie; Prakash Panangaden; Peter Selinger (QPL/DCM@ICALP, 2008)

Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract). - Peter Selinger (QPL/DCM@ICALP, 2008)

Preface. - Bob Coecke; Prakash Panangaden; Peter Selinger (QPL@MFPS, 2009)

Preface. - Michael W. Mislove; Peter Selinger (MFPS, 2010)

Logical Methods in Quantum Information Theory. - Peter Selinger (WoLLIC, 2012)

Finite dimensional Hilbert spaces are complete for dagger compact closed categories. - Peter Selinger (Log. Methods Comput. Sci., 2012)

Quantum circuits of T-depth one - Peter Selinger (CoRR, 2012)

Exact synthesis of multi-qubit Clifford+T circuits - Brett Giles; Peter Selinger (CoRR, 2012)

Presheaf Models of Quantum Computation: An Outline. - Octavio Malherbe; Philip J. Scott; Peter Selinger (Computation, Logic, Games, and Quantum Foundations, 2013)

Quipper: a scalable quantum programming language. - Alexander S. Green; Peter LeFanu Lumsdaine; Neil J. Ross; Peter Selinger; Benoît Valiron (PLDI, 2013)

An Introduction to Quantum Programming in Quipper. - Alexander S. Green; Peter LeFanu Lumsdaine; Neil J. Ross; Peter Selinger; Benoît Valiron (RC, 2013)

Remarks on Matsumoto and Amano's normal form for single-qubit Clifford+T operators. - Brett Giles; Peter Selinger (CoRR, 2013)

Completely positive projections and biproducts. - Chris Heunen; Aleks Kissinger; Peter Selinger (QPL, 2013)

Applying quantitative semantics to higher-order quantum computing. - Michele Pagani; Peter Selinger; Benoît Valiron (POPL, 2014)

Optimal ancilla-free Clifford+T approximation of z-rotations. - Neil J. Ross; Peter Selinger (CoRR, 2014)

Quipper: Concrete Resource Estimation in Quantum Algorithms. - Jonathan M. Smith; Neil J. Ross; Peter Selinger; Benoît Valiron (CoRR, 2014)

Programming the quantum future. - Benoît Valiron; Neil J. Ross; Peter Selinger; D. Scott Alexander; Jonathan M. Smith (Commun. ACM, 2015)

Generators and relations for n-qubit Clifford operators. - Peter Selinger (Log. Methods Comput. Sci., 2015)

Efficient Clifford+T approximation of single-qubit operators. - Peter Selinger (Quantum Inf. Comput., 2015)

Reversible k-valued logic circuits are finitely generated for odd k. - Peter Selinger (CoRR, 2016)

Optimal ancilla-free Clifford+T approximation of z-rotations. - Neil J. Ross; Peter Selinger (Quantum Inf. Comput., 2016)

A categorical model for a quantum circuit description language. - Francisco Rios; Peter Selinger (QPL, 2017)

Challenges in Quantum Programming Languages (Invited Talk). - Peter Selinger (FSCD, 2018)

Dependently Typed Folds for Nested Data Types. - Peng Fu 001; Peter Selinger (CoRR, 2018)

Quantum Programming Languages (Dagstuhl Seminar 18381). - Michele Mosca; Martin Roetteler; Peter Selinger (Dagstuhl Reports, 2018)

A finite alternation result for reversible boolean circuits. - Peter Selinger (Sci. Comput. Program., 2018)

Linear Dependent Type Theory for Quantum Programming Languages: Extended Abstract. - Peng Fu 001; Kohei Kishida; Peter Selinger (LICS, 2020)

A Tutorial Introduction to Quantum Circuit Programming in Dependently Typed Proto-Quipper. - Peng Fu 001; Kohei Kishida; Neil J. Ross; Peter Selinger (RC, 2020)

Generators and relations for Un(Z[½, i]). - Xiaoning Bian; Peter Selinger (QPL, 2021)

Generators and Relations for the Group On(Z[1/2]). - Sarah Meng Li; Neil J. Ross; Peter Selinger (QPL, 2021)

Generators and Relations for Real Stabilizer Operators. - Justin Makary; Neil J. Ross; Peter Selinger (QPL, 2021)

Generators and Relations for 2-Qubit Clifford+T Operators. - Xiaoning Bian; Peter Selinger (QPL, 2022)

A biset-enriched categorical model for Proto-Quipper with dynamic lifting. - Peng Fu 001; Kohei Kishida; Neil J. Ross; Peter Selinger (QPL, 2022)

On the Lambek embedding and the category of product-preserving presheaves. - Peng Fu 001; Kohei Kishida; Neil J. Ross; Peter Selinger (CoRR, 2022)

Linear Dependent Type Theory for Quantum Programming Languages. - Peng Fu 001; Kohei Kishida; Peter Selinger (Log. Methods Comput. Sci., 2022)

Towards an Induction Principle for Nested Data Types. - Peng Fu 001; Peter Selinger (WoLLIC, 2023)

Generators and Relations for 3-Qubit Clifford+CS Operators. - Xiaoning Bian; Peter Selinger (QPL, 2023)

Some improvements to product formula circuits for Hamiltonian simulation. - Andre Kornell; Peter Selinger (CoRR, 2023)

Proto-Quipper with Dynamic Lifting. - Peng Fu 001; Kohei Kishida; Neil J. Ross; Peter Selinger (Proc. ACM Program. Lang., 2023)

Proto-Quipper with Reversing and Control. - Peng Fu 001; Kohei Kishida; Neil J. Ross; Peter Selinger (CoRR, 2024)

Paintbucket on graphs is PSPACE-complete. - Ethan J. Saunders; Peter Selinger (CoRR, 2024)