The Fortress Language Specification - CiteSeerX

Bound of type: bound ∆ (τ) = σ
bound ∆ (α) = ∆(α)
bound ∆ (σ) = σ
One owner for all the visible methods: p ⊢ oneOwner(C)
[ONEOWNER]
∀f ∈ visible p (C) . f only occurs once in visible p (C)
p ⊢ oneOwner(C)
Auxiliary functions for methods: defined p / inherited p / visible p (C) = { −→ f }
defined p (C) = { −−−−−−−→ Fname(fd)} where C −→ fd ∈ p
inherited p (C) = ⊎ N i ∈{ −→ N } {f i | f i ∈ visible p (N i ), f i ∉ defined p (C)} where C extends { −→ N } ∈ p
visible p (C) = defined p (C) ⊎ inherited p (C)
Figure A.5: Static Semantics of Basic Core Fortress (III)
A.2 Core Fortress with Where Clauses
In this section, we define a Fortress core calculus with where clauses. We call this calculus Core Fortress with Where
Clauses. Core Fortress with Where Clauses is an extension of Basic Core Fortress with where clauses.
A.2.1
Syntax
The syntax for Core Fortress with Where Clauses is provided in Figure A.6. For simplicity, we use the following
notational conventions:
• We abbreviate a sequence of relations α 1 extends { −→ K 1 } · · · α n extends { −→ −−−−−−−−−−−→
K n } to αextends { −→ K} and τ 1