Difference between revisions of "Budapest Hackathon 2016/Talks"

From HaskellWiki
Jump to: navigation, search
(Created page with "The following talks have been confirmed. All the slides will be uploaded to the events [https://github.com/BP-HUG/bp-hackathon-2016 github page]. = András Kovács - A tour o...")
 
Line 1: Line 1:
The following talks have been confirmed. All the slides will be uploaded to the events [https://github.com/BP-HUG/bp-hackathon-2016 github page].
 
  +
__NOTOC__
  +
 
The following are the planned talks for this years event. All the slides will be uploaded to the events [https://github.com/BP-HUG/bp-hackathon-2016 github page].
   
 
= András Kovács - A tour of GHC 8 features =
 
= András Kovács - A tour of GHC 8 features =
   
''Abstract:'' GHC 8 brought us a number of new features. This talk focuses on the changes to the type system (new kind system, explicit type applications, injective families) and presents some use cases and idioms that were impossible or unwieldy with previous GHC releases. We also touch on Strict Haskell, stack tracing, custom type errors, record field overloading, and their current usability.
+
'''Abstract:''' GHC 8 brought us a number of new features. This talk focuses on the changes to the type system (new kind system, explicit type applications, injective families) and presents some use cases and idioms that were impossible or unwieldy with previous GHC releases. We also touch on Strict Haskell, stack tracing, custom type errors, record field overloading, and their current usability.
  +
  +
= Dániel Berényi - Selected use cases of structured recursion schemes =
  +
  +
'''Abstract:''' We show how the simplest structured recursion schemes can drive generic tree manipulations. Catamorphisms perform bottom-up, while Anamorphisms do the opposite (top-down) recursive traversals. The transformations applied to the trees are completely separated from the traversal in the form of algebras and coalgebras. We show how these methods can be used to do simple manipulations to a small Embedded Domain Specific Language. We briefly review their potential applications in High-Performance Computing applications.<br/>
  +
  +
Dániel is an associate of the GPU Lab at Wigner Research Centre for Physics.
  +
  +
= Dániel Vigovszky - Haskell at Prezi =
  +
  +
'''Abstract:''' Prezi uses Haskell in its document model related projects. In this talk first we will explain the domain and show the problems we wanted to solve. Following that we will first show the unique build environment we created to be able to work efficiently on complex Haskell codebases. Then we will look into our extensive use of QuickCheck, how it's used and what we learned.

Revision as of 13:38, 24 July 2016


The following are the planned talks for this years event. All the slides will be uploaded to the events github page.

András Kovács - A tour of GHC 8 features

Abstract: GHC 8 brought us a number of new features. This talk focuses on the changes to the type system (new kind system, explicit type applications, injective families) and presents some use cases and idioms that were impossible or unwieldy with previous GHC releases. We also touch on Strict Haskell, stack tracing, custom type errors, record field overloading, and their current usability.

Dániel Berényi - Selected use cases of structured recursion schemes

Abstract: We show how the simplest structured recursion schemes can drive generic tree manipulations. Catamorphisms perform bottom-up, while Anamorphisms do the opposite (top-down) recursive traversals. The transformations applied to the trees are completely separated from the traversal in the form of algebras and coalgebras. We show how these methods can be used to do simple manipulations to a small Embedded Domain Specific Language. We briefly review their potential applications in High-Performance Computing applications.

Dániel is an associate of the GPU Lab at Wigner Research Centre for Physics.

Dániel Vigovszky - Haskell at Prezi

Abstract: Prezi uses Haskell in its document model related projects. In this talk first we will explain the domain and show the problems we wanted to solve. Following that we will first show the unique build environment we created to be able to work efficiently on complex Haskell codebases. Then we will look into our extensive use of QuickCheck, how it's used and what we learned.