Haskell代写代考

# Functions in Haskell * Read also Chapter 4 of the text book “Programming in Haskell. ## Overview In this lesson, we study various ways how functions can be defined in Haskell. We will study the following ways: 1. Composition of existing functions 2. Conditionals (`if _ then _ else _ `) 3. Guarded equations

— Binary string transmitter example from chapter 7 of Programming — in Haskell, , Cambridge University Press, 2016. import Data.Char — Base conversion type Bit = Int bin2int :: [Bit] -> Int bin2int = foldr (\x y -> x + 2*y) 0 int2bin :: Int -> [Bit] int2bin 0 = [] int2bin n = n

# Higher-order Functions These notes should be read in conjunction with chapter 7 – Higher-order functions of our textbook Programming in Haskell. * We discuss some examples from the [Haskell’98 standard prelude](https://www.haskell.org/onlinereport/standard-prelude.html) for pedagogical purposes. * See the [prelude for the current version of the language](https://hackage.haskell.org/package/base-4.12.0.0/docs/Prelude.html) for all predefined classes and their instances. ## Note:

— setting the “warn-incomplete-patterns” flag asks GHC to warn you — about possible missing cases in pattern-matching definitions {-# OPTIONS_GHC -fwarn-incomplete-patterns #-} — see https://wiki.haskell.org/Safe_Haskell {-# LANGUAGE Safe #-} module Assessed1 (checksum , step , bin2Bool , bool2Bin , notBin , andBin , orBin , deMorg1 , deMorg2 , deMorg3 , deMorg4 , equals ,