Browse by Tags

All Tags » Functional programming (RSS)
Introduction A while ago I was explaining runtime mechanisms like the stack and the heap to some folks. (As an aside, I’m writing a debugger course on “Advanced .NET Debugging with WinDbg with SOS”, which is an ongoing project. Time will tell when it...
Introduction Recursion is a widely known technique to decompose a problem in smaller “instances” of the same problem. For example, performing tree operations (e.g. in the context of data structures, user interfaces, hierarchical stores, XML, etc) can...
Introduction Side-effects don’t fit together very well with functional-style delayed computation, as observed in LINQ. Having such constructs embedded in an otherwise eagerly evaluated imperative language like C# can cause quite some confusion from time...
Introduction A while back, I blogged about (Mis)using C# 4.0 Dynamic – Type-Free Lambda Calculus, Church Numerals, and more which was a fun post and got some good feedback and solid reading numbers. So, let’s continue our journey of brain-exploding theoretical...
Introduction Sunday morning, time for another episode of the Crazy Sundays series. Again one in the category with risk for exploding brains , but that’s what we like, don’t we? This time around, we’re going to have a look at the type free lambda calculus...
Introduction We’ve been talking about functional programming quite a bit already. One of the things used frequently in functional programming is recursion, instead of imperative loop constructs. Both have their advantages, but often recursive techniques...
Posted by bart | 50 comment(s)
With a hypothetical next release of the C# language around the corner (more about that after Anders, our language Caesar, has delivered his “Future of C#” talk on the PDC 08), I’ve had the honor to receive an early print of The C# Programming Language...
I didn’t intend to make this a series of posts but that’s the way things go. Based on feedback from readers and additional questions raised, one decides that add that little bit more to it and ultimate you’re writing a sequel. Where have we been on this...
Posted by bart | 5 comment(s)
Recently I posted a post titled Curry for dummies . I have to admit the article did possibly exceed the dummy level, so here's a little code-based wrap-up before extending upon it: int Add( int a, int b) { return a + b; } // // Without curry support...
Posted by bart | 1 comment(s)
Introduction Functional programming concepts aren’t that hard but sometimes a little abstract. In this post I’ll try to demystify the concept of currying, or - in simple words – partial function application. If you wonder where the name “curry” comes...
Posted by bart | 81 comment(s)
More Posts Next page »