CMP.15:4.5 - Choose checking and binding conditions separately
Choose when contributions become connected and when the required obligations are checked. These are distinct decisions: dynamic composition can carry static constraints, and early registration can still leave semantic errors until execution.
| Needed guarantee | What must support it |
|---|---|
| Old source modules remain unchanged | The extension and joining modules use published interfaces; composition happens outside the old modules. |
| Modules can be checked and compiled separately | The language and build arrangement expose sufficient interfaces, constraints and dependency information without requiring all implementation sources together. |
| A required missing body is found before execution | A static capability requirement or a complete composition check covers the admitted combinations and their dependencies. |
| Old behavior is preserved | Old calls retain suitable bodies and assumptions, with an argument over the observations promised. |
A static realization can express each operation as an implementation of a constructor signature. A term using Let requires that extended signature. An implementation of only the old signature cannot be supplied to it without failing the relevant type requirement. CMP.15:5.3 gives the bodies and the rejected combination. This establishes availability and type compatibility only to the extent enforced by the chosen language; an unchecked cast can conceal the missing obligation. Correctly typed but wrong FV(Let) remains possible.
A dynamic realization can collect explicit bodies, reject conflicts and compare their keys with R before running any handler. Missing pairs then fail during composition rather than halfway through an effectful operation. The check is complete for R; it covers the application only if R covers its reachable uses. Guard calls outside that scope. Loading another extension requires constructing or qualifying another composition.
Keep three failures distinct:
| Failure | Diagnosis and useful repair |
|---|---|
| No applicable implementation | Supply the missing body, make an existing body available, or narrow the admitted use explicitly. |
| No unique selected implementation | Resolve the conflict or ambiguity by a stated selection, applicability or intersection rule. |
| One selected implementation returns the wrong meaning | Repair its semantic rule and dependent uses; availability and ordinary types have not established correctness. |
Malformed input, an unbound variable and a language-defined arithmetic error are errors of the represented language or its inputs. A loaded method that is not visible to the running computation is a binding or visibility issue. Diagnose those conditions separately from a missing semantic implementation.
The historical expression problem asks for stronger properties than practical plug-in loading alone, including static type safety and extension without recompiling existing code. Wadler’s formulation supplies those comparison criteria. Use the name as a search cue; state which properties the construction achieves.