Closed uncomputable closed 4 months ago
Finalize expressions (including non-programs) from the human encoding.
The finalization on master forces the root node to be 1→ 1.
The finalization of this PR allows root nodes whose type A → B is fixed by constraints inside the expression.
Finalize expressions (including non-programs) from the human encoding.
The finalization on master forces the root node to be 1→ 1.
The finalization of this PR allows root nodes whose type A → B is fixed by constraints inside the expression.
Todo