Ignore:
Timestamp:
Apr 10, 2025, 5:13:49 PM (5 months ago)
Author:
Fangren Yu <f37yu@…>
Branches:
master
Children:
aacd1e1, b1b513d
Parents:
28182444
Message:

add the abstract paragraph

File:
1 edited

Legend:

Unmodified
Added
Removed

  • doc/theses/fangren_yu_MMath/resolution.tex

    r28182444 rbb506e0  
    151151Specifically, the resolution algorithms used in \CC and Java are greedy, selecting the best match for each subexpression without considering the higher-level ones (bottom-up).
    152152Therefore, at each resolution step, the arguments are already given unique interpretations, so the ordering only needs to compare different sets of conversion targets (function parameter types) on the same set of input.
    153 \begin{cfa}
    154 @generate a C++ example here@
    155 
    156 read more
    157 \end{cfa}
    158153
    159154In \CFA, trying to use such a system is problematic because of the presence of return-type overloading of functions and variable.
Note: See TracChangeset for help on using the changeset viewer.