The set of lambda terms with and equivalence form a computability model.
weak product [local-0]
See weak product.
Check that and
weak terminal [local-1]
Any element can play the role of a weak terminal: for all
weak cartesian closed [local-2]
Let be given by application, if induces an operation in representing some then induces the corresponding operation in ; conversely, if induces an operation in , then induces the corresponding one in .
Definition closed terms [local-3]
There is a submodel for closed terms.
Notation Use -equivalence [local-4]
Use -equivalence then we denote .