際際滷shows by User: davidoverton / http://www.slideshare.net/images/logo.gif 際際滷shows by User: davidoverton / Fri, 31 Jul 2020 01:38:21 GMT 際際滷Share feed for 際際滷shows by User: davidoverton Linear Types in Haskell /slideshow/linear-types-in-haskell/237426064 linear-200731013821
Talk I presented at Melbourne Haskell Users Group, 30th July 2020]]>
Talk I presented at Melbourne Haskell Users Group, 30th July 2020]]> Fri, 31 Jul 2020 01:38:21 GMT /slideshow/linear-types-in-haskell/237426064 davidoverton@slideshare.net(davidoverton) Linear Types in Haskell davidoverton Talk I presented at Melbourne Haskell Users Group, 30th July 2020 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/linear-200731013821-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Talk I presented at Melbourne Haskell Users Group, 30th July 2020
Linear Types in Haskell from David Overton
]]> 226 0 https://cdn.slidesharecdn.com/ss_thumbnails/linear-200731013821-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Serverless haskell /slideshow/serverless-haskell/88599841 serverlesshaskell-180222112510
際際滷s from a talk on Serverless Haskell at the Melbourne Haskell Users Group meetup, 22nd February 2018]]>
際際滷s from a talk on Serverless Haskell at the Melbourne Haskell Users Group meetup, 22nd February 2018]]> Thu, 22 Feb 2018 11:25:10 GMT /slideshow/serverless-haskell/88599841 davidoverton@slideshare.net(davidoverton) Serverless haskell davidoverton 際際滷s from a talk on Serverless Haskell at the Melbourne Haskell Users Group meetup, 22nd February 2018 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/serverlesshaskell-180222112510-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> 際際滷s from a talk on Serverless Haskell at the Melbourne Haskell Users Group meetup, 22nd February 2018
Serverless haskell from David Overton
]]> 422 1 https://cdn.slidesharecdn.com/ss_thumbnails/serverlesshaskell-180222112510-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 dmo-phd-thesis /slideshow/dmophdthesis/61562770 d1354a89-611b-4c22-8cff-8cdaf95cea74-160502030845
]]>
]]> Mon, 02 May 2016 03:08:45 GMT /slideshow/dmophdthesis/61562770 davidoverton@slideshare.net(davidoverton) dmo-phd-thesis davidoverton <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/d1354a89-611b-4c22-8cff-8cdaf95cea74-160502030845-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br>
dmo-phd-thesis from David Overton
]]> 400 7 https://cdn.slidesharecdn.com/ss_thumbnails/d1354a89-611b-4c22-8cff-8cdaf95cea74-160502030845-thumbnail.jpg?width=120&height=120&fit=bounds document 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Constraint Programming in Haskell /slideshow/constraint-programming-in-haskell/54903826 constraints-151109113436-lva1-app6892
際際滷s from my talk to the Melbourne Haskell Users Group, 29th October 2015. Code at https://github.com/dmoverton/finite-domain]]>
際際滷s from my talk to the Melbourne Haskell Users Group, 29th October 2015. Code at https://github.com/dmoverton/finite-domain]]> Mon, 09 Nov 2015 11:34:36 GMT /slideshow/constraint-programming-in-haskell/54903826 davidoverton@slideshare.net(davidoverton) Constraint Programming in Haskell davidoverton 際際滷s from my talk to the Melbourne Haskell Users Group, 29th October 2015. Code at https://github.com/dmoverton/finite-domain <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/constraints-151109113436-lva1-app6892-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> 際際滷s from my talk to the Melbourne Haskell Users Group, 29th October 2015. Code at https://github.com/dmoverton/finite-domain
Constraint Programming in Haskell from David Overton
]]> 4387 7 https://cdn.slidesharecdn.com/ss_thumbnails/constraints-151109113436-lva1-app6892-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Comonads in Haskell /slideshow/comonad/36611947 comonad-140703194509-phpapp01
Comonads are the category-theoretic dual of monads. While monads have been found to be a very useful design pattern for structuring programs in functional languages, such as Haskell, comonads have so far failed to gain much traction. In this talk we will look at what comonads are and how they are defined in Haskell, comparing them with the Haskell definition of monads. We will then look at some specific examples of comonads and how they can be used in practical programs. We will assume basic knowledge of Haskell, including the Monad class and common instances. No knowledge of category theory will be required.]]>
Comonads are the category-theoretic dual of monads. While monads have been found to be a very useful design pattern for structuring programs in functional languages, such as Haskell, comonads have so far failed to gain much traction. In this talk we will look at what comonads are and how they are defined in Haskell, comparing them with the Haskell definition of monads. We will then look at some specific examples of comonads and how they can be used in practical programs. We will assume basic knowledge of Haskell, including the Monad class and common instances. No knowledge of category theory will be required.]]> Thu, 03 Jul 2014 19:45:09 GMT /slideshow/comonad/36611947 davidoverton@slideshare.net(davidoverton) Comonads in Haskell davidoverton Comonads are the category-theoretic dual of monads. While monads have been found to be a very useful design pattern for structuring programs in functional languages, such as Haskell, comonads have so far failed to gain much traction. In this talk we will look at what comonads are and how they are defined in Haskell, comparing them with the Haskell definition of monads. We will then look at some specific examples of comonads and how they can be used in practical programs. We will assume basic knowledge of Haskell, including the Monad class and common instances. No knowledge of category theory will be required. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/comonad-140703194509-phpapp01-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Comonads are the category-theoretic dual of monads. While monads have been found to be a very useful design pattern for structuring programs in functional languages, such as Haskell, comonads have so far failed to gain much traction. In this talk we will look at what comonads are and how they are defined in Haskell, comparing them with the Haskell definition of monads. We will then look at some specific examples of comonads and how they can be used in practical programs. We will assume basic knowledge of Haskell, including the Monad class and common instances. No knowledge of category theory will be required.
Comonads in Haskell from David Overton
]]> 9220 5 https://cdn.slidesharecdn.com/ss_thumbnails/comonad-140703194509-phpapp01-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Zippers /slideshow/zippers-35110200/35110200 91rtjndetacdhhesom1j-140525212750-phpapp02
Zippers are a design pattern in functional programming languages, such as Haskell, which provides a focus point and methods for navigating around in a functional data structure. It turns out that for any algebraic data type with one parameter, the derivative of the type is a zipper for it.]]>
Zippers are a design pattern in functional programming languages, such as Haskell, which provides a focus point and methods for navigating around in a functional data structure. It turns out that for any algebraic data type with one parameter, the derivative of the type is a zipper for it.]]> Sun, 25 May 2014 21:27:50 GMT /slideshow/zippers-35110200/35110200 davidoverton@slideshare.net(davidoverton) Zippers davidoverton Zippers are a design pattern in functional programming languages, such as Haskell, which provides a focus point and methods for navigating around in a functional data structure. It turns out that for any algebraic data type with one parameter, the derivative of the type is a zipper for it. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/91rtjndetacdhhesom1j-140525212750-phpapp02-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Zippers are a design pattern in functional programming languages, such as Haskell, which provides a focus point and methods for navigating around in a functional data structure. It turns out that for any algebraic data type with one parameter, the derivative of the type is a zipper for it.
Zippers from David Overton
]]> 2418 3 https://cdn.slidesharecdn.com/ss_thumbnails/91rtjndetacdhhesom1j-140525212750-phpapp02-thumbnail.jpg?width=120&height=120&fit=bounds presentation 000000 http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 https://cdn.slidesharecdn.com/profile-photo-davidoverton-48x48.jpg?cb=1596159398 https://github.com/dmoverton https://cdn.slidesharecdn.com/ss_thumbnails/linear-200731013821-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/linear-types-in-haskell/237426064 Linear Types in Haskell https://cdn.slidesharecdn.com/ss_thumbnails/serverlesshaskell-180222112510-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/serverless-haskell/88599841 Serverless haskell https://cdn.slidesharecdn.com/ss_thumbnails/d1354a89-611b-4c22-8cff-8cdaf95cea74-160502030845-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/dmophdthesis/61562770 dmo-phd-thesis