A collection of equations
$$\begin{aligned} \mathit{Emacs} + \mathit{Go} = \mathit{Parametric\ Polymorphism} \end{aligned}$$
$$\begin{aligned} \mathit{Product} = \mathit{Customer} \times \mathit{Business} \times \mathit{Technology} \end{aligned}$$
$$\begin{aligned} \mathit{Algorithm} = \mathit{Logic} + \mathit{Control} \end{aligned}$$
$$\begin{aligned} \mathit{Cost\ of\ Delay} = & \mathit{User-Business\ Value} + \mathit{Time\ Criticality}\ +\\ & \mathit{Risk\ Reduction\ and}/\mathit{or\ Opportunity\ Enablement} \end{aligned}$$
$$\begin{aligned} \mathit{Well}\ \text{-}\mathit{founded\ Semantics} + \mathit{Branch\ and\ Bound} = \mathit{Stable\ Models} \end{aligned}$$
$$\begin{aligned} \mathit{Property\ Tests} + \mathit{Contracts} = \mathit{Integration\ Tests} \end{aligned}$$
$$\begin{aligned} \mathit{Compiler}(\mathit{Program}) = \mathit{Algorithms} + \mathit{Data\ Structures} \end{aligned}$$
$$\begin{aligned} \mathit{Clingo} = \mathit{ASP} + \mathit{Control} \end{aligned}$$
$$\begin{aligned} \mathit{Assets} = \mathit{Liabilities} + \mathit{Equity} \end{aligned}$$
$$\begin{aligned} \mathit{Programming} = \mathit{Structure} + \mathit{Efficiency} \end{aligned}$$
$$\begin{aligned} \mathit{Screen} + \mathit{Camera} = \mathit{World} \end{aligned}$$
$$\begin{aligned} \mathit{What} + \mathit{When} = \mathit{How} \end{aligned}$$
$$\begin{aligned} \mathit{Successful\ Fiction\ Writing} = \mathit{Organizing} + \mathit{Creating} + \mathit{Marketing} \end{aligned}$$
$$\begin{aligned} \mathit{Model\ Theory} & = \mathit{Universal\ Algebra} + \mathit{Logic} \\ & = \mathit{Algebraic\ Geometry} - \mathit{Fields} \end{aligned}$$
$$\begin{aligned} \mathit{Demonic} + \mathit{Angelic\ Behaviour} = \mathit{Simulation\ Properties} \end{aligned}$$
$$\begin{aligned} \mathit{Dynamic\ Scope} + \mathit{Laziness} = \mathit{Counterfactuals} \end{aligned}$$
$$\begin{aligned} \mathit{Safety} = \mathit{Progress} + \mathit{Preservation} \end{aligned}$$
$$\begin{aligned} \mathit{Money} \mathrel{+}= \mathit{Income} - \mathit{Spending} \end{aligned}$$
$$\begin{aligned} \mathit{Suffering} = \mathit{Pain} \times \mathit{Resistance} \end{aligned}$$
$$\begin{aligned} \mathit{Separation\ Logic} + \mathit{Superposition\ Calculus} = \mathit{Heap\ Theorem\ Prover} \end{aligned}$$
$$\begin{aligned} \mathit{Constraint\ Program} = \mathit{Model} + \mathit{Search} \end{aligned}$$
$$\begin{aligned} \mathit{Types} + \mathit{Values} & = \mathit{Dependent\ Types} \\ & = \mathit{Types\ Refined\ with\ predicates\ over\ values} \end{aligned}$$
$$\begin{aligned} \mathit{Pitch\ Pipe} + \mathit{Piano} = \mathit{Pocket\ Pitch} \end{aligned}$$
$$\begin{aligned} \mathit{Refinement\ Types} = \mathit{Types} + \mathit{Logical\ Predicates} \end{aligned}$$
$$\begin{aligned} \mathit{Programming} = \mathit{Algorithms} + \mathit{Coding} \end{aligned}$$
$$\begin{aligned} \mathit{SAT} + \mathit{Theory\ Solvers} = \mathit{SMT} \end{aligned}$$
$$\begin{aligned} \mathit{GADTs} = \mathit{Algebraic\ Datatypes} + \mathit{Existential\ Types} + \mathit{Equality\ Constraints} \end{aligned}$$
$$\begin{aligned} \mathit{Hoare\ triples} + \mathit{Monadic\ types} = \mathit{Hoare\ Type\ Theory} \end{aligned}$$
$$\begin{aligned} \mathit{DSL\ design} = \mathit{Art} + \mathit{Lots\ of\ iterations} \end{aligned}$$
$$\begin{aligned} \mathit{Inverse\ Semantics} + \mathit{Skolemization} = \mathit{Witness\ Function} \end{aligned}$$
$$\begin{aligned} k\text{-}\mathit{FAIR} = k\text{-}\mathit{LIVENESS} + \mathit{FAIR} \end{aligned}$$
$$\begin{aligned} \mathit{Cyclic\ proof} = \mathit{pre}\text{-}\mathit{proof}\ \mathcal{P} + \mathit{soundness\ condition}\ \mathcal{S}(\mathcal{P}) \end{aligned}$$
$$\begin{aligned} \mathit{coinduction} = \mathit{use\ of\ finality\ for\ coalgebras} \end{aligned}$$
$$\begin{aligned} \mathit{Query} = \mathit{operation} + \mathit{pattern} \end{aligned}$$