This commit is contained in:
Andreas Stadelmeier 2024-05-07 15:29:15 +02:00
parent b5f7345e51
commit 38589f804c

View File

@ -1371,8 +1371,8 @@ which satisfies all input subtype constraints.
Types are reduced until they %either reach a discrepancy like $\type{String} \doteq \type{Integer}$
reach a form like $\tv{a} \doteq \type{T}$.
Afterwards \unify{} substitutes type placehodler $\tv{a}$ with $\type{T}$.
This is done until a substitution for all type placehodlers and therefore a valid solution is reached.
Afterwards \unify{} substitutes type placeholder $\tv{a}$ with $\type{T}$.
This is done until a substitution for all type placeholders and therefore a valid solution is reached.
The reduction and substitutions are done in the first step of the algorithm.
%The type reduction is done by the rules in figure \ref{fig:reductionRules}