Hi

I was curious if you could do some HOAS nonsense like

```
Unset Positivity Checking.
Inductive term: nat :=
| lift {n}: term (S n) -> term n
| tt {n}: term n
| fanout {n} (_ _: term n): term n
| fst {n}: term n -> term n
| snd {n}: term n -> term n
| lam {n} (term n -> term n): term (S n)
| app {n} (_ _: term n): term n.
Set Positivity Checking.
```

I don’t really get Curry’s paradox though.