I assume we will use a fallback to the compiler, w...

# arrow-meta

[Imran/Malic]

I assume we will use a fallback to the compiler, whenever we are at the End of the Graph and there is no valid path from A to B . If we think about it as an commutative graph, how can we proof that all of path’s commute ?

[Imran/Malic]

Unless induction is sufficient enough.

[raulraja]

It’s a directed graph and the path ends when there is no edge between two typed vertices. You could insert a recursive proof and try to exploit it but it’s easy to disallow recursion in the first place when constructing the graph.

[raulraja]

so recursive induction could be resolved or bailed at compile time wherever it made sense

[Imran/Malic]

Thank you for your answer 🙂