Changeset bd405fa for doc/theses/aaron_moss_PhD/phd/resolution-heuristics.tex

Timestamp:

Apr 25, 2019, 2:58:48 PM (4 years ago)

Author:

Aaron Moss <a3moss@…>

Branches:

arm-eh, cleanup-dtors, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

052cd71, 1bc5975, c378e5e, cbef27b

Parents:

98b4b12

Message:

thesis: final edits

File:

• doc/theses/aaron_moss_PhD/phd/resolution-heuristics.tex (modified) (1 diff)

doc/theses/aaron_moss_PhD/phd/resolution-heuristics.tex

@@ -18 +18 @@
 A comparison of the richer type systems in \CFA{} and \CC{} highlights some of the challenges in \CFA{} expression resolution. 
 The key distinction between \CFA{} and \CC{} resolution is that \CC{} uses a greedy algorithm for selection of candidate functions given their argument interpretations, whereas \CFA{} allows contextual information from superexpressions to influence the choice among candidate functions. 
-One key use of this contextual information is for type inference of polymorphic return types; \CC{} requires explicit specification of template parameters that only occur in a function's return type, while \CFA{} allows the instantiation of these type parameters to be inferred from context(and in fact does not allow explicit specification of type parameters to a function), as in the following example:
+One key use of this contextual information is for type inference of polymorphic return types; \CC{} requires explicit specification of template parameters that only occur in a function's return type, while \CFA{} allows the instantiation of these type parameters to be inferred from context (and in fact does not allow explicit specification of type parameters to a function), as in the following example:
 
 \begin{cfa}