write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can of sorts implements a constructor (sort metavariable) representing an unknown sort. The constraint solver can compute these sort metavariables, just like it does when computing regular term metavariables

write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can of sorts implements a constructor (sort metavariable) representing an unknown sort. The constraint solver can compute these sort metavariables, just like it does when computing regular term metavariables

write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can of sorts implements a constructor (sort metavariable) representing an unknown sort. The constraint solver can compute these sort metavariables, just like it does when computing regular term metavariables

write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can of sorts implements a constructor (sort metavariable) representing an unknown sort. The constraint solver can compute these sort metavariables, just like it does when computing regular term metavariables

write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can

write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can

write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can

write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can

write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can

write tactics that can be applied without any syntactic overhead. For instance, suppose you have a solver: magic : Type → Term that takes a reflected goal and outputs a proof (when successful). You can