stan/Ecoop2024_TIforWildFJ
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Comments

Browse Source
This commit is contained in:
JanUlrich 2024-04-08 22:51:06 +02:00
parent 079bb914e4
commit 4b183937f5
2 changed files with 13 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
introduction.tex
View File

@ -563,8 +563,6 @@ The constraints where this is possible are marked as capture constraints.
Type information flows top down. Type information flows top down.
Argument types of a method invocation impact its return type. Argument types of a method invocation impact its return type.
But knowing the return type does not imply distinct argument types. But knowing the return type does not imply distinct argument types.
The code in listing \ref{principalTypeExample} shows a nested method call
\texttt{receive(copy(lSpecial))}.
We know from the argument types of \texttt{receive} -which are given- that the \texttt{copy} method We know from the argument types of \texttt{receive} -which are given- that the \texttt{copy} method
needs to return a type of the form $\exptype{Pair}{\type{X}, \type{Y}}$ needs to return a type of the form $\exptype{Pair}{\type{X}, \type{Y}}$
where \type{X} and \type{Y} can be any types as long as \type{Y} is a subtype of \type{X}. where \type{X} and \type{Y} can be any types as long as \type{Y} is a subtype of \type{X}.
@ -573,6 +571,14 @@ Without wildcards this would leave us with a clue what the type should look like
%TODO: simplify this example. lSpeial <. List<x> and List<x> <. id is sufficient %TODO: simplify this example. lSpeial <. List<x> and List<x> <. id is sufficient
% The unify algorithm needs to resolve l <c List<x?> to l <. X.List<X>, X.List<X> <c List<x?> % The unify algorithm needs to resolve l <c List<x?> to l <. X.List<X>, X.List<X> <c List<x?>
% this is not complete:
l <c Pair<x?, y?>
l <. X,Y.Pair<X,Y>, X,Y.Pair<X,Y> <. Pair<x?, y?>
% if a x =. y emerge:
X =. Y, which will delete both wildcards
\end{itemize} \end{itemize}
%TODO: Move this part. or move the third challenge some underneath. %TODO: Move this part. or move the third challenge some underneath.

5
unify.tex
View File

@ -415,6 +415,11 @@ which are used for the upper and lower bounds.
% -------------- % --------------
% b =. X.C<X> % b =. X.C<X>
% TODO: SameW rule can also be applied to normal type variables, because we have the contract rule now: % TODO: SameW rule can also be applied to normal type variables, because we have the contract rule now:
% a <c List<x?>
% --------------
% a <. X.List<X>, X.List<X> <c List<x?>
\begin{figure} \begin{figure}
\begin{center} \begin{center}
\leavevmode \leavevmode