Pablo Arrighi and Alejandro Díaz-Caro - A System F Accounting For Scalars

A System F accounting for scalars
arXiv:0903.3741
Pablo Arrighi and Alejandro Daz-Caro

Universit de Grenoble Laboratoire d'Informatique de Grenoble
November 19th, 2009. PPS (Paris)
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system
Conclusions and future work
Global context
Oddity of Quantum theory
ad hoc
Quantum Logic?
(developed
before quantum computing, no clear relation with
quantum programs).
Birkho, G. and J. von Neumann, The logic of quantum mechanics, Annals of Mathematics 37 (1936), pp. 823843.
1
Pablo Arrighi and Alejandro Daz-Caro, LIG A System F accounting for scalars, arXiv:0903.3741 2/31
Motivation
Linear-Algebraic
-Calculus
System F
Global context
ad hoc
Quantum Logic?
(developed
quantum programs). Models of Linear Logics
Quantum Theory? (Coherent
spaces, Micromechanics loses duplicability.)
1
Motivation
Linear-Algebraic
-Calculus
System F
Global context
ad hoc
Quantum Logic?
(developed
spaces, Micromechanics loses duplicability.) Curry-Howard : (programs,types)=(proofs,logics). Quantum Computation : (quantum programs, quantum types). CH+QC : (quantum th. proofs, quantum th. logics)? Quantum logics : isolating the reasoning behind quantum algorithms?
1
Motivation
Linear-Algebraic
-Calculus
System F
Global context
ad hoc
Quantum Logic?
(developed
spaces, Micromechanics loses duplicability.) Curry-Howard : (programs,types)=(proofs,logics). Quantum Computation : (quantum programs, quantum types). CH+QC : (quantum th. proofs, quantum th. logics)? Quantum logics : isolating the reasoning behind quantum algorithms?
What are quantum types?

1
Motivation
Linear-Algebraic
-Calculus
System F
Quantum theory
States are (normalized) vectors Vector space of o.n.b.
(bi ).
v.
Then
v=
i i bi .
Pablo Arrighi and Alejandro Daz-Caro, LIG
A System F accounting for scalars, arXiv:0903.3741
3/31
Motivation
Linear-Algebraic
-Calculus
System F
Quantum theory
(bi ).
v.
Then
v=
i i bi .
v = U v.
Evolutions are (unitary) linear operators U .
3/31
Motivation
Linear-Algebraic
-Calculus
System F
Quantum theory
(bi ).
v.
Then
v=
i i bi .
v = U v.
Systems are put next to one another with Bilinear just like application :
u + v w = u w + v w, u v + w = u v + u w, . . .
3/31
Motivation
Linear-Algebraic
-Calculus
System F
Quantum theory
(bi ).
v.
Then
v=
i i bi .
v = U v.
Systems are put next to one another with Bilinear just like application :
u + v w = u w + v w, u v + w = u v + u w, . . . No-cloning theorem!
3/31
Motivation
Linear-Algebraic
-Calculus
System F
No-cloning theorem
Statement: Proof: Vector space of o.n.b.
U
: U
v = v v.
so
(bi ),
v=
bi = bi bi
U
i bi .
We can have (=copying, OK)
But then
v =
i bi = i U bi i i = i bi bi = i j bi bj i ij = ( i bi ) ( j bj ) i j = vv
U
(=cloning, Not OK)
4/31
Motivation
Linear-Algebraic
-Calculus
System F
No-cloning theorem
Statement: Proof: Vector space of o.n.b.
U
: U
v = v v.
so
(bi ),
v=
bi = bi bi
U
i bi .
We can have (=copying, OK)
But then
v =
i bi = i U bi i i = i bi bi = i j bi bj i ij = ( i bi ) ( j bj ) i j = vv
U
(=cloning, Not OK)
Conicts with -reduction?

Motivation
Linear-Algebraic
-Calculus
System F
Linear-Algebraic The language
-Calculus2
Higher-order computation t ::= x | x .t | (t t) |
Arrighi, P. and G. Dowek. Linear-algebraic -calculus: higher-order, encodings and conuence. Lecture Notes in Computer Science (RTA'08), 5117
2
(2008), pp. 1731.

5/31
Motivation
Linear-Algebraic
-Calculus
System F
-Calculus2
Linear algebra t + t | .t | 0
2
(2008), pp. 1731.

5/31
Motivation
Linear-Algebraic
-Calculus
System F
-Calculus2

x .t b t[b/x ] ()
(*)
b an abstraction or a
variable.
2
(2008), pp. 1731.

5/31
Motivation
Linear-Algebraic
-Calculus
System F
-Calculus2
Elementary rules such as

x .t b t[b/x ] ()
(*)
b an abstraction or a
variable.
u + 0 u and .(u + v) .u + .v.

.u + .u ( + ).u.
u closed normal. (***) u and u + v closed normal.

(**)
Factorisation rules such as (**)
Application rules such as (***)
u (v + w) (u v) + (u w).
2
(2008), pp. 1731.

5/31
Motivation
Linear-Algebraic
-Calculus
System F
Linear-Algebraic -Calculus Why the restrictions : Copying vs Cloning
Untyped
-calculus
+ linear algebra
Cloning?
6/31
Motivation
Linear-Algebraic
-Calculus
System F
Untyped
-calculus
+ linear algebra
Cloning?
x .(x x )
i
( i bi ) (
i bi
i bi bi
i bi )
6/31
Motivation
Linear-Algebraic
-Calculus
System F
Untyped
-calculus
+ linear algebra
Cloning?
x .(x x )
i
( i bi ) (
i bi
i bi bi
i bi )
No-cloning says bottom reduction forbidden. We must delay beta reduction till after linearity. So restrict beta reduction to
vectors i.e.
base
abstractions or variables.
6/31
Motivation
Linear-Algebraic
-Calculus
System F
Linear-Algebraic -Calculus Why the restrictions : Innities

Untyped
-calculus
+ linear algebra
7/31
Motivation
Linear-Algebraic
-Calculus
System F

Untyped
-calculus
+ linear algebra
Yb x .(b + (x x )) x .(b + (x x )) Yb b + Yb
7/31
Motivation
Linear-Algebraic
-Calculus
System F

Untyped
-calculus
+ linear algebra
But whoever says innity says trouble says. . .
7/31
Motivation
Linear-Algebraic
-Calculus
System F

Untyped
-calculus
+ linear algebra
But whoever says innity says trouble says. . . indenite forms.
7/31
Motivation
Linear-Algebraic
-Calculus
System F

Untyped
-calculus
+ linear algebra
Yb Yb b + Yb Yb b
7/31
Motivation
Linear-Algebraic
-Calculus
System F

Untyped
-calculus
+ linear algebra
Yb Yb b + Yb Yb b
0
High school teacher says we must restrict factorization rules to
nite vectors i.e.

closed-normal forms.
A System F accounting for scalars, arXiv:0903.3741 7/31
Motivation
Linear-Algebraic
-Calculus
System F
System F Straightforward extension of System F (2la )
System F rules plus simple rules to type algebraic terms
0: A
ax0
u: A
v: A
u + v: A
+I
t: A
.t : A
8/31
Motivation
Linear-Algebraic
-Calculus
System F
0: A
ax0
u: A
v: A
u + v: A
+I
t: A
.t : A
Theorem (Strong normalization)
t: T
is strongly normalising.
8/31
Motivation
Linear-Algebraic
-Calculus
System F
0: A
ax0
u: A
v: A
u + v: A
+I
t: A
.t : A
Theorem (Strong normalization)
t: T
Proof.
Sketch: We extend the notion of saturated sets.
8/31
Motivation
Linear-Algebraic
-Calculus
System F
System F Strong normalization of 2la

SN :
Set of strongly normalising terms
9/31
Motivation
Linear-Algebraic
-Calculus
System F

SN :
A subset X
1 2 3 4
n 0, (((x t1 ) . . . ) tn ) X where ti SN ; v[b/x ] t X (x v) b t X ; t, u X t + u X ; , t X .t X ; i I , ((ui w1 ) . . . wn ) X

i
SN
is saturated if
w1 . . . w X ;
n
i I , (u wi ) X u
i
7 8 9 10
.((t1 t2 ) . . . tn ) X ((t1 t2 ) . . . .tk ) . . . tn X (1 k n); 0 X; t SN , (0 t ) X ; SN , (t 0) X . t, u u

X
X;
stable by construction and anti-reduction
9/31
Motivation
Linear-Algebraic
-Calculus
System F

SN :
A subset X
1 2 3 4
n 0, (((x t1 ) . . . ) tn ) X where ti SN ; v[b/x ] t X (x v) b t X ; t, u X t + u X ; , t X .t X ; i I , ((ui w1 ) . . . wn ) X

i
SN
is saturated if
w1 . . . w X ;
n
i I , (u wi ) X u
i
7 8 9 10
.((t1 t2 ) . . . tn ) X ((t1 t2 ) . . . .tk ) . . . tn X (1 k n); 0 X; t SN , (0 t ) X ; SN , (t 0) X . t, u u

X
X;
stable by construction and anti-reduction
SAT
is the set of all saturated sets

Motivation
Linear-Algebraic
-Calculus
System F
System F Strong normalization of 2la (II)
Rening the sketch: The idea is that types correspond to saturated sets.
10/31
Motivation
Linear-Algebraic
-Calculus
System F
System F Strong normalization of 2la (II)
Rening the sketch: The idea is that types correspond to saturated sets. This correspondance is achived by a maping from types to
SAT .
10/31
Motivation
Linear-Algebraic
-Calculus
System F
System F Strong normalization of 2la (III)
Lemma
1
SN
SAT , SAT A B SAT ,
A B
For all collection A
of members of SAT ,
i Ai SAT ,
11/31
Motivation
Linear-Algebraic
-Calculus
System F
Lemma
1
SN
SAT , SAT A B SAT ,
A B
of members of SAT ,
i Ai SAT ,
Denition (Mapping)
[[X ]] = (X ) [[X .T ]] =
(where
() : TVar SAT )
[[A B ]] = [[A]] [[B ]]
Y SAT [[T ]](X :=Y )
11/31
Motivation
Linear-Algebraic
-Calculus
System F
Lemma
1
SN
SAT , SAT A B SAT ,
A B
of members of SAT ,
i Ai SAT ,
Denition (Mapping)
[[X ]] = (X ) [[X .T ]] =
(where
() : TVar SAT )
[[A B ]] = [[A]] [[B ]]
Y SAT [[T ]](X :=Y )
Lemma
Given a valuation
, [[T ]] SAT
Motivation
Linear-Algebraic
-Calculus
System F
System F Strong normalization of 2la (IV)
Denition ( )
For
= x1 : A1 , . . . , xn : An ,
x1
t: T
means that
[[A1 ]] , . . . xn [[An ]] t [[T ]]
12/31
Motivation
Linear-Algebraic
-Calculus
System F
System F Strong normalization of 2la (IV)
Denition ( )
For
= x1 : A1 , . . . , xn : An ,
x1
t: T
means that
[[A1 ]] , . . . xn [[An ]] t [[T ]]
Rening the sketch: Prove that
t: T t: T
We prove this by induction on the derivation of the denition of hypothesis)
t: T
(In fact
is slightly dierent to strengthen the induction
12/31
Motivation
Linear-Algebraic
-Calculus
System F
System F Strong normalization of 2la (V)
Then, the proof of the strong normalisation theorem is: Let
t: T
13/31
Motivation
Linear-Algebraic
-Calculus
System F
Then, the proof of the strong normalisation theorem is: Let t: T t: T
13/31
Motivation
Linear-Algebraic
-Calculus
System F
Then, the proof of the strong normalisation theorem is: Let t: T t: T If (xi : Ai ) , xi [[Ai ]]
then
t [[T ]]
13/31
Motivation
Linear-Algebraic
-Calculus
System F
Then, the proof of the strong normalisation theorem is: Let t: T t: T If (xi : Ai ) , xi [[Ai ]] Note that
x
then
t [[T ]]
i [[Ai ]]
because
[[Ai ]]
is saturated,
13/31
Motivation
Linear-Algebraic
-Calculus
System F
Then, the proof of the strong normalisation theorem is: Let t: T t: T If (xi : Ai ) , xi [[Ai ]] Note that
x
then
t [[T ]]
i [[Ai ]]
because
then
t is strong normalising because [[T ]] SN
[[Ai ]]
is saturated,
13/31
Motivation
Linear-Algebraic
-Calculus
System F
System F Linear-Algebraic -Calculus with 2la

x .t b t[b/x ] ()
(*)
b an abstraction or a variable.
u + 0 u and .(u + v) .u + .v.
Factorisation rules such as
.u + .u ( + ).u.
Application rules such as
u (v + w) (u v) + (u w).
14/31
Motivation
Linear-Algebraic
-Calculus
System F

x .t b t[b/x ] ()
(*)
Every typable term is strong normalizing
u + 0 u and .(u + v) .u + .v.
.u + .u ( + ).u.
u (v + w) (u v) + (u w).
14/31
Motivation
Linear-Algebraic
-Calculus
System F

x .t b t[b/x ] ()
(*)
b an abstraction or a variable. Yb is no typable!
Every typable term is strong normalizing Hence
u + 0 u and .(u + v) .u + .v.
.u + .u ( + ).u.
u (v + w) (u v) + (u w).
14/31
Motivation
Linear-Algebraic
-Calculus
System F

x .t b t[b/x ] ()
(*)
Every typable term is strong
u + 0 u and .(u + v) .u + .v.
Yb is no typable! t t 0 always, so it is not necesary to reduce t rst. we can

Hence remove the closed-normal restrictions!
normalizing
.u + .u ( + ).u.
u (v + w) (u v) + (u w).
14/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Grammar
Types grammar:
T = U | X .T | .T | 0, U = X | U T | X .U
where
and
(S, +, )
is a conmutative ring.
15/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Type inference rules
ax U
[ ]
, x : U
:U , x : U
u: U T
(u v) : T
v: U
t: T
x t : U T I [X ] with
I [U ]
u : X .T u : T [U /X ]
E [X := U ]
u: T u : X .T
FV () /
16/31
Motivation
Linear-Algebraic
-Calculus
System F
ax U
[ ]
, x : U
:U , x : U
u: U T
(u v) : T
v: U
t: T
I [U ]
u : X .T u : T [U /X ]
ax0
E [X := U ]
u: T u : X .T
FV () /
u: T
v: T
0: T
u + v: T
+I
u: T
.u : T
16/31
Motivation
Linear-Algebraic
-Calculus
System F
ax U
[ ]
, x : U
:U , x : U
u : .(U T )

v : .U
(u v) : ( ).T E [X := U ]
t: T
I [U ]
u : X .T u : T [U /X ]
ax
u: T u : X .T
FV () /
0: 0
u : .T
v : .T
u + v : ( + ).T
+I
u: T
.u : .T
sI
[]
Where U
and types in contexts are are in
U.
17/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Strong normalisation
()
: map that take types and remove all the scalars on it.
18/31
Motivation
Linear-Algebraic
-Calculus
System F
()
Example:
(U .X ) = U X
18/31
Motivation
Linear-Algebraic
-Calculus
System F
()
Example:
(U .X ) = U X =T
for some T without scalars.
We also dene 0
18/31
Motivation
Linear-Algebraic
-Calculus
System F
()
Example:
(U .X ) = U X =T
We also dene 0
Lemma (Correspondence with 2la )
t: T
2la t : T
18/31
Motivation
Linear-Algebraic
-Calculus
System F
()
Example:
(U .X ) = U X =T
We also dene 0
Lemma (Correspondence with 2la )
t: T
2la t : T
Theorem (Strong normalisation)
t: T
Proof.
By previous lemma
2la
t: T
, then
t is strong
normalising.
18/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Subject reduction
Theorem (Subject Reduction)

Let t
t . Then
:T
:T
19/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Subject reduction
Theorem (Subject Reduction)

Let t
t . Then
:T
:T
using that rule and
Proof.
(sketch)
We proof rule by rule that if
t : T , then t : T .
tt
In general, the method is to take the term into its small parts and recompose to
t.
t, decompose it
19/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Subject reduction proof: example (I)

To show a rule as example, we need some auxiliary lemmas and denitions:
20/31
Motivation
Linear-Algebraic
-Calculus
System F

To show a rule as example, we need some auxiliary lemmas and denitions: Order: Write A
B A
>B
if either
B
X .A or X .C and
C [U /X ] for some
U.
is the reexive and transitive closure of
>.
20/31
Motivation
Linear-Algebraic
-Calculus
System F

To show a rule as example, we need some auxiliary lemmas and denitions: Order: Write A
B A
>B
if either
B
X .A or X .C and
C [U /X ] for some
U.
is the reexive and transitive closure of
>.
Instuition of this denition:

Types in the numerator of
t: A t : X .A
with
FV () /
or
t : X .C t : C [U /X ]
are greater than the types in the denominator.
20/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Subject reduction proof: example (II)

Some lemmas needed:
21/31
Motivation
Linear-Algebraic
-Calculus
System F

Some lemmas needed:
1
and
t: A t: B
21/31
Motivation
Linear-Algebraic
-Calculus
System F

Some lemmas needed:
1 2
B and t : A A B A B
A
t: B
21/31
Motivation
Linear-Algebraic
-Calculus
System F

Some lemmas needed:
1 2 3
B and t : A A B A B
A
t: B
(u v) : .T ,
then
Generation lemma (app): Let
u : .U T v : .U T T =
21/31
Motivation
Linear-Algebraic
-Calculus
System F

Some lemmas needed:
1 2 3
B and t : A A B A B
A
t: B
(u v) : .T ,
then
Generation lemma (app): Let
u : .U T v : .U T T =
4
Generation lemma (sum): Let
u + v : .T , u : .T v : .T =+
then
21/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Subject reduction proof: example (III)
Example: Rule
( u + v) w ( u w ) + ( v w ) .
22/31
Motivation
Linear-Algebraic
-Calculus
System F
Example: Rule Let
( u + v) w ( u w ) + ( v w ) .
(u + v) w : T .
22/31
Motivation
Linear-Algebraic
-Calculus
System F
Example: Rule Let
( u + v) w ( u w ) + ( v w ) .
(u + v) w : T .
Using the previous lemmas we can prove that
u : ( ).U T v : ((1 ) ).U T w : .U

T
and
where
= 1,
is some scalar.
22/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Subject reduction proof: example (IV)
Then
u : ( ).U T
w : .U
(u w) : ( ).T .T
23/31
Motivation
Linear-Algebraic
-Calculus
System F
Then
u : ( ).U T
w : .U
(u w) : ( ).T .T
Also,
v : ((1 ) ).(U T )
w : .U
(v w) : ((1 ) ).T (1 ).T
23/31
Motivation
Linear-Algebraic
-Calculus
System F
Then
u : ( ).U T
w : .U
(u w) : ( ).T .T
Also,

So
v : ((1 ) ).(U T )
w : .U
(v w) : ((1 ) ).T (1 ).T (u w) : .T (v w) : (1 ).T
(u w) + (v w) : T
+I
and
23/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Probabilistic type system: Intuition
Conditional
functions
same type on each branch.
24/31
Motivation
Linear-Algebraic
-Calculus
System F
Conditional
functions
By restricting the scalars to positive reals system.
probabilistic type
24/31
Motivation
Linear-Algebraic
-Calculus
System F
Conditional
functions
By restricting the scalars to positive reals system.
probabilistic type
For example, one can type functions such as

1 x {x [ 1 .(true + false)] [ 4 .true + 3 .false]} : B B 2 4
with the type system serving as a guarantee that the function conserves probabilities summing to one.
24/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Probabilistic type system: Formalisation
We dene the probabilistic type system to be the scalar type system with the following restrictions:
25/31
Motivation
Linear-Algebraic
-Calculus
System F
S = R+ ,
25/31
Motivation
Linear-Algebraic
-Calculus
System F
S = R+ ,
Contexts: Types in contexts are classic types (C ), i.e. types in
exempt of any scalar,
25/31
Motivation
Linear-Algebraic
-Calculus
System F
S = R+ ,
We change the rule
to
t : X .T t : T [C /X ]
with
25/31
Motivation
Linear-Algebraic
-Calculus
System F
S = R+ ,
We change the rule
to
t : X .T t : T [C /X ]
with
The nal conclusion must be classic.
25/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Probabilistic type system: Proof
Denition (Weight function

Let
to check probability distributions)
: R+
be a function dened inductively by:
(0) = 0 (b) = 1 (t1 t2 ) = (t1 ) (t2 )
(t1 + t2 ) = (t1 ) + (t2 ) (.t) = (t)
26/31
Motivation
Linear-Algebraic
-Calculus
System F

Let
: R+
(0) = 0 (b) = 1 (t1 t2 ) = (t1 ) (t2 )
(t1 + t2 ) = (t1 ) + (t2 ) (.t) = (t)
Theorem (Normal terms in probabilistic have weight 1)

C
t: C
(t ) = 1.
Proof.
We prove that
induction over
t .
t : .C (t ) = by structural
26/31
Motivation
Linear-Algebraic
-Calculus
System F

Let
: R+
(0) = 0 (b) = 1 (t1 t2 ) = (t1 ) (t2 )
(t1 + t2 ) = (t1 ) + (t2 ) (.t) = (t)

C
t: C
(t ) = 1.
Proof.
We prove that
induction over
t .
1 2
Example: 2.(x
.x )
26/31
Motivation
Linear-Algebraic
-Calculus
System F

Let
: R+
(0) = 0 (b) = 1 (t1 t2 ) = (t1 ) (t2 )
(t1 + t2 ) = (t1 ) + (t2 ) (.t) = (t)

C
t: C
(t ) = 1.
Proof.
We prove that
induction over
t .
1 2
1 2
Example: 2.(x
.x )
(2.(x
.x ) y ) = 2
Motivation
Linear-Algebraic
-Calculus
System F

Let
: R+
(0) = 0 (b) = 1 (t1 t2 ) = (t1 ) (t2 )
(t1 + t2 ) = (t1 ) + (t2 ) (.t) = (t)

C
t: C
(t ) = 1.
Proof.
We prove that
induction over
t .
1 2
1 2
Example: 2.(x
.x )
y .x ) y ) = 2 (y ) = 1
26/31
(2.(x
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Logical content: No-cloning theorem (I)
Denition (Proof method of depth n)

0 (S ) = S n1 (S ) n (S ) = R PS
where
S
or
k (S ) h
P
or
h ( S )
P
is a sequent, is a constant derivation tree of size n,
n
R P
max{k , h}
= n 1,
is a typing rule, and is a sequent such that the resulting derivation tree is
well-formed.
27/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Logical content: No-cloning theorem (I)
Denition (Proof method of depth n)

0 (S ) = S n1 (S ) n (S ) = R PS
where
S
or
k (S ) h
P
or
h ( S )
P
is a sequent, is a constant derivation tree of size n,
n
R P
max{k , h}
= n 1,
is a typing rule, and is a sequent such that the resulting derivation tree is
well-formed. C
(n (S ))
denote the conclusion (root) of the tree

n (S ).
27/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Logical content: No-cloning theorem (II)
Examples:
S P
1 ( S ) =
28/31
Motivation
Linear-Algebraic
-Calculus
System F
Examples:
S P
1 ( S ) =
1 (
t: T) =
t: T t : X .T
28/31
Motivation
Linear-Algebraic
-Calculus
System F
Examples:
S P
1 ( S ) =
1 (
t: T) =
t: T t : X .T
n 2 n ( v : 2.A u : .A) = u : .A +I u + v : (2 + ).A
(Partial function or pattern matching)
28/31
Motivation
Linear-Algebraic
-Calculus
System F
Examples:
S P
1 ( S ) =
1 (
t: T) =
t: T t : X .T
n 2 n ( v : 2.A u : .A) = u : .A +I u + v : (2 + ).A = PS
means that PS can be derived from S by using S once, with the xed proof method
(Partial function or pattern matching) Basically C (n (S ))
28/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Logical content: No-cloning theorem (III)
Theorem (No-cloning of scalars)
n such that , C (n ( .U )) = ( s + ).V with = 0 and constants in S , s N>1 and U , V constants in U .

Induction over n.
Proof.
29/31
Motivation
Linear-Algebraic
-Calculus
System F

Induction over n.
Proof.
Corollary (No-cloning Theorem)

n
such that
T , C (n (
)) =
T.
where A
is the classical encoding for the type of tuples.
29/31
Motivation
Linear-Algebraic
-Calculus
System F

Induction over n.
Proof.

n
such that
T , C (n (
)) =
T.
where A
Proof.
It is easy to show that
T , T .U
with U
29/31
Motivation
Linear-Algebraic
-Calculus
System F

Induction over n.
Proof.

n
such that
T , C (n (
)) =
T.
where A
Proof.

T
T , T .U
2
with U
T .U .U .(U U ) = (1 2 + 0).(U U ).
29/31
Motivation
Linear-Algebraic
-Calculus
System F

Induction over n.
Proof.

n
such that
T , C (n (
)) =
T.
where A
Proof.

T
T , T .U
2
with U
T .U .U .(U U ) = (1 2 + 0).(U U ).
By the previous theorem, the corollary holds.

Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Summary of contributions
S.N. : Simplied the Linear-algebraic most restrictions. S.R. OK.
-calculus
by lifting
30/31
Motivation
Linear-Algebraic
-Calculus
System F

Scalar
-calculus
by lifting
type system : types keep track of the `amount of a
type' by holding sum of amplitudes of terms of that types.
30/31
Motivation
Linear-Algebraic
-Calculus
System F

Scalar
-calculus
by lifting
type system : types keep track of the `amount of a
type' by holding sum of amplitudes of terms of that types.
probabilistic type system, yielding a higher-order
probabilistic
-calculus.
30/31
Motivation
Linear-Algebraic
-Calculus
System F
The scalar type system Polemics, future work
31/31
Motivation
Linear-Algebraic
-Calculus
System F
Captured no-cloning theorem is a way that is faithful to quantum theory and linear algebra, unlike LL:
one can nd a copying proof method, but there is no for cloning all A. Algebraic linearity is about taking .U to something in + . . . not just for = 1 = + 1.
A proof method
For all
31/31
Motivation
Linear-Algebraic
-Calculus
System F
Captured no-cloning theorem is a way that is faithful to quantum theory and linear algebra, unlike LL:
one can nd a copying proof method, but there is no for cloning all A. Algebraic linearity is about taking .U to something in + . . . not just for = 1 = + 1.
A proof method
For all
C.-H.+Q.C.=(quantum th. proofs, quantum th. logics)? Need a Vectorial type system:
Scalar type system magnitude and signs for type vectors. Future system direction, (i.e. addition and orthogonality of types). Then it would be possible to check norm on amplitudes rather than probabilities.
31/31

Pablo Arrighi and Alejandro Díaz-Caro - A System F Accounting For Scalars

Uploaded by

Copyright:

Available Formats

You might also like

Pablo Arrighi and Alejandro Díaz-Caro - A System F Accounting For Scalars

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Pablo Arrighi and Alejandro Díaz-Caro - A System F Accounting For Scalars

Uploaded by

Copyright:

Available Formats

A System F accounting for scalars

Pablo Arrighi and Alejandro Daz-Caro

November 19th, 2009. PPS (Paris)

The scalar type system

Conclusions and future work

before quantum computing, no clear relation with

The scalar type system

Conclusions and future work

before quantum computing, no clear relation with

quantum programs). Models of Linear Logics

Quantum Theory? (Coherent

spaces, Micromechanics loses duplicability.)

The scalar type system

Conclusions and future work

before quantum computing, no clear relation with

quantum programs). Models of Linear Logics

Quantum Theory? (Coherent

The scalar type system

Conclusions and future work

before quantum computing, no clear relation with

quantum programs). Models of Linear Logics

Quantum Theory? (Coherent

What are quantum types?

The scalar type system

Conclusions and future work

States are (normalized) vectors Vector space of o.n.b.

Pablo Arrighi and Alejandro Daz-Caro, LIG

A System F accounting for scalars, arXiv:0903.3741

The scalar type system

Conclusions and future work

States are (normalized) vectors Vector space of o.n.b.

Evolutions are (unitary) linear operators U .

Pablo Arrighi and Alejandro Daz-Caro, LIG

A System F accounting for scalars, arXiv:0903.3741

The scalar type system

Conclusions and future work

States are (normalized) vectors Vector space of o.n.b.

Evolutions are (unitary) linear operators U .

Pablo Arrighi and Alejandro Daz-Caro, LIG

A System F accounting for scalars, arXiv:0903.3741

The scalar type system

Conclusions and future work

States are (normalized) vectors Vector space of o.n.b.

Evolutions are (unitary) linear operators U .

Pablo Arrighi and Alejandro Daz-Caro, LIG

A System F accounting for scalars, arXiv:0903.3741

The scalar type system

Conclusions and future work

We can have (=copying, OK)

(=cloning, Not OK)

Pablo Arrighi and Alejandro Daz-Caro, LIG

A System F accounting for scalars, arXiv:0903.3741

The scalar type system

Conclusions and future work

We can have (=copying, OK)

(=cloning, Not OK)

Conicts with -reduction?

The scalar type system

Conicts with -reduction?

(2008), pp. 1731.

(2008), pp. 1731.

(2008), pp. 1731.

(2008), pp. 1731.

Linear-Algebraic -Calculus Why the restrictions : Innities

Linear-Algebraic -Calculus Why the restrictions : Innities

Linear-Algebraic -Calculus Why the restrictions : Innities

Linear-Algebraic -Calculus Why the restrictions : Innities

Linear-Algebraic -Calculus Why the restrictions : Innities

Linear-Algebraic -Calculus Why the restrictions : Innities