An interpreter extends another along a map of languages when it admits at each node the images of the rules the other admits there.
- unary {n : N} {a : T} {r : (b : T) × L.Unary a b} : r ∈ I.unary n a → ⟨r.fst, φ.onFunction r.snd⟩ ∈ J.unary n a
The unary rules.
- binary {n : N} {l r : T} {m : (u : T) × L.Binary l r u} : m ∈ I.binary n l r → ⟨m.fst, φ.onFunction m.snd⟩ ∈ J.binary n l r
The binary rules.
Used by Interpreter.mem_derivs_of_le, Interpreter.mem_values_of_le, Interpreter.typeDriven_sum_extends, Interpreter.Extends.withAbstraction, PhraseStructure.Tree.mem_values_of_le