Add Wildcard introduction

This commit is contained in:
JanUlrich 2024-02-06 09:45:53 +01:00
parent 5433e94aab
commit 98a66bbced

View File

@ -11,6 +11,12 @@ This paper extends a type inference algorithm for Featherweight Java (\cite{TIfo
The last step to create a type inference algorithm compatible to the Java type system.
The algorithm is a modified version of the \unify{} algorithm presented in \cite{plue09_1}.
The algorithm is a slightly improved version of the one in \cite{TIforFGJ} and added wildcard support.
Wildcards are existential types which have to be \textit{unpacked} before they can be used.
In Java this is done implicitly by a process called capture conversion \cite{JavaLanguageSpecification}.
The type system in \cite{WildcardsNeedWitnessProtection} makes this process explicit by using \texttt{let} statements.
Our type inference algorithm will accept an input program without let statements and add them where necessary.
%TODO
% The goal is to proof soundness in respect to the type rules introduced by \cite{aModelForJavaWithWildcards}
% and \cite{WildcardsNeedWitnessProtection}.