Why is pure untyped lambda calculus often described as impossible to use?
With a suitable library of functions, will it not be about the same as any other functional language?
In theory, theory and practice are the same. In practice, this is not so.
In theory, it will be just another functional language. But have you considered the effect of performance on the actual performance of mathematics with Church numbers? Yes you can do it. But your programs will run so slowly that they will look seriously broken. A practical, functional language should find ways to make a pragmatic compromise between providing abstractions that can be built and using fast, native implementations of commonly used things.
. , , , - , . , , , , , , , , , 7 , -... . - . , , , , . , , . : , , - , - . , ().
7
Source: https://habr.com/ru/post/1790576/More articles:How can you say that everything is std :: vector - specified size in single line space? - c ++How to use BlockingCollection <'a> .TryTake in F # - tuplesextract attribute value in XML using regex - javaBrute force magic squares - algorithmTransactionScope does not roll back in MSTest test - c #Destruction in DSFML2 - memoryHelp using parallel task library - c #custom pagment - asp.net"foreach" does not work when using Parallel Task Library - parallel-processingWhat is the process of reordering one list based on the alleged reordering as a result of sorting another list? - sortingAll Articles