Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
If you were to read a problem statement, such as something found on TopCoder, and you converted it to a lambda calculus representation, is it a simple exercise to ‘convert’ this to Haskell or Lisp code?
In other words, can a problem be solved using the lambda calculus formal system and then trivially implemented in a functional programming language?
The syntax for Haskell is quite similar to the lambda calculus. Your problem is going to be that some terms in the untyped lambda calculus won’t be accepted by Haskell’s type checker.
Out of curiosity, who the hell solves TopCoder using the lambda calculus? That sounds highly non-trivial. o_O