@comment{
----------------------------------------------------------------------
This file contains a list of bibliographic references for Peter Selinger's
papers, as well as for selected other contributions (such as software).
It is current as of May 12, 2022.
The following macros are used in some of the entries:
\usepackage{hyperref}
\newcommand{\urlalt}[2]{\href{#1}{\nolinkurl{#2}}}
\newcommand{\arxiv}[1]{\urlalt{http://arxiv.org/abs/#1}{arXiv:#1}}
----------------------------------------------------------------------
}
@unpublished{BS2023-cliffordcs3,
author = {Fu, Peng and Selinger, Peter},
title = {Towards an induction principle for nested data types},
year = 2023,
month = jun,
note = {To appear in {\em WoLLIC 2023}.
Available from \arxiv{2306.10124}},
filename = {depfold}
}
@unpublished{BS2023-cliffordcs3,
author = {Bian, Xiaoning and Selinger, Peter},
title = {Generators and relations for 3-qubit {Clifford+$CS$}
operators},
year = 2023,
month = jun,
note = {To appear in {\em QPL 2023}.
Available from \arxiv{2306.08530}},
filename = {cliffordcs2}
}
@article{FKS2022-lindep-long,
author = {Fu, Peng and Kishida, Kohei and Selinger, Peter},
title = {Linear Dependent Type Theory for Quantum Programming
Languages},
journal = {Logical Methods in Computer Science},
volume = 18,
number = {3:28},
pages = {1--44},
year = 2022,
note = {Also available from \arxiv{2004.13472}},
doi = {10.46298/lmcs-18(3:28)2022},
filename = {lindep-long}
}
@unpublished{FKRS2022-lambek,
author = {Fu, Peng and Kishida, Kohei and Ross, Neil J. and
Selinger, Peter},
title = {On the {Lambek} embedding and the category of
product-preserving presheaves},
year = 2022,
month = may,
note = {Available from \arxiv{2205.06068}},
filename = {lambek}
}
@unpublished{FKRS2022-dynlift-model,
author = {Fu, Peng and Kishida, Kohei and Ross, Neil J. and
Selinger, Peter},
title = {A biset-enriched categorical model for {Proto-Quipper}
with dynamic lifting},
year = 2022,
month = apr,
note = {To appear in {\em QPL 2022}.
Available from \arxiv{2204.13039}},
filename = {dynlift-model}
}
@inproceedings{FKRS2022-dynlift,
author = {Fu, Peng and Kishida, Kohei and Ross, Neil J. and
Selinger, Peter},
title = {{Proto-Quipper} with dynamic lifting},
booktitle = {Proceedings of the 50th ACM SIGPLAN Symposium on
Principles of Programming Languages, POPL 2023, Boston},
series = {Proceedings of the ACM on Programming Languages},
volume = {7 (POPL)},
pages = {309--334},
year = 2023,
month = jan,
note = {Also available from \arxiv{2204.13041}},
doi = {10.1145/3571204},
filename = {dynlift}
}
@unpublished{BS2022-cliffordt2,
author = {Bian, Xiaoning and Selinger, Peter},
title = {Generators and relations for 2-qubit {Clifford+$T$}
operators},
year = 2022,
month = apr,
note = {To appear in {\em QPL 2022}.
Available from \arxiv{2204.02217}},
filename = {cliffordt2}
}
@unpublished{DS2022-hex-l5,
author = {Demer, Eric and Selinger, Peter},
title = {There are infinitely many monotone games over {$L_5$}},
year = 2022,
month = mar,
note = {Available from \arxiv{2203.13971}},
filename = {hex-l5}
}
@unpublished{DSW2021-hex-gadgets,
author = {Demer, Eric and Selinger, Peter and Wang, Kyle},
title = {All passable games are realizable as monotone set coloring
games},
year = 2021,
month = nov,
note = {To appear in {\it Games of No Chance 6}.
Available from \arxiv{2111.10351}},
filename = {hex-gadgets}
}
@inproceedings{BS2021-gaussian,
author = {Bian, Xiaoning and Selinger, Peter},
title = {Generators and relations for {$U_n(\mathbb{Z}[1/2,i])$}},
booktitle = {Proceedings of the 18th International Conference on Quantum
Physics and Logic, QPL 2021, Gdansk, Poland},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = {343},
pages = {145--164},
year = 2021,
note = {Also available from \arxiv{2105.14047}},
doi = {10.4204/EPTCS.343.8},
filename = {gaussian}
}
@inproceedings{LRS2021-intrels,
author = {Li, Sarah Meng and Ross, Neil J. and Selinger, Peter},
title = {Generators and relations for the group
{$O_n(\mathbb{Z}[1/2])$}},
booktitle = {Proceedings of the 18th International Conference on Quantum
Physics and Logic, QPL 2021, Gdansk, Poland},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = {343},
pages = {210--264},
year = 2021,
note = {Also available from \arxiv{2106.01175}},
doi = {10.4204/EPTCS.343.11},
filename = {intrels}
}
@inproceedings{MRS2021-realstab,
author = {Makary, Justin and Ross, Neil J. and Selinger, Peter},
title = {Generators and relations for real stabilizer operators},
booktitle = {Proceedings of the 18th International Conference on Quantum
Physics and Logic, QPL 2021, Gdansk, Poland},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = {343},
pages = {14--36},
year = 2021,
note = {Also available from \arxiv{2109.05655}},
doi = {10.4204/EPTCS.343.2},
filename = {realstab}
}
@article{S2021-hex-cgt,
author = {Selinger, Peter},
title = {On the combinatorial value of {Hex} positions},
journal = {Integers},
volume = {22},
pages = {G3},
year = 2022,
note = {Also available from \arxiv{2101.06694}},
filename = {hex-cgt}
}
@inproceedings{FKS2020-lindep,
author = {Fu, Peng and Kishida, Kohei and Selinger, Peter},
title = {Linear Dependent Type Theory for Quantum Programming
Languages},
booktitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic
in Computer Science, LICS 2020, Saarbr\"ucken, Germany},
pages = {440--453},
year = 2020,
doi = {10.1145/3373718.3394765},
note = {Also available from \arxiv{2004.13472v1}},
filename = {lindep}
}
@inproceedings{FKRS2020-dpq-tutorial,
author = {Fu, Peng and Kishida, Kohei and Ross, Neil J. and
Selinger, Peter},
title = {A Tutorial Introduction to Quantum Circuit Programming in
Dependently Typed {Proto-Quipper}},
booktitle = {Proceedings of the 12th International Conference on
Reversible Computation, RC 2020, Oslo, Norway},
series = {Lecture Notes in Computer Science},
volume = {12227},
pages = {153--168},
publisher = {Springer},
year = 2020,
note = {Also available from \arxiv{2005.08396}},
doi = {10.1007/978-3-030-52482-1_9},
filename = {dpq-tutorial}
}
@unpublished{ST2018-free-choice,
author = {Selinger, Peter and Tapp, Kristopher},
title = {On the mathematics of the free-choice paradigm},
year = 2018,
month = aug,
note = {Available from \arxiv{1808.06961}},
filename = {free-choice}
}
@unpublished{FS2018-dependent-fold,
author = {Fu, Peng and Selinger, Peter},
title = {Dependently typed folds for nested data types},
year = 2018,
month = jun,
note = {Available from \arxiv{1806.05230}},
filename = {dependent-fold}
}
@inproceedings{RS2017-pqmodel,
author = {Rios, Francisco and Selinger, Peter},
title = {A categorical model for a quantum circuit
description language. {Extended} Abstract},
booktitle = {Proceedings of the 14th International Conference on Quantum
Physics and Logic, QPL 2017, Nijmegen},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = {266},
pages = {164--178},
year = 2018,
note = {Also available from \arxiv{1706.02630}},
doi = {10.4204/EPTCS.266.11},
filename = {pqmodel}
}
@article{RS2016-gridsynth,
author = {Ross, Neil J. and Selinger, Peter},
title = {Optimal ancilla-free {Clifford}+{$T$} approximation of
{$z$}-rotations},
journal = {Quantum Information and Computation},
volume = {16},
number = {11--12},
pages = {901--953},
year = 2016,
doi = {10.26421/QIC16.11-12-1},
note = {Also available from \arxiv{1403.2975}},
filename = {gridsynth}
}
@unpublished{RS2014-gridsynth-implementation,
author = {Ross, Neil J. and Selinger, Peter},
title = {Exact and approximate synthesis of quantum circuits},
year = 2014,
note = {Software implementation, available from
\url{http://www.mathstat.dal.ca/~selinger/newsynth/}}
}
@article{Sel2018-alternation,
author = {Selinger, Peter},
title = {A finite alternation result for reversible boolean
circuits},
journal = {Science of Computer Programming},
volume = {151},
pages = {2--17},
year = 2018,
note = {Also available from \arxiv{1604.02549}},
doi = {10.1016/j.scico.2017.08.011},
filename = {alternation}
}
@inproceedings{Sel2016-alternation,
author = {Selinger, Peter},
title = {A finite alternation result for reversible boolean
circuits},
booktitle = {Proceedings of the 8th International Conference on
Reversible Computation, RC 2016, Bologna, Italy},
series = {Lecture Notes in Computer Science},
volume = {9720},
pages = {271--285},
publisher = {Springer},
year = 2016,
note = {Also available from \arxiv{1604.02549}},
doi = {10.1007/978-3-319-40578-0_20}
}
@unpublished{Sel2016-lafont-note,
author = {Selinger, Peter},
title = {Reversible $k$-valued logic circuits are finitely
generated for odd~$k$},
year = 2016,
month = apr,
note = {Available from \arxiv{1604.01646}},
filename = {lafont-note}
}
@article{VRSAS2015-cacm,
author = {Valiron, Beno{\^\i}t and Ross, Neil J. and Selinger, Peter
and Alexander, D. Scott and Smith, Jonathan M.},
title = {Programming the Quantum Future},
journal = {Communications of the ACM},
volume = 58,
number = 8,
pages = {52--61},
year = 2015,
doi = {10.1145/2699415},
filename = {cacm}
}
@unpublished{SRSV2014-qapl,
author = {Smith, Jonathan M. and Ross, Neil J. and Selinger, Peter
and Valiron, Beno{\^\i}t},
title = {{Quipper}: concrete resource estimation in quantum
algorithms},
year = 2014,
month = apr,
note = {Extended abstract for a talk given at the 12th
International Workshop on Quantitative Aspects of
Programming Languages and Systems, QAPL 2014,
Grenoble. Available from \arxiv{1412.0625}},
filename = {qapl}
}
@unpublished{GS2013-ma-remarks,
author = {Giles, Brett and Selinger, Peter},
title = {Remarks on {Matsumoto} and {Amano}'s normal form for
single-qubit {Clifford+$T$} operators},
year = 2013,
month = dec,
note = {Available from \arxiv{1312.6584}},
filename = {ma-remarks}
}
@inproceedings{PSV2014-qcpm,
author = {Pagani, Michele and Selinger, Peter and Valiron,
Beno{\^\i}t},
title = {Applying Quantitative Semantics to Higher-Order Quantum
Computing},
booktitle = {Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on
Principles of Programming Languages, POPL 2014, San Diego},
series = {ACM SIGPLAN Notices},
volume = {49(1)},
pages = {647--658},
year = 2014,
month = jan,
note = {Also available from \arxiv{1311.2290}},
doi = {10.1145/2535838.2535879},
filename = {qcpm}
}
@article{Sel2014-clifford,
author = {Selinger, Peter},
title = {Generators and Relations for $n$-Qubit {Clifford}
Operators},
journal = {Logical Methods in Computer Science},
volume = 11,
number = {2:10},
pages = {1--17},
year = 2015,
note = {Also available from \arxiv{1310.6813}},
doi = {10.2168/LMCS-11(2:10)2015},
filename = {clifford}
}
@inproceedings{HKS2014-cpproj,
author = {Heunen, Chris and Kissinger, Aleks and Selinger, Peter},
title = {Completely Positive Projections and Biproducts},
booktitle = {Proceedings of the 10th International Workshop on Quantum
Physics and Logic, QPL 2013, Barcelona},
series = {Electronic Proceedings in Theoretical Computer Science},
volume = {171},
pages = {71--83},
year = 2014,
note = {Also available from \arxiv{1308.4557}},
doi = {10.4204/EPTCS.171.7},
filename = {cpproj}
}
@inproceedings{GLRSV2013-rc,
author = {Green, Alexander and Lumsdaine, Peter LeFanu and Ross, Neil
J. and Selinger, Peter and Valiron, Beno{\^\i}t},
title = {An Introduction to Quantum Programming in {Quipper}},
booktitle = {Proceedings of the 5th International Conference on
Reversible Computation, RC 2013, Victoria, British Columbia},
series = {Lecture Notes in Computer Science},
volume = 7948,
pages = {110-124},
publisher = {Springer},
year = 2013,
note = {Also available from \arxiv{1304.5485}},
doi = {10.1007/978-3-642-38986-3_10},
filename = {quipper_demo}
}
@inproceedings{GLRSV2013-pldi,
author = {Green, Alexander and Lumsdaine, Peter LeFanu and Ross, Neil
J. and Selinger, Peter and Valiron, Beno{\^\i}t},
title = {{Quipper}: a Scalable Quantum Programming Language},
booktitle = {Proceedings of the 34th Annual ACM SIGPLAN Conference on
Programming Language Design and Implementation, PLDI 2013,
Seattle},
series = {ACM SIGPLAN Notices},
volume = {48(6)},
pages = {333--342},
year = 2013,
month = jun,
note = {Also available from \arxiv{1304.3390}},
doi = {10.1145/2499370.2462177},
filename = {pldi154-green}
}
@unpublished{GLRSV2013-quipper,
author = {Green, Alexander and Lumsdaine, Peter LeFanu and Ross, Neil
J. and Selinger, Peter and Valiron, Beno{\^\i}t},
title = {The {Quipper} language},
year = 2013,
note = {Software implementation, available from
\url{http://www.mathstat.dal.ca/~selinger/quipper/}},
filename = {quipper}
}
@incollection{MSS2013-pmodels,
author = {Malherbe, Octavio and Scott, Philip J. and Selinger, Peter},
title = {Presheaf Models of Quantum Computation: An Outline},
booktitle = {Computation, Logic, Games, and Quantum Foundations. The
Many Facets of Samson Abramsky},
series = {Lecture Notes in Computer Science},
volume = 7860,
publisher = {Springer},
year = 2013,
pages = {178--194},
note = {Also available from \arxiv{1302.5652}},
doi = {10.1007/978-3-642-38164-5_13},
filename = {pmodels}
}
@article{Sel2015-newsynth,
author = {Selinger, Peter},
title = {Efficient {Clifford}+{$T$} Approximation of Single-Qubit
Operators},
journal = {Quantum Information and Computation},
volume = 15,
number = {1--2},
pages = {159--180},
year = 2015,
doi = {10.26421/QIC15.1-2-10},
note = {Also available from \arxiv{1212.6253}},
filename = {newsynth}
}
@article{GS2013-nqubit,
author = {Giles, Brett and Selinger, Peter},
title = {Exact synthesis of multiqubit {Clifford+$T$} circuits},
journal = {Physical Review A},
volume = 87,
pages = {032332 (7 pages)},
year = 2013,
note = {Also available from \arxiv{1212.0506}},
doi = {10.1103/PhysRevA.87.032332},
filename = {nqubit}
}
@article{Sel2013-toffoli,
author = {Selinger, Peter},
title = {Quantum Circuits of {$T$}-Depth One},
journal = {Physical Review A},
volume = 87,
pages = {042302 (4 pages)},
year = 2013,
note = {Also available from \arxiv{1210.0974}},
doi = {10.1103/PhysRevA.87.042302},
filename = {toffoli}
}
@article{Sel2012-finhilb,
author = {Selinger, Peter},
title = {Finite Dimensional {Hilbert} Spaces are Complete for Dagger
Compact Closed Categories},
journal = {Logical Methods in Computer Science},
volume = 8,
number = {3:6},
pages = {1--12},
year = 2012,
note = {Also available from \arxiv{1207.6972}},
doi = {10.2168/LMCS-8(3:6)2012},
filename = {finhilb}
}
@inproceedings{Sel2011-finhilb-qpl,
author = {Selinger, Peter},
title = {Finite Dimensional {Hilbert} Spaces are Complete for Dagger
Compact Closed Categories},
booktitle = {Proceedings of the 5th International Workshop on Quantum
Physics and Logic, QPL 2008, Reykjavik},
series = {Electronic Notes in Theoretical Computer Science},
volume = {270(1)},
pages = {113--119},
year = 2011,
doi = {10.1016/j.entcs.2011.01.010},
filename = {finhilb-qpl}
}
@article{MSS2012-ptrace,
author = {Malherbe, Octavio and Scott, Philip J. and Selinger, Peter},
title = {Partially Traced Categories},
journal = {Journal of Pure and Applied Algebra},
volume = 216,
number = 12,
pages = {2563--2585},
year = 2012,
note = {Also available from \arxiv{1107.3608}},
doi = {10.1016/j.jpaa.2012.03.026},
filename = {ptrace}
}
@incollection{Sel2010-halftwist,
author = {Selinger, Peter},
title = {Autonomous Categories in which {$A \cong A^{*}$}.
{Extended} Abstract},
booktitle = {Proceedings of the 7th International Workshop on Quantum
Physics and Logic, QPL 2010, Oxford},
pages = {151--160},
year = 2010,
filename = {halftwist}
}
@incollection{SV2009-qlambdabook,
author = {Selinger, Peter and Valiron, Beno{\^\i}t},
title = {Quantum Lambda Calculus},
editor = {Simon Gay and Ian Mackie},
booktitle = {Semantic Techniques in Quantum Computation},
publisher = {Cambridge University Press},
year = 2009,
chapter = 4,
pages = {135--172},
filename = {qlambdabook}
}
@incollection{Sel2009-graphical,
author = {Selinger, Peter},
title = {A Survey of Graphical Languages for Monoidal Categories},
editor = {Coecke, Bob},
booktitle = {New Structures for Physics},
series = {Lecture Notes in Physics},
volume = 813,
publisher = {Springer},
pages = {289--355},
year = {2011},
note = {Also available from \arxiv{0908.3347}},
doi = {10.1007/978-3-642-12821-9_4},
filename = {graphical}
}
@InProceedings{SV2008-catcbv,
author = {Selinger, Peter and Valiron, Beno{\^\i}t},
title = {A Linear-Non-Linear Model for a Computational Call-by-Value
Lambda Calculus},
booktitle = {Proceedings of the 11th International Conference on
Foundations of Software Science and Computation Structures,
FOSSACS 2008, Budapest},
series = {Lecture Notes in Computer Science},
volume = 4962,
pages = {81--96},
publisher = {Springer},
year = 2008,
doi = {10.1007/978-3-540-78499-9_7},
filename = {catcbv}
}
@inproceedings{Sel2008-idem,
author = {Selinger, Peter},
title = {Idempotents in Dagger Categories},
booktitle = {Proceedings of the 4th International Workshop on Quantum
Programming Languages, QPL 2006, Oxford},
series = {Electronic Notes in Theoretical Computer Science},
volume = 210,
pages = {107--122},
year = 2008,
publisher = {Elsevier},
doi = {10.1016/j.entcs.2008.04.021},
filename = {idem}
}
@inproceedings{SV2008-qlinear,
author = {Selinger, Peter and Valiron, Beno{\^\i}t},
title = {On a Fully Abstract Model for a Quantum Linear Functional
Language},
booktitle = {Proceedings of the 4th International Workshop on Quantum
Programming Languages, QPL 2006, Oxford},
series = {Electronic Notes in Theoretical Computer Science},
volume = 210,
pages = {123--137},
year = 2008,
publisher = {Elsevier},
doi = {10.1016/j.entcs.2008.04.022},
filename = {qlinear}
}
@inproceedings{CFS2006-treesparse,
author = {Caboara, Massimo and Faridi, Sara and Selinger, Peter},
title = {Tree Checking for Sparse Complexes},
booktitle = {Proceedings of the Second International Congress on
Mathematical Software, ICMS 2006, Castro-Urdiales, Spain},
series = {Lecture Notes in Computer Science},
volume = 4151,
pages = {110--121},
publisher = {Springer},
year = 2006,
doi = {10.1007/11832225_10},
filename = {treesparse}
}
@inproceedings{CFS2005-treecomp,
author = {Caboara, Massimo and Faridi, Sara and Selinger, Peter},
title = {Simplicial Tree Computations. {Extended} Abstract},
booktitle = {Proceedings of the 8th International Symposium on Effective
Methods in Algebraic Geometry, MEGA 2005, Sardinia, Italy},
note = {13 pages},
year = 2005,
filename = {treecomp}
}
@article{CFS2007-treecycle,
author = {Caboara, Massimo and Faridi, Sara and Selinger, Peter},
title = {Simplicial Cycles and the Computation of Simplicial Trees},
journal = {Journal of Symbolic Computation},
volume = 42,
pages = {74--88},
year = 2007,
doi = {10.1016/j.jsc.2006.03.004},
note = {Also available from \arxiv{math/0606375}},
filename = {treecycle}
}
@inproceedings{SV2005-qlambda,
author = {Selinger, Peter and Valiron, Beno{\^\i}t},
title = {A Lambda Calculus for Quantum Computation with Classical
Control},
booktitle = {Proceedings of the 7th International Conference on Typed
Lambda Calculi and Applications, TLCA 2005, Nara, Japan},
series = {Lecture Notes in Computer Science},
volume = 3461,
publisher = {Springer},
pages = {354--368},
year = 2005,
doi = {10.1007/11417170_26},
filename = {qlambda}
}
@article{SV2006-qlambda-mscs,
author = {Selinger, Peter and Valiron, Beno{\^\i}t},
title = {A Lambda Calculus for Quantum Computation with Classical
Control},
journal = {Mathematical Structures in Computer Science},
volume = 16,
number = 3,
pages = {527--552},
year = 2006,
doi = {10.1017/S0960129506005238},
filename = {qlambda-mscs}
}
@inproceedings{Sel2005-dagger,
author = {Selinger, Peter},
title = {Dagger Compact Closed Categories and Completely Positive
Maps},
booktitle = {Proceedings of the 3rd International Workshop on Quantum
Programming Languages, QPL 2005, Chicago},
series = {Electronic Notes in Theoretical Computer Science},
volume = 170,
publisher = {Elsevier},
pages = {139-163},
year = {2007},
doi = {10.1016/j.entcs.2006.12.018},
filename = {dagger}
}
@unpublished{Sel2004-longcones,
author = {Selinger, Peter},
title = {Towards a semantics for higher-order quantum computation},
year = 2004,
note = {Expanded version of {\cite{Sel2004-cones}}. Available from
\url{http://www.mathstat.dal.ca/~selinger/papers.html#cones}},
filename = {longcones}
}
@inproceedings{Sel2004-cones,
author = {Selinger, Peter},
title = {Towards a Semantics For Higher-Order Quantum Computation},
booktitle = {Proceedings of the 2nd International Workshop on Quantum
Programming Languages, QPL 2004, Turku, Finland},
year = 2004,
pages = {127--143},
series = {TUCS General Publication No~33},
organization = {Turku Centre for Computer Science},
filename = {cones}
}
@inproceedings{Sel2004-flops04,
author = {Selinger, Peter},
title = {A Brief Survey of Quantum Programming Languages},
booktitle = {Proceedings of the 7th International Symposium on
Functional and Logic Programming, FLOPS 2004, Nara, Japan},
series = {Lecture Notes in Computer Science},
volume = 2998,
pages = {1--6},
publisher = {Springer},
year = 2004,
doi = {10.1007/978-3-540-24754-8_1},
filename = {flops04}
}
@article{Sel2004-qpl,
author = {Selinger, Peter},
title = {Towards a Quantum Programming Language},
journal = {Mathematical Structures in Computer Science},
volume = 14,
number = 4,
pages = {527--586},
year = 2004,
doi = {10.1017/S0960129504004256},
filename = {qpl}
}
@unpublished{Sel2003-controlremarks,
author = {Selinger, Peter},
title = {Some remarks on control categories},
note = {Manuscript, 17 pages. Available from
\url{http://www.mathstat.dal.ca/~selinger/papers/#controlremarks}},
year = 2003,
month = jun,
filename = {controlremarks}
}
@unpublished{Sel2003-krivine,
author = {Selinger, Peter},
title = {From continuation passing style to {Krivine}'s abstract
machine},
note = {Manuscript, 23 pages. Available from
\url{http://www.mathstat.dal.ca/~selinger/papers/#krivine}},
year = 2003,
month = may,
filename = {krivine}
}
@article{Sel2002-cmaa,
author = {Selinger, Peter},
title = {Order-Incompleteness and Finite Lambda Reduction Models},
journal = {Theoretical Computer Science},
volume = 309,
number = 1,
pages = {43--63},
year = 2003,
doi = {10.1016/S0304-3975(02)00038-5},
filename = {cmaa}
}
@inproceedings{Sel1996-order,
author = {Selinger, Peter},
title = {Order-Incompleteness and Finite Lambda Models. {Extended}
Abstract},
booktitle = {Proceedings of the Eleventh Annual IEEE Symposium on Logic
in Computer Science, LICS 1996},
pages = {432--439},
year = 1996,
doi = {10.1109/LICS.1996.561459},
filename = {order}
}
@article{Sel2002-combinatory,
author = {Selinger, Peter},
title = {The Lambda Calculus is Algebraic},
journal = {Journal of Functional Programming},
volume = 12,
number = 6,
pages = {549--566},
year = 2002,
doi = {10.1017/S0956796801004294},
filename = {combinatory}
}
@unpublished{Sel2013-lambdanotes,
author = {Selinger, Peter},
title = {Lecture notes on the lambda calculus},
note = {Expository course notes, 120 pages. Available from
\arxiv{0804.3434}},
year = 2013,
filename = {lambdanotes}
}
@inproceedings{Sel2001-proto,
author = {Selinger, Peter},
title = {Models for an Adversary-Centric Protocol Logic},
booktitle = {Proceedings of the 1st Workshop on Logical Aspects of
Cryptographic Protocol Verification, Paris},
series = {Electronic Notes in Theoretical Computer Science},
volume = {55(1)},
year = 2001,
pages = {69--84},
doi = {10.1016/S1571-0661(04)00245-2},
filename = {proto}
}
@article{Sel2001-control,
author = {Selinger, Peter},
title = {Control Categories and Duality: on the Categorical
Semantics of the Lambda-Mu Calculus},
journal = {Mathematical Structures in Computer Science},
year = 2001,
volume = 11,
number = 2,
pages = {207--260},
filename = {control}
}
@inproceedings{Sel1999-catasynch,
author = {Selinger, Peter},
title = {Categorical Structure of Asynchrony},
booktitle = {Proceedings of the 15th Conference on the Mathematical
Foundations of Programming Semantics, MFPS 1999, New
Orleans},
series = {Electronic Notes in Theoretical Computer Science},
volume = 20,
year = 1999,
pages = {158--181},
doi = {10.1016/S1571-0661(04)80073-2},
filename = {catasynch}
}
@unpublished{Sel1998-bainbridge,
author = {Selinger, Peter},
title = {A note on {Bainbridge}'s power set construction},
year = 1998,
month = may,
note = {Manuscript, 10 pages. Available from
\url{http://www.mathstat.dal.ca/~selinger/papers.html#bainbridge}},
filename = {bainbridge}
}
@phdthesis{Sel1997-PhD,
author = {Selinger, Peter},
title = {Functionality, Polymorphism, and Concurrency: A
Mathematical Investigation of Programming Paradigms},
school = {University of Pennsylvania},
year = 1997,
note = {129 pages. Available as IRCS Technical Report 97-17},
month = jun,
filename = {diss}
}
@unpublished{Sel1997-asynch-full,
author = {Selinger, Peter},
title = {First-order axioms for asynchrony},
year = 1997,
note = {Expanded version of {\cite{Sel1997-asynch}}. Available
from \url{http://www.mathstat.dal.ca/~selinger/papers.html}},
filename = {concur97full}
}
@inproceedings{Sel1997-asynch,
author = {Selinger, Peter},
title = {First-Order Axioms for Asynchrony},
booktitle = {Proceedings of the 8th International Conference on
Concurrency Theory, CONCUR 1997, Warsaw, Poland},
series = {Lecture Notes in Computer Science},
volume = 1243,
publisher = {Springer},
pages = {376--390},
year = 1997,
doi = {10.1007/3-540-63141-0_26},
filename = {concur97short}
}
@unpublished{Sel1994-lh,
author = {Selinger, Peter},
title = {{$LH$} has nonempty products},
year = 1994,
note = {Manuscript, 5 pages. Available from
\url{http://www.mathstat.dal.ca/~selinger/papers/#lh}},
url = {http://www.mathstat.dal.ca/~selinger/papers.html#lh},
filename = {lh}
}
@unpublished{Sel1996-join-calculus,
author = {Selinger, Peter},
title = {A compiler for the join calculus},
year = 1996,
note = {Software implementation, available from
\url{http://www.mathstat.dal.ca/~selinger/join.html}},
filename = {join-calculus}
}
@unpublished{Sel1998-lammunu,
author = {Selinger, Peter},
title = {An implementation of the call-by-name
$\lambda\mu\nu$-calculus},
year = 1998,
note = {Software implementation, available from
\url{http://www.mathstat.dal.ca/~selinger/lammunu/}},
filename = {lammunu}
}