• Nem Talált Eredményt

On Models of General Type-Theoretical Languages

N/A
N/A
Protected

Academic year: 2022

Ossza meg "On Models of General Type-Theoretical Languages"

Copied!
13
0
0

Teljes szövegt

(1)

On Models of General Type-Theoretical Languages

2010-4.indd 27

2010-4.indd 27 2011.01.21. 13:05:362011.01.21. 13:05:36

(2)

C C

C

C C

o o

o

o

2010-4.indd 28

2010-4.indd 28 2011.01.21. 13:05:372011.01.21. 13:05:37

(3)

P T

o∈P T T Y P EP T P T ⊆T Y P EP T

α, β ∈T Y P EP T ⇒ α, β ∈T Y P EP T o

α, β α

β

α β

L=LC, V ar, Con, Cat

LC LC={λ,(,)}

V ar = ∪α∈T Y P EP TV ar(α) V ar(α)

V ar(α) α

2010-4.indd 29

2010-4.indd 29 2011.01.21. 13:05:382011.01.21. 13:05:38

(4)

Con=∪α∈T Y P EP TCon(α) Con(α) Cat=∪α∈T Y P EP TCat(α) Cat(α)

V ar(α)∪Con(α)⊆Cat(α)

C∈Cat(α, β) B∈Cat(α)⇒‘C(B) ∈Cat(β) A∈Cat(β) τ ∈V ar(α)⇒‘(λτ A) ∈Cat(α, β)

F DomF(γ)γ∈T Y P EP T

γ∈P T DomF(γ)

DomF(α, β) =DomF(β)DomF(α) α, β ∈T Y P EP T P F

DomP F(γ)γ∈T Y P EP T

γ ∈P T DomP F(γ)

Θγ γ DomP F(γ)\ {Θγ} =∅

DomP F(α, β) = DomP F(β)DomP F(α) α, β ∈T Y P EP T

Θα,β = g g ∈ DomP F(α, β) g(u) = Θβ u ∈

DomP F(α)

M G G, , v

G

, v Con V ar

a∈Con(α) (a)∈DomG(α) τ ∈V ar(α) v(τ)∈DomG(α)

M G G

Con L

Con

Cat L Cat(α) α

LT Y P EP T)

v

2010-4.indd 30

2010-4.indd 30 2011.01.21. 13:05:392011.01.21. 13:05:39

(5)

M =F, , v F

DomM(α) =DomF(α). P M =P F, , v P F

DomP M(α) =DomP F(α)\ {Θα}.

M (=G, , v) ξ ∈V ar(γ) u∈DomG(γ) Mξu(=G, , v[ξ :u]) M v[ξ :u](ξ) =u

M(=G, , v) A

α [[A]]M

a∈Con(γ) [[a]]M =(a) ξ∈V ar(γ) [[ξ]]M =v(ξ)

A∈Cat(α, β) B ∈Cat(α) [[A(B)]]M = [[A]]M([[B]]M) A β ξ ∈V ar(α) [[λξA]]M =g g

DomG(α) DomG(β) g(u) = [[A]]Mτu

u∈DomG(α)

M A∈Cat(α) [[A]]M ∈DomM(α) M [[A]]M ∈DomM(α)∪ {Θα}

M A

M A∈CatMmf A∈Cat(α) α [[A]]M ∈DomM(α)

M A∈ Cat

A ∈ Cat M1 = G, , v1 M2 = G, , v2

L G

v1(τ) =v2(τ) τ ∈V(A) [[A]]M1 = [[A]]M2

A∈Cat [[A]]M v

[[A]]M = [[A]]Mτu τ ∈V ar(γ) u∈DomF(γ)

V(A) A

2010-4.indd 31

2010-4.indd 31 2011.01.21. 13:05:402011.01.21. 13:05:40

(6)

M L M

A, B, C(A, B, C ∈Cat) τ (τ ∈V ar) (λτ C)(A),(λτ C)(B)∈CatMmf

[[A]]M = [[B]]M ⇒[[(λτ C)(A)]]M = [[(λτ C)(B)]]M

A∈Cat B, C∈Cat(γ) M L [[B]]M = [[C]]M ⇒[[A]]M = [[A[C↓B]]]M.

M L M

B τ A M

[[B]]M =u [[ABτ]]M = [[A]]Mτu.

A∈Cat τ ∈V ar(β) B ∈Cat(β) B τ A [[(λτ A)(B)]]M = [[ABτ]]M

M

A Cat B, C Cat(γ) A[CB] (∈ Cat)

λ B C

2010-4.indd 32

2010-4.indd 32 2011.01.21. 13:05:412011.01.21. 13:05:41

(7)

L(=LC, V ar, Con, Cat) M(=G, , v)

≈ Cat(⊆Cat) ≈

L Cat

L ∼=L L

A∼=LB γ A, B∈Cat(γ)

M ≈M L

CatMmf A≈MB ⇔[[A]]M = [[B]]M

M

Mc L {A : A ∈ Cat, A } ∩CatMmf A≈McB ⇔[[A]]M = [[B]]M

≈ L M L ≈M

L

L ∼=L

ML

M1 M2 L

M1M2M1cM2c

≈ ≈ L ≈ ≈

A, B(∈Cat) A≈B ⇔A≈B

≈ ≈ L ≈

A, B(∈Cat) A≈B ⇔A≈B

M1, M2 L

M1M2

M1, M2 L M1 M2

M1, M2 L M1 M2

M (=G, , v) L τ ∈V ar(γ) u∈DomG M Mτu

M1, M2 L M1, M2

2010-4.indd 33

2010-4.indd 33 2011.01.21. 13:05:422011.01.21. 13:05:42

(8)

M1, M2 L M1, M2 M1, M2

P F P Ft

P F P Ft

P F DomtP F(γ)γ∈T Y P EP T

γ ∈P T DomtP F(γ) =DomP F(γ)\ {Θγ} γ =α, β DomtP F(γ)⊆DomP F(γ)

f ∈DomtP F(α, β)f(u)∈DomtP F(β) u∈DomtP F(α) f(u) = Θβ

DomtF

F DomtF(γ) =DomF(γ) γ∈T Y P EP T M(=G, , v) DomtM(γ) =DomtG(γ)

γ ∈T Y P EP T

A γ M [[A]]M

DomtM(γ)

A

M L A A ∈ Con(γ) γ ∈P T A∈CatMmf [[A]]M ∈DomtM(γ)

A∈Cat(α, β) B ∈Cat(α) M A(B) M

≈,≈ L ≈

≈ ≈

M1, M2 L M2 M1

M1 [[A]]M2 = [[A]]M1 A∈CatMmf1

M1, M2 L M2≥M1M2⊇≈M1

M2≥M1 M2 M1

M1 M2

M1 M2 L M2≥M1 M1≥M2

M2 M1 M2≥M1 M2 M1 M1

2010-4.indd 34

2010-4.indd 34 2011.01.21. 13:05:422011.01.21. 13:05:42

(9)

M L

M M M M M

M M M M

M L

L M L A, B

A, B ∈ Cat

A, B M

M A∼MB C (∈Cat)

τ (∈V ar)

(λτ C)(A)∈CatMmf ⇔(λτ C)(B)∈CatMmf.

M L ∼M

Cat

A∼MB ⇒A∼=LB ∼=L⊇∼M M L

A, B

M A, B∈Cat\CatMmf A∼MB⇔A∼=LB

2010-4.indd 35

2010-4.indd 35 2011.01.21. 13:05:432011.01.21. 13:05:43

(10)

M L

C τ (λτ C)(A) (λτ C)(B)

A B M

M L

M L

M ∼=LM ∼=L

L

M L ∼M ∼=L

M ∼=L

M L M

M

M1, M2 M1M1

M2 A≈M1B ⇒A∼M2B A, B∈Cat

M L M

A≈MB⇒A∼MB A, B∈Cat

M (= G, , v) L M (=

G, , v) v

M M

M

2010-4.indd 36

2010-4.indd 36 2011.01.21. 13:05:442011.01.21. 13:05:44

(11)

M

M M

M L A≈MB (A, B ∈

Cat) A∼=LB γ ∈T Y P EP T A, B∈Cat(γ) M L ∼=L⊇≈M ML≥M M1, M2 L M1 M2

ML

M L M

∼=L⊇≈M ML≥M

M L M

∼=L⊇≈M ML ≥M

A, B, C ∈ Cat M L

[[B]]M = [[C]]M ⇒[[A]]M = [[A[C↓B]]]M.

A, B, C∈ Cat

[[B]]M = [[C]]M ⇒[[A]]M = [[A[C↓B]]]M,

M L

M

B, C ∈Cat B≈MC([[B]]M = [[C]]M) BMC D∈Cat, τ ∈V ar (λτ D)(B)∈CatMmf (λτ D)(C) ∈/ CatMmf

B, C ∈Cat(γ) γ ∈T Y P EP T [[(λτ D)(B)]]M = [[(λτ D)(C)]]M α, β ∈ T Y P EP T α = β B ∈Cat(α), C ∈Cat(β) A= (λξξ)(B) ξ∈V ar(α) A ∈Cat

A[C↓B]∈/Cat [[A]]M = [[A[C↓B]]]M

2010-4.indd 37

2010-4.indd 37 2011.01.21. 13:05:452011.01.21. 13:05:45

(12)

M L A, B, C∈ Cat

[[B]]M = [[C]]M ⇒[[A]]M = [[A[C↓B]]]M.

M L M L

M L ∼=L⊇≈M

M L

DomM(γ) (γ ∈P T)

DomM(γ) (γ ∈ P T) DomM(γ) (γ ∈ T Y P EP T) M (= G, , v)

DomM(γ) (γ ∈ T Y P EP T)

M u

u ∈ DomM(α)∩DomM(β) α = β τ1 ∈ V ar(α) τ2 ∈ V ar(β) v v1) = u = v2) M = G, , v

[[τ1]]M = [[τ2]]M τ1 L τ2 M

M

M L

DomM(γ) (γ ∈T Y P EP T) M

A≈MB AMB A, B ∈CatMmf A L B α, β ∈ T Y P EP T A ∈ Cat(α) B ∈ Cat(β) α = β [[A]]M ∈ DomM(α) [[B]]M ∈DomM(β) [[A]]M = [[B]]M DomM(α)∩DomM(β)=∅

G DomG(γ) (γ∈P T)

M M L

2010-4.indd 38

2010-4.indd 38 2011.01.21. 13:05:462011.01.21. 13:05:46

(13)

ML ∼=L

∼=L

M

M M ≥M

ML M

ML ≥M

M M ≥M

ML ≥ M ML ≥ M A≈M B

A∼=LB γ ∈ T Y P EP T A, B ∈ Cat(γ)

(λτ C)(A)∈Cat (λτ C)(B)∈Cat C∈Cat τ ∈V ar

[[(λτ C)(A)]]M = [[(λτ C)(B)]]M

(λτ C)(A)∈CatMmf ⇔(λτ C)(B)∈CatMmf A∼MB

2010-4.indd 39

2010-4.indd 39 2011.01.21. 13:05:462011.01.21. 13:05:46

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

The Gravitational Physics Research Group of Wigner RCP of the HAS conducts research on various fields including theoretical field theory, numerical and post-Newtonian general

When monolingual models are available (currently only et, fi, hu), these perform better on their native lan- guage, but in general they transfer worse than multilingual models or

Entity boundaries, as in the motivating example of household resolution, might be fuzzy. A person may for example move from the parents and therefore belong to multiple

Based on the flow type, domain-specific visual languages can be grouped into three subclasses: data flow languages, control flow languages and languages with no flow.. Data

Keywords: polynomial inequalities, set on the unit circle, Riesz–Bernstein inequality, normal derivatives of Green’s functions AMS Classification 42A05.. For a comprehensive history

In the present paper the general field theoretical examination of the field of transmission lines is presented, in the course of which it will be clarified, in the

Since document and directory languages are modal logics over document and directory models, the working mechanism of the engine is based on the different variations of model

We prove the global asymptotic stability of the disease-free and the endemic equilibrium for general SIR and SIRS models with nonlinear incidence.. Instead of the popular