please solve asap. Define a Haskell program that contains afunction main :: IO () . When executed theprogram should read one line after the other(via getLine ). It should stop itsexecution when reading an empty line, andthen prints the lines with line-numbersattached.Here is an example dialog. All lines after theempty line have been printed by the program.Hello,this is sometext.(empty line)1 of 3. Hello,2 of 3. this is some3 of 3. text.Make sure that in your program, the output isprecisely formatted as indicated.

Answered: Define a Haskell program that contains…

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

Similar questions

for Haskell: describe how the following function someFunc works. someFunc [] = [] someFunc (x:xs) = (length $ x : takeWhile (==x) xs, x) : someFunc (dropWhile (==x) xs)
for Haskell: describe what the following function someFunct does someFunct p = foldr (\x xs -> if p x then x:xs else xs) []
Imagine a function f in HASKELL that has the type Ord a => a -> a -> Bool, and then it's partially applied it to one numeric value. Create a function f, and also a function g that is the partially applied f.
for Haskell: explain what the following function someFunc does: someFunc m n = take m ((map (\f -> f n) . map (*)) [1..])
Write a Haskell program convertFraction2Binary that takes as input a fractional number between 0 and 1 and returns the binary representation of the number as a String. In case of repeating patterns, stop at length 23.
(Haskell) Let us use the list [d1, d2, ..., dn], where each di is between 0 and 9, to represent the (positive) big-integer d1d2...dn. type BigInt = [Int] For example, [9, 9, 9, 9, 9, 9, 9, 9, 9, 8] represents the big-integer 9999999998. Fill out the implementation for bigAdd :: BigInt -> BigInt -> BigInt so that it takes two integer lists, where each integer is between 0 and 9 and returns the list corresponding to the addition of the two big-integers. Again, you have to fill in the implementation to supply the appropriate values to f, base, args. You should get the following behavior: ghci> bigAdd [9, 9] [1, 0, 0, 2] [1, 1, 0, 1] ghci> bigAdd [9, 9, 9, 9] [9, 9, 9] [1, 0, 9, 9, 8] You may find the integer functions div and mod to be helpful here. Your implementation should not be recursive. Note about BigInts: we expect the result of bigAdd to not have any leading zeroes, like [0, 1, 0, 9, 9, 8]. The number zero should be represented as []. Code: import Prelude…
haskell language -- with the help of the function "even", return those elements of the given input list that are even p7 :: [Integer] -> [Integer] p7 = undefined -- return the number of zero values in the input list (you can use the section (== 0) as a predicate to test for 0) p8 :: [Integer] -> Int p8 = undefined -- using the function all, return True iff all the elements in the list are nonzero. p9 :: [Integer] -> Bool p9 = undefined {- given f , p , and xs, return the list of those elements x of xs for which f x satisfies the given predicate p. -} p10 :: (a -> b) -> (b -> Bool) -> [a] -> [a] p10 = undefined {- given a function and a list of inputs, construct the list of input-output pairs for that function on those inputs. Hint: this is a good place to use an anonymous function, to go from a value of type a to a value of type (a,b). -} p11 :: (a -> b) -> [a] -> [(a,b)] p11 = undefined -- Multiply all the numbers in the input list p12 ::…
IN HASKELL PROGRAMMING LANGUAGE PLEASE In case you do not know it: the game is played on a 3x3 grid that is initially empty. Two players are playing, by alternatingly making moves. A move by a player places their token (an X for player 1, an O for player 2) into a cell that was empty. We are using algebraic notations for indexing the positions in the board, with A,B,C indexing the columns and 1,2,3 the rows. Specifically, these coordinates would be used in the implementation for moves made by a human player. If the X X O Figure 1: Sample board position same token appears 3 times in any of the three columns, three rows or two main diagonals the game is over and that player wins. If the grid is filled without that happening the game is a draw. For the depicted board, we have Xs in positions C3 and A2, and an O in position B1. It would be O’s turn to make a move; a legal move would be C2, but it is not a good move, because X can force a win by responding A1. O cannot force a win, but…
Write a Haskell function that takes the circumference of a square as inputand computes the area of the square. Within your function you should first compute an intermediate result.
In a language with strong typing what advantages does static checking have over dynamic checking? choose all that apply A. shorter compile time B. early / less expensive error checking C. strong typing does not allow type checking D. strong typing is done at run time, preventing run time errors.
In Haskell Language write matchEmpty, which determines whether the language for a regular-- expression includes the empty string.matchEmpty :: RE symbol -> BoolmatchEmpty = ?-- Note that the type signature does not restrict symbol to types with-- equality testing, so we cannot use match or match' to check whether the-- empty string is allowed.---- matchEmpty r = match r [] -- type error---- Similarly, we cannot use generate' and check whether the first string-- it provides is the empty string.---- Finally, while generate has the proper type, we cannot use it to write a-- function that always terminates, as we cannot conclude that the empty-- string is not present until we have examined every string.---- *HW3> matchEmpty (getRE "e")-- True-- *HW3> matchEmpty (getRE "abc*")-- False-- *HW3> matchEmpty (getRE "a*")-- True-- *HW3> matchEmpty (getRE "0")-- False-- *HW3> matchEmpty (getRE "0*")-- True NOTE: Above are a few examples of what the output will look like. All…
can someone help me understand what does those two haskell function do myFun1::[a] -> (b -> a -> b) -> b -> [b] myFun1 [] f b = [b] myFun1 (x:xs) f b = (b):myFun3 xs f (f b x) myFun2::[a] -> [b] -> (a -> c) -> (b -> c) -> [(c,c)] myFun2 [] _ f g = [] myFun2 _ [] f g = [] myFun2 (x:xs) (y:ys) f g = (f x, g y):myFun2 xs ys f g

SEE MORE 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

SEE MORE TEXTBOOKS