Peter Selinger

From MaRDI portal
Revision as of 20:13, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1884895

Available identifiers

zbMath Open selinger.peterDBLPs/PeterSelingerWikidataQ102174134 ScholiaQ102174134MaRDI QIDQ1884895

List of research outcomes





PublicationDate of PublicationType
Generators and relations for real stabilizer operators2024-11-29Paper
Generators and relations for \(U_n(\mathbb{Z}[\frac{1}{2}, i)\)]2024-11-29Paper
Generators and relations for the group \(\mathrm{O}_n(\mathbb{Z}[\frac{1}{2})\)]2024-11-29Paper
Generators and Relations for 3-Qubit Clifford+CS Operators2024-03-22Paper
Towards an induction principle for nested data types2024-02-28Paper
First-order axioms for asynchrony2023-05-17Paper
Linear Dependent Type Theory for Quantum Programming Languages2022-10-06Paper
On the combinatorial value of Hex positions2022-08-08Paper
On the Lambek embedding and the category of product-preserving presheaves2022-05-12Paper
A Biset-Enriched Categorical Model for Proto-Quipper with Dynamic Lifting2022-04-27Paper
Proto-Quipper with dynamic lifting2022-04-27Paper
There are infinitely many monotone games over $L_5$2022-03-25Paper
A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)2021-12-17Paper
All passable games are realizable as monotone set coloring games2021-11-19Paper
A tutorial introduction to quantum circuit programming in dependently typed proto-quipper2021-07-05Paper
Completely positive projections and biproducts2021-06-29Paper
Linear Dependent Type Theory for Quantum Programming Languages2021-01-21Paper
Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)2016-10-07Paper
A Finite Alternation Result for Reversible Boolean Circuits2016-08-10Paper
Reversible k-valued logic circuits are finitely generated for odd k2016-04-06Paper
Generators and relations for n-qubit Clifford operators2015-08-25Paper
Applying quantitative semantics to higher-order quantum computing2014-04-10Paper
Idempotents in Dagger Categories2014-01-17Paper
On a Fully Abstract Model for a Quantum Linear Functional Language2014-01-17Paper
An Introduction to Quantum Programming in Quipper2013-12-17Paper
Dagger Compact Closed Categories and Completely Positive Maps2013-12-06Paper
Models for an Adversary-Centric Protocol Logic2013-07-24Paper
Presheaf Models of Quantum Computation: An Outline2013-05-28Paper
Partially traced categories2013-03-06Paper
Finite dimensional Hilbert spaces are complete for dagger compact closed categories2012-08-15Paper
A Survey of Graphical Languages for Monoidal Categories2011-05-31Paper
Tree Checking for Sparse Complexes2010-09-14Paper
https://portal.mardi4nfdi.de/entity/Q35608392010-05-14Paper
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)2008-04-11Paper
Simplicial cycles and the computation of simplicial trees2007-10-23Paper
Functional and Logic Programming2007-09-25Paper
A lambda calculus for quantum computation with classical control2006-08-28Paper
Typed Lambda Calculi and Applications2005-11-11Paper
Order-incompleteness and finite lambda reduction models2004-10-27Paper
Towards a quantum programming language2004-09-24Paper
The lambda calculus is algebraic2002-01-01Paper
Control categories and duality: on the categorical semantics of the lambda-mu calculus2001-07-17Paper
https://portal.mardi4nfdi.de/entity/Q42610811999-09-20Paper

Research outcomes over time

This page was built for person: Peter Selinger