Changeset 39de1c5
 Timestamp:
 Apr 24, 2019, 4:09:47 PM (2 years ago)
 Branches:
 aaronthesis, armeh, cleanupdtors, jacob/cs343translation, jenkinssandbox, master, newast, newastuniqueexpr
 Children:
 5d3a952
 Parents:
 ec92b48
 Location:
 doc/theses/aaron_moss_PhD/phd
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

doc/theses/aaron_moss_PhD/phd/background.tex
rec92b48 r39de1c5 379 379 \CFA{} adds a significant number of features to standard C, increasing the expressivity and reusability of \CFA{} code while maintaining backwards compatibility for both code and larger language paradigms. 380 380 This flexibility does incur significant added compilation costs, however, the mitigation of which are the primary concern of this thesis. 381 382 \cbstarty383 One area of inquiry which is outside the scope of this thesis is formalization of the \CFA{} type system.384 Ditchfield~\cite{Ditchfield92} defined the $F_\omega^\ni$ polymorphic lambda calculus which is the theoretical basis for the \CFA{} type system.385 Ditchfield did not, however, prove any soundness or completeness properties for $F_\omega^\ni$; such proofs remain future work.386 A number of formalisms other than $F_\omega^\ni$ could potentially be adapted to model \CFA{}.387 One promising candidate is \emph{local type inference} \cite{Pierce00,Odersky01}, which describes similar contextual propagation of type information; another is the polymorphic conformitybased model of the Emerald~\cite{Black90} programming language, which defines a subtyping relation on types which are conceptually similar to \CFA{} traits.388 These modelling approaches could potentially be used to extend an existing formal semantics for C such as Cholera \cite{Norrish98}, CompCert \cite{Leroy09}, or Formalin \cite{Krebbers14}.389 \cbendy 
doc/theses/aaron_moss_PhD/phd/introduction.tex
rec92b48 r39de1c5 51 51 \cbendx 52 52 Type environments are also widely modelled in compiler implementations, particularly for functional languages, though also increasingly commonly for other languages (such as Rust~\cite{Rust}) which perform type inference; the type environment presented here may be useful to those language implementors. 53 54 \cbstarty 55 One area of inquiry which is outside the scope of this thesis is formalization of the \CFA{} type system. 56 Ditchfield~\cite{Ditchfield92} defined the $F_\omega^\ni$ polymorphic lambda calculus which is the theoretical basis for the \CFA{} type system. 57 Ditchfield did not, however, prove any soundness or completeness properties for $F_\omega^\ni$; such proofs remain future work. 58 A number of formalisms other than $F_\omega^\ni$ could potentially be adapted to model \CFA{}. 59 One promising candidate is \emph{local type inference} \cite{Pierce00,Odersky01}, which describes similar contextual propagation of type information; another is the polymorphic conformitybased model of the Emerald~\cite{Black90} programming language, which defines a subtyping relation on types which are conceptually similar to \CFA{} traits. 60 These modelling approaches could potentially be used to extend an existing formal semantics for C such as Cholera \cite{Norrish98}, CompCert \cite{Leroy09}, or Formalin \cite{Krebbers14}. 61 \cbendy
Note: See TracChangeset
for help on using the changeset viewer.