A Differential Model Theory for Resource Lambda Calculi - Part II

Size: px
Start display at page:

Download "A Differential Model Theory for Resource Lambda Calculi - Part II"

Transcription

1 A Differential Model Theory for Resource Lambda Calculi - Part II Giulio Manzonetto (joint work with Bucciarelli, Ehrhard, Laird, McCusker) g.manzonetto@cs.ru.nl Intelligent Systems Radboud University Nijmegen FMCS Calgary - 11 th June 2011 Giulio Manzonetto (RU) Differential Model Theory 11/06/11 1 / 35

2 Introduction Outline 1 Cartesian (Closed) Differential Categories [BEM 10, Man 11] Typed and untyped models of differential/resource λ-calculus Soundness & Completeness Examples 2 Building Differential Categories [LMM 11] A general recipe: From SMC(C) Differential SMC(C) Differential C(C)C 3 Game Semantics [LMM 11] Instances: Categories of Games, The relational semantics Full abstraction for relational semantics w.r.t. Resource PCF 4 Conclusions Giulio Manzonetto (RU) Differential Model Theory 11/06/11 2 / 35

3 Cartesian Closed Differential Categories Differential Categories The differential λ-calculus inspired researchers working on category theory. Aim: Axiomatize a differential operator D( ) categorically. Differential categories Blute, Cockett and Seely proposed: BCS 06: (monoidal) differential categories point of view too fine BCS 09: Cartesian differential categories sound and complete for their term calculus, lack of higher order functions! Not enough for modeling the differential λ-calculus!!! Giulio Manzonetto (RU) Differential Model Theory 11/06/11 3 / 35

4 Cartesian Closed Differential Categories Differential Categories The differential λ-calculus inspired researchers working on category theory. Aim: Axiomatize a differential operator D( ) categorically. Differential categories Blute, Cockett and Seely proposed: BCS 06: (monoidal) differential categories point of view too fine BCS 09: Cartesian differential categories sound and complete for their term calculus, lack of higher order functions! Not enough for modeling the differential λ-calculus!!! Giulio Manzonetto (RU) Differential Model Theory 11/06/11 3 / 35

5 Cartesian Closed Differential Categories Left Additive Categories We have sums of λ-terms and the application is left-linear: ( i s i)t = i s it s( i t i) i st i We need a left-additive sum on morphisms! A category C is left-additive if: each homset has a structure of commutative monoid (C(A, B), + AB, 0 AB ), f ; (g + h) = (f ; g) + (f ; h) and f ; 0 = 0. When f satisfies also (g + h); f = (g; f ) + (h; f ) and 0; f = 0 it is called additive. (weak form of linearity) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 4 / 35

6 Cartesian Closed Differential Categories Left Additive Categories We have sums of λ-terms and the application is left-linear: ( i s i)t = i s it s( i t i) i st i We need a left-additive sum on morphisms! A category C is left-additive if: each homset has a structure of commutative monoid (C(A, B), + AB, 0 AB ), f ; (g + h) = (f ; g) + (f ; h) and f ; 0 = 0. When f satisfies also (g + h); f = (g; f ) + (h; f ) and 0; f = 0 it is called additive. (weak form of linearity) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 4 / 35

7 Cartesian Closed Differential Categories Cartesian (Closed) Left-additive Categories A category C is Cartesian left-additive if: C is a left-additive category, it is Cartesian (= it has products), all projections and pairings of additive maps are additive. A category C is Cartesian closed left-additive if: C is Cartesian left-additive, it is a ccc (Λ( ) = curry, ev =eval), it satisfies Λ(f + g) = Λ(f ) + Λ(g) and Λ(0) = 0. (implies f + g, h ; ev = f, h ; ev + g, h ; ev) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 5 / 35

8 Cartesian Closed Differential Categories Cartesian (Closed) Left-additive Categories A category C is Cartesian left-additive if: C is a left-additive category, it is Cartesian (= it has products), all projections and pairings of additive maps are additive. The Cartesian (closed) structure does not behaves automatically well with the left-additive enrichment! A category C is Cartesian closed left-additive if: C is Cartesian left-additive, it is a ccc (Λ( ) = curry, ev =eval), it satisfies Λ(f + g) = Λ(f ) + Λ(g) and Λ(0) = 0. (implies f + g, h ; ev = f, h ; ev + g, h ; ev) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 5 / 35

9 Cartesian Closed Differential Categories Cartesian Differential Categories Cartesian differential operator: D f : A B D (f ) : A A B Satisfying: D1. D (f + g) = D (f ) + D (g) and D (0) = 0 D2. h + k, v ; D (f ) = h, v ; D (f ) + k, v ; D (f ) and 0, v ; D (f ) = 0 D3. D (Id) = π 1, D (π 1 ) = π 1 ; π 1 and D (π 2 ) = π 1 ; π 2 D4. D ( f, g ) = D (f ), D (g) D5. D (g; f ) = D(g), π 2 ; g ; D (f ) D6. g, 0, h, k ; D (D (f )) = g, k ; D (f ) D7. 0, h, g, k ; D (D (f )) = 0, g, h, k ; D (D (f )) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 6 / 35

10 Cartesian Closed Differential Categories Subcategory of Linear Morphisms Linear morphisms A morphism f is linear if its differential is constant: D (f ) = π 1 ; f. f linear f additive f linear f additive Giulio Manzonetto (RU) Differential Model Theory 11/06/11 7 / 35

11 Cartesian Closed Differential Categories Partial differentiation Imagine we just want to differentiate f : C A B on C. D (f ) : (C A) (C A) B, we can obtain the partial derivative D C (f ) : C (C A) by zeroing out the A component, C (C A) Id C,0 C A Id C A (C A) (C A) B D (f ) D C (f ) = Id C, 0 C A Id C A; D (f ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 8 / 35

12 Cartesian Closed Differential Categories Cartesian closed differential category Cartesian closed differential category [Bucciarelli-Ehrhard-Manzonetto 10] C is a Cartesian closed differential category if: C is a Cartesian differential category, it is Cartesian closed left-additive, it satisfies the following rule: For all f : C A B: D (Λ(f )) = Λ( π 1 0 A, π 2 Id A ; D (f )) Intuitively, the following methods for partial derivatives are equivalent: 1 Do Λ(f ) : C [A B] then apply D ( ), 2 Use the trick by zeroing out the A component as before. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 9 / 35

13 Cartesian Closed Differential Categories Categorical Interpretation (simply typed) Define f g = 0, π 1 ; g, Id ; D (f ): f : C A B g : C A f g : C A B Define Γ D s : σ = s σ Γ : Γ σ by: x σ Γ;x:σ = π 2, y τ Γ;x:σ = π 1 ; y τ Γ, (st ) τ Γ = s σ τ Γ, T σ Γ ; ev, (λx.s) σ τ Γ = Λ( s τ Γ;x:σ ), (D(s) t) σ τ Γ = Λ(Λ ( s σ τ Γ ) t σ Γ ), 0 σ Γ = 0, (s + S) σ Γ = s σ Γ + S σ Γ. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 10 / 35

14 Cartesian Closed Differential Categories Categorical Interpretation (simply typed) Define f g = 0, π 1 ; g, Id ; D (f ): f : C A B g : C A f g : C A B Define Γ D s : σ = s σ Γ : Γ σ by: x σ Γ;x:σ = π 2, y τ Γ;x:σ = π 1 ; y τ Γ, (st ) τ Γ = s σ τ Γ, T σ Γ ; ev, (λx.s) σ τ Γ = Λ( s τ Γ;x:σ ), (D(s) t) σ τ Γ = Λ(Λ ( s σ τ Γ ) t σ Γ ), 0 σ Γ = 0, (s + S) σ Γ = s σ Γ + S σ Γ. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 10 / 35

15 Cartesian Closed Differential Categories Categorical Interpretation (simply typed) Define f g = 0, π 1 ; g, Id ; D (f ): f : C A B g : C A f g : C A B Define Γ D s : σ = s σ Γ : Γ σ by: x σ Γ;x:σ = π 2, y τ Γ;x:σ = π 1 ; y τ Γ, (st ) τ Γ = s σ τ Γ, T σ Γ ; ev, (λx.s) σ τ Γ = Λ( s τ Γ;x:σ ), (D(s) t) σ τ Γ = Λ(Λ ( s σ τ Γ ) t σ Γ ), 0 σ Γ = 0, (s + S) σ Γ = s σ Γ + S σ Γ. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 10 / 35

16 Cartesian Closed Differential Categories Categorical Interpretation (simply typed) Define f g = 0, π 1 ; g, Id ; D (f ): f : C A B g : C A f g : C A B Define Γ D s : σ = s σ Γ : Γ σ by: x σ Γ;x:σ = π 2, y τ Γ;x:σ = π 1 ; y τ Γ, (st ) τ Γ = s σ τ Γ, T σ Γ ; ev, (λx.s) σ τ Γ = Λ( s τ Γ;x:σ ), (D(s) t) σ τ Γ = Λ(Λ ( s σ τ Γ ) t σ Γ ), 0 σ Γ = 0, (s + S) σ Γ = s σ Γ + S σ Γ. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 10 / 35

17 Cartesian Closed Differential Categories Soundness If C is a Cartesian closed differential category, then Th D (C) = {s = t Γ D s : σ Γ D t : σ s σ Γ = t σ Γ } is a differential λ-theory (i.e., it contains = D and it is contextual). Soundness Theorem [BEM 10] Cartesian closed differential categories are sound models for: Simply Typed Differential λ-calculus Giulio Manzonetto (RU) Differential Model Theory 11/06/11 11 / 35

18 Cartesian Closed Differential Categories Soundness If C is a Cartesian closed differential category, then Th D (C) = {s = t Γ D s : σ Γ D t : σ s σ Γ = t σ Γ } is a differential λ-theory (i.e., it contains = D and it is contextual). We can interpret the Resource Calculus by translation: Γ R M : σ = (M ) σ Γ we get that Th R (C) is a resource λ-theory. Soundness Theorem [BEM 10] Cartesian closed differential categories are sound models for: Simply Typed Differential λ-calculus Simply Typed Resource Calculus (by translation ( ) ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 11 / 35

19 Soundness Cartesian Closed Differential Categories If C is a Cartesian closed differential category, then Th D (C) = {s = t Γ D s : σ Γ D t : σ s σ Γ = t σ Γ } is a differential λ-theory (i.e., it contains = D and it is contextual). Every model of the differential λ-calculus is also a model of the resource calculus We can interpret the Resource Calculus by translation: Γ R M : σ = (M ) σ Γ we get that Th R (C) is a resource λ-theory. Soundness Theorem [BEM 10] Cartesian closed differential categories are sound models for: Simply Typed Differential λ-calculus Simply Typed Resource Calculus (by translation ( ) ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 11 / 35

20 Cartesian Closed Differential Categories Modelling the Untyped Differential λ-calculus As in the λ-calculus we need a reflexive object U (i.e., [U U] U) in a Cartesian closed differential category, but it is not enough! Linear reflexive object A reflexive object [U U] U is linear if A : U [U U], λ : [U U] U are both linear maps. We modify the interpretation in the obvious way: x i x = π i, st x = A s x, T x ; ev, λy.s x = Λ( s x,y ); λ, with y / x D(s) t x = Λ(Λ ( s x ; A) t x ); λ. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 12 / 35

21 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 13 / 35

22 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Completeness Theorem for λ-calculus [Scott Koymans] Every λ-theories T is the theory of a reflexive object in a suitable CCC C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 13 / 35

23 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Scott-Koymans completeness proof for regular λ-calculus (take T ): Λ/T Karoubi envelope C T = K(Λ/T ) I reflexive obj. Completeness Theorem for λ-calculus [Scott Koymans] Every λ-theories T is the theory of a reflexive object in a suitable CCC C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 13 / 35

24 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Scott-Koymans completeness proof for regular λ-calculus (take T ): Λ/T Karoubi envelope C T = K(Λ/T ) I reflexive obj. M Λ o [λx.m] T Completeness Theorem for λ-calculus [Scott Koymans] Every λ-theories T is the theory of a reflexive object in a suitable CCC C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 13 / 35

25 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Scott-Koymans completeness proof for regular λ-calculus (take T ): Λ/T Karoubi envelope C T = K(Λ/T ) Th(I) = T M Λ o [λx.m] T Completeness Theorem for λ-calculus [Scott Koymans] Every λ-theories T is the theory of a reflexive object in a suitable CCC C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 13 / 35

26 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. The category C T is described as follows (where M; N = λz.n(mz)): Objects: {A Λ/T A; A = A} Hom(A,B): {f Λ/T A; f ; B = f } Identity: Id A = A Composition: f ; g Completeness Theorem for λ-calculus [Scott Koymans] Every λ-theories T is the theory of a reflexive object in a suitable CCC C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 13 / 35

27 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Idea: encode the categorical constructions via λ-terms: Products: f, g = λz.[fz, gz] π A 1,A 2 i = p i ; A i where [M, N] = λy.ymn, p 1 = λx.xk and p 2 = λx.xk (Church encoding). Exponents: [A B] = λz.a; z; B ev A,B = λz.b(p 1 z(a(p 2 z))) Λ(f ) = λxy.f [x, y] Completeness Theorem for λ-calculus [Scott Koymans] Every λ-theories T is the theory of a reflexive object in a suitable CCC C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 13 / 35

28 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. The category C T is described as follows (where M; N = λz.n(mz)): Objects: {A Λ/T A; A = A, A(x + y) = Ax + Ay} Hom(A,B): {f Λ/T A; f ; B = f } Identity: Id A = A Composition: f ; g Additive structure: the sum in the category is the sum of terms. Completeness Theorem for differential λ-calculus [Manzonetto 11] Every differential λ-theory T is the theory of a linear reflexive object in a suitable Cartesian closed differential category C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 14 / 35

29 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Problem: Church s pairing is not additive! [M+M, N+N ] = λy.y(m+m )(N+N ) λy.ymn+λy.ym N = [M, N]+[M, N ] f + f, g + g f, g + f, g Completeness Theorem for differential λ-calculus [Manzonetto 11] Every differential λ-theory T is the theory of a linear reflexive object in a suitable Cartesian closed differential category C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 14 / 35

30 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Solution: set-like encoding exploiting resource consciousness [M, N] = λy.m + λy.d(y) N p 1 = λx.x0 p 2 = λx.(d(x) I)00 We need to restrict to theories with idempotent sum! Completeness Theorem for differential λ-calculus [Manzonetto 11] Every differential λ-theory T with idempotent sum is the theory of a linear reflexive object in a suitable Cartesian closed differential category C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 14 / 35

31 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. The encoding of the differential operator is straightforward: D (f ) = λz.b((d(f ) (A(p 1 z)))(a(p 2 z))) : A A B Completeness Theorem for differential λ-calculus [Manzonetto 11] Every differential λ-theory T with idempotent sum is the theory of a linear reflexive object in a suitable Cartesian closed differential category C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 14 / 35

32 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Completeness proof for differential λ-calculus (take T ): Λ d /T Karoubi envelope C T = K(Λ d /T ) I linear refl. obj. M Λ o d [λx. M] T ( ) : D(M) N λy.(d( M) Ñ)y, the identity otherwise. Completeness Theorem for differential λ-calculus [Manzonetto 11] Every differential λ-theory T with idempotent sum is the theory of a linear reflexive object in a suitable Cartesian closed differential category C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 14 / 35

33 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Completeness proof for differential λ-calculus (take T ): Λ d /T Karoubi envelope C T = K(Λ d /T ) Th(I) T M Λ o d [λx. M] T We add equations Th(I) D(M) N = λy.(d(m) N)y (differentially extensional axiom) Completeness Theorem for differential λ-calculus [Manzonetto 11] Every differential λ-theory T with idempotent sum is the theory of a linear reflexive object in a suitable Cartesian closed differential category C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 14 / 35

34 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Completeness proof for differential λ-calculus (take T ): Λ d /T Karoubi envelope C T = K(Λ d /T ) Th(I) = T M Λ o d [λx.m] T We restrict to differentially extensional T Completeness Theorem for differential λ-calculus [Manzonetto 11] Every differentionally extensional differential λ-theory T with idempotent sum is the theory of a linear reflexive object in a suitable Cartesian closed differential category C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 14 / 35

35 Cartesian Closed Differential Categories Soundness and Completeness Theorem [Manzonetto 11] Cartesian closed differential categories are sound and complete models of the differential λ-calculus. Completeness proof for differential λ-calculus (take T ): Λ d /T Karoubi envelope C T = K(Λ d /T ) Th(I) = T M Λ o d [λx.m] T All models arising naturally are differentionally extensional, also the non-extensional ones! Completeness Theorem for differential λ-calculus [Manzonetto 11] Every differentionally extensional differential λ-theory T with idempotent sum is the theory of a linear reflexive object in a suitable Cartesian closed differential category C T. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 14 / 35

36 Cartesian Closed Differential Categories Examples 1 MFin: Finiteness Spaces. [Ehrhard] [No reflexive objects in it!] 2 MRel: The Relational Semantics. The cokleisli of Rel + M f ( ). 3 Its variations with Infinite Multiplicities [Carraro-Ehrhard-Salibra] 4 Convenient differential category [Blute-Ehrhard-Tasson] 5 Categories of games... [Laird-Manzonetto-MCusker] (see later) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 15 / 35

37 Cartesian Closed Differential Categories Main Example: The Relational Semantics MRel Objects: sets, Morphisms: MRel(A, B) = P(M f (A) B) (relations between M f (A) and B). Given f : A B we can define: D(f ) = {(([a], m), b) (m [a], b) f } : A A B. Theorem [BEM 10] The category MRel is a Cartesian closed differential category. Corollary MRel is a model of the simply typed differential λ-calculus. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 16 / 35

38 Cartesian Closed Differential Categories Main Example: The Relational Semantics MRel Objects: sets, Morphisms: MRel(A, B) = P(M f (A) B) (relations between M f (A) and B). Given f : A B we can define: D(f ) = {(([a], m), b) (m [a], b) f } : A A B. Theorem [BEM 10] The category MRel is a Cartesian closed differential category. Corollary MRel is a model of the simply typed differential λ-calculus. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 16 / 35

39 Cartesian Closed Differential Categories Main Example: The Relational Semantics Untyped Models in MRel D: relational analogous of Scott s D (extensional), E: relational analogous of Engelers graph model (non extensional, but differentially extensional), Giulio Manzonetto (RU) Differential Model Theory 11/06/11 17 / 35

40 Cartesian Closed Differential Categories Main Example: The Relational Semantics Untyped Models in MRel D: relational analogous of Scott s D (extensional), Construction: D 0 = D n+1 = M f (D n ) (ω) D = n ω D n (m 1, m 2, m 3,...) D (m 1, (m 2, m 3,...)) M f (D) D = [D D] E: relational analogous of Engelers graph model (non extensional, but differentially extensional), Giulio Manzonetto (RU) Differential Model Theory 11/06/11 17 / 35

41 Cartesian Closed Differential Categories Main Example: The Relational Semantics Untyped Models in MRel D: relational analogous of Scott s D (extensional), E: relational analogous of Engelers graph model (non extensional, but differentially extensional), MRel models the Taylor Expansion In every linear reflexive object U of MRel we have S U x = S U x Giulio Manzonetto (RU) Differential Model Theory 11/06/11 17 / 35

42 Cartesian Closed Differential Categories Main Example: The Relational Semantics Untyped Models in MRel D: relational analogous of Scott s D (extensional), E: relational analogous of Engelers graph model (non extensional, but differentially extensional), MRel models the Taylor Expansion In every linear reflexive object U of MRel we have S U x = S U x Full Abstraction [Bucciarelli-Carraro-Ehrhard-Manzonetto 11] D is a fully abstract model of the resource calculus with tests. M N [ C( ) C(M) C(N) ] Giulio Manzonetto (RU) Differential Model Theory 11/06/11 17 / 35

43 Building Differential Categories Building Differential Categories SMC C sup-lattice enrichment countable biproducts Giulio Manzonetto (RU) Differential Model Theory 11/06/11 18 / 35

44 Building Differential Categories Building Differential Categories SMC C sup-lattice enrichment countable biproducts SMC K(C) Karoubi envelope symmetric tensor power coalgebra modality differential operator Giulio Manzonetto (RU) Differential Model Theory 11/06/11 18 / 35

45 Building Differential Categories Building Differential Categories SMC C sup-lattice enrichment countable biproducts Karoubi envelope Differential category K(C) sup-lattice enrichment Giulio Manzonetto (RU) Differential Model Theory 11/06/11 18 / 35

46 Building Differential Categories Building Differential Categories SMC C sup-lattice enrichment countable biproducts Karoubi envelope Differential category K(C) sup-lattice enrichment co-kleisli Cart. differential K! (C) cpo-enriched Giulio Manzonetto (RU) Differential Model Theory 11/06/11 18 / 35

47 Building Differential Categories Building Differential Categories monoidal closed SMC C sup-lattice enrichment countable biproducts Karoubi envelope monoidal closed Differential category K(C) sup-lattice enrichment co-kleisli Cartesian closed Cart. differential K! (C) cpo-enriched Giulio Manzonetto (RU) Differential Model Theory 11/06/11 18 / 35

48 Building Differential Categories Building Differential Categories SMC C sup-lattice enrichment countable biproducts all R-exponentials A R Karoubi envelope Differential category K(C) sup-lattice enrichment co-kleisli Cart. differential K! (C) cpo-enriched R-exponentials cat. Cartesian closed Giulio Manzonetto (RU) Differential Model Theory 11/06/11 18 / 35

49 Building Differential Categories General recipe for coalgebra modalities Take an SMC. In presence of the equalizer A n (as in many models of LL): A n equalizer A n. n! permutations A n A n gives the n-th layer of the free commutative monoid!a. Coalgebra modality!a = n ω A n This works for symmetric monoidal categories where the tensor distributes over the infinite product: X ( A n ) = (X A n ) n ω n ω Giulio Manzonetto (RU) Differential Model Theory 11/06/11 19 / 35

50 Building Differential Categories General recipe for coalgebra modalities Take an SMC. In presence of the equalizer A n (as in many models of LL): A n equalizer A n. n! permutations A n A n gives the n-th layer of the free commutative monoid!a. Coalgebra modality!a = n ω A n This works for symmetric monoidal categories where the tensor distributes over the infinite product: X ( A n ) = (X A n ) n ω n ω Giulio Manzonetto (RU) Differential Model Theory 11/06/11 19 / 35

51 Building Differential Categories Always works in the Karoubi Envelope K(C) (for sup-semilattice enriched C with infinite biproducts): Obj: Hom((A,f),(B,g)): (A, f ), A C, f : A A idempotent h C(A, B), such that f ; h = h g; h = h We can construct the symmetric tensor product A n using Θ A,n = σ S n σ (A n, f n ; Θ A,n ) Storage modality f n ; Θ A,n (A n, f n ) (A n, f n ). n! permutations!(a, f ) = n ω(a, f ) n (free commutative comonoid) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 20 / 35

52 Building Differential Categories Always works in the Karoubi Envelope K(C) (for sup-semilattice enriched C with infinite biproducts): Obj: Hom((A,f),(B,g)): (A, f ), A C, f : A A idempotent h C(A, B), such that f ; h = h g; h = h We can construct the symmetric tensor product A n using Θ A,n = σ S n σ (A n, f n ; Θ A,n ) Storage modality f n ; Θ A,n (A n, f n ) (A n, f n ). n! permutations!(a, f ) = n ω(a, f ) n (free commutative comonoid) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 20 / 35

53 Building Differential Categories Always works in the Karoubi Envelope Differential transformation d : (A, f )!(A, f )!(A, f ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 21 / 35

54 Building Differential Categories Always works in the Karoubi Envelope Differential transformation d : (A, f ) (A, f ) n (A, f ) n n ω n ω 1 For each n we have: 2 Tupling all these gives a map f n+1 ; Θ A,n+1 (A, f ) (A, f ) n (A, f ) n+1 (A, f )!(A, f ) n ω (A, f ) n+1 3 Finally pairing with 0 : (A, f )!(A, f ) gives (A, f )!(A, f )!(A, f ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 21 / 35

55 Building Differential Categories Always works in the Karoubi Envelope Differential transformation d : (A, f ) (A, f ) n (A, f ) n n ω n ω 1 For each n we have: 2 Tupling all these gives a map f n+1 ; Θ A,n+1 (A, f ) (A, f ) n (A, f ) n+1 (A, f )!(A, f ) n ω (A, f ) n+1 3 Finally pairing with 0 : (A, f )!(A, f ) gives (A, f )!(A, f )!(A, f ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 21 / 35

56 Building Differential Categories Always works in the Karoubi Envelope Differential transformation d : (A, f ) (A, f ) n (A, f ) n n ω n ω 1 For each n we have: (A, f )!(A, f ) =; π n f n+1 ; Θ A,n+1 (A, f ) (A, f ) n (A, f ) n+1 2 Tupling all these gives a map (A, f )!(A, f ) n ω (A, f ) n+1 3 Finally pairing with 0 : (A, f )!(A, f ) gives (A, f )!(A, f )!(A, f ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 21 / 35

57 Building Differential Categories Always works in the Karoubi Envelope Differential transformation d : (A, f ) (A, f ) n (A, f ) n n ω n ω 1 For each n we have: (A, f )!(A, f ) =; π n f n+1 ; Θ A,n+1 (A, f ) (A, f ) n (A, f ) n+1 2 Tupling all these gives a map (A, f )!(A, f ) n ω (A, f ) n+1 3 Finally pairing with 0 : (A, f )!(A, f ) gives (A, f )!(A, f )!(A, f ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 21 / 35

58 Building Differential Categories Always works in the Karoubi Envelope Differential transformation d : (A, f ) (A, f ) n (A, f ) n n ω n ω 1 For each n we have: (A, f )!(A, f ) =; π n f n+1 ; Θ A,n+1 (A, f ) (A, f ) n (A, f ) n+1 2 Tupling all these gives a map (A, f )!(A, f ) n ω (A, f ) n+1 3 Finally pairing with 0 : (A, f )!(A, f ) gives (A, f )!(A, f )!(A, f ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 21 / 35

59 Building Differential Categories Always works in the Karoubi Envelope What if I don t have sup-lattice enrichment or infinite biproducts? Differential transformation d : (A, f ) (A, f ) n (A, f ) n n ω n ω 1 For each n we have: (A, f )!(A, f ) =; π n f n+1 ; Θ A,n+1 (A, f ) (A, f ) n (A, f ) n+1 2 Tupling all these gives a map (A, f )!(A, f ) n ω (A, f ) n+1 3 Finally pairing with 0 : (A, f )!(A, f ) gives (A, f )!(A, f )!(A, f ) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 21 / 35

60 Free completions Building Differential Categories SMC C Giulio Manzonetto (RU) Differential Model Theory 11/06/11 22 / 35

61 Building Differential Categories Free completions SMC C + sup-lattice enrichment sup-lattice completion SMC C Giulio Manzonetto (RU) Differential Model Theory 11/06/11 22 / 35

62 Building Differential Categories Free completions SMC BP(C + ) sup-lattice enrichment countable biproducts biproduct completion SMC C + sup-lattice enrichment sup-lattice completion SMC C Giulio Manzonetto (RU) Differential Model Theory 11/06/11 22 / 35

63 Building Differential Categories Free completions SMC BP(C + ) sup-lattice enrichment countable biproducts biproduct completion Karoubi envelope SMC C + sup-lattice enrichment Differential category K(BP(C + )) sup-lattice enrichment sup-lattice completion co-kleisli SMC C Cartesian differential K! (BP(C + )) cpo-enriched Giulio Manzonetto (RU) Differential Model Theory 11/06/11 22 / 35

64 Building Differential Categories Easy way to Build Models of Resource PCF Resource PCF Simply Typed Resource Calculus + Constants for natural numbers (of ground type Nat) + Fixed Point Combinator Y, + If-zero? instruction. Operational semantics: Linear Head Reduction. Denotational Models Cartesian Closed Differential Categories, + Fixpoints, + (weak) Natural number object. Remark on the construction We recover MRel and build categories of games. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 23 / 35

65 Building Differential Categories Easy way to Build Models of Resource PCF Resource PCF Simply Typed Resource Calculus + Constants for natural numbers (of ground type Nat) + Fixed Point Combinator Y, + If-zero? instruction. Operational semantics: Linear Head Reduction. Denotational Models Cartesian Closed Differential Categories, + Fixpoints, + (weak) Natural number object. Remark on the construction We recover MRel and build categories of games. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 23 / 35

66 Building Differential Categories Example from SMCC 1 (1 object, 1 morphism) Terminal SMCC 1 Giulio Manzonetto (RU) Differential Model Theory 11/06/11 24 / 35

67 Building Differential Categories Example from SMCC 1 (1 object, 1 morphism) SMCC BP(1 + ) = Rel biproduct completion SMCC 1 + sup-lattice completion Terminal SMCC 1 Giulio Manzonetto (RU) Differential Model Theory 11/06/11 24 / 35

68 Building Differential Categories Example from SMCC 1 (1 object, 1 morphism) SMCC BP(1 + ) = Rel biproduct completion Karoubi envelope SMCC 1 + Differential category K(Rel) im(rel),! = M f sup-lattice completion co-kleisli Terminal SMCC 1 Cart. closed differential MRel K! (BP(C + )) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 24 / 35

69 Building Differential Categories Playing with games... Arena An arena A is given by: a finite bipartite forest over two sets of moves MA P and MO A, an edge relation (enabling), a labelling function (Questions and Answers). Strategies Given an arena A, a strategy over A is: a set of complete sequences (= every question is answered exactly once), the Opponent plays first (then they alternate), satisfying P-visibility and P-bracketing. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 25 / 35

70 Building Differential Categories Playing with games... Arena An arena A is given by: a finite bipartite forest over two sets of moves MA P and MO A, an edge relation (enabling), a labelling function (Questions and Answers). Strategies Given an arena A, a strategy over A is: a set of complete sequences (= every question is answered exactly once), the Opponent plays first (then they alternate), satisfying P-visibility and P-bracketing. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 25 / 35

71 Building Differential Categories A category G of games Category G of games [Harmer-McCusker] The category G: Objects: arenas whose roots are all O-moves, Hom(A,B): strategies on A B, Composition: usual parallel composition plus hiding construction, Identities: copycat strategies. = disjoint union, A B = Arena B with a copy of A attached below each initial move (to maintain the forest structure) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 26 / 35

72 Building Differential Categories A category G of games Category G of games [Harmer-McCusker] The monoidal closed category G: Objects: arenas whose roots are all O-moves, Hom(A,B): strategies on A B, Composition: usual parallel composition plus hiding construction, Identities: copycat strategies. = disjoint union, A B = Arena B with a copy of A attached below each initial move (to maintain the forest structure) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 26 / 35

73 Building Differential Categories The subcategory G Remark Every object of G can be endowed with a comonoid structure Comonoid homomorphisms = maps whose choice of move at any stage depends only on the current thread. Subcategory of comonoid homomorphisms Cartesian closed category G. Theorem [Harmer-McCusker 99] G is fully abstract for Erratic Idealized Algol. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 27 / 35

74 Building Differential Categories The subcategory G Remark Every object of G can be endowed with a comonoid structure Comonoid homomorphisms = maps whose choice of move at any stage depends only on the current thread. Subcategory of comonoid homomorphisms Cartesian closed category G. Theorem [Harmer-McCusker 99] G is fully abstract for Erratic Idealized Algol. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 27 / 35

75 Building Differential Categories G is a Cartesian Closed Differential Category Given a complete play (playing in A at least once): s : A B Its derivative s : A A B plays in the left A exactly once. Derivative combinator D (σ) = {s comp(a A B) s is a derivative of some s σ} The derivative is programmable in Erratic Idealized Algol. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 28 / 35

76 Building Differential Categories G is a Cartesian Closed Differential Category Given a complete play (playing in A at least once): s : A B Its derivative s : A A B plays in the left A exactly once. Derivative combinator D (σ) = {s comp(a A B) s is a derivative of some s σ} The derivative is programmable in Erratic Idealized Algol. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 28 / 35

77 Building Differential Categories Analysis of G Path: non-repeating enumeration of all moves, respects the order given by the edge relation in the arena, the first move is by O, moves alternate polarity thereafter. Exhausting strategy: set of even paths satisfying P-visibility. Category of Exhausting games The category EG: Objects: finite O-rooted arenas, Hom(A,B): exhausting strategy on A B, monoidal structure = disjoint union, has all R-exponentials A R, where R = arena with a single O-move. Let s apply (the second part of) our construction... Giulio Manzonetto (RU) Differential Model Theory 11/06/11 29 / 35

78 Building Differential Categories Analysis of G Path: non-repeating enumeration of all moves, respects the order given by the edge relation in the arena, the first move is by O, moves alternate polarity thereafter. Exhausting strategy: set of even paths satisfying P-visibility. Category of Exhausting games The category EG: Objects: finite O-rooted arenas, Hom(A,B): exhausting strategy on A B, monoidal structure = disjoint union, has all R-exponentials A R, where R = arena with a single O-move. Let s apply (the second part of) our construction... Giulio Manzonetto (RU) Differential Model Theory 11/06/11 29 / 35

79 Building Differential Categories Analysis of G Path: non-repeating enumeration of all moves, respects the order given by the edge relation in the arena, the first move is by O, moves alternate polarity thereafter. Exhausting strategy: set of even paths satisfying P-visibility. Category of Exhausting games The sup-lattice enriched category EG: Objects: finite O-rooted arenas, Hom(A,B): exhausting strategy on A B, monoidal structure = disjoint union, has all R-exponentials A R, where R = arena with a single O-move. Let s apply (the second part of) our construction... Giulio Manzonetto (RU) Differential Model Theory 11/06/11 29 / 35

80 Recovering G Building Differential Categories SMC EG Giulio Manzonetto (RU) Differential Model Theory 11/06/11 30 / 35

81 Recovering G Building Differential Categories SMC BP(EG) biproduct completion Karoubi envelope SMC EG Differential category K(BP(EG)) co-kleisli Cart. differential K! (BP(EG)) CCC R-exponentials Giulio Manzonetto (RU) Differential Model Theory 11/06/11 30 / 35

82 Recovering G Building Differential Categories SMC BP(EG) biproduct completion Karoubi envelope SMC EG Differential category K(BP(EG)) co-kleisli Category G full faithful functor Cart. differential K! (BP(EG)) CCC R-exponentials Giulio Manzonetto (RU) Differential Model Theory 11/06/11 30 / 35

83 Recovering G Building Differential Categories SMC BP(EG) biproduct completion Karoubi envelope SMC EG Differential category K(BP(EG)) co-kleisli Category G Model of Resource PCF full faithful functor Cart. differential K! (BP(EG)) CCC R-exponentials Giulio Manzonetto (RU) Differential Model Theory 11/06/11 30 / 35

84 Recovering G Building Differential Categories SMC BP(EG) biproduct completion Karoubi envelope SMC EG Differential category K(BP(EG)) co-kleisli Category G No full abstraction :( full faithful functor Cart. differential K! (BP(EG)) CCC R-exponentials Giulio Manzonetto (RU) Differential Model Theory 11/06/11 30 / 35

85 Building Differential Categories Refining We consider a switch equivalence relation: = least equivalence relation s o p o p t s o p o p t -closed strategies = causal independent strategies The category EG Objects: O-rooted arenas, Hom(A,B): deterministic -closed strategies. Remark Nondeterminism arise with the sup-lattice completion. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 31 / 35

86 Let s try again... Building Differential Categories SMC EG Giulio Manzonetto (RU) Differential Model Theory 11/06/11 32 / 35

87 Let s try again... Building Differential Categories SMC BP(EG ) biproduct completion Karoubi envelope SMC EG Differential category K(BP(EG )) co-kleisli Cart. differential K! (BP(EG )) CCC R-exponentials Giulio Manzonetto (RU) Differential Model Theory 11/06/11 32 / 35

88 Let s try again... Building Differential Categories SMC BP(EG ) biproduct completion Karoubi envelope SMC EG Differential category K(BP(EG )) co-kleisli Category G full faithful functor Cart. differential K! (BP(EG )) CCC R-exponentials Giulio Manzonetto (RU) Differential Model Theory 11/06/11 32 / 35

89 Let s try again... Building Differential Categories SMC BP(EG ) biproduct completion Karoubi envelope SMC EG Differential category K(BP(EG )) co-kleisli Category G Model of Resource PCF full faithful functor Cart. differential K! (BP(EG )) CCC R-exponentials Giulio Manzonetto (RU) Differential Model Theory 11/06/11 32 / 35

90 Let s try again... Building Differential Categories SMC BP(EG ) biproduct completion Karoubi envelope You re kidding, right? Why are you bothering us? SMC EG Differential category K(BP(EG )) co-kleisli Category G No full abstraction but... full faithful functor Cart. differential K! (BP(EG )) CCC R-exponentials Giulio Manzonetto (RU) Differential Model Theory 11/06/11 32 / 35

91 Let s try again... Building Differential Categories SMC BP(EG ) biproduct completion Karoubi envelope G has the finite definability property, moreover... SMC EG Differential category K(BP(EG )) co-kleisli Category G full faithful functor Cart. differential K! (BP(EG )) CCC R-exponentials Giulio Manzonetto (RU) Differential Model Theory 11/06/11 32 / 35

92 Building Differential Categories Full Abstraction for Resource PCF EG QA : Arenas where each question enables a unique answer (Unique) Full Functor : EG QA 1 Giulio Manzonetto (RU) Differential Model Theory 11/06/11 33 / 35

93 Building Differential Categories Full Abstraction for Resource PCF G embeds in K! (BP((EG QA ) + )) by construction! (Unique) Full Functor Full Functor : EG QA 1 F : K! (BP((EG QA ) + )) K! (Rel) (lifted) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 33 / 35

94 Building Differential Categories Full Abstraction for Resource PCF (Unique) Full Functor Full Functor Full Functor : EG QA 1 F : K! (BP((EG QA ) + )) K! (Rel) F : G MRel (lifted) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 33 / 35

95 Building Differential Categories Full Abstraction for Resource PCF (Unique) Full Functor Full Functor Full Functor : EG QA 1 F : K! (BP((EG QA ) + )) K! (Rel) F : G MRel (lifted) Finite Definability Property Both G and MRel have the finite definability property. (def. G def. MRel ) Corollary: MRel is Fully Abstract for Resource PCF Let M, N of type A. M N [ C( ) C(M) C(N) ] Giulio Manzonetto (RU) Differential Model Theory 11/06/11 33 / 35

96 Building Differential Categories Full Abstraction for Resource PCF Finite Definability Property Both G and MRel have the finite definability property. (def. G def. MRel ) Corollary: MRel is Fully Abstract for Resource PCF Let M, N of type A. M N [ C( ) C(M) C(N) ] Proof (sketch) Suppose a M N, By finite definability {(a, 0)} : A Nat denotes some term x : A C(x), Hence C(M) = zero and C(N) =, Thus C(M) but C(N) Giulio Manzonetto (RU) Differential Model Theory 11/06/11 33 / 35

97 Conclusion Conclusions We have: Defined Cartesian closed differential categories, Shown they are sound and complete models of untyped differential λ-calculus, Provided a construction for building differential categories, Applied it to categories of games and categories of sets and relations, shown that MRel is fully abstract for Resource PCF. Giulio Manzonetto (RU) Differential Model Theory 11/06/11 34 / 35

98 Conclusion Thanks for your attention! Questions? Giulio Manzonetto (RU) Differential Model Theory 11/06/11 35 / 35

A Differential Model Theory for Resource Lambda Calculi - Part I

A Differential Model Theory for Resource Lambda Calculi - Part I A Differential Model Theory for Resource Lambda Calculi - Part I Giulio Manzonetto g.manzonetto@cs.ru.nl Intelligent Systems Radboud University Nijmegen FMCS 2011 - Calgary - 11 th June 2011 Giulio Manzonetto

More information

What is a Categorical Model of the Differential and the Resource λ-calculi?

What is a Categorical Model of the Differential and the Resource λ-calculi? What is a Categorical Model of the Differential and the Resource λ-calculi? Giulio Manzonetto a a Department of Computer Science, Radboud University, Nijmegen, The Netherlands Email: G.Manzonetto@cs.ru.nl

More information

Relational Graph Models, Taylor Expansion and Extensionality

Relational Graph Models, Taylor Expansion and Extensionality Relational Graph Models, Taylor Expansion and Extensionality Domenico Ruoppolo Giulio Manzonetto Laboratoire d Informatique de Paris Nord Université Paris-Nord Paris 13 (France) MFPS XXX Ithaca, New York

More information

Polymorphic Game Semantics for Dynamic Binding

Polymorphic Game Semantics for Dynamic Binding Polymorphic Game Semantics for Dynamic Binding J. Laird University of Bath, UK August 30, 2016 Goals Extend game semantics of generic polymorphism in three (related) directions: Dynamic Binding of terms

More information

Extraction from classical proofs using game models

Extraction from classical proofs using game models 1/16 Extraction from classical proofs using game models Valentin Blot University of Bath research funded by the UK EPSRC 2/16 The computational content of classical logic Griffin, 1990: Computational content

More information

FULL ABSTRACTION FOR THE RESOURCE LAMBDA CALCULUS WITH TESTS, THROUGH TAYLOR EXPANSION

FULL ABSTRACTION FOR THE RESOURCE LAMBDA CALCULUS WITH TESTS, THROUGH TAYLOR EXPANSION Logical Methods in Computer Science Vol. 8(3:3)2012, pp. 1 44 www.lmcs-online.org Submitted Feb. 29, 2012 Published Oct. 10, 2012 FULL ABSTRACTION FOR THE RESOURCE LAMBDA CALCULUS WITH TESTS, THROUGH TAYLOR

More information

Complete Partial Orders, PCF, and Control

Complete Partial Orders, PCF, and Control Complete Partial Orders, PCF, and Control Andrew R. Plummer TIE Report Draft January 2010 Abstract We develop the theory of directed complete partial orders and complete partial orders. We review the syntax

More information

CS 4110 Programming Languages & Logics. Lecture 16 Programming in the λ-calculus

CS 4110 Programming Languages & Logics. Lecture 16 Programming in the λ-calculus CS 4110 Programming Languages & Logics Lecture 16 Programming in the λ-calculus 30 September 2016 Review: Church Booleans 2 We can encode TRUE, FALSE, and IF, as: TRUE λx. λy. x FALSE λx. λy. y IF λb.

More information

A relational semantics for parallelism and non-determinism in a functional setting

A relational semantics for parallelism and non-determinism in a functional setting A relational semantics for parallelism and non-determinism in a functional setting Antonio Bucciarelli a, Thomas Ehrhard a, Giulio Manzonetto b,1 a Laboratoire PPS, Université Paris 7, 2, place Jussieu

More information

A Bird s Eye View on the Quantitative Semantics of Linear Logic

A Bird s Eye View on the Quantitative Semantics of Linear Logic A Bird s Eye View on the Quantitative Semantics of Linear Logic Michele Pagani Laboratoire d Informatique de Paris Nord Institut Galilèe Universitè de Paris 13 Villetaneuse, France michelepagani@lipnuniv-paris13fr

More information

Who am I, and why do research? A categorical description of the essential structure of differential calculus. Introduction (not too technical!

Who am I, and why do research? A categorical description of the essential structure of differential calculus. Introduction (not too technical! Who am I, and why do research? A categorical description of the essential structure of differential calculus R.A.G. Seely John Abbott College Research Day at John Abbott College, 17 April 2013 http://www.math.mcgill.ca/rags/

More information

Polarized Multigames. Furio Honsell 1, Marina Lenisa 1. Contents

Polarized Multigames. Furio Honsell 1, Marina Lenisa 1. Contents Under consideration for publication in Math. Struct. in Comp. Science Polarized Multigames Furio Honsell 1, Marina Lenisa 1 Dipartimento di Matematica e Informatica, Università di Udine, Italy furio.honsell@comune.udine.it,

More information

Topology in Denotational Semantics

Topology in Denotational Semantics Journées Topologie et Informatique Thomas Ehrhard Preuves, Programmes et Systèmes (PPS) Université Paris Diderot - Paris 7 and CNRS March 21, 2013 What is denotational semantics? The usual stateful approach

More information

Lambda Calculus, Linear Logic and Symbolic Computation

Lambda Calculus, Linear Logic and Symbolic Computation Lambda Calculus, Linear Logic and Symbolic Computation Habilitation à diriger des recherches Giulio Manzonetto giulio.manzonetto@lipn.univ-paris13.fr LIPN Université Paris Nord IRIF Université Paris Diderot

More information

Fully Abstract Models of the Probabilistic λ-calculus

Fully Abstract Models of the Probabilistic λ-calculus Fully Abstract Models of the Probabilistic λ-calculus Pierre Clairambault Univ Lyon, CNRS, ENS de Lyon, UCB Lyon 1, LIP, France pierre.clairambault@ens-lyon.fr Hugo Paquet Department of Computer Science

More information

Fully Abstract Models of the Probabilistic λ-calculus

Fully Abstract Models of the Probabilistic λ-calculus 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 Fully Abstract Models of the Probabilistic λ-calculus Pierre Clairambault Univ Lyon, CNRS, ENS de Lyon, UCB Lyon 1, LIP, France pierre.clairambault@ens-lyon.fr

More information

Sequents are written as A, where A; B represent formulae and ; represent multisets of formulae. Where represents the multiset A 1 ; : : : ; A n, then!

Sequents are written as A, where A; B represent formulae and ; represent multisets of formulae. Where represents the multiset A 1 ; : : : ; A n, then! What is a Categorical Model of ntuitionistic Linear Logic G.M. Bierman University of Cambridge Computer Laboratory Abstract. This paper re-addresses the old problem of providing a categorical model for

More information

An innocent model of linear logic

An innocent model of linear logic CTCS 2004 Preliminary Version Asynchronous games 3 An innocent model of linear logic Paul-André Melliès Equipe Preuves Programmes Systèmes CNRS et Université Denis Diderot Paris, France Abstract Since

More information

Categories of Coalgebraic Games with Selective Sum

Categories of Coalgebraic Games with Selective Sum Fundamenta Informaticae XX (2014) 1 20 1 DOI 10.3233/FI-2012-0000 IOS Press Categories of Coalgebraic Games with Selective Sum Furio Honsell Dipartimento di Matematica e Informatica, Università di Udine,

More information

ON THE CHARACTERIZATION OF MODELS OF H : THE SEMANTICAL ASPECT

ON THE CHARACTERIZATION OF MODELS OF H : THE SEMANTICAL ASPECT Logical Methods in Computer Science Vol. 12(1:4)2016, pp. 1 34 www.lmcs-online.org Submitted Jan. 13, 2014 Published Apr. 27, 2016 ON THE CHARACTERIZATION OF MODELS OF H : THE SEMANTICAL ASPECT FLAVIEN

More information

Models and theories of lambda calculus

Models and theories of lambda calculus Models and theories of lambda calculus Giulio Manzonetto To cite this version: Giulio Manzonetto. Models and theories of lambda calculus. [Research Report] 2009. HAL Id: inria-00380183

More information

n-dimensional Boolean algebras

n-dimensional Boolean algebras n-dimensional Boolean algebras Antonio Bucciarelli IRIF, Univ Paris Diderot joint work with Antonio Ledda, Francesco Paoli and Antonino Salibra Outline 1 Church algebras and the λ-calculus 2 n-dimensional

More information

Call-by-value non-determinism in a linear logic type discipline

Call-by-value non-determinism in a linear logic type discipline Call-by-value non-determinism in a linear logic type discipline Alejandro Díaz-Caro? Giulio Manzonetto Université Paris-Ouest & INRIA LIPN, Université Paris 13 Michele Pagani LIPN, Université Paris 13

More information

Connecting the categorical and the modal logic approaches to Quantum Mech

Connecting the categorical and the modal logic approaches to Quantum Mech Connecting the categorical and the modal logic approaches to Quantum Mechanics based on MSc thesis supervised by A. Baltag Institute for Logic, Language and Computation University of Amsterdam 30.11.2013

More information

Graph lambda theories

Graph lambda theories Under consideration for publication in Math. Struct. in Comp. Science Graph lambda theories A N T O N I O B U C C I A R E L L I 1 and A N T O N I N O S A L I B R A 2 1 Equipe PPS (case 7014), Université

More information

Asynchronous games 1: Uniformity by group invariance

Asynchronous games 1: Uniformity by group invariance synchronous games 1: Uniformity by group invariance Paul-ndré Melliès Équipe Preuves, Programmes, Systèmes CNRS, Université Paris 7 Received Ten years ago, bramsky, Jagadeesan,

More information

Resource lambda-calculus: the differential viewpoint

Resource lambda-calculus: the differential viewpoint Resource lambda-calculus: the differential viewpoint Preuves, Programmes et Systèmes (PPS) Université Paris Diderot and CNRS September 13, 2011 History ( 1985): Girard Girard had differential intuitions

More information

FROM COHERENT TO FINITENESS SPACES

FROM COHERENT TO FINITENESS SPACES FROM COHERENT TO FINITENESS SPACES PIERRE HYVERNAT Laboratoire de Mathématiques, Université de Savoie, 73376 Le Bourget-du-Lac Cedex, France. e-mail address: Pierre.Hyvernat@univ-savoie.fr Abstract. This

More information

Advanced Lambda Calculus. Henk Barendregt & Giulio Manzonetto ICIS Faculty of Science Radboud University Nijmegen, The Netherlands

Advanced Lambda Calculus. Henk Barendregt & Giulio Manzonetto ICIS Faculty of Science Radboud University Nijmegen, The Netherlands Advanced Lambda Calculus Henk Barendregt & Giulio Manzonetto ICIS Faculty of Science Radboud University Nijmegen, The Netherlands Form of the course Ordinary lecture Seminar form Exam: working out an exercise

More information

UNIVERSITY OF CALGARY. What is a Differential Partial Combinatory Algebra? Jonathan Gallagher A THESIS SUBMITTED TO THE FACULTY OF GRADUATE STUDIES

UNIVERSITY OF CALGARY. What is a Differential Partial Combinatory Algebra? Jonathan Gallagher A THESIS SUBMITTED TO THE FACULTY OF GRADUATE STUDIES UNIVERSITY OF CALGARY What is a Differential Partial Combinatory Algebra? by Jonathan Gallagher A THESIS SUBMITTED TO THE FACULTY OF GRADUATE STUDIES IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE

More information

A Concrete Representation of Observational Equivalence for PCF

A Concrete Representation of Observational Equivalence for PCF A of Observational Equivalence for PCF Martin Churchill, Jim Laird and Guy McCusker University of Bath March 28th, 2009 GaLoP workshop, University of York Martin Churchill, Jim Laird and Guy McCusker University

More information

Discrete Random Variables Over Domains

Discrete Random Variables Over Domains Theoretical Computer Sceince, to appear Discrete Random Variables Over Domains Michael Mislove 1 Department of Mathematics Tulane University New Orleans, LA 70118 Abstract In this paper we initiate the

More information

From parametric polymorphism to models of polymorphic FPC

From parametric polymorphism to models of polymorphic FPC Under consideration for publication in Math. Struct. in Comp. Science From parametric polymorphism to models of polymorphic FPC Rasmus Ejlers Møgelberg IT University of Copenhagen Rued Langgaards Vej 7

More information

The Scott model of Linear Logic is the extensional collapse of its relational model

The Scott model of Linear Logic is the extensional collapse of its relational model The Scott model of Linear Logic is the extensional collapse of its relational model Thomas Ehrhard CNRS, PPS, UMR 7126, Univ Paris Diderot, Sorbonne Paris Cité F-75205 Paris, France September 26, 2011

More information

Homological Algebra and Differential Linear Logic

Homological Algebra and Differential Linear Logic Homological Algebra and Differential Linear Logic Richard Blute University of Ottawa Ongoing discussions with Robin Cockett, Geoff Cruttwell, Keith O Neill, Christine Tasson, Trevor Wares February 24,

More information

Weighted relational models of typed lambda-calculi

Weighted relational models of typed lambda-calculi Weighted relational models of typed lambda-calculi Jim Laird, Giulio Manzonetto, Guy McCusker and Michele Pagani, Department of Computer Science, University of ath, ath, A2 7AY, UK Université Paris 3,

More information

Weighted relational models of typed lambda-calculi

Weighted relational models of typed lambda-calculi Weighted relational models of typed lambda-calculi Jim Laird, Giulio Manzonetto, Guy McCusker and Michele Pagani, Department of Computer Science, University of ath, ath, A2 7AY, UK Université Paris 3,

More information

Interpreting the Second-Order Lambda Calculus using Qualitative Domains

Interpreting the Second-Order Lambda Calculus using Qualitative Domains Department of Mathematics Bachelor Thesis Interpreting the Second-Order Lambda Calculus using Qualitative Domains Author: Anton Golov Supervisor: Dr. Jaap van Oosten September 2014-July 2015 Contents 1

More information

Domain theory and denotational semantics of functional programming

Domain theory and denotational semantics of functional programming Domain theory and denotational semantics of functional programming Martín Escardó School of Computer Science, Birmingham University MGS 2007, Nottingham, version of April 20, 2007 17:26 What is denotational

More information

Modèles des langages de programmation Domaines, catégories, jeux. Programme de cette seconde séance:

Modèles des langages de programmation Domaines, catégories, jeux. Programme de cette seconde séance: Modèles des langages de programmation Domaines, catégories, jeux Programme de cette seconde séance: Modèle ensembliste du lambda-calcul ; Catégories cartésiennes fermées 1 Synopsis 1 the simply-typed λ-calculus,

More information

Categories, Proofs and Programs

Categories, Proofs and Programs Categories, Proofs and Programs Samson Abramsky and Nikos Tzevelekos Lecture 4: Curry-Howard Correspondence and Cartesian Closed Categories In A Nutshell Logic Computation 555555555555555555 5 Categories

More information

EasyChair Preprint. Normalization and Taylor expansion of lambda-terms

EasyChair Preprint. Normalization and Taylor expansion of lambda-terms EasyChair Preprint 165 Normalization and Taylor expansion of lambda-terms Federico Olimpieri EasyChair preprints are intended for rapid dissemination of research results and are integrated with the rest

More information

A completeness theorem for symmetric product phase spaces

A completeness theorem for symmetric product phase spaces A completeness theorem for symmetric product phase spaces Thomas Ehrhard Fédération de Recherche des Unités de Mathématiques de Marseille CNRS FR 2291 Institut de Mathématiques de Luminy CNRS UPR 9016

More information

Note on models of polarised intuitionistic logic

Note on models of polarised intuitionistic logic Note on models of polarised intuitionistic logic Guillaume Munch-Maccagnoni Team Gallinette, Inria Bretagne Atlantique, Univ. Nantes, LS2N, Nantes, France Guillaume.Munch-Maccagnoni@Inria.fr 3rd June 2017

More information

Higher Order Containers

Higher Order Containers Higher Order Containers Thorsten Altenkirch 1, Paul Levy 2, and Sam Staton 3 1 University of Nottingham 2 University of Birmingham 3 University of Cambridge Abstract. Containers are a semantic way to talk

More information

The Minimal Graph Model of Lambda Calculus

The Minimal Graph Model of Lambda Calculus The Minimal Graph Model of Lambda Calculus Antonio Bucciarelli 1 and Antonino Salibra 2 1 Université Paris 7, Equipe PPS, 2 place Jussieu, 72251 Paris Cedex 05, France buccia@pps.jussieu.fr, 2 Università

More information

A Linear/Producer/Consumer model of Classical Linear Logic

A Linear/Producer/Consumer model of Classical Linear Logic A Linear/Producer/Consumer model of Classical Linear Logic Jennifer Paykin Steve Zdancewic February 14, 2014 Abstract This paper defines a new proof- and category-theoretic framework for classical linear

More information

Symbol Index Group GermAnal Ring AbMonoid

Symbol Index Group GermAnal Ring AbMonoid Symbol Index 409 Symbol Index Symbols of standard and uncontroversial usage are generally not included here. As in the word index, boldface page-numbers indicate pages where definitions are given. If a

More information

Towards a Flowchart Diagrammatic Language for Monad-based Semantics

Towards a Flowchart Diagrammatic Language for Monad-based Semantics Towards a Flowchart Diagrammatic Language or Monad-based Semantics Julian Jakob Friedrich-Alexander-Universität Erlangen-Nürnberg julian.jakob@au.de 21.06.2016 Introductory Examples 1 2 + 3 3 9 36 4 while

More information

Pierre Clairambault 1

Pierre Clairambault 1 Theoretical Informatics and Applications Informatique Théorique et Applications Will be set by the publisher STRONG FUNCTORS AND INTERLEAVING FIXPOINTS IN GAME SEMANTICS Pierre Clairambault 1 Abstract.

More information

CARTESIAN DIFFERENTIAL CATEGORIES

CARTESIAN DIFFERENTIAL CATEGORIES Theory and Applications o Categories, Vol. 22, No. 23, 2009, pp. 622 672. CARTESIAN DIFFERENTIAL CATEGORIES R.F. BLUTE, J.R.B. COCKETT AND R.A.G. SEELY Abstract. This paper revisits the authors notion

More information

Alberto Carraro 1, 2 and Antonino Salibra 1

Alberto Carraro 1, 2 and Antonino Salibra 1 Theoretical Informatics and Applications Informatique Théorique et Applications Will be set by the publisher EASY LAMBDA-TERMS ARE NOT ALWAYS SIMPLE Alberto Carraro 1, 2 and Antonino Salibra 1 Abstract.

More information

Categorical axioms for functional real-number computation

Categorical axioms for functional real-number computation Categorical axioms for functional real-number computation Parts 1 & 2 Martín Escardó University of Birmingham, England Joint work with Alex Simpson, University of Edinburgh, Scotland MAP, Leiden, 28 Nov

More information

Monads and More: Part 4

Monads and More: Part 4 Monads and More: Part 4 Tarmo Uustalu, Tallinn Nottingham, 14-18 May 2007 Coeffectful computation and comonads For coeffectful notions of computation, we have a comonad (D, ε, δ) on the base category C

More information

1 The Hyland-Schalke functor G Rel. 2 Weakenings

1 The Hyland-Schalke functor G Rel. 2 Weakenings 1 The Hyland-Schalke functor G Rel Let G denote an appropriate category of games and strategies, and let Rel denote the category of sets and relations. It is known (Hyland, Schalke, 1996) that the following

More information

Denotational semantics of linear logic

Denotational semantics of linear logic Denotational semantics of linear logic Lionel Vaux I2M, Université d Aix-Marseille, France LL2016, Lyon school: 7 and 8 November 2016 L. Vaux (I2M) Denotational semantics of linear logic LL2016 1 / 31

More information

Full abstraction for nominal exceptions and general references

Full abstraction for nominal exceptions and general references Full abstraction for nominal exceptions and general references Nikos Tzevelekos Oxford University N.Tzevelekos GALOP 08 1 Summary Summary Nominal games Further directions Semantics of nominal computation.

More information

ABSTRACT DIFFERENTIAL GEOMETRY VIA SHEAF THEORY

ABSTRACT DIFFERENTIAL GEOMETRY VIA SHEAF THEORY ABSTRACT DIFFERENTIAL GEOMETRY VIA SHEAF THEORY ARDA H. DEMIRHAN Abstract. We examine the conditions for uniqueness of differentials in the abstract setting of differential geometry. Then we ll come up

More information

Reconsidering MacLane. Peter M. Hines

Reconsidering MacLane. Peter M. Hines Reconsidering MacLane Coherence for associativity in infinitary and untyped settings Peter M. Hines Oxford March 2013 Topic of the talk: Pure category theory... for its own sake. This talk is about the

More information

Locally cartesian closed categories

Locally cartesian closed categories Locally cartesian closed categories Clive Newstead 80-814 Categorical Logic, Carnegie Mellon University Wednesday 1st March 2017 Abstract Cartesian closed categories provide a natural setting for the interpretation

More information

MFPS LICS Special Session Honouring Dana Scott. Symmetric Scott. Andrew Pitts. Computer Laboratory MFPS/LICS /14

MFPS LICS Special Session Honouring Dana Scott. Symmetric Scott. Andrew Pitts. Computer Laboratory MFPS/LICS /14 MFPS/LICS 2013 1/14 MFPS LICS Special Session Honouring Dana Scott Symmetric Scott Andrew Pitts Computer Laboratory 80 years of Dana Scott MFPS/LICS 2013 2/14 automata theory set theory sheaves & logic

More information

OPERAD BIMODULE CHARACTERIZATION OF ENRICHMENT. V2

OPERAD BIMODULE CHARACTERIZATION OF ENRICHMENT. V2 OPERAD BIMODULE CHARACTERIZATION OF ENRICHMENT. 2 STEFAN FORCEY 1. Idea In a recent talk at CT06 http://faculty.tnstate.edu/sforcey/ct06.htm and in a research proposal at http://faculty.tnstate.edu/sforcey/class_home/research.htm

More information

Full Abstraction for Resource Calculus with Tests

Full Abstraction for Resource Calculus with Tests Full Abstraction for Resource Calculus with Tests Antonio Bucciarelli 1, Alberto Carraro 1,3, Thomas Ehrhard 1, and Giulio Manzonetto 2 1 Laboratoire PPS, CNRS, Université Paris-Diderot, Paris, France

More information

The lambda calculus with constructors

The lambda calculus with constructors The lambda calculus with constructors Categorical semantic and Continuations Barbara Petit Focus - Univ. Bologna CaCos 2012 Barbara Petit (Focus - Univ. Bologna) The lambda calculus with constructors 1

More information

Denoting computation

Denoting computation A jog from Scott Domains to Hypercoherence Spaces 13/12/2006 Outline Motivation 1 Motivation 2 What Does Denotational Semantic Mean? Trivial examples Basic things to know 3 Scott domains di-domains 4 Event

More information

A categorical model for a quantum circuit description language

A categorical model for a quantum circuit description language A categorical model for a quantum circuit description language Francisco Rios (joint work with Peter Selinger) Department of Mathematics and Statistics Dalhousie University CT July 16th 22th, 2017 What

More information

Categories and Functors (Lecture Notes for Midlands Graduate School, 2013) Uday S. Reddy The University of Birmingham

Categories and Functors (Lecture Notes for Midlands Graduate School, 2013) Uday S. Reddy The University of Birmingham Categories and Functors (Lecture Notes for Midlands Graduate School, 2013) Uday S. Reddy The University of Birmingham April 7, 2013 2 Contents 1 Categories 5 1.1 Categories with and without elements.......................

More information

Linear Realizability and Full Completeness for Typed Lambda-calculi

Linear Realizability and Full Completeness for Typed Lambda-calculi Linear Realizability and Full Completeness for Typed Lambda-calculi Samson Abramsky Oxford University Computing Laboratory, Wolfson Building, Parks Road, OX1 3QD, England, tel. +44 (0)1865 283558, fax:

More information

GAME THEORETIC ANALYSIS OF CALL-BY-VALUE COMPUTATION

GAME THEORETIC ANALYSIS OF CALL-BY-VALUE COMPUTATION GME THEORETIC NLYSIS OF CLL-BY-VLUE COMPUTTION KOHEI HOND NOBUKO YOSHID bstract. We present a general semantic universe of call-by-value computation based on elements of game semantics, and validate its

More information

Games on Graphs and Sequentially Realizable Functionals Extended Abstract

Games on Graphs and Sequentially Realizable Functionals Extended Abstract Games on Graphs and Sequentially Realizable Functionals Extended Abstract Martin Hyland DPMMS Centre for Mathematical Sciences Wilberforce Road, Cambridge, CB3 0WB, UK M.Hyland@dpmms.cam.ac.uk Andrea Schalk

More information

Universal Algebra for Logics

Universal Algebra for Logics Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic

More information

About Typed Algebraic Lambda-calculi

About Typed Algebraic Lambda-calculi About Typed Algebraic Lambda-calculi Benoît Valiron INRIA Saclay/LIX Palaiseau, France valiron@lix.polytechnique.fr Abstract Arrighi and Dowek (2008) introduce an untyped lambdacalculus together with a

More information

A Terminating and Confluent Linear Lambda Calculus

A Terminating and Confluent Linear Lambda Calculus A Terminating and Confluent Linear Lambda Calculus Yo Ohta and Masahito Hasegawa Research Institute for Mathematical Sciences, Kyoto University Kyoto 606-8502, Japan Abstract. We present a rewriting system

More information

Endomorphism Semialgebras in Categorical Quantum Mechanics

Endomorphism Semialgebras in Categorical Quantum Mechanics Endomorphism Semialgebras in Categorical Quantum Mechanics Kevin Dunne University of Strathclyde November 2016 Symmetric Monoidal Categories Definition A strict symmetric monoidal category (A,, I ) consists

More information

RELATIONAL GRAPH MODELS AT WORK

RELATIONAL GRAPH MODELS AT WORK RELATIONAL GRAPH MODELS AT WORK FLAVIEN BREUVART, GIULIO MANZONETTO, AND DOMENICO RUOPPOLO Université Paris 13, Laboratoire LIPN, CNRS UMR 7030, France e-mail address: {flavien.breuvart,giulio.manzonetto,domenico.ruoppolo}@lipn.univ-paris13.fr

More information

Category Theory for Linear Logicians

Category Theory for Linear Logicians Category Theory for Linear Logicians Richard Blute Philip Scott September 10, 2003 Abstract This paper presents an introduction to category theory with an emphasis on those aspects relevant to the analysis

More information

Categorical coherence in the untyped setting. Peter M. Hines

Categorical coherence in the untyped setting. Peter M. Hines Categorical coherence in the untyped setting Peter M. Hines SamsonFest Oxford May 2013 The Untyped Setting Untyped categories Categories with only one object (i.e. monoids) with additional categorical

More information

An introduction to partial lambda algebras

An introduction to partial lambda algebras An introduction to partial lambda algebras J.R.B. Cockett and P.J.W. Hofstra Department of Computer Science, University of Calgary, Calgary, T2N 1N4, Alberta, Canada February 1, 2007 Partially supported

More information

Sequential algorithms and strongly stable functions

Sequential algorithms and strongly stable functions Sequential algorithms and strongly stable functions Paul-André Melliès 1 Abstract Intuitionistic proofs (or PCF programs) may be interpreted as functions between domains, or as strategies on games. The

More information

A Graph Theoretic Perspective on CPM(Rel)

A Graph Theoretic Perspective on CPM(Rel) A Graph Theoretic Perspective on CPM(Rel) Daniel Marsden Mixed states are of interest in quantum mechanics for modelling partial information. More recently categorical approaches to linguistics have also

More information

Monads and Adjunctions for Global Exceptions

Monads and Adjunctions for Global Exceptions MFPS 2006 Monads and Adjunctions for Global Exceptions Paul Blain Levy 1 School of Computer Science University of Birmingham Birmingham B15 2TT, U.K. Abstract In this paper, we look at two categorical

More information

Logic for Computational Effects: work in progress

Logic for Computational Effects: work in progress 1 Logic for Computational Effects: work in progress Gordon Plotkin and John Power School of Informatics University of Edinburgh King s Buildings Mayfield Road Edinburgh EH9 3JZ Scotland gdp@inf.ed.ac.uk,

More information

Serre A -functors. Oleksandr Manzyuk. joint work with Volodymyr Lyubashenko. math.ct/ Notation. 1. Preliminaries on A -categories

Serre A -functors. Oleksandr Manzyuk. joint work with Volodymyr Lyubashenko. math.ct/ Notation. 1. Preliminaries on A -categories Serre A -functors Oleksandr Manzyuk joint work with Volodymyr Lyubashenko math.ct/0701165 0. Notation 1. Preliminaries on A -categories 2. Serre functors 3. Serre A -functors 0. Notation k denotes a (ground)

More information

Operational Theories and Categorical Quantum Mechanics

Operational Theories and Categorical Quantum Mechanics Operational Theories and Categorical Quantum Mechanics Samson Abramsky and Chris Heunen Department of Computer Science University of Oxford June 7, 2013 Abstract A central theme in current work in quantum

More information

Primitive recursion in niteness spaces

Primitive recursion in niteness spaces Primitive recursion in niteness spaces Lionel Vaux Laboratoire de Mathématiques de l'université de Savoie UFR SF, Campus Scientique, 73376 Le Bourget-du-Lac Cedex, France E-mail: lionel.vaux@univ-savoie.fr

More information

2-DIMENSIONAL TOPOLOGICAL QUANTUM FIELD THEORIES AND FROBENIUS ALGEBRAS. Contents 1. The main theorem 1

2-DIMENSIONAL TOPOLOGICAL QUANTUM FIELD THEORIES AND FROBENIUS ALGEBRAS. Contents 1. The main theorem 1 2-DIMENSIONL TOPOLOGICL QUNTUM FIELD THEORIES ND FROBENIUS LGEBRS CROLINE TERRY bstract. Category theory provides a more abstract and thus more general setting for considering the structure of mathematical

More information

Algebras and Bialgebras

Algebras and Bialgebras Algebras and Bialgebras via categories with distinguished objects Vaughan Pratt Stanford University October 9, 2016 AMS Fall Western Sectional Meeting University of Denver, CO Vaughan Pratt (Stanford University)

More information

1 Categorical Background

1 Categorical Background 1 Categorical Background 1.1 Categories and Functors Definition 1.1.1 A category C is given by a class of objects, often denoted by ob C, and for any two objects A, B of C a proper set of morphisms C(A,

More information

Relational semantics for a fragment of linear logic

Relational semantics for a fragment of linear logic Relational semantics for a fragment of linear logic Dion Coumans March 4, 2011 Abstract Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic.

More information

Lambda Calculus: Models and Theories

Lambda Calculus: Models and Theories Lambda Calculus: Models and Theories Antonino Salibra Dipartimento di Informatica Università Ca Foscari di Venezia Via Torino 155, 30172 Venezia, Italy salibra@dsi.unive.it Abstract In this paper we give

More information

Simply Typed λ-calculus

Simply Typed λ-calculus Simply Typed λ-calculus Lecture 1 Jeremy Dawson The Australian National University Semester 2, 2017 Jeremy Dawson (ANU) COMP4630,Lecture 1 Semester 2, 2017 1 / 23 A Brief History of Type Theory First developed

More information

On the Semantics of Parsing Actions

On the Semantics of Parsing Actions On the Semantics of Parsing Actions Hayo Thielecke School of Computer Science University of Birmingham Birmingham B15 2TT, United Kingdom Abstract Parsers, whether constructed by hand or automatically

More information

Join Inverse Categories and Reversible Recursion

Join Inverse Categories and Reversible Recursion Join Inverse Categories and Reversible Recursion Robin Kaarsgaard a,, Holger Bock Axelsen a, Robert Glück a a DIKU, Department of Computer Science, University of Copenhagen Abstract Recently, a number

More information

Categorical techniques for NC geometry and gravity

Categorical techniques for NC geometry and gravity Categorical techniques for NC geometry and gravity Towards homotopical algebraic quantum field theory lexander Schenkel lexander Schenkel School of Mathematical Sciences, University of Nottingham School

More information

CS611 Lecture 25 Solving Domain Equations 22 October 2007 Lecturer: Andrew Myers

CS611 Lecture 25 Solving Domain Equations 22 October 2007 Lecturer: Andrew Myers CS611 Lecture 25 Solving Domain Equations 22 October 2007 Lecturer: Andrew Myers To develop a denotational semantics for a language with recursive types, or to give a denotational semantics for the untyped

More information

Handbook of Logic and Proof Techniques for Computer Science

Handbook of Logic and Proof Techniques for Computer Science Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives

More information

A Game Semantics of Local Names and Good Variables. Jim Laird University of Sussex,UK

A Game Semantics of Local Names and Good Variables. Jim Laird University of Sussex,UK A Game Semantics of Local Names and Good Variables Jim Laird University of Sussex,UK 1 Background Game semantics provides attractive models of higher-order functions, and features with locally declared

More information

Internship Report Game Semantics and Normalization by Evaluation for Brouwer Ordinals

Internship Report Game Semantics and Normalization by Evaluation for Brouwer Ordinals Internship Report Game Semantics and Normalization by Evaluation for Brouwer Ordinals Léo Exibard August 28, 2015 Abstract P. Clairambault and P. Dybjer developed a Normalization by Evaluation (NbE) algorithm

More information

Graph models for the untyped λ-calculus

Graph models for the untyped λ-calculus Graph models for the untyped λ-calculus Kelley Philip van Evert On the cover: a picture I drew of Dana Scott. Graph models for the untyped λ-calculus Kelley Philip van Evert 4046854 Bachelor s thesis in

More information

Scott Domains for Denotational Semantics and Program Extraction

Scott Domains for Denotational Semantics and Program Extraction Scott Domains for Denotational Semantics and Program Extraction Ulrich Berger Swansea University Workshop Domains Oxford, 7-8 July 2018 1 / 46 Overview 1. Domains 2. Computability 3. Denotational semantics

More information