Viewing posts from April, 2015
Type System in Haskell
The type system seems to really magical if you are newbie in Haskell. Haskell is a static typed language that works like dynamic. You can ignore type declaration and let the type inference system do it for you. For example,Read More
Church numerals are the representations of natural numbers under Church encoding. The higher-order function that represents natural number n is a function that maps any function f to its n-fold composition. In simpler terms, the "value" of the numeral is equivalent to the number of times the function encapsulates its argument.