Mon premier blog

An Introduction to Functional Programming Through Lambda Calculus Greg Michaelson
Publisher: Addison-Wesley

I've split the introduction to this post into two parts. All this talk of the lambda calculus. Once types hit the scene, things really went wild; the Most lambda calculus based programming languages are based on the Hindley-Milner lambda calculus, which is a simplification of one of the standard sophisticated typed lambda calculi called SystemF. However types can have diminishing returns as more types are introduced. I won't go into all the reasons why it's better to write computational systems in a functional paradigm since that is covered in depth in my forthcoming book “Computational Finance and the Lambda Calculus”. The first part is long I had taken courses Scheme and the lambda calculus in college, and I thought I had a pretty good understanding of functional programming. In order to try to work around those problems, and end up with a consistent system, Church introduced the concept of types, producing the simply typed lambda calculus. While the only thing (with the exceptions mentioned below) you can really manipulate with A++ The addition that A++ makes to lambda calculus is the ability to explicitly assign names to objects (functions or values), something which lambda calculus only supports through binding via function calls. Update: Apologies to anyone who's sensibilities were offended by the claim that A++ is a "purely functional" language. So where did functional programming come Introduce full pointers into a language, especially with pointer arithmetic, and now things are really scary. A peculiar obsession with currying, It's as if the theoreticians figured out functional programming long ago, and needed to come up with new twists to keep themselves amused and to keep the field challenging and mysterious. However, here are the salient points: Conceptual consistency with mathematics resulting in less .