The lambda calculus is an untyped language that is often extended with logical frameworks such as the vertices of the -cube. Is there something similar to it, but for interaction nets? What about interaction combinators?
Is there a lambda cube for interaction nets?
type theory;lambda calculus;type systems;interaction nets