├── 02-starting-out.hs ├── 03-types-and-typeclasses.hs ├── 04-syntax-in-functions.hs ├── 05-recursion.hs ├── 06-higher-order-functions.hs ├── 07-modules.hs ├── 08-making-our-own-types-and-typeclasses.hs ├── 09-input-and-output.hs ├── 11-functors-applicative-functors-and-monoids.hs ├── 12-a-fistful-of-monads.hs ├── 13-for-a-few-monads-more.hs ├── DistanceConversions.hs ├── LICENSE └── README /02-starting-out.hs: -------------------------------------------------------------------------------- 1 | {- 2 | -Once you've installed Haskell from http://www.haskell.org/platform/, load the interpreter with the command ghci. 3 | - 4 | -You can load (and reload) this file in the interpreter with the command: ":l 2-starting-out.hs" 5 | - 6 | -The first function has been completed as an example. All the other functions are undefined. 7 | -They can be implemented in one line using the material covered in http://learnyouahaskell.com/starting-out 8 | - 9 | -All indices are zero based. 10 | -} 11 | 12 | -- Find the penultimate element in list l 13 | penultimate l = last (init l) 14 | 15 | -- Find the element at index k in list l 16 | -- For example: "findK 2 [0,0,1,0,0,0]" returns 1 17 | findK k l = undefined 18 | 19 | -- Determine if list l is a palindrome 20 | isPalindrome l = undefined 21 | 22 | {- 23 | - Duplicate the elements in list xs, for example "duplicate [1,2,3]" would give the list [1,1,2,2,3,3] 24 | - Hint: The "concat [l]" function flattens a list of lists into a single list. 25 | - (You can see the function definition by typing ":t concat" into the interpreter. Perhaps try this with other variables and functions) 26 | - 27 | - For example: concat [[1,2,3],[3,4,5]] returns [1,2,3,3,4,5] 28 | -} 29 | duplicate xs = undefined 30 | 31 | {- 32 | - Imitate the functinality of zip 33 | - The function "min x y" returns the lower of values x and y 34 | - For example "ziplike [1,2,3] ['a', 'b', 'c', 'd']" returns [(1,'a'), (2, 'b'), (3, 'c')] 35 | -} 36 | ziplike xs ys = undefined 37 | 38 | -- Split a list l at element k into a tuple: The first part up to and including k, the second part after k 39 | -- For example "splitAtIndex 3 [1,1,1,2,2,2]" returns ([1,1,1],[2,2,2]) 40 | splitAtIndex k l = undefined 41 | 42 | -- Drop the element at index k in list l 43 | -- For example "dropK 3 [0,0,0,1,0,0,0]" returns [0,0,0,0,0,0] 44 | dropK k l = undefined 45 | 46 | -- Extract elements between ith and kth element in list l. Including i, but not k 47 | -- For example, "slice 3 6 [0,0,0,1,2,3,0,0,0]" returns [1,2,3] 48 | slice i k l = undefined 49 | 50 | -- Insert element x in list l at index k 51 | -- For example, "insertElem 2 5 [0,0,0,0,0,0]" returns [0,0,0,0,0,2,0] 52 | insertElem x k l = undefined 53 | 54 | -- Rotate list l n places left. 55 | -- For example, "rotate 2 [1,2,3,4,5]" gives [3,4,5,1,2] 56 | rotate n l = undefined 57 | -------------------------------------------------------------------------------- /03-types-and-typeclasses.hs: -------------------------------------------------------------------------------- 1 | {- 2 | - For this exercise, we are dealing with a type for colours of the rainbow 3 | - The typeclass is defined here, and note its English spelling. 4 | - For more information on how this is done, look ahead to: 5 | - http://learnyouahaskell.com/making-our-own-types-and-typeclasses 6 | - 7 | - Have a play with the Colour in ghci, try the succ and pred functions and so on. 8 | -} 9 | data Colour = Red | Orange | Yellow | Green | Blue | Indigo | Violet 10 | deriving (Eq, Ord, Show, Bounded, Enum) 11 | 12 | {- 13 | - Again, you should be able to write these functions in one line, 14 | - using the information from the chapter http://learnyouahaskell.com/types-and-typeclasses 15 | - and the chapter before 16 | -} 17 | 18 | {- 19 | - The Colour typeclass is of type Ord 20 | - What is the "first" (or least) colour 21 | -} 22 | firstColour = undefined 23 | 24 | -- List the colours in reverse order 25 | reverseColourOrder = undefined 26 | 27 | {- 28 | - Mix two colours together, to produce the average value of the two. 29 | - Example: paintMix Orange Green = Yellow 30 | - If necessary, favour the "higher" value when computing the average. 31 | - For example: paintMix Green Violet = Indigo 32 | - Hint: Integer division can be performed with the quot function: quot 7 2 = 3 33 | -} 34 | paintMix c1 c2 = undefined 35 | -------------------------------------------------------------------------------- /04-syntax-in-functions.hs: -------------------------------------------------------------------------------- 1 | -- This function should print a single digit number as English text, or "unknown" if it's out of the range 0-9 2 | englishDigit :: Int -> String 3 | englishDigit x = undefined 4 | 5 | -- given a tuple, divide fst by snd, using pattern matching. 6 | -- it should return undefined for division by zero 7 | divTuple :: (Eq a, Fractional a) => (a, a) -> a 8 | divTuple (x, y) = undefined 9 | 10 | -- if the first three numbers in a list are all zero, return True 11 | threeZeroList :: [Int] -> Bool 12 | threeZeroList [x] = undefined 13 | -------------------------------------------------------------------------------- /05-recursion.hs: -------------------------------------------------------------------------------- 1 | -- Raise x to the power y, using recursion 2 | -- For example, power 5 2 = 25 3 | power :: Int -> Int -> Int 4 | power x y = undefined 5 | 6 | -- create a list of length n of the fibbonaci sequence in reverse order 7 | -- examples: fib 0 = [0] 8 | -- fib 1 = [1, 0] 9 | -- fib 10 = [55,34,21,13,8,5,3,2,1,1,0] 10 | -- try to use a where clause 11 | fib :: (Num a, Eq a) => a -> [a] 12 | fib x = undefined 13 | 14 | -- This is not recursive, but have a go anyway. 15 | -- Create a function which takes two parameters, a number and a step 16 | -- The result is the sign of the original number reversed, and the step added to the absolute value 17 | -- Confused? Some examples: stepReverseSign 6 2 = -8 18 | -- stepReverseSign -3 1 = 4 19 | -- stepReverseSign 1 2 = -3 20 | stepReverseSign :: (Fractional a, Ord a) => a -> a -> a 21 | stepReverseSign a = undefined 22 | 23 | {- Lets calculate pi. 24 | - The Leibniz formula for pi (http://en.wikipedia.org/wiki/Leibniz_formula_for_%CF%80) 25 | - Can be defined as pi = (4/1) - (4/3) + (4/5) - (4/7) .... 26 | - We can create a function, where given a certain tolerance, we can recursively calculate 27 | - Pi to within that tolerance. 28 | - Lets create two functions, piCalc, and piCalc', the latter we will recursively call 29 | - until our pi calculation is within the tolerance 30 | 31 | - The piCalc function is defined as: 32 | - piCalc :: (Fractional a, Integral b, Ord a) => a -> (a, b) 33 | 34 | - Given a tolerance, say, 0.001, it will return a tuple. 35 | - fst is pi to an accuracy of the tolerance, 0.001 in this case 36 | - snd is the number of recursive steps taken to calculate it, after all this chapter is about recursion! 37 | - Example: piCalc 0.001 = (3.1420924036835256,2000) 38 | 39 | - The piCalc' function is defined as 40 | - piCalc' :: (Ord a, Fractional a, Integral b) => a -> a -> a -> b -> (a, b) 41 | - Lots of parameters! 42 | - The first parameter is the current denominator from the Leibniz formula 43 | - The next is our calculation of pi from our previous attempt 44 | - The next is the tolerance 45 | - The final parameter is the number of times this function has been called (ie, we add one every time we recurse 46 | - Example piCalc' 1 0.0 0.001 0 = (3.1420924036835256,2000) 47 | - 48 | - Feel free to change the parameter order, what parameters you need etc in order to get this to work for you, 49 | - But, of course the output of piCalc should remain as (pi, count) 50 | - 51 | - You may find the stepReverseSign function handy 52 | -} 53 | 54 | piCalc :: (Fractional a, Integral b, Ord a) => a -> (a, b) 55 | piCalc a = undefined 56 | 57 | piCalc' :: (Ord a, Fractional a, Integral b) => a -> a -> a -> b -> (a, b) 58 | piCalc' w x y z = undefined 59 | 60 | -------------------------------------------------------------------------------- /06-higher-order-functions.hs: -------------------------------------------------------------------------------- 1 | -- Sum the numbers between two inclusive values recursively, assuming a < b when the function is first called 2 | -- Example: sumInts 0 1 = 1 3 | -- sumInts 1 3 = 6 4 | sumInts :: Int -> Int -> Int 5 | sumInts a b = undefined 6 | 7 | -- Define a square function 8 | sq :: Int -> Int 9 | sq x = undefined 10 | 11 | -- Sum the squares between two numbers. This function should be similar to the sumInts function 12 | sumSquares :: Int -> Int -> Int 13 | sumSquares a b = undefined 14 | 15 | -- Define a higher order sum function which accepts an (Int -> Int) function to apply to all integers between two values. 16 | -- Again this should look similar to the sumInts and sumSquares functions 17 | higherOrderSum :: (Int -> Int) -> Int -> Int -> Int 18 | higherOrderSum intApplication a b = undefined 19 | 20 | -- Define the square sum in terms of higherOrderSum 21 | hoSumSquares :: Int -> Int -> Int 22 | hoSumSquares = undefined 23 | 24 | -- Define the sum between two values in terms of higherOrderSum 25 | -- Note there is no parameter on the function definition 26 | -- Try to use a lambda if possible 27 | hoSumInts :: Int -> Int -> Int 28 | hoSumInts = undefined 29 | 30 | -- Create a new higher order method which generalises over the function provided by sumInts (That is, parameterize (+) :: Int -> Int -> Int) between a and b 31 | -- This will give the ability to perform utilities such as the prodcut of all squares (or any other Int -> Int function) between a and b 32 | -- You will also need to generalise the base case 33 | -- You can also define the function signature yourself, which leaves you free to define the parameters and their order 34 | -- To be clear, your function will need to handle: 35 | -- - A start value, a :: Int 36 | -- - A end value, b :: Int 37 | -- - A function to apply to each value, op :: Int -> Int 38 | -- - A function to apply between each value, f :: Int -> Int -> Int 39 | -- - A value to return in the base case when a > b, z :: Int 40 | higherOrderSequenceApplication = undefined 41 | 42 | -- Define a factorial method using the higherOrderSequenceAppliction 43 | hoFactorial :: Int -> Int 44 | hoFactorial = undefined 45 | -------------------------------------------------------------------------------- /07-modules.hs: -------------------------------------------------------------------------------- 1 | -- Fill in the DistanceConversions module first, and import it here 2 | -- create a higher-order function for converting an area between two dimensions 3 | -- this will take the function for converting a distance, and an area to convert 4 | -- using the functions defined in the DistanceConversions module 5 | -- Example areaConv inchesToCentimetres 9 = 58.0644 6 | 7 | areaConv :: (Float -> Float) -> Float -> Float 8 | areaConv linearConversion area = undefined 9 | 10 | -- define a function for converting square inches into square centimetres 11 | sqInToSqCm :: Float -> Float 12 | sqInToSqCm = undefined 13 | 14 | -- define a function for converting square chains (22 yards) to square metres 15 | sqChainsToSqM :: Float -> Float 16 | sqChainsToSqM = undefined 17 | -------------------------------------------------------------------------------- /08-making-our-own-types-and-typeclasses.hs: -------------------------------------------------------------------------------- 1 | {- 2 | - We are going to create some types for a deck of cards 3 | - The cards need to have an ordering, based on the standard ranking http://en.wikipedia.org/wiki/Standard_52-card_deck#Rank_and_color 4 | - We are assuming Aces are high. 5 | - Therefore, the following statements should be true: 6 | - (Card Ace Spades) > (Card King Spades) 7 | - (Card Two Clubs) < (Card Three Clubs) 8 | - 9 | - We are going to provide our own implementation of the Show typeclass for the Card type. 10 | - When displaying the Card instance in GHCI, or calling show (Card digit suit), the String which should be displayed is "The of " 11 | - 12 | - Uncomment the following declarations to complete the implementation, and provide an implementation for instance Show Card 13 | -} 14 | 15 | --data Suit = 16 | --data Digit = 17 | --data Card = 18 | 19 | -- We should be able to provide a function which returns the higher ranked card: 20 | betterCard :: Card -> Card -> Card 21 | betterCard x y = undefined 22 | 23 | -- Here is a new Typeclass, which represents some kind of playing hand in a game. 24 | -- It returns True for a "winning hand", depending on the rules for the type of class we are playing with 25 | class Hand a where 26 | play :: [a] -> Bool 27 | 28 | -- Implement Hand for Card, where play returns true if the list contains the Ace of Spades 29 | instance Hand Card where 30 | play c = undefined 31 | 32 | -- Create a new Coin type 33 | --data Coin = 34 | 35 | -- Implement Hand for Coin, where play returns true if there are ten heads in a row in the list 36 | instance Hand Coin where 37 | play c = undefined 38 | 39 | -- Have a play with implementing Hand for some other types, for instance Int and Bool 40 | -------------------------------------------------------------------------------- /09-input-and-output.hs: -------------------------------------------------------------------------------- 1 | {- 2 | - Lets implement the UNIX echo command 3 | - The program arguments are simply printed to the standard output. 4 | - If the first argument is -n, this argument is not printed, and no trailing newline is printed 5 | -} 6 | 7 | main = undefined 8 | 9 | {- Write a lottery number picker 10 | - This function should take a StdGen instance, and produce a list of six unique numbers between 1 and 49, in numerical order 11 | -} 12 | lottery :: StdGen -> [Int] 13 | lottery gen = undefined 14 | -------------------------------------------------------------------------------- /11-functors-applicative-functors-and-monoids.hs: -------------------------------------------------------------------------------- 1 | import Control.Applicative 2 | import Data.Monoid 3 | 4 | -- We can use the following type to simulate our own list 5 | data List a = Empty | Value a (List a) deriving (Show) 6 | 7 | -- Make the list a Functor 8 | 9 | -- Write a function which appends one list on to another 10 | combineLists:: List a -> List a -> List a 11 | combineLists a b = undefined 12 | 13 | -- Make our list a Monoid 14 | 15 | -- Make our list an Applicative 16 | 17 | -- Make sure that the List obeys the laws for Applicative and Monoid 18 | 19 | -- Create some lists of numbers of different lengths such as: 20 | twoValueList = Value 10 $ Value 20 Empty 21 | 22 | -- Use <$> on the lists with a single-parameter function, such as: 23 | plusTwo = (+2) 24 | 25 | -- Use <$> and <*> on the lists with a binary function 26 | 27 | -- Create some lists of binary functions 28 | 29 | -- Use <*> on the binary functions list and the number lists 30 | -------------------------------------------------------------------------------- /12-a-fistful-of-monads.hs: -------------------------------------------------------------------------------- 1 | {- 2 | - Create a type called Validation 3 | - The type constructor takes one parameter 4 | - There are two Values: 5 | - Success, which takes that parameter and 6 | - Fail String, which represents a failure, and a reason for that failure 7 | -} 8 | --data Validation a 9 | 10 | -- Make the Validation a Monad 11 | 12 | 13 | {- 14 | - Create a function, positiveCheck, which takes a number and returns a successful Validation if it's positive, 15 | - and a failed Validation with a String message if not. 16 | -} 17 | --positiveCheck :: (Num a, Ord a) => a -> Validation a 18 | --positiveCheck x = undefined 19 | 20 | {- 21 | - Create a function, evenCheck, which returns a successful Validation if it's even, 22 | - and a failed Validation with a string message if it's odd 23 | -} 24 | --evenCheck :: (Integral a) => a -> Validation a 25 | --evenCheck x = undefined 26 | 27 | {- 28 | - Write a function which uses positiveCheck and evenCheck to make sure a number is both positive and even 29 | -} 30 | --positiveAndEvenCheck :: (Num a, Ord a, Integral a) => a -> Validation a 31 | --positiveAndEvenCheck x = undefined 32 | -------------------------------------------------------------------------------- /13-for-a-few-monads-more.hs: -------------------------------------------------------------------------------- 1 | {- 2 | - We are going to write a binary search algorithm, which returns a Writer, so we can record the intermediate steps. 3 | - 4 | - The signature of our binary search is as follows: 5 | - binarySearch :: (Show a, Ord a, Eq a, Monoid b) => (a -> a -> b) -> a -> [a] -> Writer b Bool 6 | - 7 | - A breakdown of the function parameters: 8 | - - (a -> a -> b) : A function which is called on each comparison, passing in the search value, and the value to compare in the list. It returns a monoid value, which is used in the Writer 9 | - - a : The value we are hunting for 10 | - - [a] : The list we are searching for the value, assumed to be ordered low to high 11 | - - Writer b Bool : The return value of the Writer will be a monoid, constructed on each (recursive) search step, and a Bool value, whether we found the value in our list 12 | - 13 | - The pattern for the gcd' function in the chapter is helpful. That is: pattern match, guard and using tell and return in the do notation. 14 | - 15 | - Note, There appear to have been some changes to ghc since Learn You a Haskell was written. There is no data constructor exposed for Writer, like described in the chapter. You cannot do things like: logNumber x = Writer (x, ["Got number: " ++ show x]). However there is a 'writer' function, which works in the same way as that constructor would. That is, you could do: logNumber x = writer (x, ["Got number: " ++ show x]). For more information, see http://stackoverflow.com/questions/11684321/how-to-play-with-control-monad-writer-in-haskell 16 | - That said, it is possible to create the Writers necessary for this exercise using only return and tell. 17 | - 18 | - It may help to write a function first, "describe", which returns a description of the comparison at each step. This function would return a single element list of type String (remember, lists are monoids). Such a function could run as follows: 19 | - 20 | - ghci> runWriter $ binarySearch describe 5 [1..10] 21 | - (True,["5 is less than 6","5 is greater than 3","5 is greater than 4","5 is equal to 5"]) 22 | - 23 | - Or, perhaps a little clearer: 24 | - ghci> mapM_ putStrLn $ snd $ runWriter $ binarySearch describe 5 [1..10] 25 | - 5 is less than 6 26 | - 5 is greater than 3 27 | - 5 is greater than 4 28 | - 5 is equal to 5 29 | -} 30 | 31 | describe :: (Show a, Eq a, Ord a) => a -> a -> [String] 32 | describe x y = undefined 33 | 34 | binarySearch :: (Show a, Ord a, Eq a, Monoid b) => (a -> a -> b) -> a -> [a] -> Writer b Bool 35 | binarySearch = undefined 36 | 37 | {- 38 | - Investigate what other functions instead of describe can be passed to the binary search. 39 | - Is it possible to provide a function, so that when we do the binary search we can return a count of how many comparisons the algorithm took? 40 | -} 41 | -------------------------------------------------------------------------------- /DistanceConversions.hs: -------------------------------------------------------------------------------- 1 | module DistanceConversions 2 | ( yardsToFeet 3 | , feetToInches 4 | , inchesToCentimetres 5 | ) where 6 | 7 | -- Define yards to feet 8 | yardsToFeet :: Float -> Float 9 | yardsToFeet y = undefined 10 | 11 | -- Define feet to inches 12 | feetToInches :: Float -> Float 13 | feetToInches f = undefined 14 | 15 | -- Define inches to centimetres 16 | inchesToCentimetres :: Float -> Float 17 | inchesToCentimetres i = undefined 18 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /README: -------------------------------------------------------------------------------- 1 | Some exercises as a companion for the book Learn You a Haskell For Great Good! 2 | 3 | See http://learnyouahaskell.com/chapters 4 | 5 | -- 6 | 7 | Exercises Copyright (c) Noel Markham 2012-2017 8 | 9 | This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. 10 | 11 | This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. 12 | 13 | You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/. 14 | --------------------------------------------------------------------------------