| 2008 |
|---|
| 24 | EE | Peter Selinger,
Benoît Valiron:
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract).
FoSSaCS 2008: 81-96 |
| 23 | EE | Peter Selinger,
Benoît Valiron:
A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract)
CoRR abs/0801.0813: (2008) |
| 22 | EE | Peter Selinger:
Lecture notes on the lambda calculus
CoRR abs/0804.3434: (2008) |
| 21 | EE | Peter Selinger:
Preface.
Electr. Notes Theor. Comput. Sci. 210: 1-2 (2008) |
| 20 | EE | Peter Selinger:
Idempotents in Dagger Categories: (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 210: 107-122 (2008) |
| 19 | EE | Peter Selinger,
Benoît Valiron:
On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 210: 123-137 (2008) |
| 2007 |
|---|
| 18 | EE | Peter Selinger:
Preface.
Electr. Notes Theor. Comput. Sci. 170: 1 (2007) |
| 17 | EE | Peter Selinger:
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract).
Electr. Notes Theor. Comput. Sci. 170: 139-163 (2007) |
| 16 | EE | Massimo Caboara,
Sara Faridi,
Peter Selinger:
Simplicial cycles and the computation of simplicial trees.
J. Symb. Comput. 42(1-2): 74-88 (2007) |
| 2006 |
|---|
| 15 | EE | Massimo Caboara,
Sara Faridi,
Peter Selinger:
Tree Checking for Sparse Complexes.
ICMS 2006: 110-121 |
| 14 | EE | Peter Selinger:
Special issue on quantum programming languages.
Mathematical Structures in Computer Science 16(3): 373-374 (2006) |
| 13 | EE | Peter Selinger,
Benoît Valiron:
A lambda calculus for quantum computation with classical control.
Mathematical Structures in Computer Science 16(3): 527-552 (2006) |
| 2005 |
|---|
| 12 | EE | Peter Selinger,
Benoît Valiron:
A Lambda Calculus for Quantum Computation with Classical Control.
TLCA 2005: 354-368 |
| 2004 |
|---|
| 11 | EE | Peter Selinger:
A Brief Survey of Quantum Programming Languages.
FLOPS 2004: 1-6 |
| 10 | EE | Peter Selinger:
Towards a quantum programming language.
Mathematical Structures in Computer Science 14(4): 527-586 (2004) |
| 2003 |
|---|
| 9 | EE | Peter Selinger:
Order-incompleteness and finite lambda reduction models.
Theor. Comput. Sci. 309(1-3): 43-63 (2003) |
| 2002 |
|---|
| 8 | EE | Richard Blute,
Peter Selinger:
Preface.
Electr. Notes Theor. Comput. Sci. 69: (2002) |
| 7 | EE | Peter Selinger:
The lambda calculus is algebraic.
J. Funct. Program. 12(6): 549-566 (2002) |
| 2001 |
|---|
| 6 | EE | Peter Selinger:
Categorical Semantics of Control.
TLCA 2001: 6-7 |
| 5 | EE | Peter Selinger:
Models for an adversary-centric protocol logic.
Electr. Notes Theor. Comput. Sci. 55(1): (2001) |
| 4 | | Peter Selinger:
Control categories and duality: on the categorical semantics of the lambda-mu calculus.
Mathematical Structures in Computer Science 11(2): 207-260 (2001) |
| 1999 |
|---|
| 3 | EE | Peter Selinger:
Categorical Structure of Asynchrony.
Electr. Notes Theor. Comput. Sci. 20: (1999) |
| 1997 |
|---|
| 2 | | Peter Selinger:
First-Order Axioms for Asynchrony.
CONCUR 1997: 376-390 |
| 1996 |
|---|
| 1 | | Peter Selinger:
Order-Incompleteness and Finite Lambda Models (Extended Abstract).
LICS 1996: 432-439 |
