Board David Baszucki @ Q1:25 Earnings Call – 5/25 Tech Incumbent AI Adoption = Top Priority I promise you, in ten years' time, you will look back and you will realize that AI has now integrated into assistants needed clear inputs and produced narrow outputs, agents promise to operate with goals, autonomy and certain guardrails. They promise to interpret intent, manage memory, and coordinate across apps productized interfaces and offered reliable outputs with minimal setup. For enterprises, they promise security and ease-of-use for non-technical employees. For consumers, they came with name recognition

play a more central role in the company by driving its digital agenda. Agile approaches hold the promise of changing this paradigm, but IT organizations have not thoroughly absorbed this message. The

by delivering more timely and accurate information. However, Agile is not a panacea: it does not promise to solve all IT and program management problems, and may not be appropriate for use in all cases

are many styles of asynchronous interfaces: • Callback argument • Return a placeholder (Future, Promise, Deferred) • Deliver to a queue • Callback registry (e.g. POSIX signals) Regardless of which type

There are many styles of asynchronous interfaces: Callback argument Return a placeholder (Future, Promise, Deferred) Deliver to a queue Callback registry (e.g. POSIX signals) Regardless of which type of

results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular

results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular

results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular

results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular

results. This corresponds to the -ffast-math option of clang. • Write @simd in front of for loops to promise that the iterations are independent and may be re- ordered. Note that in many cases, Julia can automatically JL_DLLEXPORT jl_value_t *jl_apply_array_type(jl_value_t *type, size_t dim) JL_ALWAYS_LEAFTYPE; JL_GC_PROMISE_ROOTED This is a function-like annotation. Any value passed to this annotation will be considered happen to know for complicated external reasons // that val is rooted under these conditions JL_GC_PROMISE_ROOTED(val); } } Completeness of analysis The analyzer only looks at local information. In particular