Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
4. Make sure that your trees (both general and binary) are instances of Show, Eq, and Ord. The Ord and Eq instantiation should implement a custom ordering, as follows: For some trees t and u we have t≤u iff traces t C traces u t == u iff traces t C traces u and traces u C traces t Pay attention to the fact that you are thus defining a partial order over trees (that is, two trees may not be comparable with each other). 2 Implementation note If you have a type with a parameter (such the type Tree a for trees holding values of type a) it is often the case that the "big" type (Tree a) can be an instance of some class (say, Eq) only if the "inner" type (a) is an instance of a certain type class (say, Ord). This kind of constraints must be specified at instantiation time. In the example mentioned above the instance Tree a of Eq will thus go as follows: instance Ord a => Eq (Tree a) where Note that I used Eq and Ord merely as examples, I am not claiming that the particular example above makes actual sense.

4. Make sure that your trees (both general and binary) are instances of Show, Eq, and Ord. The Ord and Eq instantiation should implement a custom ordering, as follows: For some trees t and u we have t≤u iff traces t C traces u t == u iff traces t C traces u and traces u C traces t Pay attention to the fact that you are thus defining a partial order over trees (that is, two trees may not be comparable with each other). 2 Implementation note If you have a type with a parameter (such the type Tree a for trees holding values of type a) it is often the case that the "big" type (Tree a) can be an instance of some class (say, Eq) only if the "inner" type (a) is an instance of a certain type class (say, Ord). This kind of constraints must be specified at instantiation time. In the example mentioned above the instance Tree a of Eq will thus go as follows: instance Ord a => Eq (Tree a) where Note that I used Eq and Ord merely as examples, I am not claiming that the particular example above makes actual sense.

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

in Haskell, question 4

4. Make sure that your trees (both general and binary) are instances of Show, Eq, and Ord. The Ord and Eq instantiation should implement a custom ordering, as follows: For some trees t and u we have t≤u iff traces t C traces u t == u iff traces t C traces u and traces u C traces t Pay attention to the fact that you are thus defining a partial order over trees (that is, two trees may not be comparable with each other). 2 Implementation note If you have a type with a parameter (such the type Tree a for trees holding values of type a) it is often the case that the "big" type (Tree a) can be an instance of some class (say, Eq) only if the "inner" type (a) is an instance of a certain type class (say, Ord). This kind of constraints must be specified at instantiation time. In the example mentioned above the instance Tree a of Eq will thus go as follows: instance Ord a => Eq (Tree a) where Note that I used Eq and Ord merely as examples, I am not claiming that the particular example above makes actual sense.
Transcribed Image Text:4. Make sure that your trees (both general and binary) are instances of Show, Eq, and Ord. The Ord and Eq instantiation should implement a custom ordering, as follows: For some trees t and u we have t≤u iff traces t C traces u t == u iff traces t C traces u and traces u C traces t Pay attention to the fact that you are thus defining a partial order over trees (that is, two trees may not be comparable with each other). 2 Implementation note If you have a type with a parameter (such the type Tree a for trees holding values of type a) it is often the case that the "big" type (Tree a) can be an instance of some class (say, Eq) only if the "inner" type (a) is an instance of a certain type class (say, Ord). This kind of constraints must be specified at instantiation time. In the example mentioned above the instance Tree a of Eq will thus go as follows: instance Ord a => Eq (Tree a) where Note that I used Eq and Ord merely as examples, I am not claiming that the particular example above makes actual sense.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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
SEE MORE TEXTBOOKS