arnekeller/Typicalc
1
0
Fork 0
mirror of https://gitlab.kit.edu/uskyk/typicalc.git synced 2024-11-09 10:50:42 +00:00
Code Issues Packages Projects Releases Wiki Activity

Improve english translation

Browse Source 
closes #23
This commit is contained in:
Arne Keller 2021-08-30 14:24:32 +02:00
parent 84f9623b95
commit 9ab7a876d6
2 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
frontend/styles/view/type-inference.css
View File

@ -41,7 +41,9 @@
} }
tc-explanation { tc-explanation {
width: 100em; width: 25em;
flex-shrink: 0;
flex-grow: 0;
padding-left: 1em; padding-left: 1em;
padding-right: 1em; padding-right: 1em;
overflow-y: auto; overflow-y: auto;

6
src/main/resources/language/translation_en.properties
View File

@ -218,9 +218,9 @@ expUnification.mgu=In this step the most general unifier %0% for the set of cons
expUnification.finalType=In this step the most general unifier %0% is applied to the type %1% of the input. The result %2% \ expUnification.finalType=In this step the most general unifier %0% is applied to the type %1% of the input. The result %2% \
is the final type of the input. is the final type of the input.
expUnification.infiniteType=The same type variable appears on both sides of the constraint. Since this would cause an \ expUnification.infiniteType=The same type variable appears on both sides of the constraint. Since this would cause an \
infinite type, the execution of the unification is stopped. infinite type, the unification algorithm terminates.
expUnification.differentTypes=Since the types on both sides of the constraint are incompatible, the execution of the \ expUnification.differentTypes=Since the types on both sides of the constraint are incompatible, the \
unification is stopped. unification algorithm terminates.
expLetUnification.finalType=In this step the most general unifier %0% is applied to the type %1% of the let-definition. \ expLetUnification.finalType=In this step the most general unifier %0% is applied to the type %1% of the let-definition. \
The result %2% is the final type of the let-definition. The result %2% is the final type of the let-definition.
expLetUnification.typeAss=In this step the type assumptions %0% for the further execution of the algorithm are \ expLetUnification.typeAss=In this step the type assumptions %0% for the further execution of the algorithm are \