Prolog. R emember the "take" function of Haskell? It can be defined in Haskell as: take :: Int -> [a] -> [a] take 0 _ = [] take _ [] = [] take n (x:xs) = x : take (n-1) xs Formulate the appropriate Prolog predicate "take(N,Xs,Ys)" which is true if (and only if) "Ys" is what results from taking "N" elements from "Xs". That is, "take(3,[1,2,3,4,5],[1,2,3])." would evaluate to "true", or "take(3,[1,2,3,4,5],Ys)." would give "Ys = [1,2,3]", while "take(3,[1,2],Ys)" would give "Ys = [1,2]"
Prolog. R emember the "take" function of Haskell? It can be defined in Haskell as: take :: Int -> [a] -> [a] take 0 _ = [] take _ [] = [] take n (x:xs) = x : take (n-1) xs Formulate the appropriate Prolog predicate "take(N,Xs,Ys)" which is true if (and only if) "Ys" is what results from taking "N" elements from "Xs". That is, "take(3,[1,2,3,4,5],[1,2,3])." would evaluate to "true", or "take(3,[1,2,3,4,5],Ys)." would give "Ys = [1,2,3]", while "take(3,[1,2],Ys)" would give "Ys = [1,2]"
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
Prolog.
R emember the "take" function of Haskell? It can be defined in Haskell
as:
take :: Int -> [a] -> [a]
take 0 _ = []
take _ [] = []
take n (x:xs) = x : take (n-1) xs
Formulate the appropriate Prolog predicate "take(N,Xs,Ys)" which is
true if (and only if) "Ys" is what results from taking "N" elements
from "Xs". That is, "take(3,[1,2,3,4,5],[1,2,3])." would evaluate to
"true", or "take(3,[1,2,3,4,5],Ys)." would give "Ys = [1,2,3]", while
"take(3,[1,2],Ys)" would give "Ys = [1,2]"
Expert Solution
Step 1
Answer:-
Step by step
Solved in 2 steps with 1 images
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.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