![[home]](images/PS05.gif){kind=small}
PERSONAL DETAILS:
|
EDUCATION:
|
University of Pennsylvania, Philadelphia, U.S.A., 1992–1997.
Ph.D. in Mathematics. Supervisor: Andre Scedrov. Thesis Title: Functionality, Polymorphism, and Concurrency: A Mathematical Investigation of Programming Paradigms.
Technische Hochschule Darmstadt, Darmstadt, Germany. 1989–1992.
|
EMPLOYMENT:
|
Professor, Department of Mathematics and
Statistics, Dalhousie University. Cross-appointed in Computer Science.
Associate Professor, Department of Mathematics and
Statistics, Dalhousie University.
Associate Professor, Department of Mathematics and
Statistics, University of Ottawa.
Assistant Professor, Department of Mathematics
and Statistics, University of Ottawa.
Research Associate, Computer Science Department, Stanford
University.
Visiting Research Assistant Professor, BRICS, Centre of the
Danish National Research Foundation, Computer Science Department,
Aarhus University, Denmark. Assistant Professor, Department of Mathematics, University of Michigan. 1997–2000. |
AFFILIATIONS:
|
Research Professorship, Complementary Program, Mathematical
Sciences Research Institute (MSRI), Berkeley, California,
August–December 2012.
Affiliate Member, Perimeter Institute for Theoretical Physics, Waterloo, Ontario, 2012–2015.
Adjunct Professor, Department of Mathematics and Statistics,
University of Ottawa. |
GRANTS AND AWARDS:
|
NSERC Discovery Grant, Computer Science, 2012–2017.
IARPA Research Contract, Intelligence Advanced Research Projects Agency, Quantum Computer Science Program. Collaborative effort with industrial partner Applied Communication Sciences and four U.S. universities. Base year followed by three option years. 2011–2015. CFI Infrastructure Operating Fund, Canada Foundation for Innovation, 2008–2009. NSERC Discovery Grant, Computer Science, 2006–2012. NSRIT Infrastructure Support, Nova Scotia Research and Innovation Trust, 2005. Startup Funds, Dalhousie University, 2005. CFI Infrastructure Operating Fund, Canada Foundation for Innovation, 2004–2006. CFI New Opportunities Fund, Canada Foundation for Innovation, 2003–2006. OIT Infrastructure Support, Ontario Innovation Trust, 2003–2005. CFI matching funds, Faculty of Science, University of Ottawa, 2003–2005. Premier's Research Excellence Award (PREA), Government of Ontario, 2003–2008. PREA matching funds, Faculty of Science, University of Ottawa, 2003–2008. NSERC Individual Research Grant, Computer Science, 2001–2006. Startup Funds, University of Ottawa, 2001–2003. Doctoral Dissertation Fellowship, Alfred P. Sloan Foundation, 1996–1997. Dissertation Fellowship, School of Arts and Sciences, University of Pennsylvania, 1995–1996. Dissertation Fellowship, Institute for Research in Cognitive Science, University of Pennsylvania, 1995. German National Scholarship Foundation Fellowship, 1991–1994. |
GRADUATE SUPERVISIONS:
Completed:
|
PUBLICATIONS:
|
O. Malherbe, P.J. Scott, P. Selinger. Partially traced categories.
To appear in Journal of Pure and Applied Algebra, 2012.
P. Selinger. Finite dimensional Hilbert spaces are complete for dagger compact closed categories. To appear in Logical Methods in Computer Science, 2011.
P. Selinger. A survey of graphical languages for monoidal
categories. Book chapter. In Bob Coecke, editor, New
Structures for Physics, Springer Lecture Notes in
P. Selinger. Finite dimensional Hilbert spaces are complete for
dagger compact closed categories. Extended abstract. In
Proceedings of the 5th International Workshop on Quantum Physics
and Logic (QPL 2008), Reykjavik. Electronic
Notes in Theoretical Computer
P. Selinger. Autonomous categories in which A is isomorphic
to A
P. Selinger, B. Valiron. Quantum lambda calculus. Book
chapter. In Simon Gay and Ian Mackie, editors,
Semantic Techniques in Quantum Computation, Cambridge
University Press,
P. Selinger, B. Valiron. A linear-non-linear model for a
computational call-by-value lambda calculus. Extended abstract. In
Proceedings of the Eleventh International Conference on
Foundations of Software Science and Computation Structures (FOSSACS
2008), Budapest. Springer LNCS 4962,
P. Selinger. Idempotents in dagger categories.
Extended abstract. In Proceedings of the 4th International Workshop
on Quantum Programming Languages (QPL 2006), Oxford. Electronic
Notes in Theoretical Computer
P. Selinger, B. Valiron. On a fully abstract model for a
quantum linear functional language. Extended abstract. In
Proceedings of the 4th International Workshop on Quantum
Programming Languages (QPL 2006), Oxford. Electronic Notes in
Theoretical Computer M. Caboara, S. Faridi, P. Selinger. Simplicial cycles and the computation of simplicial trees. Journal of Symbolic Computation 42:74–88, 2007.
P. Selinger. Dagger compact closed categories and completely
positive maps. Extended abstract. In Proceedings of the
3rd International Workshop on Quantum Programming Languages (QPL
2005), Chicago. Electronic Notes in Theoretical Computer
P. Selinger, B. Valiron. A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16(3):527–552, 2006.
M. Caboara, S. Faridi, P. Selinger. Tree checking for sparse
complexes. In Proceedings of the Second International
Congress on Mathematical Software (ICMS 2006), Castro-Urdiales,
Spain. Springer LNCS 4151,
P. Selinger, B. Valiron. A lambda calculus for quantum
computation with classical control. In Proceedings of the
Seventh International Conference on Typed Lambda Calculi and
Applications (TLCA 2005), Nara, Japan. Springer LNCS 3461,
M. Caboara, S. Faridi, P. Selinger. Simplicial tree
computations. Extended abstract. In Proceedings of
Effective Methods in Algebraic Geometry (MEGA 2005), Sardinia,
Italy.
P. Selinger. Towards a semantics for higher-order quantum
computation. In Proceedings of the 2nd International
Workshop on Quantum Programming Languages, Turku, Finland. TUCS
General Publication No 33, Turku Centre for Computer Science,
P. Selinger. A brief survey of quantum programming languages.
In Proceedings of the 7th International Symposium on
Functional and Logic Programming, Nara, Japan. Springer LNCS 2998,
P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science 14(4):527–586, 2004. P. Selinger. Order-incompleteness and finite lambda reduction models. Theoretical Computer Science 309(1):43–63, 2003. P. Selinger. The lambda calculus is algebraic. Journal of Functional Programming 12(6):549–566, 2002. P. Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science 11(2):207–260, 2001.
P. Selinger. Models for an adversary-centric protocol logic.
In Proceedings of the 1st Workshop on Logical Aspects of
Cryptographic Protocol Verification, Paris. Electronic Notes in
Theoretical Computer
P. Selinger. Categorical structure of asynchrony. In
Proceedings of the Fifteenth Annual Conference on
Mathematical Foundations of Programming Semantics, New Orleans.
Electronic Notes in Theoretical Computer
P. Selinger. First-order axioms for asynchrony. In
Proceedings of the Eighth International Conference on
Concurrency Theory, Warsaw. Lecture Notes in Computer
P. Selinger. Order-incompleteness and finite lambda models.
Extended abstract. In Proceedings of the Eleventh Annual
IEEE Symposium on Logic in Computer Science, New Brunswick, New
Jersey, |
BOOKS EDITED:
|
Proceedings of the 8th International Workshop on Quantum
Physics and Logic, QPL 2011, Nijmegen.
Proceedings of the 7th International Workshop on Quantum
Physics and Logic, QPL 2010, Oxford.
Proceedings of the 6th International Workshop on Quantum
Physics and Logic, QPL 2009, Oxford.
Proceedings of the 5th International Workshop on Quantum
Physics and Logic (formerly Quantum Programming Languages), QPL
2008, Reykjavik.
Proceedings of the 4th International Workshop on Quantum
Programming Languages, QPL 2006, Oxford.
Proceedings of the 3rd International Workshop on Quantum
Programming Languages, QPL 2005, Chicago. P. Selinger, editor,
Electronic Notes in Theoretical Computer
Proceedings of the 2nd International Workshop on Quantum
Programming Languages, QPL 2004, Turku, Finland. P. Selinger,
editor. Turku Centre for Computer Science General Publication
Proceedings of Category Theory and Computer Science, CTCS 2002,
Ottawa, Canada. R. Blute and P. Selinger, editors, Electronic Notes
in Theoretical Computer |
PRESENTATIONS AT INTERNATIONAL CONFERENCES AND WORKSHOPS:
|
Logical methods in quantum information theory. Invited
lecture, 19th Workshop on Logic, Language, Information and
Computation (
Logical approaches to higher-order quantum information
theory. Invited lecture, 13th Union College Mathematics
Conference, Schenectady, New York,
Partially traced categories. 13th Union College Mathematics
Conference, Schenectady, New York,
Logical methods in quantum information theory. Invited
lecture, 27th British Colloquium for Theoretical Computer Science
(
Autonomous categories with self-dual objects. International
Category Theory Conference (CT 2010), Genova, Italy,
Autonomous categories in which A is isomorphic to
A Higher types in quantum computing. Invited lecture, QICS School on Foundational Structures in Quantum Computation and Information, Oxford, May 24–28, 2010. Finite dimensional Hilbert spaces are complete for dagger compact closed categories. Invited participant, Special Session on Logic and Foundations of Physics, North American Annual Meeting of the Association for Symbolic Logic, Washington, March 17–20, 2010.
Higher-order quantum computation. Invited participant,
Workshop on Categories, Quanta, and Concepts, Perimeter Institute,
Waterloo, Canada,
Semantic methods in quantum information theory. Invited
tutorial, 25th Conference on the Mathematical Foundations of
Programming Semantics (MFPS 2009), Oxford,
Data types for quantum computing. Invited participant,
Workshop on Foundational Structures for Quantum Information and
Computation, Obergurgl, Austria,
Finite dimensional Hilbert spaces are complete for dagger compact
closed categories. 5th International Workshop on Quantum
Physics and Logic (QPL 2008), Reykjavik,
Fibonacci objects. 16th Workshop on Foundational Methods in
Computer Science (FMCS 2008), Halifax,
Categorical models of quantum computation.
Invited tutorial, 24th Conference on the Mathematical Foundations of
Programming Semantics (MFPS 2008), Philadelphia, Finite dimensional Hilbert spaces are complete for dagger compact closed categories. Invited participant, Workshop on Logic, Physics and Quantum Information Theory, Bellairs Research Institute, Barbados, March 17, 2008. Linear logic in quantum computation. Invited participant, Journées Jean-Yves Girard, Paris, Sept 10–12, 2007.
Survey of graphical calculi for monoidal categories.
Workshop on Tensors, Knots and Braids in Logic and Physics,
Oxford,
Idempotents in dagger categories.
4th International Workshop on Quantum Programming Languages (QPL 2006),
Oxford,
Categorical models of quantum computation. Invited lecture,
International Category Theory Conference (CT 2006), White Point, Nova
Scotia,
Semantics of a quantum programming language. Invited lecture,
22nd Conference on the Mathematical Foundations of Programming
Semantics (MFPS 2006), Genova, Italy,
Semantics of quantum computation. Three invited tutorial lectures,
Annual Meeting of the Association for Symbolic Logic, Montreal,
Idempotents in dagger categories. Invited participant, Special
Session on Categorical Logic and Quantum Computation, Annual Meeting
of the Association for Symbolic Logic, Montreal,
Idempotents in dagger categories. Invited participant,
Geometry of Computation 2006, IML Institute for Mathematics at
Luminy, University of Marseille,
Dagger compact closed categories and completely positive maps.
3rd International Workshop on Quantum Programming Languages (QPL 2005),
Chicago, Programming languages for quantum computing. Invited lecture, ACM Symposium on Principles of Programming Languages (POPL 2005), Long Beach, California, Jan 12–14, 2005.
{\bf Towards a Quantum Programming Language.} Invited participant,
Workshop on Quantum Computation and Information Theory, Banff
International Research Station,
Towards a semantics for higher-order quantum computation. 2nd
International Workshop on Quantum Programming Languages (QPL 2004),
Turku, Finland,
Towards a semantics for higher-order quantum computation.
Foundational Methods in Computer Science (FMCS 2004), University of
Calgary, On the semantics of higher-order quantum computation. Invited participant, Workshop on Logical and Semantical Methods in Quantum Computation, Bellairs Research Institute, Barbados, April 16, 2004. Towards a model of higher-order quantum computation. Invited participant, Workshop on Algebra and Logic on Programming Systems, Kyoto, Japan, April 10, 2004. The design of quantum programming languages. Invited lecture, International Symposium on Functional and Logic Programming (FLOPS 2004), Nara, Japan, April 7–9, 2004.
Towards a quantum programming language. Invited lecture, 9th
International Conference on Category Theory in Computer Science (CTCS
2002), Ottawa, Towards a quantum programming language. Invited participant, Logic and Interaction Weeks, Marseille, Feb. 18–22, 2002.
Models for an adversary-centric protocol logic. 1st Workshop
on Logical Aspects of Cryptographic Protocol Verification, Paris,
On the semantics of classical logic. Workshop on Logic,
Language and Computation (LLC), Center for the Study of Language and
Information, Stanford,
Categorical semantics of control. Invited lecture, Typed Lambda
Calculi and Applications (TLCA 2001), Krakow,
Categorical models of communication.
Invited lecture, Foundational Methods in Computer Science (FMCS 2000),
Vancouver,
A domain-theoretic model for asynchronous communication.
Invited participant, International Symposium on Domain Theory,
Shanghai,
Control categories and duality. Invited lecture, Workshop on
Classical Logic and Programming,
Chambéry, France,
Categorical structure of asynchrony. Invited lecture,
Fifteenth Annual Conference on Mathematical Foundations of
Programming Semantics (MFPS 1999), New Orleans,
Control categories: an axiomatic approach to the semantics of
functional control. Fourteenth Annual Workshop on Mathematical
Foundations of Programming Semantics (MFPS 1998), London,
Finite lambda models. Invited participant, Workshop on
Mathematical Logic, Oberwolfach, Germany,
First-order axioms for asynchrony. Eighth International
Conference on Concurrency Theory (CONCUR 1997). Warsaw, Poland,
Order-incompleteness and finite lambda models. Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS 1996). New Brunswick, New Jersey, July 27–30, 1996.
Henkin representations and polymorphism. Twelfth Annual
Workshop on Mathematical Foundations of Programming Semantics
(MFPS 1996). Boulder, Colorado,
Unorderable algebras and Mal'cev operators. Conference on Modern
Algebra and its Applications. Nashville, Tennessee, |
PROFESSIONAL ACTIVITIES:
|
Program committee member. 40th International Colloquium on
Automata, Languages and Programming, Track B (ICALP 2013), Riga,
Latvia, July 8–12, 2013.
Guest editor. Information and Computation, special issue on Quantum Physics and Logic, 2011–2012.
Co-organizer. 20th Workshop on Foundational Methods in
Computer Science Co-organizer. Logic and Interaction Weeks 2012, CIRM, Marseille, France, Jan 30 – Mar 16, 2012. Program committee co-chair. 8th International Workshop on Quantum Physics and Logic (QPL 2011). Nijmegen, October 27–29, 2011. Visiting researcher. IML Institute for Mathematics at Luminy, 4 lectures on Logical approaches to quantum information theory, University of Marseille, March 16 – Apr 12, 2011. Guest lecturer. University of Paris 13, 4 lectures on Quantum programming languages and logical approaches to quantum information theory, Paris, February 7–17, 2011. Co-organizer. Category Theory "Octoberfest" Workshop, Dalhousie University, October 23–24, 2010. Guest editor. Foundations of Physics, special issue on Quantum Physics and Logic, 2010–2012. Co-organizer. 7th International Workshop on Quantum Physics and Logic (QPL 2010). Oxford, May 29–30, 2010. Program committee chair. 26th International Conference on the Mathematical Foundations of Programming Semantics (MFPS 2010), Ottawa, May 5–10, 2010. Program committee member. North American Annual Meeting of the Association for Symbolic Logic, Washington, March 17–20, 2010. Program committee member. 5th Workshop on Developments in Computational Models (DCM 2009), Rhodes, Greece, July 11, 2009. Organizing committee member. 17th Workshop on Foundational Methods in Computer Science (FMCS 2009), Vancouver, Canada, May 28–31, 2009. Co-organizer. 6th International Workshop on Quantum Physics and Logic (QPL 2009). Oxford, April 8–9, 2009. Program committee member. 25th International Conference on the Mathematical Foundations of Programming Semantics (MFPS 2009), Oxford, April 3–7, 2009.
Co-organizer. 16th Workshop on Foundational Methods in
Computer Science Program committee member. 15th International Workshop on Expressiveness in Concurrency (EXPRESS 2008), Toronto, August 23, 2008. Editorial board member. Logical Methods in Computer Science, September 2007 – 2013. Program committee member. 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), Wroclaw, Poland, July 9–13, 2007. Program committee member. International Conference on Typed Lambda Calculi and Applications (TLCA 2007), Paris, June 25–29, 2007. Organizer. 4th International Workshop on Quantum Programming Languages (QPL 2006). Oxford, July 17–19, 2006. Program committee member. 33rd International Colloquium on Automata, Languages and Programming, Track B (ICALP 2006), Venice, Italy, July 10–14, 2006. Co-organizer. International Category Theory Conference (CT 2006), White Point, Nova Scotia, June 25 – July 1, 2006. Program committee member. 8th International Symposium on Functional and Logic Programming (FLOPS 2006), Mt. Fuji, Japan, April 24–26, 2006. Editorial board member. Mathematical Structures in Computer Science, February 2005 – 2010. Organizer. 3rd International Workshop on Quantum Programming Languages (QPL 2005). Chicago, June 30 – July 1, 2005. This workshop is affiliated with the Twentieth Annual IEEE Symposium on Logic in Computer Science (LICS 2005). Program committee member. 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005), Chicago, June 26–29, 2005. Program committee member. 8th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2005), Edinburgh, Scotland, Apr. 4–8, 2005. Guest editor. Mathematical Structures in Computer Science, special issue on Quantum Programming Languages, 2005. Program committee member. 10th International Conference on Category Theory in Computer Science (CTCS 2004), Copenhagen, Denmark, Aug. 12–14, 2004. Lecturer. Workshop on Quantum Computing, Institute for Studies in Theoretical Physics and Mathematics, Tehran, Iran, August 1–5, 2004. Organizer. 2nd International Workshop on Quantum Programming Languages (QPL 2004). Turku, Finland, July 12–13, 2004. This workshop is affiliated with the Nineteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2004). Program committee member. Workshop on Categorical Methods for Concurrency, Interaction, and Mobility (CMCIM 2003), Marseille, France, Sept. 6, 2003. Organizer. First International Workshop on Quantum Programming Languages (QPL 2003). Ottawa, June 15–16, 2003. Co-organizer and lecturer. Fields Summer School on Logic and Foundations of Computation. Ottawa, June 2–20, 2003. Program committee member. Workshop on Security of Communication on the Internet (SECI 2002), Tunis, Tunisia, Sept. 19–21, 2002. Lecturer. Graduate Student Preconference to CTCS 2002. Ottawa, August 12–14, 2002. |
TEACHING EXPERIENCE:
Dalhousie University, 2005–
|