G6021: Comparative Programming Exercise Sheet 4 1 Data Types In Haskell we can define our own types in two ways: • Renaming old types, for example: type Name = [Char]. • Constructing new types, for example: data MyBool = T | F. (Adding deriving (Show) means that Haskell will print these types.) When constructing new […]
CS计算机代考程序代写 Haskell G6021: Comparative Programming Read More »
G6021: Comparative Programming Extra Haskell exercises: Lists Write Haskell functions for the following questions. Avoid using built-in functions in your answer (you may however use append ++, if needed). Lists 1. Find the last element of a list. 2. Find the penultimate element of a list. 3. Write functions to find the largest element and
CS计算机代考程序代写 Haskell G6021: Comparative Programming Read More »
1 1. Types 2 1. 2. 3. 3 1. 4 Take What are the types of the following Haskell expressions. Try to think what they might be before checking with the Haskell interpreter. (a) (*) (b) (&&) True (c) \x -> \f -> f (f x) (d) tail [1,2,3] (e) error (f) \(x,y) -> x&&True
CS计算机代考程序代写 interpreter Haskell 1 Read More »
G6021: Comparative Programming Exercise Sheet 1 (self study) 1 Starting Haskell The aim is to make a start with using the Haskell system. We will use GHCi, which is an interactive environment (interpreter), and is part of a larger toolset known as the Glasgow Haskell Compiler. Haskell expressions can be interactively evaluated and programs can
CS计算机代考程序代写 algorithm interpreter compiler Haskell G6021: Comparative Programming Read More »
G6021: Comparative Programming Exam Practice 2 1. (a) Give an example for each of the following: i. a λ-term that is in normal form but does not have a type. ii. a λ-term that has a normal form but does not have a type. iii. a λ-term that has a normal form and does have
CS计算机代考程序代写 Haskell Java G6021: Comparative Programming Read More »
1 Types 2 1. (a) (*) (b) (&&) True (c) \x -> \f -> f (f x) (d) tail [1,2,3] (e) error (f) \(x,y) -> x&&True Answer: Each of these can be tested in Haskell by entering: :t followed by the expression at the prompt. The answers below are not exactly the same as what
CS计算机代考程序代写 interpreter Haskell 1 Types Read More »
G6021: Comparative Programming Exercise Sheet 2 1 Function arguments If a function needs two arguments, it can take them one at a time or both together, as illustrated by the following functions: f x y = x+y g (x,y) = x+y 1. 2. 3. 4. 5. 2 1. 2. 3. 4. What are the types
CS计算机代考程序代写 algorithm Haskell G6021: Comparative Programming Read More »
Some worked examples for G6021 Comparative Programming 1 Accumulating Parameters For material about accumulating parameters, see Part 3 of the lecture notes. The aim is to convert a Haskell function into a tail recursive function: a function that does not have to do anything after a recursive call. To illustrate the idea, look at the
CS计算机代考程序代写 Haskell Some worked examples for G6021 Comparative Programming Read More »
G6021 Comparative Programming 1 Understanding Fixpoints Let’s begin with a little puzzle. Fill in the blanks of the following sentence with numerals (in decimal notation) so as to make it true: “Inthissentence,thenumberofoccurrencesof0is ,of1is ,of2is ,…,of9is .” To see why this is relevant to Comparative Programming, let’s see how we can solve this. First, define the
CS计算机代考程序代写 algorithm AI Haskell G6021 Comparative Programming Read More »
1 1. 2. 3. 4. 5. G6021: Comparative Programming Exercise Sheet 3 Functions on lists Write a function addOneToAll that will add one to all the elements of a list. Write this two ways, first using pattern matching, then using list comprehensions. Write a function timesTwoToAll that will multiply all the elements of a list
CS计算机代考程序代写 Haskell 1 Read More »