20 likes | 98 Views
Closest Match Method Invocation. C,L,X, σ |- E: D C,L,X, σ |- E i : σ i D |- τ m( τ 1 ,..., τ k ) Y τ i := σ i D |- γ m( γ 1 ,..., γ k ) Z : ( i : γ i := σ i ) ( i : γ i := τ i ) C, L, X, σ |- E . m ( E 1 , ... , E k ) : τ.
E N D
Closest Match Method Invocation C,L,X,σ |- E: DC,L,X,σ |- Ei: σi D |- τ m(τ1,...,τk) Y τi:= σi D |- γ m(γ1,..., γk) Z : (i: γi:= σi) (i: γi:= τi) C, L, X, σ |- E.m(E1,...,Ek): τ • This rule does not describe access modifiers
Unique Match Method Invocation C,L,X,σ |- E: DC,L,X,σ |- Ei: σi D |- τ m(τ1,...,τk) Y τi:= σi D |- γ m(γ1,..., γk) Z : (i: γi:= σi) (i: γi = τi) C, L, X, σ |- E.m(E1,...,Ek): τ • This rule does not describe access modifiers