{- Every list comprehension can be expressed via map, filter, and - concat. - Here is a concrete list comprehension: -} original :: [ (Integer, Integer) 1 original = [ (x,y) i x <- [1..100), y - [1..x), x `mod y > 0 ] - comprehensions (though range expressions are still allowed). A rough idea is already given here. Complete that definition - by replacing the occurrences of 'undefined' appropriately. - Do not use any additional top-level or local (let, where) - definitions. alternative :: [ (Integer, Integer) 1 alternative = concat ( map (\x -> map (\y -> undefined) undefined) undefined )
{- Every list comprehension can be expressed via map, filter, and - concat. - Here is a concrete list comprehension: -} original :: [ (Integer, Integer) 1 original = [ (x,y) i x <- [1..100), y - [1..x), x `mod y > 0 ] - comprehensions (though range expressions are still allowed). A rough idea is already given here. Complete that definition - by replacing the occurrences of 'undefined' appropriately. - Do not use any additional top-level or local (let, where) - definitions. alternative :: [ (Integer, Integer) 1 alternative = concat ( map (\x -> map (\y -> undefined) undefined) undefined )
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Please dont copy anywhere
![Task 1
{- Every list comprehension can be expressed via map, filter, and
- concat.
- Here is a concrete list comprehension:
-}
original :: [ (Integer, Integer) 1
original = [ (x,y) i x <- [1..100], y <- [1..x), x `mod y > 0 ]
{- Your task is to implement the same without using list
comprehensions (though range expressions are still allowed).
- A rough idea is already given here. Complete that definition
- by replacing the occurrences of 'undefined' appropriately.
- Do not use any additional top-level or local (let, where)
- definitions.
-}
alternative ::[ (Integer, Integer) ]
alternative = concat ( map (\x -> map (\y -> undefined) undefined)
undefined )](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa707a246-9c43-4d0a-8a5a-404f4630dee5%2Ff8bfecf0-2f46-4457-943d-8d50d47d73dd%2F78suech_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Task 1
{- Every list comprehension can be expressed via map, filter, and
- concat.
- Here is a concrete list comprehension:
-}
original :: [ (Integer, Integer) 1
original = [ (x,y) i x <- [1..100], y <- [1..x), x `mod y > 0 ]
{- Your task is to implement the same without using list
comprehensions (though range expressions are still allowed).
- A rough idea is already given here. Complete that definition
- by replacing the occurrences of 'undefined' appropriately.
- Do not use any additional top-level or local (let, where)
- definitions.
-}
alternative ::[ (Integer, Integer) ]
alternative = concat ( map (\x -> map (\y -> undefined) undefined)
undefined )
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY