Ignore:
Timestamp:
Feb 4, 2019, 10:20:43 PM (3 years ago)
Author:
Aaron Moss <a3moss@…>
Branches:
aaron-thesis, arm-eh, cleanup-dtors, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr
Children:
902b123
Parents:
0e6a0be
Message:

thesis: discuss design differences between cfa-cc and resolv-proto

File:
1 edited

Legend:

Unmodified
Added
Removed
  • doc/theses/aaron_moss_PhD/phd/resolution-heuristics.tex

    r0e6a0be r8d752592  
    326326As such, I opted to continue Bilson's approach of designing a bespoke solver for \CFA{} assertion satisfaction, rather than attempting to re-express the problem in some more general formalism.
    327327
    328 \section{Conclusion \& Future Work}
     328\section{Conclusion \& Future Work} \label{resn-conclusion-sec}
    329329
    330330I have experimented with using expression resolution rather than type unification to choose assertion resolutions; this path should be investigated further in future work.
Note: See TracChangeset for help on using the changeset viewer.