About this document
Computational Lambda Calculus Overview by Dan Mark Pidor Bagsican is a document available to read on EtoBox.
This document discusses computational lambda calculus. It begins with an introduction to lambda calculus as a formal system for capturing computational aspects of functions. It then covers syntax, free variables, substitution, rewrite rules, convertibility, reducibility, normal forms, and different reduction strategies like leftmost-outermost and leftmost-innermost reduction. Haskell code is provided to implement concepts like free variables, substitution, and reduction in the lambda calculus. Exercises are
- Author
- Dan Mark Pidor Bagsican
- Language
- EN