# Changeset 8f55e8e9

Ignore:
Timestamp:
Apr 20, 2019, 9:40:54 PM (2 years ago)
Branches:
aaron-thesis, arm-eh, cleanup-dtors, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr
Children:
cf01d0b
Parents:
2834e99
Message:

thesis: comment on general applications in conclusion, per Gregor

Location:
doc
Files:
3 edited

Unmodified
Removed
• ## doc/bibliography/pl.bib

 r2834e99 number      = 11, pages       = {853-860}, } @inproceedings{Odersky01, keywords = {Scala}, contributer = {a3moss@uwaterloo.ca}, author = {Odersky, Martin and Zenger, Christoph and Zenger, Matthias}, title = {Colored Local Type Inference}, booktitle = {Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages}, series = {POPL '01}, year = {2001}, isbn = {1-58113-336-7}, location = {London, United Kingdom}, pages = {41--53}, numpages = {13}, url = {http://doi.acm.org/10.1145/360204.360207}, doi = {10.1145/360204.360207}, acmid = {360207}, publisher = {ACM}, address = {New York, NY, USA}, } } @article{Pierce00, keywords = {Scala}, contributer = {a3moss@uwaterloo.ca}, author = {Pierce, Benjamin C. and Turner, David N.}, title = {Local Type Inference}, journal = {ACM Trans. Program. Lang. Syst.}, issue_date = {Jan. 2000}, volume = {22}, number = {1}, month = jan, year = {2000}, issn = {0164-0925}, pages = {1--44}, numpages = {44}, url = {http://doi.acm.org/10.1145/345099.345100}, doi = {10.1145/345099.345100}, acmid = {345100}, publisher = {ACM}, address = {New York, NY, USA}, keywords = {polymorphism, subtyping, type inference}, } @article{Sundell08, keywords    = {lock free, deque},
• ## doc/theses/aaron_moss_PhD/phd/conclusion.tex

 r2834e99 The resolver prototype presented in this work has good performance and already has the basics of \CFA{} semantics implemented, as well as many of the necessary core data structures, and would be a viable candidate for a new compiler architecture. An alternate approach would be to fork an existing C compiler such as Clang~\cite{Clang}, which would need to be modified to use one of the resolution algorithms discussed here, as well as various other features introduced by Bilson~\cite{Bilson03}. More generally, the algorithmic techniques described in this thesis may be useful to implementors of other programming languages. In particular, the demonstration of practical performance for polymorphic return-type inference suggests the possibility of eliding return-type-only template parameters in \CC{} function calls, though integrating such an extension into \CC{} expression resolution in a backwards-compatible manner may be challenging. The \CFA{} expression resolution problem also bears some similarity to the \emph{local type inference} model put forward by Pierce \& Turner \cite{Pierce00} and Odersky \etal{} \cite{Odersky01}; compiler implementors for languages such as Scala \cite{Scala} that perform type inference based on this model may be able to profitably adapt the algorithms and data structures presented in this thesis.
• ## doc/theses/aaron_moss_PhD/phd/experiments.tex

 r2834e99 \CFACC{} can generate realistic test inputs for the resolver prototype from equivalent \CFA{} code; the generated test inputs currently comprise all \CFA{} code currently in existence, $9,000$ lines drawn primarily from the standard library and compiler test suite. the generated test inputs currently comprise all \CFA{} code currently in existence, 9,000 lines drawn primarily from the standard library and compiler test suite. \CFACC{} is also instrumented to produce a number of code metrics. These metrics were used to construct synthetic test inputs during development of the resolver prototype; these synthetic inputs provided useful design guidance, but the performance results presented in this chapter are based on the more realistic directly-generated inputs. \item[Basic] (\textsc{bas}) Bilson-style type environment with hash-based equivalence class storage, as discussed in Section~\ref{naive-env-sec}. \item[Incremental Inheritance] (\textsc{inc}) Incremental-inheritance variant sharing unmodified common parent information among environments, as discussed in Section~\ref{inc-env-sec}. \item[Persistent union-find] (\textsc{per}) Union-find-based environment, using the persistent variant discussed in Section~\ref{env-persistent-union-find} for backtracking and combination. This variant requires that all pairs of type arguments used as arguments to $combine$ descent from a common root environment; this requirement is incompatible with the caching used in the top-down traversal direction, and thus no \textsc{td-*-per} algorithms are tested. \item[Persistent union-find] (\textsc{per}) Union-find-based environment, using the persistent variant discussed in Section~\ref{env-persistent-union-find} for backtracking and combination. This variant requires that all pairs of type arguments used as arguments to $combine$ descend from a common root environment; this requirement is incompatible with the caching used in the top-down traversal direction, and thus no \textsc{td-*-per} algorithms are tested. \end{description} \end{description}
Note: See TracChangeset for help on using the changeset viewer.