Question: How to write a binary tree expression in pure lambda calculus? I have checked a lot of study materials, and they all only have example

How to write a binary tree expression in pure lambda calculus?

I have checked a lot of study materials, and they all only have example of list implementation in pure lambda calculus, which is

How to write a binary tree expression in pure lambda calculus? I.

Based on this, anyone can help me for implementing a binary tree( sort of nested list?) using pure lambda calculus( node and leaf, leaf comes with int number - eg. node(node(leaf(3),leaf(4))) ) ?

list = d.c.f.fi f2.x) list = d.c.f.fi f2.x)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!