In the context of typed programming languages, define the terms ';soundness'; and ';completeness';?

If an algorithm is ';complete';, that means that it always finds a solution (if one exists) or correctly determines that there is no solution.





If an algorithm is ';sound';, that means that any solution it finds is correct.