Timeline for Logic, λ-Calculus, and Programming Language Theory (2012) [pdf]
I’ve taken some graduate courses in programming languages where I’ve learned about the lambda calculus and about type theory, and I really appreciate this post since this provides a nice timeline of how programming language theory has evolved.  One topic I’m very interested in is how computation can be expressed in many different ways and the tradeoffs behind various expressions.I apologize if this is off-topic, but I wonder if there has been work done on algorithm analysis using the lambda calculus?  The texts that I’ve read on algorithms describe the algorithms using procedural code, and then the analysis is done on the amount of procedures that get called.  However, I would imagine that the description would be different for non-procedural styles of programming.  I’ve heard of a book called “Functional Data Structures” but I haven’t read it yet.  I’m wondering if there has been work done on algorithm analysis at the lambda calculus level.