Question: Invent an encoding in lambda calculus to represent a binary tree In this question you will invent an encoding in lambda calculus to represent a
Invent an encoding in lambda calculus to represent a binary tree

In this question you will invent an encoding in lambda calculus to represent a binary tree. You may assume that we already have an encoding of integers which supports basic arithmetic, including negative numbers (i.e.-1): addition (+ a b); and comparisons (
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
