An Introduction to Functional Programming Through Lambda Calculus

- 143 -and so on.def istype (t::o)= equal t (type o)def isbool obj = istype (bool_type::obj)def isnumb obj = istype (numb_type::obj)Here, we have explicitly provided a value for the second bound variable o from the new single bound variable obj.In practical terms, curried functions are more flexible to use but less efficient to implement as more function entry andexit is necessitated.7.17. SummaryIn this chapter we have:• represented composite values as lists• developed selector functions to simplify composite value manipulation• introduced generalised list structure matching• introduced notations for local definitions• considered the efficiency of naive linear list algorithms• represented trees as lists• developed functions to manipulate ordered binary trees• considered the efficiency of binary trees• met curried and uncurried functions, and partial applicationSome of these topics arte summarised below.Generalised structure matchingdef [,, ... ] =def =Local definitionslet = in ==where = ==λ.