What if a function negates itself? However much I try I am simply unable to do away with my C-language perspective.
An alternate solution is to re-interpret lambda calculus not as a theory of logical assertions, but rather as a means of expressing computation. In this way, the paradox can be "solved" by reinterpreting it as a recursive statement, that is, the infinite recursion implying
Time to realize that functional languages very much exist.
No comments:
Post a Comment