\chapter{Conclusion}

This thesis performed a detailed examination of the three most important high-level containers in many programming languages: array, linked-list, and string.
The goal of the work is to make containers easier to use, performant and safer.
Since some subset of these three containers are used in almost every program in every programming language, this is a laudable goal.
Accomplishing this goal in C is difficult because these features are poorly designed.
By extending C into \CFA, it is possible to augment the programming language to provide better support and significant safety.
The result is code that is easier to write, maintain, safer from hacker attach-vectors.

\section{Lists}

The key takeaway for lists is that intrusive lists can be made easy to use, performant by eliminating implicit memory allocation, and able to simulate wrapped lists, whereas wrapped lists cannot simulate intrusive lists.

\section{Arrays}

The key takeaway for arrays is that the type system must be extended to properly manage array bounds (dimension) to safely pass arrays to (polymorphic) functions.
By adding a special kind of template constant to \CFA, @[N]@, the type system understands array bounds and implicitly associates these bounds with array instances, statically and dynamically, throughout the programming language.
Array overruns are no longer possible because all subscripting is checked, as in other modern languages.
Subscript checking can be implicitly elided when the compiler is given sufficient information to determine the subscript variable is always in bounds, giving performant execution.

The ability to slice a higher-dimensional array into subarrays is also a powerful and safety critical feature.


\section{Strings}

The key takeaway for strings is that providing powerful and safe block operations for manipulating strings is more important than ultra-level performance.
Manipulating strings is always going to be expensive because of their dynamic variable sizing, as the hardware rarely has string-level operations, possibly only move and compare.
This work designs an expressive set of safe string operations for composing, comparing, and decomposing arbitrary length strings, include complex reading and printing operations.


\section{Future Work}

All three forms of containers presented in this work are in their nascence both in design and implementation.
This work provides the foundation for future students to add more functionality and provide more robust and performant implementations.

