default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Selinger
Person information
- affiliation: Dalhousie University, Canada
- affiliation (former): University of Ottawa, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Peng Fu
, Kohei Kishida, Neil J. Ross, Peter Selinger:
Proto-Quipper with Dynamic Lifting. Proc. ACM Program. Lang. 7(POPL): 309-334 (2023)- [c37]Peng Fu, Peter Selinger:
Towards an Induction Principle for Nested Data Types. WoLLIC 2023: 244-255 - [c36]Xiaoning Bian, Peter Selinger:
Generators and Relations for 3-Qubit Clifford+CS Operators. QPL 2023: 114-126 - [i20]Peng Fu, Peter Selinger:
Towards an induction principle for nested data types. CoRR abs/2306.10124 (2023) - [i19]Andre Kornell, Peter Selinger:
Some improvements to product formula circuits for Hamiltonian simulation. CoRR abs/2310.12256 (2023) - 2022
- [j14]Peng Fu, Kohei Kishida, Peter Selinger:
Linear Dependent Type Theory for Quantum Programming Languages. Log. Methods Comput. Sci. 18(3) (2022) - [c35]Xiaoning Bian, Peter Selinger:
Generators and Relations for 2-Qubit Clifford+T Operators. QPL 2022: 13-28 - [c34]Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger:
A biset-enriched categorical model for Proto-Quipper with dynamic lifting. QPL 2022: 302-342 - [i18]Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger:
Proto-Quipper with dynamic lifting. CoRR abs/2204.13041 (2022) - [i17]Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger:
On the Lambek embedding and the category of product-preserving presheaves. CoRR abs/2205.06068 (2022) - 2021
- [c33]Justin Makary, Neil J. Ross, Peter Selinger:
Generators and Relations for Real Stabilizer Operators. QPL 2021: 14-36 - [c32]Xiaoning Bian, Peter Selinger:
Generators and relations for Un(Z[½, i]). QPL 2021: 145-164 - [c31]Sarah Meng Li, Neil J. Ross, Peter Selinger:
Generators and Relations for the Group On(Z[1/2]). QPL 2021: 210-264 - 2020
- [c30]Peng Fu, Kohei Kishida, Peter Selinger:
Linear Dependent Type Theory for Quantum Programming Languages: Extended Abstract. LICS 2020: 440-453 - [c29]Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger:
A Tutorial Introduction to Quantum Circuit Programming in Dependently Typed Proto-Quipper. RC 2020: 153-168 - [i16]Peng Fu, Kohei Kishida, Peter Selinger:
Linear Dependent Type Theory for Quantum Programming Languages. CoRR abs/2004.13472 (2020) - [i15]Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger:
A tutorial introduction to quantum circuit programming in dependently typed Proto-Quipper. CoRR abs/2005.08396 (2020)
2010 – 2019
- 2019
- [e9]Peter Selinger, Giulio Chiribella:
Proceedings 15th International Conference on Quantum Physics and Logic, QPL 2018, Halifax, Canada, 3-7th June 2018. EPTCS 287, 2019 [contents] - 2018
- [j13]Peter Selinger:
A finite alternation result for reversible boolean circuits. Sci. Comput. Program. 151: 2-17 (2018) - [c28]Peter Selinger:
Challenges in Quantum Programming Languages (Invited Talk). FSCD 2018: 3:1-3:2 - [i14]Peng Fu, Peter Selinger:
Dependently Typed Folds for Nested Data Types. CoRR abs/1806.05230 (2018) - [i13]Michele Mosca, Martin Roetteler, Peter Selinger:
Quantum Programming Languages (Dagstuhl Seminar 18381). Dagstuhl Reports 8(9): 112-132 (2018) - 2017
- [c27]Francisco Rios, Peter Selinger:
A categorical model for a quantum circuit description language. QPL 2017: 164-178 - 2016
- [j12]Neil J. Ross, Peter Selinger:
Optimal ancilla-free Clifford+T approximation of z-rotations. Quantum Inf. Comput. 16(11&12): 901-953 (2016) - [c26]Peter Selinger:
A Finite Alternation Result for Reversible Boolean Circuits. RC 2016: 271-285 - [i12]Peter Selinger:
Reversible k-valued logic circuits are finitely generated for odd k. CoRR abs/1604.01646 (2016) - [i11]Peter Selinger:
A finite alternation result for reversible boolean circuits. CoRR abs/1604.02549 (2016) - 2015
- [j11]Benoît Valiron, Neil J. Ross, Peter Selinger, D. Scott Alexander, Jonathan M. Smith:
Programming the quantum future. Commun. ACM 58(8): 52-61 (2015) - [j10]Peter Selinger:
Generators and relations for n-qubit Clifford operators. Log. Methods Comput. Sci. 11(2) (2015) - [j9]Peter Selinger:
Efficient Clifford+T approximation of single-qubit operators. Quantum Inf. Comput. 15(1-2): 159-180 (2015) - [e8]Chris Heunen, Peter Selinger, Jamie Vicary:
Proceedings 12th International Workshop on Quantum Physics and Logic, QPL 2015, Oxford, UK, July 15-17, 2015. EPTCS 195, 2015 [contents] - 2014
- [c25]Michele Pagani, Peter Selinger, Benoît Valiron:
Applying quantitative semantics to higher-order quantum computing. POPL 2014: 647-658 - [i10]Neil J. Ross, Peter Selinger:
Optimal ancilla-free Clifford+T approximation of z-rotations. CoRR abs/1403.2975 (2014) - [i9]Jonathan M. Smith, Neil J. Ross, Peter Selinger, Benoît Valiron:
Quipper: Concrete Resource Estimation in Quantum Algorithms. CoRR abs/1412.0625 (2014) - 2013
- [c24]Octavio Malherbe, Philip J. Scott, Peter Selinger:
Presheaf Models of Quantum Computation: An Outline. Computation, Logic, Games, and Quantum Foundations 2013: 178-194 - [c23]Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron:
Quipper: a scalable quantum programming language. PLDI 2013: 333-342 - [c22]Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron:
An Introduction to Quantum Programming in Quipper. RC 2013: 110-124 - [c21]Chris Heunen, Aleks Kissinger, Peter Selinger:
Completely positive projections and biproducts. QPL 2013: 71-83 - [i8]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) - [i7]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) - [i6]Michele Pagani, Peter Selinger, Benoît Valiron:
Applying quantitative semantics to higher-order quantum computing. CoRR abs/1311.2290 (2013) - [i5]Brett Giles, Peter Selinger:
Remarks on Matsumoto and Amano's normal form for single-qubit Clifford+T operators. CoRR abs/1312.6584 (2013) - 2012
- [j8]Peter Selinger:
Finite dimensional Hilbert spaces are complete for dagger compact closed categories. Log. Methods Comput. Sci. 8(3) (2012) - [c20]Peter Selinger:
Logical Methods in Quantum Information Theory. WoLLIC 2012: 88 - [i4]Peter Selinger:
Quantum circuits of T-depth one. CoRR abs/1210.0974 (2012) - [i3]Brett Giles, Peter Selinger:
Exact synthesis of multi-qubit Clifford+T circuits. CoRR abs/1212.0506 (2012) - 2011
- [e7]Bob Coecke, Ian Mackie, Prakash Panangaden, Peter Selinger:
Proceedings of the Joint 5th International Workshop on Quantum Physics and Logic and 4th Workshop on Developments in Computational Models, QPL/DCM@ICALP 2008, Reykjavik, Iceland, July 12-13, 2008. Electronic Notes in Theoretical Computer Science 270(1), Elsevier 2011 [contents] - [e6]Bob Coecke, Prakash Panangaden, Peter Selinger:
Proceedings of the 6th International Workshop on Quantum Physics and Logic, QPL@MFPS 2009, Oxford, UK, April 8-9, 2009. Electronic Notes in Theoretical Computer Science 270(2), Elsevier 2011 [contents] - [e5]Bart Jacobs, Peter Selinger, Bas Spitters:
Proceedings 8th International Workshop on Quantum Physics and Logic, QPL 2011, Nijmegen, Netherlands, October 27-29, 2011. EPTCS 95, 2011 [contents] - 2010
- [c19]Michael W. Mislove, Peter Selinger:
Preface. MFPS 2010: 1-3 - [e4]Michael W. Mislove, Peter Selinger:
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, MFPS 2010, Ottawa, Ontario, Canada, May 6-10, 2010. Electronic Notes in Theoretical Computer Science 265, Elsevier 2010 [contents]
2000 – 2009
- 2009
- [c18]Bob Coecke, Prakash Panangaden, Peter Selinger:
Preface. QPL@MFPS 2009: 1-2 - 2008
- [c17]Peter Selinger, Benoît Valiron:
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract). FoSSaCS 2008: 81-96 - [c16]Bob Coecke, Ian Mackie, Prakash Panangaden, Peter Selinger:
Preface. QPL/DCM@ICALP 2008: 1-2 - [c15]Peter Selinger:
Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract). QPL/DCM@ICALP 2008: 113-119 - [e3]Peter Selinger:
Proceedings of the 4th International Workshop on Quantum Programming Languages, QPL 2006, Oxford, UK, July 17-19, 2006. Electronic Notes in Theoretical Computer Science 210, Elsevier 2008 [contents] - [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]Peter Selinger:
Lecture notes on the lambda calculus. CoRR abs/0804.3434 (2008) - 2007
- [j7]Massimo Caboara, Sara Faridi, Peter Selinger:
Simplicial cycles and the computation of simplicial trees. J. Symb. Comput. 42(1-2): 74-88 (2007) - [e2]Peter Selinger:
Proceedings of the 3rd International Workshop on Quantum Programming Languages, QPL 2005, DePaul University, Chicago, USA, June 30 - July 1, 2005. Electronic Notes in Theoretical Computer Science 170, Elsevier 2007 [contents] - 2006
- [j6]Peter Selinger:
Special issue on quantum programming languages. Math. Struct. Comput. Sci. 16(3): 373-374 (2006) - [j5]Peter Selinger, Benoît Valiron:
A lambda calculus for quantum computation with classical control. Math. Struct. Comput. Sci. 16(3): 527-552 (2006) - [c14]Massimo Caboara, Sara Faridi, Peter Selinger:
Tree Checking for Sparse Complexes. ICMS 2006: 110-121 - [c13]Peter Selinger:
Preface. QPL 2006: 1-2 - [c12]Peter Selinger:
Idempotents in Dagger Categories: (Extended Abstract). QPL 2006: 107-122 - [c11]Peter Selinger, Benoît Valiron:
On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract). QPL 2006: 123-137 - 2005
- [c10]Peter Selinger, Benoît Valiron:
A Lambda Calculus for Quantum Computation with Classical Control. TLCA 2005: 354-368 - [c9]Peter Selinger:
Preface. QPL 2005: 1 - [c8]Peter Selinger:
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract). QPL 2005: 139-163 - 2004
- [j4]Peter Selinger:
Towards a quantum programming language. Math. Struct. Comput. Sci. 14(4): 527-586 (2004) - [c7]Peter Selinger:
A Brief Survey of Quantum Programming Languages. FLOPS 2004: 1-6 - 2003
- [j3]Peter Selinger:
Order-incompleteness and finite lambda reduction models. Theor. Comput. Sci. 309(1-3): 43-63 (2003) - 2002
- [j2]Peter Selinger:
The lambda calculus is algebraic. J. Funct. Program. 12(6): 549-566 (2002) - [c6]Richard Blute, Peter Selinger:
Preface. CTCS 2002: 362-365 - [e1]Richard Blute, Peter Selinger:
Category Theory and Computer Science, CTCS 2002, Ottawa, Canada, August 15-17, 2002. Electronic Notes in Theoretical Computer Science 69, Elsevier 2002 [contents] - 2001
- [j1]Peter Selinger:
Control categories and duality: on the categorical semantics of the lambda-mu calculus. Math. Struct. Comput. Sci. 11(2): 207-260 (2001) - [c5]Peter Selinger:
Categorical Semantics of Control. TLCA 2001: 6-7 - [c4]Peter Selinger:
Models for an adversary-centric protocol logic. LACPV@CAV 2001: 69-84
1990 – 1999
- 1999
- [c3]Peter Selinger:
Categorical Structure of Asynchrony. MFPS 1999: 158-181 - 1997
- [c2]Peter Selinger:
First-Order Axioms for Asynchrony. CONCUR 1997: 376-390 - 1996
- [c1]Peter Selinger:
Order-Incompleteness and Finite Lambda Models (Extended Abstract). LICS 1996: 432-439
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-10-07 21:16 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:
