TAPL Notes

05 - The Untyped Lambda-Calculus 2024-05-03 | 18 words

Lambda grammer: t ::== # terms x # variable λx.t # abstraction t t # application Church Booleans tru = λt. λf. t; fls = λt. λf. f;test = λl. λm. λn. l m n; and = λb. λc. b c fls;…

03 - Untyped Arithmatic Expressions 2024-03-23 | 352 words

Language: t ::= true # constant true false # constant false if t then t else t # conditional 0 # constant 0 succ t # successor pred t # predecessor iszero t # zero test Notice that the …