def proof
import bolt@1.27.0.0/src/rules/calls.bend as Callsimport Base
import bolt@1.27.0.0/src/syntax/tree.bend as Tree
289# is the def a proof? One that returns a proof (`-> {a == b : T}`), or one
290# written with no type at all (`def f(x, y):`), which is how Bend fills the
291# law named f
292def proof(+sig: Tree.Node) -> Bool:
293 Bool.or(returns_proof(sig), Bool.not(typed(sig)))