Difference between revisions of "Budapest Hackathon 2016/Talks"
m |
|||
| (5 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
| − | __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]. |
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]. |
||
| + | = Presentations = |
||
| ⚫ | |||
| + | |||
| ⚫ | |||
'''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. |
||
| + | * [https://github.com/BP-HUG/bp-hackathon-2016/blob/master/presentations/AKovacs_GHC8 slides] |
||
| ⚫ | |||
| + | * [https://www.youtube.com/watch?v=cCGqV90jyOc video] |
||
| + | |||
| ⚫ | |||
'''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/> |
'''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/> |
||
| Line 13: | Line 16: | ||
Dániel is an associate of the GPU Lab at Wigner Research Centre for Physics. |
Dániel is an associate of the GPU Lab at Wigner Research Centre for Physics. |
||
| + | * [https://github.com/BP-HUG/bp-hackathon-2016/blob/master/presentations/DBerenyi_Recursion_schemes/DBerenyi_HaskellHackathon.pdf slides] |
||
| ⚫ | |||
| + | * [https://github.com/BP-HUG/bp-hackathon-2016/blob/master/presentations/DBerenyi_Recursion_schemes example files] |
||
| + | * [https://www.youtube.com/watch?v=0Od_smjZ_jU video] |
||
| + | |||
| ⚫ | |||
'''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. |
'''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. |
||
| + | * [https://prezi.com/p/j0dehuddmj1d/ slides] |
||
| ⚫ | |||
| + | * [https://www.youtube.com/watch?v=5fnQWaIS30A video] |
||
| + | |||
| ⚫ | |||
'''Abstract:''' Zeldspar is a domain-specific language to implement digital signal processing pipelines. It's an implementation of the Ziria language (by Microsoft Research) on the top of Feldspar (an EDSL written in Haskell for signal processing, developed at Chalmers in Göteborg, Sweden). In this talk I will present how Zeldspar is built on the top of a deep language stack, and I also show how it can be compiled to run efficiently on many-core devices such as Adapteva's Epiphany chips and Parallella boards. |
'''Abstract:''' Zeldspar is a domain-specific language to implement digital signal processing pipelines. It's an implementation of the Ziria language (by Microsoft Research) on the top of Feldspar (an EDSL written in Haskell for signal processing, developed at Chalmers in Göteborg, Sweden). In this talk I will present how Zeldspar is built on the top of a deep language stack, and I also show how it can be compiled to run efficiently on many-core devices such as Adapteva's Epiphany chips and Parallella boards. |
||
| + | |||
| + | * [https://github.com/BP-HUG/bp-hackathon-2016/blob/master/presentations/MKaracsony_Zeldspar/Zeldspar_the_road_to_epiphany.pdf slides] |
||
| + | * [https://www.youtube.com/watch?v=GY5SxLkVyp4 video] |
||
| + | |||
| + | = Ligthining talks = |
||
| + | |||
| + | == Andor Pénzes - OO in Haskell == |
||
| + | ''Description:'' A quick experiment to implement OO methods in Haskell. You can follow the progression through the commits. |
||
| + | |||
| + | More info: |
||
| + | |||
| + | * [https://github.com/andorp/oo-haskell Github page] |
||
| + | * [https://www.youtube.com/watch?v=vw9PKN7EwTs video] |
||
| + | |||
| + | == Frantisek Kocun - Howerpoint: CLI presentation slides is Haskell == |
||
| + | ''Description:'' Use GHCi to display slides for your presentations. |
||
| + | |||
| + | More info: |
||
| + | |||
| + | * [https://github.com/fokot/howerpoint Github page] |
||
| + | * [https://www.youtube.com/watch?v=C88Og_lX22E video] |
||
| + | |||
| + | == Boldizsár Németh - Haskell tools demo == |
||
| + | ''Description:'' A new refractoring tool for Haskell. '''Contributors are welcome! If you know to write plugins for text editors (e.g. Emacs, Vim), or IDEs and want to help please contact Boldizsár!''' |
||
| + | |||
| + | More info: |
||
| + | |||
| + | * [https://github.com/BP-HUG/bp-hackathon-2016/blob/master/lightning_talks/BNemeth_Haskell_tools.pdf slides] |
||
| + | * [http://haskelltools.org/ website] |
||
| + | * [https://github.com/haskell-tools/haskell-tools Github page] |
||
| + | * [https://www.youtube.com/watch?v=wpNxuR-XgNQ video] |
||
| + | |||
| + | == Péter Divánszky - x86–64 code generation is Haskell demo == |
||
| + | ''Description:'' Generate x86 assembly code from Haskell. |
||
| + | |||
| + | More info: |
||
| + | |||
| + | * [https://github.com/divipp/x86-64 Github page] |
||
| + | * [https://www.youtube.com/watch?v=H8gPOHb2A-0 video] |
||
Latest revision as of 05:44, 26 October 2016
The following are the planned talks for this years event. All the slides will be uploaded to the events github page.
Presentations
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.
Máté Karácsony - Zeldspar: The Road to Epiphany
Abstract: Zeldspar is a domain-specific language to implement digital signal processing pipelines. It's an implementation of the Ziria language (by Microsoft Research) on the top of Feldspar (an EDSL written in Haskell for signal processing, developed at Chalmers in Göteborg, Sweden). In this talk I will present how Zeldspar is built on the top of a deep language stack, and I also show how it can be compiled to run efficiently on many-core devices such as Adapteva's Epiphany chips and Parallella boards.
Ligthining talks
Andor Pénzes - OO in Haskell
Description: A quick experiment to implement OO methods in Haskell. You can follow the progression through the commits.
More info:
Frantisek Kocun - Howerpoint: CLI presentation slides is Haskell
Description: Use GHCi to display slides for your presentations.
More info:
Boldizsár Németh - Haskell tools demo
Description: A new refractoring tool for Haskell. Contributors are welcome! If you know to write plugins for text editors (e.g. Emacs, Vim), or IDEs and want to help please contact Boldizsár!
More info:
Péter Divánszky - x86–64 code generation is Haskell demo
Description: Generate x86 assembly code from Haskell.
More info: