函数式编程

1 Lists [30%] Exercise 1.1 Exercise 1.2 Let and H ≡ ( (()())) λfga.(ISNIL a) NIL CONS g (HEAD a) f g (TAIL a) COMP2022: Formal Languages and Logic Assignment 1 Due: 23:00pm Sunday 9th September (week 6) Let Q, K, and A be arbitrary expressions. Consider the Church encoding for the list {Q,K,A}. •

technique outlined in Lecture 14, slides 22-24. following ML binary tree in the lambda-calculus: node(node(node(leaf(1), leaf(2)), leaf(3)), node(leaf(4), leaf(5))) Show the representation for the CSE505 – Spring 2018 Assignment 3 – Lambda Calculus Due Date: Weds, April 11 (11:59 pm) You may work in pairs for this assignment. Problem 1: Consider an ML binary tree