Reduce this term into normal from, if it exists (show your working): (λx.((λz.zwz)(((λxyx.y)(λx.y)(λy.x))((λx.xx)(λy.yyy)))))t

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Reduce this term into normal from, if it exists (show your working):
(λx.((λz.zwz)(((λxyx.y)(λx.y)(λy.x))((λx.xx)(λy.yyy)))))t

Exercise 1: A combinator is any lambda term which does not contain any free variables,
usually denoted with upper case letters. The combinators S, K and I are defined to be the
following X-terms:
S
K
I
=
b)
=
Xxyz.xz(yz)
Xxy.x
Xx.x
Reduce the following terms to normal form:
a) We underline the redex to be reduced at each step:
SKK = (λxyz.xz(yz))KK →ß
SSS = (Axyz.xz(yz)) SS8
→B
(Xyz.Kz(yz))K
→B λz.Kz(Kz)
Az.(λxy.x)z(Kz)
SIK = (Xxyz.xz(yz))IK →ß (\yz.Iz(yz))K
→BXz.Iz(K2)
=
=
=
→ Az.(Ay.z) (Kz)
→B
Xz.z
=
Xz.(λx.x)z(Kz)
→BXz.z(Kz)
=
Az.z((λxy.x)z)
→BXz.z(Ay.z)
Az.(λxyz.xz(yz))z(Sz)
→ Az.(Ayw.zw(yw))(Sz)
→ Az.Aw.zw(Szw)
(Xyz.Sz(yz))S
Az.Sz(Sz)
Azw.zw((Axyz.xz(yz))zw)
→ Azw.zw((Xyt.zt(yt))w)
→ Azw.zw(At.zt(wt)).
Transcribed Image Text:Exercise 1: A combinator is any lambda term which does not contain any free variables, usually denoted with upper case letters. The combinators S, K and I are defined to be the following X-terms: S K I = b) = Xxyz.xz(yz) Xxy.x Xx.x Reduce the following terms to normal form: a) We underline the redex to be reduced at each step: SKK = (λxyz.xz(yz))KK →ß SSS = (Axyz.xz(yz)) SS8 →B (Xyz.Kz(yz))K →B λz.Kz(Kz) Az.(λxy.x)z(Kz) SIK = (Xxyz.xz(yz))IK →ß (\yz.Iz(yz))K →BXz.Iz(K2) = = = → Az.(Ay.z) (Kz) →B Xz.z = Xz.(λx.x)z(Kz) →BXz.z(Kz) = Az.z((λxy.x)z) →BXz.z(Ay.z) Az.(λxyz.xz(yz))z(Sz) → Az.(Ayw.zw(yw))(Sz) → Az.Aw.zw(Szw) (Xyz.Sz(yz))S Az.Sz(Sz) Azw.zw((Axyz.xz(yz))zw) → Azw.zw((Xyt.zt(yt))w) → Azw.zw(At.zt(wt)).
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education