0
$\begingroup$

Consider this following Lambda expression:

$$\lambda s. (s \text{ } s )$$

This function applies it's arguement to it's arguement. If this is a valid lambda expression, wouldn't it also be allowed in Haskell if it's based on type theory. What is the obstruction preventing us from doing this?

Improve this question
$\endgroup$
1
  • 3
    $\begingroup$ That's untyped lambda calculus $\endgroup$
    – Fyodor Soikin
    Feb 15 at 14:31

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.