SYSTEMS OF ENGAGEMENT i. Gartner Bi-modal IT 1. Type 1 – System of Record – “Doing it right” 2. Type 2 – System of Engagement – “Doing it fast” ii. DevOps helps reject the bi-modal IT model and lets you

pseudo-code might look like: function matmul(a::AbstractMatrix, b::AbstractMatrix) op = (ai, bi) -> ai * bi + ai * bi ## this is insufficient because it assumes `one(eltype(a))` is constructable: # R = t calls `promote_type` ## but this is not true for some types, such as Bool: # R = promote_type(ai, bi)CHAPTER 13. METHODS 172 # this is wrong, since depending on the return value # of type-inference

pseudo-code might look like: function matmul(a::AbstractMatrix, b::AbstractMatrix) op = (ai, bi) -> ai * bi + ai * bi ## this is insufficient because it assumes `one(eltype(a))` is constructable: # R = t calls `promote_type` ## but this is not true for some types, such as Bool: # R = promote_type(ai, bi)CHAPTER 13. METHODS 172 # this is wrong, since depending on the return value # of type-inference

pseudo-code might look like: function matmul(a::AbstractMatrix, b::AbstractMatrix) op = (ai, bi) -> ai * bi + ai * bi ## this is insufficient because it assumes `one(eltype(a))` is constructable: # R = t calls `promote_type` ## but this is not true for some types, such as Bool: # R = promote_type(ai, bi)CHAPTER 13. METHODS 172 # this is wrong, since depending on the return value # of type-inference

pseudo-code might look like: function matmul(a::AbstractMatrix, b::AbstractMatrix) op = (ai, bi) -> ai * bi + ai * bi ## this is insufficient because it assumes `one(eltype(a))` is constructable: # R = t calls `promote_type` ## but this is not true for some types, such as Bool: # R = promote_type(ai, bi) # this is wrong, since depending on the return value # of type-inference is very brittle (as well

pseudo-code might look like: function matmul(a::AbstractMatrix, b::AbstractMatrix) op = (ai, bi) -> ai * bi + ai * bi ## this is insufficient because it assumes `one(eltype(a))` is constructable: # R = t calls `promote_type` ## but this is not true for some types, such as Bool: # R = promote_type(ai, bi) # this is wrong, since depending on the return value # of type-inference is very brittle (as well

pseudo-code might look like: function matmul(a::AbstractMatrix, b::AbstractMatrix) op = (ai, bi) -> ai * bi + ai * bi ## this is insufficient because it assumes `one(eltype(a))` is constructable: # R = t calls `promote_type` ## but this is not true for some types, such as Bool: # R = promote_type(ai, bi) # this is wrong, since depending on the return value # of type-inference is very brittle (as well

pseudo-code might look like: function matmul(a::AbstractMatrix, b::AbstractMatrix) op = (ai, bi) -> ai * bi + ai * bi ## this is insufficient because it assumes `one(eltype(a))` is constructable: # R = t calls `promote_type` ## but this is not true for some types, such as Bool: # R = promote_type(ai, bi) # this is wrong, since depending on the return value # of type-inference is very brittle (as well

pseudo-code might look like: function matmul(a::AbstractMatrix, b::AbstractMatrix) op = (ai, bi) -> ai * bi + ai * bi ## this is insufficient because it assumes `one(eltype(a))` is constructable: # R = t calls `promote_type` ## but this is not true for some types, such as Bool: # R = promote_type(ai, bi)CHAPTER 13. METHODS 173 # this is wrong, since depending on the return value # of type-inference

pseudo-code might look like: function matmul(a::AbstractMatrix, b::AbstractMatrix) op = (ai, bi) -> ai * bi + ai * biCHAPTER 12. METHODS 163 ## this is insufficient because it assumes `one(eltype(a))` calls `promote_type` ## but this is not true for some types, such as Bool: # R = promote_type(ai, bi) # this is wrong, since depending on the return value # of type-inference is very brittle (as well