In most programming language we need ways to declare our own types. These help with readability, modularity etc. Haskell is no different in offering these capabilities.<\/p>\n
We can create a simple data type using the data<\/em> keyword, followed by either of available values (in C# this would be similar to an enum). So here’s the definition of a Boolean type<\/p>\n The values after the = are the value constructors<\/em> with the | being like an or<\/em>, hence this Bool have either False or True value. <\/p>\n Note: The type name and the value constructor must be capital cased.<\/em><\/p>\n We can also declare types more like structs\/classes in that we can define the field types that make up the type. For example here’s a Point type<\/p>\n In this example we could create a point as follows<\/p>\n Accessing these values can be a little verbose (especially when we might have lots of fields) because of the lack of any names, hence we’d use pattern matching, i.e. <\/p>\n Note: The type annotation is not required and the underscore is a discard, hence is ignored.<\/em><\/p>\n We can combine types just as we combined False and True into essentially a union. So for example here we have a data type Shape with constructors for Circle and Triangle.<\/p>\n It’s not clear what these fields of the constructors mean, so let’s add some names which also allows us to more easily access specific values from the data (i.e. fixes the issue with using pattern matching – which ofcourse is still a valid way of doing things).<\/p>\n We can declare instances of this type using names or without names, for example<\/p>\n Instead of creating a function to extract a value (like we did with the xpt function we created) we can now use the following<\/p>\n and Haskell essentially creates the function for us, i.e. using the REPL along with :t hypotenuse<\/em> we get the following<\/p>\n Haskell is immutable, so how do we make changes to an instance of data? Well we “copy and update”. Thankfully Haskell makes this easy (so we don’t have to literally create copies of every field on our data and then change values).<\/p>\n If you’ve used JavaScript it’s like using a spread operator of in F# and with<\/em>.<\/p>\n In this case newTriangle<\/em> is a copy of the triangle<\/em> data, with the hypotenuse<\/em> changed.<\/p>\n","protected":false},"excerpt":{"rendered":" In most programming language we need ways to declare our own types. These help with readability, modularity etc. Haskell is no different in offering these capabilities. We can create a simple data type using the data keyword, followed by either of available values (in C# this would be similar to an enum). So here’s the […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[295],"tags":[],"class_list":["post-8267","post","type-post","status-publish","format-standard","hentry","category-haskell"],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/posts\/8267","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/comments?post=8267"}],"version-history":[{"count":2,"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/posts\/8267\/revisions"}],"predecessor-version":[{"id":8269,"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/posts\/8267\/revisions\/8269"}],"wp:attachment":[{"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/media?parent=8267"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/categories?post=8267"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/putridparrot.com\/blog\/wp-json\/wp\/v2\/tags?post=8267"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}\r\ndata Bool = False | True\r\n<\/pre>\n
\r\ndata Point = Point Integer Integer\r\n<\/pre>\n
\r\npt = Point 1 2\r\n<\/pre>\n
\r\nxpt :: Point -> Integer\r\nxpt (Point x _) = x\r\n\r\n-- example of printing the x value of value pt of type Point\r\nprint (xpt pt)\r\n<\/pre>\n
\r\ndata Shape = Triangle Int Int Int | Circle Int\r\n\r\ntriangle = Triangle 1 2 3\r\ncircle = Circle 4\r\n<\/pre>\n
\r\ndata Shape = Triangle { \r\n hypotenuse :: Int, \r\n opposite :: Int, \r\n adjacent :: Int \r\n} | Circle { \r\n radius :: Int \r\n}\r\n<\/pre>\n\r\n-- not using names\r\ntriangle = Triangle 1 2 3\r\n-- with names\r\ntriangle1 = Triangle { opposite = 5, hypotenuse = 6, adjacent = 7 }\r\n<\/pre>\n\r\nprint (hypotenuse triangle)\r\n<\/pre>\n
\r\nhypotenuse :: Shape -> Int\r\n<\/pre>\n
\r\nnewTriangle = triangle { hypotenuse = 10 } \r\n<\/pre>\n