arXiv:1211.5762math.CT
Classical lambda calculus in modern dress
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's representation theorem is then completely natural and leads to precise theorems showing the essential equivalence with more familiar notions. Simple abstract proofs of fundamental results in the semantics of the lambda calculus are given.
For a professional category theorist interested in theoretical computer science? The thing is, they could easily just dive into reading some papers on the subject. The intuition and mechanical skill of category theory is easily adapted to thinking about computation. Here are…
danharajView on HNParent context