</p>
<p>In LaTTe if a term has a type, then it is unique (up-to beta-equivalence). Moreover, given a term we can compute its type (if it has one). This is a very powerful feature, which is only rarely present in proof assistants based on type theory.</p>
</div></div></div></body></html>