- Simplicial cycles and the computation of simplicial trees
- QPL 2005 Preliminary Version Dagger compact closed categories and
- QPL 2005 Preliminary Version Pauli measurements are universal
- Electronic Notes in Theoretical Computer Science 20 (1999) URL: http://www.elsevier.nl/locate/entcs/volume20.html 23 pages
- A linear-non-linear model for a computational call-by-value lambda calculus
- QPL 2006 Preliminary Version On a fully abstract model for a quantum
- Under consideration for publication in Math. Struct. in Comp. Science A lambda calculus for quantum computation with
- Proc. QPL 2004, pp. 2138 Operational semantics for
- Under consideration for publication in J. Functional Programming 1 The Lambda Calculus is Algebraic
- OrderIncompleteness and Finite Lambda Reduction Models Peter Selinger
- A Note on Bainbridge's Power Set Construction Peter Selinger #
- QPL 2005 Preliminary Version A process algebra for reasoning about quantum
- Preliminary Mathematics
- A survey of graphical languages for monoidal Peter Selinger
- Quantum Lambda Calculus Peter Selinger
- LH has nonempty products Peter Selinger
- Proc. QPL 2004, pp. 145162 Toward a software architecture for quantum
- Proceedings of the 3rd International Workshop on
- Math. Struct. in Comp. Science (2001), vol. 11, pp. 207--260. Printed in the United Kingdom # 2001 Cambridge University Press
- computation Mathematics
- Universelle Bereiche Peter Selinger
- linearnonlinear computational
- A lambda calculus for quantum computation with classical control
- Towards a semantics for higherorder quantum computation #
- Categorical Mathematics,
- FUNCTIONALITY, POLYMORPHISM,
- QPL/DCM 2008 Finite dimensional Hilbert spaces are
- consideration publication
- From Continuation Passing Style to Krivine's Abstract Machine
- categories Peter University Abstract
- A lambda calculus for quantum computation with classical control
- Proc. QPL 2004, pp. 91107 Communicating quantum processes
- University, Polytechnique,
- consideration publication
- QPL 2005 Preliminary Version Simulating and compiling code for the
- Autonomous categories in which A = A (extended abstract)
- Quantum Lambda Calculus Peter Selinger
- A survey of graphical languages for monoidal Peter Selinger
- QPL/DCM 2008 Finite dimensional Hilbert spaces are
- QPL/DCM 2008 Finite dimensional Hilbert spaces are
- Simplicial Tree Computations Extended Abstract
- Under consideration for publication in Math. Struct. in Comp. Science A lambda calculus for quantum computation with
- QPL 2005 Preliminary Version Dagger compact closed categories and
- Towards a semantics for higher-order quantum computation
- Towards a semantics for higher-order quantum computation
- From Continuation Passing Style to Krivine's Abstract Machine
- Under consideration for publication in J. Functional Programming 1 The Lambda Calculus is Algebraic
- Lecture Notes on the Lambda Calculus Peter Selinger
- Workshop on Logical Aspects of Cryptographics 2001 Preliminary Version Models for an Adversary-Centric Protocol
- A Note on Bainbridge's Power Set Construction Peter Selinger
- An Implementation of the Call-By-Name Peter Selinger
- 2010 Category Theory Octoberfest Dalhousie University, Halifax, Canada
- Proceedings of the 4th International Workshop on
- QPL 2006 Preliminary Version A quantum game semantics for the
- QPL 2006 Preliminary Version Quantum arrows in Haskell
- QPL 2005 Preliminary Version An algebra of pure quantum programming
- QPL 2005 Preliminary Version Quantum programming with mixed states
- Proc. QPL 2004, pp. 3956 The logic of quantum programs
- Proc. QPL 2004, pp. 5773 Quantum information-flow,
- Proc. QPL 2004, pp. 7590 Quantum weakest preconditions
- Proc. QPL 2004, pp. 109126 A process algebraic approach to concurrent and
- Proc. QPL 2004, pp. 127143 Towards a semantics for
- Proc. QPL 2004, pp. 163178 Quantum typing
- MATH/CSCI 4116/5116: CRYPTOGRAPHY, FALL 2006 Midterm Answers, October 18, 2006
- 14(4):527586, Programming
- The final version of this paper appeared in Math. Struct. in Comp. Science 14(4):527586, 2004 Towards a Quantum Programming Language
- First-Order Axioms for Asynchrony Peter Selinger
- QPL 2006 Preliminary Version From reversible to irreversible computations
- Math. Struct. in Comp. Science (2001), vol. 11, pp. 207260. Printed in the United Kingdom c 2001 Cambridge University Press
- caboara@dm.unipi.it. University,
- Preliminary Idempotents
- FUNCTIONALITY, POLYMORPHISM, AND CONCURRENCY: A MATHEMATICAL INVESTIGATION OF PROGRAMMING PARADIGMS
- QPL/DCM 2008 Finite dimensional Hilbert spaces are
- Friedman's ATranslation Peter Selinger
- Theory and Implementation of a Functional Programming Language
- Theoretical http://www.elsevier.nl/locate/entcs/volume20.html
- QPL 2006 Preliminary Version POVMs and Naimark's theorem without sums
- QPL 2005 Preliminary Version Distributed measurement-based quantum
- QPL 2006 Preliminary Version Quantum data and control made easier
- FUNCTIONALITY, POLYMORPHISM, AND CONCURRENCY: A MATHEMATICAL INVESTIGATION OF PROGRAMMING PARADIGMS
- Tree Checking for Sparse Complexes Massimo Caboara 1 , Sara Faridi 2,# , and Peter Selinger 3,#
- First-Order Axioms for Asynchrony Peter Selinger
- Tree Checking for Sparse Complexes Massimo Caboara1
- Theory and Implementation of a Functional Programming Language
- QPL 2005 Preliminary Version Quantum patterns and types for entanglement
- Mathematics Statistics,
- Computations implications
- Towards a semantics for higherorder quantum computation #
- Order-Incompleteness and Finite Lambda Reduction Models Peter Selinger
- Order-Incompleteness and Finite Lambda Models Extended Abstract
- QPL 2006 Preliminary Version Idempotents in dagger categories
- dimensional Mathematics
- QPL 2006 Preliminary Version On a fully abstract model for a quantum
- Invited lecture On the structure of quantum algorithms and the role of classical mathematics
- QPL 2005 Preliminary Version Quantum programs with
- Some Remarks on Control Categories Peter Selinger
- Proc. QPL 2004, pp. 179195 Non-deterministic quantum programming
- QPL 2006 Preliminary Version Towards a quantum calculus
- Proc. QPL 2004, p. 1 Invited lecture
- Fields Institute Summer School, Logic and Foundations of Computation, Ottawa, June 2-20, 2003 Week 1+2 Participants
- A Brief Survey Of Quantum Programming Languages
- QPL 2005 Preliminary Version Dagger compact closed categories and
- polynomial. corresponding
- Instructions (please read before sending the attached form) The rooms in the dormitories are arranged in two-bedroom suites, sharing a kitchenette and a
- FUNCTIONALITY, POLYMORPHISM, AND CONCURRENCY: A MATHEMATICAL INVESTIGATION OF PROGRAMMING PARADIGMS
- Towards a semantics for higher-order quantum computation*
- From Continuation Passing Style to Krivine's Abstract Machine
- Electronic Notes in Theoretical Computer Science 20 (1999) URL: http://www.elsevier.nl/locate/entcs/volume20.html 23 pages
- Some Remarks on Control Categories Peter Selinger
- QPL 2006 Preliminary Version Idempotents in dagger categories
- University Abstract categories)
- Fitchstyle natural deduction macros Peter Selinger
- Mathematics University,
- Cryptographics Preliminary
- Continuation Mathematics
- An Introduction to Finitesimal Topology \Lambda
- A linearnonlinear model for a computational callbyvalue lambda calculus
- Lecture Notes on the Lambda Calculus Peter Selinger
- QPL 2006 Preliminary Version Semantic abstraction and quantum
- This volume contains the proceedings of the 2nd International Workshop on Quantum Pro-gramming Languages (QPL'04), which will be held July 1213, 2004 in Turku, Finland.
- computation characterization
- Implementation Programming
- Workshop on Logical Aspects of Cryptographics 2001 Preliminary Version Models for an Adversary-Centric Protocol
- Preliminary University,
- OrderIncompleteness and Finite Lambda Models Extended Abstract
- FirstOrder Axioms for Asynchrony Peter Selinger \Lambda
- higherorder computation
- FirstOrder Axioms for Asynchrony Peter Selinger \Lambda
- Autonomous categories in which A # = A # (extended abstract)
- Under consideration for publication in J. Functional Programming 1 The Lambda Calculus is Algebraic
- A Brief Survey Of Quantum Programming Languages
- LH has nonempty products Peter Selinger
- QPL 2006 Preliminary Version Idempotents in dagger categories
- QPL 2006 Preliminary Version On a fully abstract model for a quantum
- Order-Incompleteness and Finite Lambda Models Extended Abstract
- QPL 2005 Preliminary Version Dagger compact closed categories and
- First-Order Axioms for Asynchrony Peter Selinger*
- First-Order Axioms for Asynchrony Peter Selinger*
- To appear in Theoretical Computer Science. Order-Incompleteness and Finite Lambda Reduction Models
- Workshop on Logical Aspects of Cryptographics 2001 Preliminary Version Models for an Adversary-Centric Protocol
- Fitch-style natural deduction macros Peter Selinger
- Simplicial Tree Computations Extended Abstract
- Proc. QPL 2004, pp. 320 A categorical quantum logic
- QPL 2006 Preliminary Version Axiomatic description of mixed states
- QPL 2005 Preliminary Version De-linearizing linearity: projective quantum
- The final version of this paper appeared in Math. Struct. in Comp. Science 14(4):527-586, 2004 Towards a Quantum Programming Language
- Some Remarks on Control Categories Peter Selinger
- dimensional Mathematics
- A Brief Survey Of Quantum Programming Languages
- An Implementation of the CallByName Calculus Peter Selinger \Lambda
- Electronic Notes in Theoretical Computer Science 20 (1999) URL: http://www.elsevier.nl/locate/entcs/volume20.html 23 pages
- higherorder computation
- Under consideration for publication in Math. Struct. in Comp. Science A lambda calculus for quantum computation with
- The final version of this paper appeared in Math. Struct. in Comp. Science 14(4* *):527-586, 2004
- An Introduction to Finitesimal Topology*
- A lambda calculus for quantum computation with classical control
- An Implementation of the Call-By-Name ~~ -Calculus Peter Selinger*
- A Note on Bainbridge's Power Set Construction Peter Selinger*
- Towards a semantics for higher-order quantum computation*
- A linear-non-linear model for a computational call-by-value lambda calculus
- Friedman's A-Translation Peter Selinger
- Lecture Notes on the Lambda Calculus Peter Selinger
- Theory and Implementation of a Functional Programming Language
- arXiv:1107.3608v1[math.CT]19Jul2011 Partially traced categories
- arXiv:1107.3608v1 Partially traced categories
- MATH/CSCI 4116: CRYPTOGRAPHY, WINTER 2012 Handout 2: The Miller-Rabin Primality Test
- Permit Parking Metered Parking
- MATH/CSCI 4116: CRYPTOGRAPHY, WINTER 2012 Handout 4: Contingency plans in case of a strike
