ifc-0163
12.3 The OPTIC contract
In the generic DIAL-X contract, \(\mathbb A_{\mathrm{OPTIC}}\) presents the locally available skill operations and \(\mathbb B_{\mathrm{OPTIC}}\) presents typed interface or workflow revisions. Their realizations execute a local skill and propose a workflow change, respectively. Execution observers form \(\Lambda _{\mathrm{OPTIC}}\), their mixed comparison is \(\Theta _{\mathrm{skill}}\), finite reuse is tested by \(\gamma _{\mathrm{skill}}\), and locked execution evidence supplies \(\mathsf{Adm}_{\mathrm{OPTIC}}\). The current experiments instantiate only registered fragments of this architectural contract.
An OPTIC implementation must expose the following components.
|
Component |
Declaration |
Failure it prevents |
|---|---|---|
|
Operational target |
Executable typed skill program \(P_m\) |
Optimizing prose that cannot be executed |
|
Structural target |
Workflow sketch \(\mathbb S_{\mathrm{skill}}\) |
Hiding the skill vocabulary and interfaces |
|
Creative mandate |
Frozen workflow and skill reference language, Boden mode, novelty observer, and independent execution value |
Calling every optimized program creative |
|
Assimilatory side |
Selection and optimization of available sections |
Calling every parameter update creative |
|
Proto-accommodative side |
Typed interface or workflow revision |
Treating arbitrary text edits as theory changes |
|
Mixed witness |
Involution/interchange defect with an execution observer |
Inferring structure from terminal score alone |
|
Finite realization |
Multi-step execution, route consistency, rollback, and transport observer \(\gamma _{\mathrm{skill}}\) |
Promoting a one-step edit that does not compose as a reusable skill |
|
Proposal language |
Bounded skill, macro, factorization, or grammar extensions |
Unconstrained post-hoc invention |
|
Controls |
Registered in-language, ordering, factorization, authorization, no-change, and capacity-matched search controls in \(\mathsf{Ctl}_{\mathrm{OPTIC}}\) |
Extending the workflow before ordinary repairs are tested |
|
Package comparison |
\(\Upsilon _{\mathrm{OPTIC}}\), with presentation and semantic components when applicable |
Hiding compiler, observer, or semantic changes inside a sketch map |
|
Admission |
Held-out execution, invariants, regressions, cost, and transfer |
Letting the optimizer certify itself |
|
Persistence |
Versioned program, compiler, traces, rejected edits, and hashes |
Replacing learning by an unreplayable conversation |
The creative mandate must name what is absent from the frozen reference language. Constructing a new ordering of registered steps can be combinational creativity. Searching a typed space of registered workflows is exploratory creativity. Adding a new skill type, interface, or grammar rule is transformational. Retuning coefficients or selecting a supplied program is ordinary optimization unless a stronger novelty claim is separately established.