Name: Bucharest FP #40 — Recursion Schemes in Haskell
Start: 2019-02-18T18:45:00+02:00
End: 2019-02-18T20:45:00+02:00
Location: TechHub Bucharest

Hello!

I am happy to announce the second presentation meetup this year with a subject I find extremely interesting: recursion schemes.

## Traian Florin Șerbănuță — Recursion Schemes in Haskell

## ABSTRACT
Let's explore "Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire"* (or how basic knowledge of abstract algebra can help you develop patterns for recursion) together. The talk will assume knowledge of Haskell syntax, type definitions, some familiarity with type eliminators (e.g. maybe, either, folds).

(*) http://maartenfokkinga.github.io/utwente/mmf91m.pdf

## BIOGRAPHY
Traian Florin Șerbănuță is an associate professor of computer science at the University of Bucharest. Traian completed his Ph.D. at UIUC, working with Grigore Rosu on the first prototype of K, which serves as a basis for the semantics-based execution and semantics-based program verification tools developed by RV, Inc. Additionally, Traian designed a maximal causal model for sequential consistency which serves as a basis for runtime verification of concurrent programs in tools such as RV-Predict. Traian currently works at RV as the K and Haskell Backend Development Lead.

Please use the comment box below if you have any questions. See you there!

Vladimir Ciobanu

Ionuț G. Stan

Bucharest FP

Technology

Lisp

Software Development

Computer Programming

Programming Languages

Scala

Haskell

Functional Programming

Clojure

Erlang Programming

F# Programming

OCaml Programming

Bucharest FP #40 — Recursion Schemes in Haskell

TechHub Bucharest

Share

Bucharest FP

Bucharest FP #40 — Recursion Schemes in Haskell

Bucharest FP

Details

Members are also interested in