Re: How to make cyclic terms (Was: A miraculous match?)

You are a fucking moron. You can even
not separate a dozen terms. Its relatively
simple to tell the things appart:
- Simple Types ( λ→ )
The simply typed lambda calculus λ→, a form of type theory,
is a typed interpretation of the lambda calculus with only
one type constructor → that builds function types.
https://en.wikipedia.org/wiki/Simply_typed_lambda_calculus
- System F
Whereas simply typed lambda calculus has variables
ranging over terms, and binders for them, System F
additionally has variables ranging over types,
https://en.wikipedia.org/wiki/System_F
Whats so difficult for you moron to understand?
Julio Di Egidio schrieb:

On 09/01/2025 17:05, Mild Shock wrote:
 

I told you a dozen times that the scope of
this thread is simple types.

 Define scope and thread.
 You are simply a waste of time.  (EOD.)
 -Julio