Induction Proofs in Ocaml: USING Helper: Lemma plus (S a) b = S (plus a b) b = Zero LHS: plus (S a) b = { case } plus (S a)Zero = { def of plus } match Zero with | Zero -> a | S c -> plus (S a) c = { apply match } (S a) RHS: S (plus a b) = { case } S (plus a Zero) = { def of plus } match Zero with | Zero -> a | S c -> plus (S a) c = { apply match } S (a) Since LHS = RHS, Lemma is proven. Use helper to prove: P3) Prove plus a (plus b c) = plus (plus a b) c
Induction Proofs in Ocaml: USING Helper: Lemma plus (S a) b = S (plus a b) b = Zero LHS: plus (S a) b = { case } plus (S a)Zero = { def of plus } match Zero with | Zero -> a | S c -> plus (S a) c = { apply match } (S a) RHS: S (plus a b) = { case } S (plus a Zero) = { def of plus } match Zero with | Zero -> a | S c -> plus (S a) c = { apply match } S (a) Since LHS = RHS, Lemma is proven. Use helper to prove: P3) Prove plus a (plus b c) = plus (plus a b) c
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
Related questions
Question
Induction Proofs in Ocaml:
USING Helper: Lemma
plus (S a) b = S (plus a b)
b = Zero
LHS:
plus (S a) b
= { case }
plus (S a)Zero
= { def of plus }
match Zero with
| Zero -> a
| S c -> plus (S a) c
= { apply match }
(S a)
RHS:
S (plus a b)
= { case }
S (plus a Zero)
= { def of plus }
match Zero with
| Zero -> a
| S c -> plus (S a) c
= { apply match }
S (a)
Since LHS = RHS, Lemma is proven.
Use helper to prove:
P3) Prove plus a (plus b c) = plus (plus a b) c
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Knowledge Booster
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
Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education