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 Universität Darmstadt, Darmstadt, Germany. 1989–1992.

EMPLOYMENT:
Professor, Department of Mathematics and
Statistics, Dalhousie University. Crossappointed 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:
Visiting Researcher, Logical Structures in Computation
Program, Simons Institute for the Theory of Computing, University of
California at Berkeley, August–December 2016.
Visiting Research Professor, Mathematical Sciences Research Institute (MSRI), Berkeley, California, August–December 2012. Affiliate Member, Perimeter Institute for Theoretical Physics, Waterloo, Ontario, 2012–2017.
Adjunct Professor, Department of Mathematics and Statistics,
University of Ottawa. 
HONORS:
Killam Professorship, Faculty of Science, Dalhousie
University. 
GRANTS AND AWARDS:
NSERC Discovery Grant, Computer Science, 2017–2022.
NSERC Accelerator Supplement, Computer Science, 2017–2020.
AFOSR Research Grant, U.S. Air Force Office of Scientific Research. 2015–2020. MURI Research Grant, unsupported participant, U.S. Department of Defense Multidisciplinary Research Program of the University Research Initiative. Collaborative effort with Tulane University, Stanford University, the University of Pennsylvania, the University of Iowa, McGill University, Oxford University, and the University of Edinburgh. 20152018. NSERC Discovery Grant, Computer Science, 2012–2017. IARPA Research Contract, U.S. Intelligence Advanced Research Projects Agency, Quantum Computer Science Program. Collaborative effort with industrial partner Applied Communication Sciences and four U.S. universities. 2011–2013. 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:
P. Selinger. A finite alternation result for reversible boolean
circuits. In Science of Computer Programming 151:2–17,
2018.
F. Rios, P. Selinger. A categorical model for a quantum circuit
description language. To appear in Proceedings of the 14th
International Conference on Quantum Physics and Logic N.J. Ross, P. Selinger. Optimal ancillafree Clifford+T approximation of zrotations. In Quantum Information and Computation 16(11–12):901–953, 2016. Available from arXiv:1403.2975.
P. Selinger. A finite alternation result for reversible boolean
circuits. Extended abstract. In Proceedings of the 8th
International Conference on Reversible Computation B. Valiron, N.J. Ross, P. Selinger, D.S. Alexander, J.M. Smith. Programming the quantum future. Communications of the ACM 58(8):52–61, 2015. P. Selinger. Generators and relations for nqubit Clifford operators. Logical Methods in Computer Science 11(2:10):1–17, 2015. P. Selinger. Efficient Clifford+T approximation of singlequbit operators. Quantum Information and Computation 15(1–2):159–180, 2015.
J.M. Smith, N.J. Ross, P. Selinger, B. Valiron. Quipper:
concrete resource estimation in quantum algorithms. Extended
abstract of a talk given at the 12th International Workshop on
Quantitative Aspects of Programming Languages and Systems
M. Pagani, P. Selinger, B. Valiron. Applying quantitative
semantics to higherorder quantum computing. In
Proceedings of the 41st ACM SIGPLANSIGACT Symposium on
Principles of Programming Languages
C. Heunen, A. Kissinger, P. Selinger. Completely positive
projections and biproducts. In Proceedings of the 10th
International Workshop on Quantum Physics and Logic
B. Giles, P. Selinger. Remarks on Matsumoto and Amano's normal
form for singlequbit Clifford+T operators. Preprint,
A.S. Green, P.L. Lumsdaine, N.J. Ross, P. Selinger, B. Valiron.
An introduction to quantum programming in Quipper. In
Proceedings of the 5th International Conference on Reversible
Computation O. Malherbe, P. Scott, P. Selinger. Presheaf models of quantum computation: an outline. In Bob Coecke, Luke Ong, Prakash Panangaden, editors, Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. Lecture Notes in Computer Science 7860:178–194, Springer, 2013.
A.S. Green, P.L. Lumsdaine, N.J. Ross, P. Selinger, B. Valiron.
Quipper: a scalable quantum programming language. In
Proceedings of the 34th annual ACM SIGPLAN conference on
Programming Language Design and Implementation
B. Giles, P. Selinger. Exact synthesis of multiqubit
Clifford+T circuits. Physical
P. Selinger. Quantum circuits of Tdepth one.
Physical P. Selinger. Finite dimensional Hilbert spaces are complete for dagger compact closed categories. Logical Methods in Computer Science 8(3:6):1–12, 2012. O. Malherbe, P.J. Scott, P. Selinger. Partially traced categories. Journal of Pure and Applied Algebra 216(12):2563–2585, 2012. P. Selinger. A survey of graphical languages for monoidal categories. Book chapter. In Bob Coecke, editor, New Structures for Physics, Lecture Notes in Physics 813:289–355, Springer, 2011.
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
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 linearnonlinear model for a
computational callbyvalue lambda calculus. Extended abstract. In
Proceedings of the Eleventh International Conference on
Foundations of Software Science and Computation Structures
P. Selinger. Idempotents in dagger categories.
Extended abstract. In Proceedings of the 4th International Workshop
on Quantum Programming Languages
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 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 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
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
M. Caboara, S. Faridi, P. Selinger. Simplicial tree
computations. Extended abstract. In Proceedings of the 8th
International Symposium on Effective Methods in Algebraic Geometry
P. Selinger. Towards a semantics for higherorder 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. Lecture Notes in Computer Science 2998:1–6, Springer, 2004. P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science 14(4):527–586, 2004. P. Selinger. Orderincompleteness 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 lambdamu calculus. Mathematical Structures in Computer Science 11(2):207–260, 2001.
P. Selinger. Models for an adversarycentric 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. Firstorder axioms for asynchrony. In Proceedings of the Eighth International Conference on Concurrency Theory, Warsaw. Lecture Notes in Computer Science 1243:376–390. Springer, 1997.
P. Selinger. Orderincompleteness 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 12th International Workshop on Quantum
Physics and Logic,
Proceedings of the 8th International Workshop on Quantum
Physics and Logic,
Proceedings of the 7th International Workshop on Quantum
Physics and Logic,
Proceedings of the 26th International Conference on the
Mathematical Foundations of Programming Semantics,
Proceedings of the 6th International Workshop on Quantum
Physics and Logic,
Proceedings of the 5th International Workshop on Quantum
Physics and Logic (formerly Quantum Programming Languages),
Proceedings of the 4th International Workshop on Quantum
Programming Languages,
Proceedings of the 3rd International Workshop on Quantum
Programming Languages,
Proceedings of the 2nd International Workshop on Quantum
Programming Languages,
Proceedings of Category Theory and Computer Science, 
PRESENTATIONS AT INTERNATIONAL CONFERENCES AND WORKSHOPS:
Invited lecture, 20th International Conference on
Descriptional Complexity of Formal Systems (
Invited lecture, 3rd International Conference on Formal
Structures for Computation and Deduction, (
Invited lecture, Meeting of the Quantum Information Science
Program, Canadian Institute for Advanced Research.
NiagaraontheLake,
A compositional quantum programming language.
Workshop on Compositionality. Simons Institute for
the Theory of Computing, Berkeley, California,
A finite alternation result for reversible boolean circuits.
Workshop on Symmetry, Logic, and Computation. Simons Institute for
the Theory of Computing, Berkeley, California,
A finite alternation result for reversible boolean circuits.
8th International Conference on Reversible Computation (
Introduction to the Quipper language. Invited tutorial, 13th
International Conference on Quantum Physics and Logic (
Numbertheoretic methods in quantum computing. Invited
lecture, 32nd Conference on the Mathematical Foundations of
Programming Semantics
Tutorial on the Quipper language. Workshop on Quantum
Computer Science, Banff International Research Station, Alberta,
Canada,
Numbertheoretic methods for unitary approximation problems.
Invited tutorial, MAP Workshop on Computable Analysis: Foundations,
Implementation and Certification, CIRM, Marseille,
Numbertheoretic methods in quantum computing. Invited
participant, Special Session on Logic, Category Theory and
Computation, 2015 Winter Meeting of the Canadian Mathematical
Society, Montreal,
Using pdfx.sty for producing validating PDF documents, with
Ross Moore. 36th Annual Meeting of the TeX Users Group (
Types for quantum computing. Invited lecture, 21st
International Conference on Types for Proofs and Programs (
Numbertheoretic methods in quantum computing. Invited
lecture, Amsterdam Quantum Logic Workshop. Amsterdam,
Optimal ancillafree Clifford+T approximation of zrotations,
with Neil J. Ross (presenter). Plenary lecture, 18th Conference on
Quantum Information Processing (
Efficient synthesis of quantum circuits by numbertheoretic
methods. Invited lecture, Conference on Knot Theory and its
Applications to Physics and Quantum Computing. Dallas, Texas,
Applying quantitative semantics to higherorder quantum
computing, with Michele Pagani and Benoît Valiron (presenter). 11th
International Workshop on Domain Theory and Applications (Domains
XI). Paris,
Optimal ancillafree Clifford+T approximation of zrotations.
Conference in honour of Prakash Panangaden on the occasion of his
sixtieth birthday. Oxford,
Overview on categories in quantum theory. Dagstuhl
Perspectives Workshop on Categorical Methods at the
Crossroads. Dagstuhl, Germany,
Optimal ancillafree Clifford+T approximation of
zrotations. Invited participant, Aspen Winter Conference
on Advances in Quantum Algorithms and Computation. Aspen, Colorado,
Control categories and duality. Invited participant, CRM
workshop "From categories to logic, linguistics and physics: a
tribute for the 90th birthday of Joachim Lambek". Montreal,
Efficient Clifford+T approximation of unitary
operators. Invited lecture, 10th International Workshop on
Quantum Physics and Logic (
Efficient Clifford+T approximation of singlequbit
operators. 21st Workshop on Foundational Methods in Computer
Science (
Logical methods in quantum information theory. Invited
lecture, 19th Workshop on Logic, Language, Information and
Computation (
Semantics of quantum computation. Invited tutorial, 19th
Workshop on Logic, Language, Information and Computation
(
Logical approaches to higherorder 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 selfdual objects. International
Category Theory Conference (
Autonomous categories in which A is isomorphic to
A
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,
Higherorder 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 (
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 (
Fibonacci objects. 16th Workshop on Foundational Methods in
Computer Science (
Categorical models of quantum computation.
Invited tutorial, 24th Conference on the Mathematical Foundations of
Programming Semantics ( 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 JeanYves 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 (
Categorical models of quantum computation. Invited lecture,
International Category Theory Conference (
Semantics of a quantum programming language. Invited lecture,
22nd Conference on the Mathematical Foundations of Programming
Semantics (
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 (
Programming languages for quantum computing. Invited lecture,
ACM Symposium on Principles of Programming Languages (
Towards a quantum programming language. Invited participant,
Workshop on Quantum Computation and Information Theory, Banff
International Research Station,
Towards a semantics for higherorder quantum computation. 2nd
International Workshop on Quantum Programming Languages (
Towards a semantics for higherorder quantum computation.
Foundational Methods in Computer Science ( On the semantics of higherorder quantum computation. Invited participant, Workshop on Logical and Semantical Methods in Quantum Computation, Bellairs Research Institute, Barbados, April 16, 2004. Towards a model of higherorder 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
(
Towards a quantum programming language. Invited lecture, 9th
International Conference on Category Theory in Computer Science ( Towards a quantum programming language. Invited participant, Logic and Interaction Weeks, Marseille, Feb. 18–22, 2002.
Models for an adversarycentric 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 (
Categorical models of communication.
Invited lecture, Foundational Methods in Computer Science (
A domaintheoretic 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,
Firstorder axioms for asynchrony. Eighth International
Conference on Concurrency Theory (CONCUR 1997). Warsaw,
Orderincompleteness 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:
Editorial board member. Logical Methods in Computer
Science, September 2007 – present.
Program committee member. 46th ACM SIGPLAN Symposium on
Principles of Programming Languages (
Coorganizer. Dagstuhl Seminar on Quantum Programming
Languages. Dagstuhl, Germany,
Program committee member. 10th Conference on Reversible
Computation (
Local organizer. 34th Conference on the Mathematical
Foundations of Programming Semantics (
Program committee cochair and local organizer. 15th
International Conference on Quantum Physics and Logic (
Program committee member. 33rd Annual ACM/IEEE Symposium on
Logic in Computer Science (
Program committee member. 9th Conference on Reversible
Computation (
Program committee member. 14th International Conference on
Quantum Physics and Logic (
Program committee member. 7th Conference on Algebra and
Coalgebra in Computer Science (
Lecturer. Summer School on Foundations of Programming and
Software systems, Minho, Portugal. Tutorial lecture on quantum
programming. Coorganizer. AIM Workshop on Arithmetic Golden Gates. American Institute of Mathematics, San Jose, California, 2017. Guest editor. Information and Computation, special issue on Quantum Physics and Logic, 2016.
Program committee member. Conference on Theory of Quantum
Computation, Communication and Cryptography (
Program committee member. 25th Annual Conference on Computer
Science Logic (
Program committee member. 8th Conference on Reversible
Computation (
Program committee member. 1st International Conference on
Formal Structures for Computation and Deduction (
Program committee member. 13th International Conference on
Quantum Physics and Logic (
Coorganizer. Workshop on Quantum Computer Science. Banff
International Research Station, Alberta, Canada,
Program committee cochair. 12th International Workshop on
Quantum Physics and Logic (
Program committee member. 26th International Conference on
Rewriting Techniques and Applications (
Program committee member. 30th Annual ACM/IEEE Symposium on
Logic in Computer Science (
Coorganizer. Workshop on Quantum Programming and Circuits,
Waterloo, Canada,
Lecturer. CAP Spring School on Quantum Structures in Physics
and Computer Science. 3 lectures on numbertheoretic methods in
quantum information theory, Oxford,
Program committee member. 11th International Workshop on
Quantum Physics and Logic (
Local organizer. Eastern Sectional Meeting of the American
Mathematical Society, Halifax,
Program committee member. 25th International Conference on
Concurrency Theory (
Program committee member. Joint 25th International Conference
on Rewriting Techniques and Applications and 12th Typed Lambda
Calculi and Applications (
Program committee member. 17th International Conference on
Foundations of Software Science and Computation Structures (
Program committee member. Workshop on Functional Programming
Concepts in DomainSpecific Languages (FPCDSL), Boston,
Program committee member. 22nd Annual Conference on Computer
Science Logic (
Program committee member. 20th Workshop on Logic, Language,
Information and Computation (
Lecturer. Summer School on Topology, Algebra and Categories
in Logic. 4 lectures on categorical logic, Nashville, Tennessee,
Program committee member. 10th International Workshop on
Quantum Physics and Logic (
Program committee member. 40th International Colloquium on
Automata, Languages and Programming, Track B (
Program committee member. 24th International Conference on
Rewriting Techniques and Applications (
Program committee member. 9th International Workshop on
Quantum Physics and Logic (
Coorganizer. 20th Workshop on Foundational Methods in
Computer Science Guest editor. Foundations of Physics 42(7), special issue on Quantum Physics and Logic, 2012.
Coorganizer. Logic and Interaction Weeks 2012, Centre
International de Rencontres Mathématiques (CIRM), Marseille,
Program committee cochair. 8th International Workshop on
Quantum Physics and Logic (
Visiting researcher. IML Institute for Mathematics at Luminy.
4 lectures on logical approaches to quantum information theory,
University of AixMarseille,
Guest lecturer. University of Paris 13. 4 lectures on quantum
programming languages and logical approaches to quantum information
theory, Paris,
Editorial board member. Mathematical Structures in
Computer Science,
Coorganizer. Category Theory "Octoberfest" Workshop,
Dalhousie University,
Coorganizer. 7th International Workshop on Quantum Physics
and Logic ( Lecturer. QICS School on Foundational Structures in Quantum Computation and Information. Lecture on higher types in quantum computing. Oxford, May 24–28, 2010.
Program committee chair. 26th International Conference on the
Mathematical Foundations of Programming Semantics (
Program committee member. North American Annual Meeting of
the Association for Symbolic Logic, Washington,
Program committee member. 5th Workshop on Developments in
Computational Models (
Organizing committee member. 17th Workshop on Foundational
Methods in Computer Science (
Coorganizer. 6th International Workshop on Quantum Physics
and Logic (
Program committee member. 25th International Conference on
the Mathematical Foundations of Programming Semantics (
Coorganizer. 16th Workshop on Foundational Methods in
Computer Science
Program committee member. 15th International Workshop on
Expressiveness in Concurrency (EXPRESS 2008), Toronto,
Program committee member. 22nd Annual IEEE Symposium on Logic
in Computer Science (
Program committee member. International Conference on Typed
Lambda Calculi and Applications (
Organizer. 4th International Workshop on Quantum Programming
Languages (
Program committee member. 33rd International Colloquium on
Automata, Languages and Programming, Track B (
Coorganizer. International Category Theory Conference (
Program committee member. 8th International Symposium on
Functional and Logic Programming (
Organizer. 3rd International Workshop on Quantum Programming
Languages (
Program committee member. 20th Annual IEEE Symposium on Logic
in Computer Science (
Program committee member. 8th International Conference on
Foundations of Software Science and Computation Structures ( 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 (
Lecturer. Workshop on Quantum Computing. 4 tutorial lectures
on logic and quantum computation. Institute for Studies in
Theoretical Physics and Mathematics (IPM), Tehran, Iran,
Organizer. 2nd International Workshop on Quantum Programming
Languages (
Program committee member. Workshop on Categorical Methods for
Concurrency, Interaction, and Mobility (
Organizer. First International Workshop on Quantum
Programming Languages (
Coorganizer and lecturer. Fields Summer School on Logic and
Foundations of Computation. Lectures on lambda calculus and classical
logic. Ottawa,
Program committee member. Workshop on Security of
Communication on the Internet (
Lecturer. Graduate Student Preconference to 
TEACHING EXPERIENCE:
Dalhousie University, 2005–
