His argument against names is a direct argument against lambda-calculus style functional programming, where the lambda construct, which introduces names for arguments, is the central mechanism. Consider his examples and think of others as well. With examples, argue for or against this point of view. Group Response Programming languages based on the lambda calculus pass parameters by position. In reference of Hudak's paper, Lambda calculus is not suitable to handle large data structures of databases.
Large databases are sometimes necessary for programming languages.
Database is an ever-growing industry for programming. Also, in matrix multiplication, functional programming languages do not fully support the transpose of the matrix of multiplication. The Sparse Matrix can be programmed in a parallel machine spawning from Backus' idea. This matrix is difficult to calculate simultaneously on a simple Von Neumann machine but could easily be done on a parallel or a distributed system. FP is limited to the order of arguments in a list.