Changeset 2183e12 for doc


Ignore:
Timestamp:
Apr 17, 2017, 3:41:36 PM (8 years ago)
Author:
Peter A. Buhr <pabuhr@…>
Branches:
ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc
Children:
4ae83a4b
Parents:
33e22da
Message:

ignore timing graph and add pages for Alphard citation

Location:
doc/generic_types
Files:
2 edited

Legend:

Unmodified
Added
Removed

  • doc/generic_types/.gitignore

    r33e22da r2183e12  
    1717*.synctex.gz
    1818comment.cut
     19timing.tex

  • doc/generic_types/generic_types.tex

    r33e22da r2183e12  
    214214A design advantage is that, unlike \CC template-functions, \CFA polymorphic-functions are compatible with C \emph{separate compilation}, preventing compilation and code bloat.
    215215
    216 Since bare polymorphic-types provide a restricted set of available operations, \CFA provides a \emph{type assertion}~\cite{alphard} mechanism to provide further type information, where type assertions may be variable or function declarations that depend on a polymorphic type-variable.
     216Since bare polymorphic-types provide a restricted set of available operations, \CFA provides a \emph{type assertion}~\cite[pp.~37-44]{Alphard} mechanism to provide further type information, where type assertions may be variable or function declarations that depend on a polymorphic type-variable.
    217217For example, the function @twice@ can be defined using the \CFA syntax for operator overloading:
    218218\newpage
    … …  
    280280\lstDeleteShortInline@%
    281281\par\smallskip
    282 \begin{tabular}{@{}l@{\hspace{\parindent}}|@{\hspace{\parindent}}l@{}}
     282\begin{tabular}{@{}l@{\hspace{1.5\parindent}}||@{\hspace{1.5\parindent}}l@{}}
    283283\begin{lstlisting}
    284284short int MAX = ...;
    … …  
    587587\lstDeleteShortInline@%
    588588\par\smallskip
    589 \begin{tabular}{@{}l@{\hspace{\parindent}}|@{\hspace{\parindent}}l@{}}
     589\begin{tabular}{@{}l@{\hspace{1.5\parindent}}||@{\hspace{1.5\parindent}}l@{}}
    590590\begin{lstlisting}
    591591int f( int, int );
    … …  
    616616\lstDeleteShortInline@%
    617617\par\smallskip
    618 \begin{tabular}{@{}l@{\hspace{\parindent}}|@{\hspace{\parindent}}l@{}}
     618\begin{tabular}{@{}l@{\hspace{1.5\parindent}}||@{\hspace{1.5\parindent}}l@{}}
    619619\begin{lstlisting}
    620620int x = 10;
    … …  
    658658\lstDeleteShortInline@%
    659659\par\smallskip
    660 \begin{tabular}{@{}l@{\hspace{\parindent}}|@{\hspace{\parindent}}l@{}}
     660\begin{tabular}{@{}l@{\hspace{1.5\parindent}}||@{\hspace{1.5\parindent}}l@{}}
    661661\begin{lstlisting}
    662662[int, int, long, double] x;
    … …  
    10151015\end{table}
    10161016
    1017 The C and \CCV variants are generally the slowest with the largest memory footprint, because to their less-efficient memory layout and the pointer-indirection necessary to implement generic types;
     1017The C and \CCV variants are generally the slowest with the largest memory footprint, because of their less-efficient memory layout and the pointer-indirection necessary to implement generic types;
    10181018this inefficiency is exacerbated by the second level of generic types in the pair-based benchmarks.
    10191019By contrast, the \CFA and \CC variants run in roughly equivalent time for both the integer and pair of @_Bool@ and @char@ because the storage layout is equivalent.
Note: See TracChangeset for help on using the changeset viewer.