Changeset 8fe7a85 for doc/theses/fangren_yu_MMath/future.tex

Timestamp:

May 12, 2025, 8:33:55 PM (10 months ago)

Author:

Fangren Yu <f37yu@…>

Branches:

master, stuck-waitfor-destruct

Children:

edd11bd

Parents:

98c77b2

Message:

proofreading changes from Gregor

File:

• doc/theses/fangren_yu_MMath/future.tex (modified) (5 diffs)

doc/theses/fangren_yu_MMath/future.tex

@@ -8 +8 @@
 \section{Closed Trait Types}
 
-Currently, \CFA does not have any closed types, as open type are the basis of its unique type-system, allowing new functions to be added at any time to override existing ones for trait satisfaction.
+Currently, \CFA does not have any closed types, as open types are the basis of its unique type-system, allowing new functions to be added at any time to override existing ones for trait satisfaction.
 Locally-declared nested-functions,\footnote{
 Nested functions are not a feature in C but supported by \lstinline{gcc} for multiple decades and are used heavily in \CFA.}
@@ -17 +17 @@
 Library implementers normally do not want users to override certain operations and cause the behaviour of polymorphic invocations to change.
 \item
-Caching and reusing resolution results in the compiler is effected, as newly introduced declarations can participate in assertion resolution;
+Caching and reusing resolution results in the compiler is affected, as newly introduced declarations can participate in assertion resolution;
 as a result, previously invalid subexpressions suddenly become valid, or alternatively cause ambiguity in assertions.
 \end{enumerate}
@@ -70 +70 @@
 \end{figure}
 
-A \CFA closed trait type is similar to a Haskell type class requiring an explicit instance declaration.
+A \CFA closed trait type is planned to be working similarly to a Haskell type class that requires an explicit instance declaration.
 The syntax for the closed trait might look like:
 \begin{cfa}
@@ -91 +91 @@
 
 \section{Associated Types}
+\label{s:AssociatedTypes}
 
 The analysis presented in \VRef{s:AssertionSatisfaction} shows if all type parameters have to be bound before assertion resolution, the complexity of resolving assertions becomes much lower as every assertion parameter can be resolved independently.
@@ -159 +160 @@
 \section{User-defined Conversions}
 
-Missing type-system feature is a scheme for user-defined conversions.
+A missing type-system feature in \CFA is a scheme for user-defined conversions.
 Conversion means one type goes through an arbitrary complex process of changing its value to some meaningful value in another type.
 Because the conversion process can be arbitrarily complex, it requires the power of a function.