Recursion Scheme with Attribute Grammar to build the most transparent analytical engine!

By Afsal Thaj

Elevator Pitch

How about build analytical engine, that has an execution plan on its own using Recursion Scheme and Attribute Grammar?

Well, one of the issue of concepts such as “Recursion Scheme”, is, we hardly explain a convincing real world use case. Here I can guarantee you will see the best in the wild!

Description

There are various use-cases for building a framework that runs analytical queries in your business, trying to solve a variety of use-cases, such as bringing observability into your platform by computing user metrics. Custom analytical frameworks need to fetch data from a single data-source to multiple data-sources, such as Redis/In-Memory, Postgres, DynamoDb, or AWS S3., and can involve complicated questions, such as how to audit the calculations or compute efficiently. In this talk, I will show an advanced use of Recursion Scheme mixed with Attribute Grammar, a concept hardly uncovered in the industry. Here the example comes off from an application that I built for Disney.

While it assumes audience know a bit about Recursion Scheme, I will expose the crux of the talk to even newcomers in Functional Programming. It will definitely show how programming in FP languages like Haskel or Scala provides the perfect toolkit to solve these problems in a principled and practical way.