By Songphon Klabwong
Lambda calculus has the equivalent expressive power compared to the Turing model. It is the origin of the functional programming approach. One of the most important concepts is YCombinator. It enables the way to perform recursion by anonymous function. In this study, we proposed the study on Y-Combinator of typed-lambda calculus based on python language. The study shows the way implementing tail-call recursion. It employs the Continuation-Passing Style (CPS) technique to send the context of execution along with the call. As a result, the code written using CPS is guaranteed to be side-effect free. Consequently, it is efficient to be executed on concurrency environment.