Inside 214-1E

Existential Pontification and Generalized Abstract Digressions

No one expects the Scott induction!

Recursion is perhaps one of the first concepts you learn about when you learn functional programming (or, indeed, computer science, one hopes.) The classic example introduced is factorial: fact :: Int -> Int fact 0 = 1 -- base case fact n = n * fact (pred n) -- recursive case Recursion on natural numbers […]

  • December 27, 2010