- This event has passed.
Bucharest FP #40 — Recursion Schemes in Haskell
February 18 @ 6:30 pm - 9:30 pm UTC+0
Join Bucharest FP to talk about recursion schemes and Haskell. RSVP here to save your front row spot on February 18, starting 18:30!
About the event
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).
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.
- 18:30 – 19:00 Registration
- 19:00 – 20:30 Talk by Traian Florin Șerbănuță
- 20:30 – 21:00 Networking
RSVP here to confirm your attendance to Bucharest FP #40 — Recursion Schemes in Haskell.
This event is hosted through TechSociety, an initiative that aims to grow the local tech community stronger by providing free event space, as well as logistical and communication support, to all people that organize free tech-related events.
Thinking about organizing a meetup or an event for the tech community out there? Join TechSociety, and we’ll help you out! All you have to do is submit the registration form available on our website, and we’ll get back to you to set all the details straight!