In this article we are going to use the internal function of Haskell like Data.complex and Prelude to create a complex number from a given imaginary parts. This tutorial will help us in creating the complex number from the given imaginary part. The imaginary part of a complex number is the coefficient of the imaginary unit, typically represented by the symbol "i", in the standard form of the complex number. A complex number can be represented in standard form as a + bi, where a is the real part and b is the imaginary part. Algorithm Step 1 − ... Read More

In Haskell, we will convert double type variables into string by using user-defined function, doubleToString along with show function and Text.Printf and Data.Text module. In the first example, we are going to use ( let valueString = show input) and in the second example, we are going to use (doubleToString d = printf "%.2f" d). And in the third example, we are going to use (doubleToString d = unpack $ pack $ show d). Algorithm Step 1 − The program execution will be started from main function. The main() function has whole control of the program. It ... Read More

In Haskell, we will convert string type variables into double by using user-defined function, stringToDouble along with read annotation, readMaybe and double functions. In the first example, we are going to use ( let value = read input :: Double) and in the second example, we are going to use (stringToDouble s = readMaybe s). And in the third example, we are going to use (stringToDouble s = case double $ pack s of). Algorithm Step 1 − The program execution will be started from main function. The main() function has whole control of the program. It ... Read More

In Haskell, we will convert double type variables into int by using user-defined function, doubleToInt along with floor, round and ceiling functions. In the first example, we are going to use (doubleToInt d = floor d) function and in the second example, we are going to use (doubleToInt d = round d). And in the third example, we are going to use (doubleToInt d = ceiling d). Algorithm Step 1 − The doubleToInt function is defined using floor function as, doubleToInt d = floor d. Step 2 − The program execution will be started from main function. The ... Read More

In Haskell, we will convert int type variables into double by using user-defined function, intToDouble along with fromIntegral, realToFrac and realPart functions. In the first example, we are going to use (intToDouble n = fromIntegral n) function and in the second example, we are going to use (intToDouble n = realToFrac n). And in the third example, we are going to use (intToDouble n = realPart (fromIntegral n :+ 0)). Algorithm Step 1 − The intToDouble function is defined using fromIntegral function. Step 2 − The program execution will be started from main function. The main() function has ... Read More

In Haskell, we will convert int type variables into string by using user-defined function, intToString along with show, map and printf functions. In the first example, we are going to use (intToString n = show n) function and in the second example, we are going to use (intToString n = intercalate "" (map show [n])). And in the third example, we are going to use (intToString n = printf "%d" n). Algorithm Step 1 − The intToString function is defined using show function as, intToString n = show n. Step 2 − The program execution will be started ... Read More

In Haskell, we will convert string type variables into integer by using user-defined function, stringToInt along with read and readMaybe functions. This can also be implemented using pattern matching and recursion. In the first example, we are going to use (stringToInt str = readMaybe str) function and in the second example, we are going to use (stringToInt "" = Nothing; stringToInt ('-':xs) = negate ; stringToInt xs; stringToInt xs = case reads xs of [(n, "")] -> Just n and _ -> Nothing). Algorithm Step 1 − The stringToInt function is defined using readMaybe function Step 2 ... Read More

In Haskell, we will convert string type variables into boolean by using user-defined function, stringToBool along with Maybe Bool, toLower and readMaybe functions. In the first example, we are going to use (stringToBool :: String -> Maybe Bool) function and in the second example, we are going to use (stringToBool str = case map toLower str of). And in third example, we are going to use (stringToBool str = case readMaybe str of). Algorithm Step 1 − The stringToBool function is defined. Step 2 − The program execution will be started from main function. The main() function has whole ... Read More

Haskell has internal functions like mapM and ForM functions to print a revered Pyramid pattern star. A reverse pyramid star pattern is a pattern of asterisks (stars) arranged in the shape of an inverted pyramid. Algorithm Step 1 − Program execution will be started from main function. The main() function has whole control of the program. It is written as main = do. In the main function, a number is passed up to which the reverse pyramid star pattern is to be printed. The main function defines the mapM_ function as, Step 2 − The variable named, “n” is ... Read More

In Haskell, we can use mapM and ForM functions to print pyramid-patterned stars. A pyramid star pattern is a design or arrangement of stars or other symbols in the shape of a pyramid. It is created by printing stars or symbols in multiple rows, starting from the top and moving downwards. Each row contains one more symbol than the previous row, creating the illusion of a triangular shape. The pattern is usually symmetrical, with the number of stars or symbols in each row equal to the row number, and the middle of each row lined up vertically. Algorithm Step ... Read More