This commit is contained in:
Andreas Stadelmeier 2024-05-14 13:31:54 +02:00
parent 77f3fbedfa
commit 8c6085f3b1

View File

@ -54,7 +54,7 @@ finite set of maximal types (for more details see Section
refines this approach by moving to a constraint-based algorithm and by refines this approach by moving to a constraint-based algorithm and by
considering lambda expressions and Scale-like function types. considering lambda expressions and Scale-like function types.
Pluemicke has a different approach to introduce wildcards in \cite{Plue09_1}. He Pluemicke has a different approach to introduce wildcards in \cite{plue09_1}. He
allows wildcards as any subsitution for type variables and disclaim the allows wildcards as any subsitution for type variables and disclaim the
capture conversion. Instead he extended capture conversion. Instead he extended
the subtyping ordering such that for $\theta \sub \theta' \sub \theta''$ holds the subtyping ordering such that for $\theta \sub \theta' \sub \theta''$ holds