Haskell is said to be a pure language because the language features are directly translatable into lambda calculus.My question is: for languages considered to be non-pure functional languages (e.g. Scala, OCaml), which aspects of those languages are not translatable into lambda calculus?
Language Features Not Translatable into Lambda Calculus
lambda calculus;functional programming