Rolling Random Romans
The abstract is the 300 character elevator pitch for this talk.
Dive into Elm's random generators on a quest to build a historically accurate Roman random name generator for the goddess Juno, based on a series of dependent and independent constraints.
The description is the public abstract of your talk. The description will be seen by reviewers during the CFP process and will eventually be seen by the attendees of the event.
You are an ancient software engineer. Juno, the Roman goddess of marriage and fertility, surprises you by walking into your office and offering you an assignment. Overseeing the birthing and naming of all Roman children is becoming a large and monotonous task. She is looking to modernize and automate. Will you build her a piece of software to randomly generate valid information for a Roman child?
Join us on the quest to complete this project using Elm's random generators. Along the way, we will see how to create complex generators out of simple ones, how to handle dependent and independent constraints, and how to work with percentages and Maybe. You will leave with a firm grasp of how Elm handles randomness in a functional manner and how to implement your own generators.
Notes will only be seen by reviewers during the CFP process. This is where you should explain things such as technical requirements, why you're the best person to speak on this subject, etc...
Elm's functional approach to randomness can be confusing and intimidating, particularly for those who come from an imperative background. This talk aims to demystify randomness in Elm as well as cover common problems such as building complex generators out of simpler ones, independent, and dependent constraints.
The talk will take a playful, narrative approach to tackling the otherwise rather dry topic of random generators. It assumes some familiarity with basic Elm concepts such as the type system and partially applied functions.