What type of lambda calculus would Lisp loosely be an example of?

Question

I\'m trying to get a better grip on how types come into play in lambda calculus. Admittedly, a lot of the type theory stuff is over my head. Lisp is a dynamically typed la

Answer 1

Lisp is not 'a lambda calculus', I don't know what 'a lambda calculus' is.

If you want to identify lambda calculi by there type system then Lisp is its own of course. The 'lambda' keyword in any lisp before Scheme is certainly pretentious, and after Scheme there's room too to say it is. Just using 'func' would have been more humble. Lisp is a list processor mainly, not a 'lambda calculus'

I also wrote a rather extensive article about this once that attempts to demonstrate why A: the term 'functional programming' is meaningless and B: why the speaking of 'a lambda calculus' rather than 'a type system' is so too:

http://blog.nihilarchitect.net/archives/289/on-functional-programming/

Also, keep in mind that in Lisp, all functions are in effect single argument and can only be have lists as their arguments.